The genetic algorithm method for multiple depot capacitated vehicle routing problem solving

Many organizations face the problem of delivering goods from a certain number of warehouses to a number of retail sites using a fleet of vehicles. The Multiple Depot Capacitated Vehicle Routing Problem is mathematical model that closely approximates the problem faced by many of these organizations. in regard that the problem is NP-hard, requiring excessive rime to be exactly solved, in this article we develop heuristic based on genetic algorithm that finds high quality solutions in a reasonable amount of computer time. Basic GA procedures adapted to a given problem are presented and sir versions of crossover operators are compared. The test results reveal that the method is able to produce results of a kind nor easily obtained before namely in terms of an amount of information about the solutions and the solution space.