A Genetic Clustering Method for the Multi-Depot Vehicle Routing Problem
A clustering method based on a genetic algorithm for solving the multi-depot routing problem is proposed. An efficient post optimiser enhanced by reduction tests is embedded into the search to further improve the solutions. Preliminary results, based on a set of problems given in the literature, are encouraging.
KeywordsGenetic Algorithm Travel Salesman Problem Genetic Cluster Vehicle Rout Problem Reduction Test
Unable to display preview. Download preview PDF.
- F.H. Cullen. Set Partitioning Based Heuristics for Interactive Routing. PhD thesis, Georgia Institute of Technology, Georgia, 1984.Google Scholar
- D.E. Goldberg. Genetic Algorthims in Search Optimization and Machine Learning. Addison Wesley, 1989.Google Scholar
- J.H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975.Google Scholar
- Parallel Genetic Algorithm Package. Argonne national laboratory. USA, 1996.Google Scholar
- J. Perl and M.S. Daskin. A warehouse location routing problem. Transportation Research, 19B:381–396, 1985.Google Scholar
- J. Renaud, G. Laporte, and F.F. Boctor. A tabu search heuristic for the multi-depot vehicle routing problem. Technical Report 94-44, Centre de Recherche sur les Transports, University of Montreal, Canada, 1994. Working Paper.Google Scholar
- S. Salhi and M. Sari. A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research, 1997. (to appear).Google Scholar
- S.R. Thangiah. Genetic Algorithms for Vehicle Routing Problems with Time Windows. CRC Press, Florida, 1996.Google Scholar
- S.R. Thangiah, I.H. Osman, R. Vinayagamoorthy, and T. Sun. Algorithms for vehicle routing problems with time deadlines. American Journal of Mathematical and Management Sciences, 13:322–355, 1993.Google Scholar