Skip to main content
SpringerLink
Log in
Book cover

Networking Communication and Data Knowledge Engineering pp 257–266Cite as

On Solutions to Capacitated Vehicle Routing Problem Using an Enhanced Ant Colony Optimization Technique

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 3))

Abstract

This paper presents an enhanced ant colony optimization (ACO) algorithm for solving the capacitated vehicle routing problem (CVRP). CVRP is the most elementary version of VRP, but also a difficult combinatorial problem which contains both the TSP (routing) and BPP (packing) problems as special cases. In the CVRP a number of vehicles having uniform capacity starts and terminates at a common depot, services a set of customers with certain demands at minimum transit cost. In this paper, an enhanced version of ACO algorithm is implemented on Fisher and Christofides benchmark problems. Computational results compared with the performance of different algorithms and relaxations are presented. These results indicate that the proposed algorithm is a comparative approach to solve CVRP. The article is concluded by examining the possible future research directions in this field.

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

References

  1. Ai, J., Kachitvichyanukul, V.: Particle swarm optimization solution representations for solving capacitated vehicle routing problem. Computers & Industrial Engineering 56 (2009) 380–387.

    Google Scholar 

  2. Alba, E., Dorronsoro, B.: The Exploration/Exploitation Tradeoff in Dynamic Cellular Genetic Algorithms. IEEE Transactions on Evolutionary Computation 9, 2 (2005) 126–142.

    Google Scholar 

  3. Baldacci, R., Toth, P., Vigo, D.: Exact algorithms for routing problems under vehicle capacity constraints. Annals of Operations Research 175 (2010) 213–245.

    Google Scholar 

  4. Berger, J., Barkoui, M.: A new hybrid genetic algorithm for the capacitated vehicle routing problem. Journal of the Operational Research Society 54(2003) 1254–1262.

    Google Scholar 

  5. Bullnheimer, B., Hartl, R.F., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319–328.

    Google Scholar 

  6. Chen, A. L., Yang, G. K., Wu, Z. M.: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University: Science, 7(4), (2006) 607–614.

    Google Scholar 

  7. Chen, P., Huang, K., Dong, Y.: Iterated variable neighborhood algorithm for capacitated vehicle routing problem. Expert Systems with Applications 37 (2010) 1620–1627.

    Google Scholar 

  8. Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. Journal of Operational Research Society 52 (2001) 928–936.

    Google Scholar 

  9. Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. Computational Intelligence Magazine, IEEE, 1 (2006) 28–39.

    Google Scholar 

  10. Ergun, O., Orlin, J.B., Steele-Feldman, A.: Creating very large scale neighborhoods out of smaller ones by compounding moves. Journal of Heuristics 12 (2006) 115–140.

    Google Scholar 

  11. Gambardella, L. M., Taillard, E., Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. [ed.] M. Dorigo and F. Glover D. Corne. New Ideas in Optimization. s.l.: McGraw-Hill, UK, (1999) 63–76.

    Google Scholar 

  12. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276–1290.

    Google Scholar 

  13. Gendreau, M., Potvin, J.-Y., Braysy, O., Hasle, G., Løkketangen, A.: Metaheuristics for the vehicle routing and its extensions: A categorized bibliography. In: Golden, B., Raghavan, S., Wasil, E. (Eds.). The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, (2008) 143–169.

    Google Scholar 

  14. Gupta, A., Saini, S.: On Solutions to Vehicle Routing Problems using Swarm Intelligence Techniques: A Review. In Proceedings of International Conference on Computer, Communication & Computational Sciences (IC4S’16), Ajmer (2016).

    Google Scholar 

  15. Gutierrez, J. G., Desaulniers, G., Laporte, G., Marianov, V.: A Branch-and-Price Algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows. European Journal of Operational Research 206 (12) (2010) 341–349. doi:10.1016/j.ejor.2010.02.037.

  16. Kanthavel, K., Prasad, P.: Optimization of Capacitated Vehicle Routing Problem by Nested Particle Swarm Optimization. American Journal of Applied Sciences 8(2) (2011) 107–112.

    Google Scholar 

  17. Laporte, G., Osman, I. H.: Routing problems: A bibliography. Annals of Operations Research 61(1995) 227–262.

    Google Scholar 

  18. Laporte, G.: The Vehicle Routing Problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59 (1992) 345–358.

    Google Scholar 

  19. Marinakis, Y., Marinaki, M., Dounias, G.: Honey bees mating optimization algorithm for large scale vehicle routing problems. Natural Computing 9 (2010) 5–27.

    Google Scholar 

  20. Osman, I. H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41 (1993) 421–451.

    Google Scholar 

  21. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31 (2004) 1985–2002.

    Google Scholar 

  22. Prins, C.: A GRASP evolutionary local search hybrid for the vehicle routing problem. In: Pereira, F.B., Tavares, J. (Eds.), Bio-inspired Algorithms for the Vehicle Routing Problem. Springer-Verlag, Berlin, Heidelberg, (2009) pp. 35–53.

    Google Scholar 

  23. Reimann, M., Doerner, K., Hartl, R. F.: D-Ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31 (2004) 563–591.

    Google Scholar 

  24. Ropke, S., Cordeau, J.-F., Iori, M. and Vigo, D.: Branch-and-Cut-and-Price for Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints. Proceedings of ROUTE, Jekyll Island (2007).

    Google Scholar 

  25. Shen, Y., Murata, T.: Pick-up Scheduling of Two-Dimensional Loading in Vehicle Routing Problem using GA. Lecture Notes in Engineering & Computer Science 6 (2) (2012) 1532–1537.

    Google Scholar 

  26. Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle routing problem. Journal on Computing 15 (2003) 333–346.

    Google Scholar 

  27. Yin, L., Liu, X.: A Single–depot Complex Vehicle Routing Problem and its PSO Solution. Proceedings of the Second Symposium International Computer Science and Computational Technology (ISCSCT ’09) China (2009) 266–269.

    Google Scholar 

  28. Yu, B., Yang, Z.-Z., Yao, B.: An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research 196 (2009) 171–176.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Physics & Computer Science, Dayalbagh Educational Institute, Agra, 282005, India

    Ashima Gupta & Sanjay Saini

Authors
  1. Ashima Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjay Saini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ashima Gupta .

Editor information

Editors and Affiliations

  1. University of Murcia, Murcia, Spain

    Gregorio Martinez Perez

  2. Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology Allahabad, Allahabad, Uttar Pradesh, India

    Krishn K. Mishra

  3. Department of Computer Science and Engineering, ABES Engineering College, Ghaziabad, Uttar Pradesh, India

    Shailesh Tiwari

  4. Department of Computer Science and Engineering, ABES Engineering College, Ghaziabad, Uttar Pradesh, India

    Munesh C. Trivedi

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gupta, A., Saini, S. (2018). On Solutions to Capacitated Vehicle Routing Problem Using an Enhanced Ant Colony Optimization Technique. In: Perez, G., Mishra, K., Tiwari, S., Trivedi, M. (eds) Networking Communication and Data Knowledge Engineering. Lecture Notes on Data Engineering and Communications Technologies, vol 3. Springer, Singapore. https://doi.org/10.1007/978-981-10-4585-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4585-1_21

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4584-4

  • Online ISBN: 978-981-10-4585-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation