Routing unmanned aerial vehicles as adapting to capacitated vehicle routing problem with genetic algorithms

The Capacitated Vehicle Routing Problem (CVRP), is a capacity constrained type of vehicle routing problem, which is widely studied with many real-world applications. Based on this problem there are many researches and proposed papers depend on different types of algorithms. However, genetic algorithm based methods are scarcely proposed in the literature. In this paper, genetic algorithms are examined to routing unmanned aerial vehicles as adapting to capacitated vehicle routing problems. Researches based on this problem with genetic algorithms are discussed and simulation results for CVRP with genetic algorithms are implemented. It is also presented and discussed with the experimental results and compared our method with the some well-known benchmark algorithms.