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. Because the problem is NP-hard, requiring excessive time to be solved exactly, we develop a heuristic based on a 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 six versions of crossover operators are compared. The test results reveal that the method is able to produce results of a kind that are not easily obtained, namely in terms of the amount of information about the solutions and the solution space.

[1]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[2]  S. Krajcar,et al.  Darwin meets computers: new approach to multiple depot capacitated vehicle routing problem , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[3]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[4]  Bruce L. Golden,et al.  A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions , 1993 .

[5]  Gilbert Laporte,et al.  An Improved Petal Heuristic for the Vehicle Routeing Problem , 1996 .

[6]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[7]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[8]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[9]  Christopher R. Houck,et al.  On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[10]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..

[11]  S. Krajcar,et al.  Genetic Algorithm Approach for Multiple Depot Capacitated Vehicle Routing Problem Solving With Heuristic Improvements , 2000 .

[12]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[13]  D. R. Fulkerson,et al.  Solving a Transportation Problem , 1956 .

[14]  M. J. D. Powell,et al.  Variable Metric Methods for Constrained Optimization , 1982, ISMP.

[15]  F. A. Tillman,et al.  A study of a look-ahead procedure for solving the multiterminal delivery problem , 1971 .