Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I.M. Chao, B.L. Golden, and E. Wasil. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. American Journal of Mathematical and Management Sciences, 13:371–401, 1993.
F.H. Cullen. Set Partitioning Based Heuristics for Interactive Routing. PhD thesis, Georgia Institute of Technology, Georgia, 1984.
D.E. Goldberg. Genetic Algorthims in Search Optimization and Machine Learning. Addison Wesley, 1989.
B.L. Golden and A. Assad. Vehicle Routing: Methods and Studies. North Holland, Amsterdam, 1988.
J.H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975.
G. Laporte. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59:345–358, 1992.
Parallel Genetic Algorithm Package. Argonne national laboratory. USA, 1996.
J. Perl and M.S. Daskin. A warehouse location routing problem. Transportation Research, 19B:381–396, 1985.
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.
S. Salhi and G.K. Rand. Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research, 66:313–330, 1993.
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).
S.R. Thangiah. Genetic Algorithms for Vehicle Routing Problems with Time Windows. CRC Press, Florida, 1996.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
Salhi, S., Thangiah, S.R., Rahman, F. (1998). A Genetic Clustering Method for the Multi-Depot Vehicle Routing Problem. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_51
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6492-1_51
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83087-1
Online ISBN: 978-3-7091-6492-1
eBook Packages: Springer Book Archive