Skip to main content
SpringerLink
Log in

Applying a Hybrid Ant Colony System to the Vehicle Routing Problem

  • Conference paper
Book cover Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3483))

Included in the following conference series:

Abstract

The vehicle routing problem (VRP) has been extensively studied because of the interest in its application in logistics and supply chain management. In this paper, we develop a hybrid algorithm (IACS-SA) that combines the strengths of improved ant colony system (IACS) and simulated annealing (SA) algorithm. The results of computational experiments on fourteen VRP benchmark problems show that our IACS-SA produces better solutions than those of other ACS in the literature. The results also indicate that such a hybrid algorithm is comparable with other meta-heuristic algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alfa, A.S., Heragu, S.S., Chen, M.: A 3-opt Based Simulated Annealing Algorithm for Vehicle Routing Problems. Computers & Industrial Engineering 21, 635–639 (1991)

    Article  Google Scholar 

  2. Baker, B.M., Ayechew, M.A.: A Genetic Algorithm for the Vehicle Routing Problem. Computers and Operations Research 30, 787–800 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barbarosoglu, G., Ozgur, D.: A Tabu Search Algorithm for the Vehicle Routing Problem. Computers and Operations Research 26, 255–270 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Breedam, A.V.: Improvement Heuristics for the Vehicle Routing Problem Based on Simulated Annealing. European Journal of Operational Research 86, 480–490 (1995)

    Article  MATH  Google Scholar 

  5. Bullnheimer, B., Hartl, R.F., Strauss, C.: An Improved Ant System for the Vehicle Routing Problem. Annals of Operations Research 89, 319–328 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bullnheimer, B., Hartl, R.F., Strauss, C.: Applying the Ant System to the Vehicle Routing Problem. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 109–120. Kluwer, Boston (1998)

    Google Scholar 

  7. Christofides, N., Mingozzi, A., Toth, P.: The Vehicle Routing Problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization. Wiley, Chichester (1979)

    Google Scholar 

  8. Clarke, G., Wright, J.W.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research 12, 568–581 (1964)

    Article  Google Scholar 

  9. Colorni, A., Dorigo, M., Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Varela, F., Bourgine, P. (eds.) Proceeding of the European Conference on Artificial Life. Elsevier, Amsterdam (1991)

    Google Scholar 

  10. Colorni, A., Dorigo, M., Maniezzo, V., Trubian, M.: Ant System for Job-Shop Scheduling. Belgian Journal of Operations Research, Statistics and Computer Science 34, 39–53 (1994)

    MATH  Google Scholar 

  11. Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach for the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)

    Article  Google Scholar 

  12. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernetics Part B 26, 29–41 (1996)

    Article  Google Scholar 

  13. Jaszkiewicz, A., Kominek, P.: Genetic Local Search with Distance Preserving Recombination Operator for a Vehicle Routing Problem. European Journal of Operational Research 151, 352–364 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Maniezzo, V., Colorni, A., Dorigo, M.: The Ant System Applied to the Quadratic Assignment Problem. Tech. Rep. IRIDIA/94-28, Universite Libre de Bruxelles, Belgium (1994)

    Google Scholar 

  15. Osman, I.H.: Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem. Annals of Operations Research 41, 421–451 (1993)

    Article  MATH  Google Scholar 

  16. Rego, C., Roucairol, C.: A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem. In: Osman, I.H., Kelly, J.P. (eds.) Meta-heuristic: Theoy and Applications, pp. 667–675. Kluwer, Boston (1996)

    Google Scholar 

  17. Rego, C.: A Subpath Ejection Method for the Vehicle Routing Problem. Management Science 44, 1447–1459 (1998)

    Article  MATH  Google Scholar 

  18. Rochat, Y., Taillard, E.: Probabilistic and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1, 147–167 (1995)

    Article  MATH  Google Scholar 

  19. Taillard, E.D.: Parallel Iterative Search Methods for Vehicle Routing Problems. Networks 23, 661–673 (1993)

    Article  MATH  Google Scholar 

  20. Ting, C.J., Chen, C.H.: An Improved Ant Colony System Algorithm for the Vehicle Routing Problem. Working Paper 2004-001. Department of Industrial Engineering and Management, Yuan Ze University, Taiwan, R.O.C. (2004)

    Google Scholar 

  21. Xu, J., Kelly, J.P.: A Network Flow-based Tabu Search Heuristic for the Vehicle Routing Problem. Transportation Science 30, 379–393 (1996)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, Yuan Ze University, 135 Yuan-Tung Road, Chungli, Taoyuan, 32003, Taiwan,R.O.C.

    Chia-Ho Chen, Ching-Jung Ting & Pei-Chann Chang

Authors
  1. Chia-Ho Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ching-Jung Ting
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pei-Chann Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, CH., Ting, CJ., Chang, PC. (2005). Applying a Hybrid Ant Colony System to the Vehicle Routing Problem. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_45

Download citation

  • DOI: https://doi.org/10.1007/11424925_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation