Algorithm for Distance Constrained Aerial Vehicle Routing Problem: Based on Minimum Spanning Tree and Genetic Computation

The main goal of this research is to find a solution of distance constrained aerial vehicle routing problem using genetic algorithm based on the minimum spanning tree heuristic. As the lower bound of vehicle routing problem, the minimum spanning tree provides a natural heuristic for the searching of routes. It is used in generating the initial population and designing of the reorganization crossover operator. The proposed algorithm performs well with respect to accuracy, consistency, speed, and simplicity in all tests in the paper.