Abstract
Paper deals with the application of a genetic algorithm in the Multiple Vehicle Routing Problem. A short overview of a previously on-site developed algorithm is given. The genetic algorithm is developed on basis of experiences in solving the Travelling Salesperson Problem. A few heuristic improvements are added in order to prevent converging to local optima and to reduce the search domain. The performance of the algorithm is investigated on two configurations, and so is the influence of each genetic parameter on the algorithm's effectiveness. The final assessment is given in conclusion.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Literature
D.E.Goldberg: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, MA, 1989.
S.Krajcar: Algorithms for interactive optimal planning of distribution networks. Doctoral thesis, ETF Zagreb, 1988.
S.Lin and B.W.Keringhan: An effective Heuristic Algorithm for Traveling Salesman Problem. Oper. Research 21, 498–516, 1973.
Z.Michalewitz: Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin, 1992.
J.Y.Suh and D.Van Gucht: Incorporating Heuristic Information into Genetic Search. Proceedings of the 2nd International Conference on Genetic Search, 100–107. Lawrence Erlbaum Associates, 1987.
D.Whitley: The Genitor Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproduction Trials is Best. Proceedings of the 3rd International Conference on Genetic Search, 116–121. Morgan Kaufmann, 1989.
D.Whitley, T. Starkweather and D'A. Fuquay: Scheduling Problems and Travelling Salesman: The Genetic Edge Recombination Operator. Proceedings of the 3rd International Conference on Genetic Search, 133–140. Morgan Kaufmann, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krajcar, S., Skrlec, D., Pribicevic, B., Blagajac, S. (1995). GA approach to solving Multiple Vehicle Routing Problem. In: Pinto-Ferreira, C., Mamede, N.J. (eds) Progress in Artificial Intelligence. EPIA 1995. Lecture Notes in Computer Science, vol 990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60428-6_44
Download citation
DOI: https://doi.org/10.1007/3-540-60428-6_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60428-0
Online ISBN: 978-3-540-45595-0
eBook Packages: Springer Book Archive