Abstract
Starting from a case study, a rich vehicle routing problem is analyzed. It is characterized by multiple time windows, heterogeneous fleet, maximum duration, and multiple visits. Two variants of Ant Colony Optimization are proposed in a multiple colonies framework. Two algorithms are tested, giving results that appear satisfactory with respect to the ones achieved by the firm.
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.
Similar content being viewed by others
References
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. ByoSystems 43, 73–81 (1997)
Stützle, T., Hoos, H.: The MAX-MIN Ant system and local search for the traveling salesman problem. In: Angeline, P. (ed.) Proceedings of the IEEE International Conference on Evolutionary Computation, Indianapolis, USA, pp. 308–313. Springer, Heidelberg (1997)
Pellegrini, P.: Application of two nearest neighbor approaches to a rich vehicle routing problem. Technical Report TR/IRIDIA/2005-15, Iridia, Université Libre de Bruxelles, Brussels, Belgium (2005)
Favaretto, D., Moretti, E., Pellegrini, P.: Ant colony system for a vrp with multiple time windows and multiple visits. Journal of Interdisciplinary Mathematics (to appear, 2006), Available on http://www.paola.pellegrini.it
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transaction on Evolutionary Computation 1, 53–66 (1997)
Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problem with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63–76. McGraw-Hill, London (1999)
Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 13, 533–549 (1986)
Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problem with time windows. Journal of the Operational Research Society 59, 928–936 (2001)
Bianchi, L., Birattari, M., Chiarandini, M., Manfrin, M., Mastrolilli, M., Paquete, L., Rossi-Doria, O., Schiavinotto, T.: Hybrid metaheuristics for the vehicle routing problem with stochastic demand. Journal of Mathematical Modelling and Algorithms 5(1), 91–110 (2006)
Birattari, M.: On the estimation of the expected performance of a metaheuristic on a class of instances. How many instances, how many runs? Technical Report TR/IRIDIA/2004-01, Université Libre de Bruxelles (2004)
Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Langdon, W. (ed.) GECCO 2002. Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11–18. Morgan Kaufmann Publishers, San Francisco, CA (2002)
Birattari, M., Zlochin, M., Dorigo, M.: Towards a theory of practice in metaheuristics design: A machine learning perspective. Theoretical Informatics and Applications 40(2), 353–369 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pellegrini, P., Favaretto, D., Moretti, E. (2007). Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74827-4_79
Download citation
DOI: https://doi.org/10.1007/978-3-540-74827-4_79
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74826-7
Online ISBN: 978-3-540-74827-4
eBook Packages: Computer ScienceComputer Science (R0)