IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v24y2024i3d10.1007_s12351-024-00862-5.html
   My bibliography  Save this article

Swarm intelligence and nature inspired algorithms for solving vehicle routing problems: a survey

Author

Listed:
  • Themistoklis Stamadianos

    (Technical University of Crete)

  • Andromachi Taxidou

    (Technical University of Crete)

  • Magdalene Marinaki

    (Technical University of Crete)

  • Yannis Marinakis

    (Technical University of Crete)

Abstract

Vehicle routing problem (VRP) is a classic NP-hard optimization problem. It is generally accepted that an optimized routing scheme can cause huge difference in the cost in all stages of transportation. Consequently, the VRP has evoked interest among the researchers of the field. Usually, a metaheuristic or an evolutionary algorithm is used for the solution of a VRP variant. In the last years, a number of swarm intelligence algorithms have been used for the solution of the problem. Initially, the two most classic swarm intelligence algorithms, the Ant Colony Optimization and the Particle Swarm Optimization, were used for the solution of this kind of problems. However, in the last years, more and more researchers solved the problem using a different swarm intelligence algorithm. In this paper, we focused in the presentation and analysis of the swarm intelligence algorithms that have been used for the solution of the problem. We give the advantages and disadvantages of each method, we focus in those ones that produced the best results in difficult VRPs and we present directions for the future of this kind of algorithms for the solution of a VRP variant.

Suggested Citation

  • Themistoklis Stamadianos & Andromachi Taxidou & Magdalene Marinaki & Yannis Marinakis, 2024. "Swarm intelligence and nature inspired algorithms for solving vehicle routing problems: a survey," Operational Research, Springer, vol. 24(3), pages 1-45, September.
    • Handle: RePEc:spr:operea:v:24:y:2024:i:3:d:10.1007_s12351-024-00862-5
    DOI: 10.1007/s12351-024-00862-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-024-00862-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-024-00862-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Alireza Goli & Amir-Mohammad Golmohammadi & José-Luis Verdegay, 2022. "RETRACTED ARTICLE: Two-echelon electric vehicle routing problem with a developed moth-flame meta-heuristic algorithm," Operations Management Research, Springer, vol. 15(3), pages 891-912, December.
    2. R. Montemanni & L. M. Gambardella & A. E. Rizzoli & A. V. Donati, 2005. "Ant Colony System for a Dynamic Vehicle Routing Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 327-343, December.
    3. Kun Guo & Qishan Zhang, 2017. "A Discrete Artificial Bee Colony Algorithm for the Reverse Logistics Location and Routing Problem," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 16(05), pages 1339-1357, September.
    4. Yongquan Zhou & Jian Xie & Hongqing Zheng, 2013. "A Hybrid Bat Algorithm with Path Relinking for Capacitated Vehicle Routing Problem," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-10, August.
    5. Liyang Xiao & Mahjoub Dridi & Amir Hajjam El Hassani & Hongying Fei & Wanlong Lin, 2018. "An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions," Sustainability, MDPI, vol. 10(3), pages 1-19, March.
    6. Baozhen Yao & Qianqian Yan & Mengjie Zhang & Yunong Yang, 2017. "Improved artificial bee colony algorithm for vehicle routing problem with time windows," PLOS ONE, Public Library of Science, vol. 12(9), pages 1-18, September.
    7. Themistoklis Stamadianos & Nikolaos A. Kyriakakis & Magdalene Marinaki & Yannis Marinakis, 2023. "Routing Problems with Electric and Autonomous Vehicles: Review and Potential for Future Research," SN Operations Research Forum, Springer, vol. 4(2), pages 1-34, June.
    8. Gajpal, Yuvraj & Abad, P.L., 2009. "Multi-ant colony system (MACS) for a vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 196(1), pages 102-117, July.
    9. Xu, Jiuping & Yan, Fang & Li, Steven, 2011. "Vehicle routing optimization with soft time windows in a fuzzy random environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1075-1091.
    10. Panagiotis-Petros Matthopoulos & Stella Sofianopoulou, 2019. "A firefly algorithm for the heterogeneous fixed fleet vehicle routing problem," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 33(2), pages 204-224.
    11. The Jin Ai & Voratas Kachitvichyanukul, 2009. "A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(4), pages 519-537.
    12. D Sariklis & S Powell, 2000. "A heuristic method for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(5), pages 564-573, May.
    13. H. Xue, 2020. "Adaptive Cultural Algorithm-Based Cuckoo Search for Time-Dependent Vehicle Routing Problem with Stochastic Customers Using Adaptive Fractional Kalman Speed Prediction," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-18, July.
    14. Yu, Bin & Yang, Zhong-Zhen & Yao, Baozhen, 2009. "An improved ant colony optimization for vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 171-176, July.
    15. Donati, Alberto V. & Montemanni, Roberto & Casagrande, Norman & Rizzoli, Andrea E. & Gambardella, Luca M., 2008. "Time dependent vehicle routing problem with a multi ant colony system," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1174-1191, March.
    16. Yu, Bin & Yang, Zhong Zhen, 2011. "An ant colony optimization model: The period vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(2), pages 166-181, March.
    17. Haitao Xu & Pan Pu & Feng Duan, 2018. "Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization," Discrete Dynamics in Nature and Society, Hindawi, vol. 2018, pages 1-13, February.
    18. B Yu & Z-Z Yang & J-X Xie, 2011. "A parallel improved ant colony optimization for multi-depot vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 183-188, January.
    19. Samuel Reong & Hui-Ming Wee & Yu-Lin Hsiao, 2022. "20 Years of Particle Swarm Optimization Strategies for the Vehicle Routing Problem: A Bibliometric Analysis," Mathematics, MDPI, vol. 10(19), pages 1-19, October.
    20. B. Bullnheimer & R.F. Hartl & C. Strauss, 1999. "An improved Ant System algorithm for theVehicle Routing Problem," Annals of Operations Research, Springer, vol. 89(0), pages 319-328, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Shuai & Gajpal, Yuvraj & Appadoo, S.S. & Abdulkader, M.M.S., 2018. "Electric vehicle routing problem with recharging stations for minimizing energy consumption," International Journal of Production Economics, Elsevier, vol. 203(C), pages 404-413.
    2. Baozhen Yao & Chao Chen & Xiaolin Song & Xiaoli Yang, 2019. "Fresh seafood delivery routing problem using an improved ant colony optimization," Annals of Operations Research, Springer, vol. 273(1), pages 163-186, February.
    3. Abdulkader, M.M.S. & Gajpal, Yuvraj & ElMekkawy, Tarek Y., 2018. "Vehicle routing problem in omni-channel retailing distribution systems," International Journal of Production Economics, Elsevier, vol. 196(C), pages 43-55.
    4. Yiwei Fan & Gang Wang & Xiaoling Lu & Gaobin Wang, 2019. "Distributed forecasting and ant colony optimization for the bike-sharing rebalancing problem with unserved demands," PLOS ONE, Public Library of Science, vol. 14(12), pages 1-26, December.
    5. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    6. Weiheng Zhang & Yuvraj Gajpal & Srimantoorao. S. Appadoo & Qi Wei, 2020. "Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions," Sustainability, MDPI, vol. 12(8), pages 1-19, April.
    7. Schyns, M., 2015. "An ant colony system for responsive dynamic vehicle routing," European Journal of Operational Research, Elsevier, vol. 245(3), pages 704-718.
    8. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    9. Wei Song & Shuailei Yuan & Yun Yang & Chufeng He, 2022. "A Study of Community Group Purchasing Vehicle Routing Problems Considering Service Time Windows," Sustainability, MDPI, vol. 14(12), pages 1-17, June.
    10. Izdebski, Mariusz & Jacyna-Gołda, Ilona & Gołda, Paweł, 2022. "Minimisation of the probability of serious road accidents in the transport of dangerous goods," Reliability Engineering and System Safety, Elsevier, vol. 217(C).
    11. Baozhen Yao & Bin Yu & Ping Hu & Junjie Gao & Mingheng Zhang, 2016. "An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot," Annals of Operations Research, Springer, vol. 242(2), pages 303-320, July.
    12. Mariusz Izdebski & Marianna Jacyna, 2021. "An Efficient Hybrid Algorithm for Energy Expenditure Estimation for Electric Vehicles in Urban Service Enterprises," Energies, MDPI, vol. 14(7), pages 1-23, April.
    13. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    14. Haitao Xu & Pan Pu & Feng Duan, 2018. "Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization," Discrete Dynamics in Nature and Society, Hindawi, vol. 2018, pages 1-13, February.
    15. Szeto, W.Y. & Wu, Yongzhong & Ho, Sin C., 2011. "An artificial bee colony algorithm for the capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 126-135, November.
    16. Samuel Reong & Hui-Ming Wee & Yu-Lin Hsiao, 2022. "20 Years of Particle Swarm Optimization Strategies for the Vehicle Routing Problem: A Bibliometric Analysis," Mathematics, MDPI, vol. 10(19), pages 1-19, October.
    17. Wan Fang & Guo Haixiang & Li Jinling & Gu Mingyun & Pan Wenwen, 2021. "Multi-objective Emergency Scheduling for Geological Disasters," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 105(2), pages 1323-1358, January.
    18. Liu, Ran & Xie, Xiaolan & Garaix, Thierry, 2014. "Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics," Omega, Elsevier, vol. 47(C), pages 17-32.
    19. Md. Anisul Islam & Yuvraj Gajpal, 2021. "Optimization of Conventional and Green Vehicles Composition under Carbon Emission Cap," Sustainability, MDPI, vol. 13(12), pages 1-20, June.
    20. Gao, Shangce & Wang, Yirui & Cheng, Jiujun & Inazumi, Yasuhiro & Tang, Zheng, 2016. "Ant colony optimization with clustering for solving the dynamic location routing problem," Applied Mathematics and Computation, Elsevier, vol. 285(C), pages 149-173.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:operea:v:24:y:2024:i:3:d:10.1007_s12351-024-00862-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.