Skip to main content

An Enhanced Ant Colony Algorithm for Vehicle Path Planning Optimization Problem

  • Conference paper
  • First Online:
Artificial Intelligence in Data and Big Data Processing (ICABDE 2021)

Abstract

When confronted with a complicated issue in a particular combinatorial situation, the ant colony optimization algorithm (ACO) can easily slip into optimal local solutions, poor convergence speed, and other drawbacks. This study suggests an enhanced version for ACO (EACO) using information guide period ants search matrix with varied search times and pheromone volatilization factors to achieve algorithm balance between “exploration” and “exploitation. The EACO applies for logistics vehicle path planning optimization (VPP) by using the optimal solution of an “opts” method. The experimental results reveal that the proposed algorithm outperforms the ACO and the other algorithms in the literature for logistical distribution paths and delivery vehicle routes to satisfy customers’ needs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Lin C, Choy KL, Ho GTS, Chung SH, Lam HY (2014) Survey of green vehicle routing problem: past and future trends. Expert Syst Appl 41:1118–1138. https://doi.org/10.1016/j.eswa.2013.07.107

    Article  Google Scholar 

  2. Daneshzand F (2011) The vehicle-routing problem. In: Logistics operations and management. https://doi.org/10.1016/B978-0-12-385202-1.00008-6

  3. Utama DM, Dewi SK, Wahid A, Santoso I (2020) The vehicle routing problem for perishable goods: a systematic review. Cogent Eng 7:1816148. https://doi.org/10.1080/23311916.2020.1816148

    Article  Google Scholar 

  4. Nguyen T-T, Qiao Y, Pan J-S, Chu S-C, Chang K-C, Xue X, Dao T-K (2020) A hybridized parallel bats algorithm for combinatorial problem of traveling salesman. J Intell Fuzzy Syst 38:5811–5820. https://doi.org/10.3233/jifs-179668

    Article  Google Scholar 

  5. Nguyen TT, Pan JS, Dao TK (2019) An improved flower pollination algorithm for optimizing layouts of nodes in wireless sensor network. IEEE Access 7:75985–75998. https://doi.org/10.1109/ACCESS.2019.2921721

    Article  Google Scholar 

  6. Nguyen TT, Pan JS, Dao TK (2019) A compact bat algorithm for unequal clustering in wireless sensor networks. Appl Sci 9:1973. https://doi.org/10.3390/app9101973

    Article  Google Scholar 

  7. Dao T-K, Pan T-S, Nguyen T-T, Chu S-C (2019) a compact articial bee colony optimization for topology control scheme in wireless sensor networks. J Inf Hiding Multimed Signal Process 06:297–310

    Google Scholar 

  8. Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci (Ny) 179:2232–2248

    Article  Google Scholar 

  9. Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer (Long. Beach. Calif). 27:17–26. https://doi.org/10.1109/2.294849

  10. Kennedy J, Eberhart RBT-IC on NN (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks. IEEE, Perth, pp 1942–1948

    Google Scholar 

  11. Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence (Cat. No.98TH8360). pp 69–73

    Google Scholar 

  12. Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1:28–39

    Article  Google Scholar 

  13. Pillay N, Qu R (2018) Vehicle routing problems. In: Natural computing series. https://doi.org/10.1007/978-3-319-96514-7_7

  14. Psaraftis HN, Wen M, Kontovas CA (2016) Dynamic vehicle routing problems: three decades and counting. Networks 67:3–31

    Article  MathSciNet  Google Scholar 

  15. Zhang Y, Tang G, Chen L (2012) Improved A* algorithm for time-dependent vehicle routing problem. In: Proceedings of the 2012 international conference on computer application and system modeling. Atlantis Press, pp 1341–1344

    Google Scholar 

  16. Vaira G (2014) Genetic algorithm for vehicle routing problem

    Google Scholar 

  17. Yu B, Yang ZZ (2011) An ant colony optimization model: the period vehicle routing problem with time windows. Transp Res Part E Logist Transp Rev 47:166–181

    Google Scholar 

  18. Philip K, Prosser P, Shaw P (1998) Dynamic VRPs: a study of scenarios. Uni of Strathclyde Technical Report, pp 1–11. cs.strath.ac.uk/apes/ apereports.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Truong-Giang Ngo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dao, TK., Nguyen, TD., Ngo, TG., Nguyen, TT., Ngo, QT. (2022). An Enhanced Ant Colony Algorithm for Vehicle Path Planning Optimization Problem. In: Dang, N.H.T., Zhang, YD., Tavares, J.M.R.S., Chen, BH. (eds) Artificial Intelligence in Data and Big Data Processing. ICABDE 2021. Lecture Notes on Data Engineering and Communications Technologies, vol 124. Springer, Cham. https://doi.org/10.1007/978-3-030-97610-1_10

Download citation

Publish with us

Policies and ethics