Darwin meets computers: New approach to multiple depot capacitated vehicle routing problem

We present a study of using genetic algorithms to solve non-fixed destination multiple-depot capacitated vehicle routing problem (MDCVRP). The genetic algorithm was developed on the basis of experiences in solving the Travelling Salesman Problem (TSP) and the Single Depot Capacitated Vehicle Routing Problem (CVRP). Heuristic improvements in population initialization and crossover operators are made to prevent converging to local optima and to reduce the search space domain. To deal effectively with the constraints of the problem, and to prune the search space of GA in advance. the difficult capacity and supply reliability constraints are embedded in the decimal strings that are coded to represent the vehicle routes between depots. Computational results carried our on several instances indicate that the total distance traveled can be reduced significantly when such method is used.