Abstract
In this paper we present a modified version of our Savings based Ant System for large-scale instances of the Vehicle Routing Problem (VRP). The main idea is to speed up the search by letting the ants solve only sub-problems rather than the whole problem. This is particularly necessary, when one has to solve large real world instances, for which the computation times of classic meta-heuristics are prohibitive. Our model is also inspired by Taillard ’s work on th e VRP ([1]), where the Tabu Search procedure employed solves only some sub-problems.
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
Taillard, E. D. (1993): Paral1el iterative search methods for vehicle routing problems. Networks 23 661–673.
Doerner, K., Gronalt, M., Hartl, R. F., Reimann, M., Strauss, C. and Stummer, M. (2002): SavingsAnts for the Vehicle Routing Problem. in: Cagnoni, S. et al. (eds.): Applications of Evolutionary Computing, Springer, Berlin, 11–20.
Reimann, M., Stummer, M. and Doerner, K. (2002): A Savings based Ant System for the Vehicle Routing Problem. in: Langdon, W. B. et al. (eds.): Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), Morgan Kaufmann, San Francisco, 1317–1325.
Toth, P. and Vigo, D. (2002): The Granular Tabu Search and its Application to the Vehicle Routing Problem. To appear in: INFORMS Journal on Computing.
Spaeth, H. (1977): Cluster-Analyse-Algorithmen zur Objektklassifizierung und Datenreduktion. Oldenbourg, Muenchen.
Gillett, B. and Miller, L. (1974): A heuristic algorithm for the vehicle dispatch problem. Operations Research 22 340–349.
Golden, B. L., Wasil, E. A., Kel1y, J. P. and Chao, I. M. (1998): The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. in: Crainic, T. G. and Laporte, G. (eds.), Fleet management and logistics, Kluwer, Norwel1, 33–56.
Bul1nheimer, B., Hartl, R. F. and Strauss, Ch. (1999): An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 319–328.
Prins, C. (2001): A Simple and Effective Evolut ionary Algorithm for the Vehicle Routing Problem. Reseach report, University of Technology of Troyes, France.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reimann, M., Doerner, K. (2003). Savings Based Ants for Large-scale Vehicle Routing Problems. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-55537-4_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00387-8
Online ISBN: 978-3-642-55537-4
eBook Packages: Springer Book Archive