Skip to main content
SpringerLink
Log in

A Hybrid Approach Based on Ant Colony System for the VRPTW

  • Conference paper
  • First Online:
Advanced Technology in Teaching - Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009)

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 117))

Abstract

The main objective of vehicle routing problem (VRP) is to minimize the total required fleet size for serving all customers. Secondary objectives are to minimize the total distance traveled or to minimize the total route duration of all vehicles. In this paper, we present a hybrid ant colony System, named IACS, coupled with the iterated local search (ILS) algorithm for the VRP with time windows (VRPTW). The ILS can help to escape local optimum. Experiments on various aspects of the algorithm and computational results for some benchmark problems are reported. We compare our approach with some classic, powerful meta-heuristics and show that the proposed approach can obtain the better quality of the solutions.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Colorni, M.D., Mariiezzo, V.: Distributed Optimization by Ant Colonies. In: Varela, F., Bourgine, P. (eds.) Proc. Eearop. Conf. Artificial Life. Elsevier, Amsterdam (1991)

    Google Scholar 

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

    Article  Google Scholar 

  3. Stützle, T., Hoos, H.H.: The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem. In: Saeck, T., Michalewicz, Z., Yao, N. (eds.) Proceedings of the IEEE International Conference on Evolution and Computation (ICEC 1997), pp. 309–314 (1997)

    Google Scholar 

  4. Gambardella, L.M., Dorigo, M.: Solving Symmetric and Asymmetric TSPs by Ant Colonies. In: Proceedings of the IEEE Conference on Evolutionary Computation, ICEC1996, pp. 622–627. IEEE Press (1996)

    Google Scholar 

  5. Zecchin, A.C., Maier, H.R., Simpson, A.R., Leonard, M., Nixon, J.B.: Ant colony optimization applied to water distribution system design: comparative study of five algorithms. Journal of Water Resources Planning and Management 133(1), 87–92 (2007)

    Article  Google Scholar 

  6. Li, Y., Chan Hilton, A.B.: Optimal groundwater monitoring design using an ant colony optimization paradigm. Environmental Modelling and Software 22(1), 110–116 (2007)

    Article  Google Scholar 

  7. Aksoy, Y., Derbez, A.: Software survey: supply chain management. OR/MS Today 30(3), 1–13 (2003)

    Google Scholar 

  8. Bullnheimer, R., Hartl, 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 

  9. Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., et al. (eds.) New ideas in optimization, pp. 63–76 (1999)

    Google Scholar 

  10. Rizzoli, A.E., Montemanni, R., Lucibello, E., Gambardella, L.M.: Ant colony optimization for real-world vehicle routing problems. From theory to applications. Swarm Intelligence 1(2), 135–151 (2007)

    Google Scholar 

  11. Angus, Woodward, C.: Multiple objective ant colony optimization. Swarm Intelligence 3(1), 69–85 (2009)

    Article  Google Scholar 

  12. Martin, O., Otto, S.W., Felten, E.W.: Large-Step Markov Chains for the Traveling Salesman Problem. Complex Systems 5(3), 299–326 (1991)

    MathSciNet  MATH  Google Scholar 

  13. Montemanni, R., Gambardella, L., Rizzoli, A., Donati, A.: A new algorithm for a dynamic vehicle routing problem based on ant colony system. In: Second International Workshop on Freight Transportation and Logistics (2003)

    Google Scholar 

  14. Hu, X., Zhang, J., Li, Y.: Flexible protein folding by ant colony optimization. In: Computational Intelligence in Biomedicine and Bioinformatics: Current Trends and Applications, pp. 317–336. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Lourencǫ, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 321–353. Kluwer Academic Publishers, Norwell (2002)

    Google Scholar 

  16. Baum, B.: Iterated descent: A better algorithm for local search in combinatorial optimization problems. Technical report, Caltech, Pasadena, CA, manuscript (1986)

    Google Scholar 

  17. Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the traveling salesman problem. Complex Systems 5(3), 299–326 (1991)

    MathSciNet  MATH  Google Scholar 

  18. Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations, pp. 369–443. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  19. Stützle, T.: Applying iterated local search to the permutation flow shop problem. Technical Report AIDA-98-04, FG Intellektik, TU Darmstadt (August 1998)

    Google Scholar 

  20. Shi, Y.H., Eberhart, R.C.: Empirical study of particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1945–1950. IEEE Service Center, Piscataway (1999)

    Google Scholar 

  21. Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., et al. (eds.) New ideas in optimization, pp. 63–76 (1999)

    Google Scholar 

  22. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Combinatorial Optimization. Wiley, Chicester (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Automation, Beijing Union University, Beijing, China

    Yuping Wang

Authors
  1. Yuping Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuping Wang .

Editor information

Editors and Affiliations

  1. Central China Normal University, Lvting Yajing, Hongshan Qu 10-3-102, Wuhan, 430079, China, People's Republic

    Yanwen Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Wang, Y. (2012). A Hybrid Approach Based on Ant Colony System for the VRPTW. In: Wu, Y. (eds) Advanced Technology in Teaching - Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009). Advances in Intelligent and Soft Computing, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25437-6_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25437-6_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25436-9

  • Online ISBN: 978-3-642-25437-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation