Modified Nonlinear Traveling Salesman Problem with Delivery Time Windows and Item Constraints

This paper presents an optimization routine to solve a Modified Multi- Vehicle Dubins Traveling Salesman Problem with time window constraints, non-constant distances between points, and delivery item constraints. The problem represents the delivery of items via fixed wing aircraft to multiple delivery points with arrival time and item weight constraints. The problem was solved via a genetic algorithm utilizing modified crossover and mutation functions. The modified crossover function generates an estimate of the minimum and maximum arrival times at a point to determine whether aircraft speed or point order should be adjusted. The modified mutation function affects either point order or arrival order. Non-integer variables were optimized during a subroutine of the genetic algorithm. A feasible, near-optimal solution was able to be calculated by the algorithm.