d2tsp_ga(varargin)

Truck and two drones traveling salesman problem (D2TSP): genetic algorithm (mutation).

Solves the truck and two drone traveling salesman problem denoted as the in tandem team where drone delivers last mile effort. Uses a genetic algorithm (route mutations) to solve the problem. The problem can solve the D2TSP for 100 cities with randomly generated coordinates. The solution is based on minimizing time instead of distance. The min-time calculation is based on the max time for the truck or either drone to deliver in an operation. An operation is denoted as the node or stop in which a drone (or both) is launched, sent to deliver and then recovered at a rendezvous location. Each drone is constrained by range and capacity. As such, the range and number of stops in an operation is limited by drone constraints.