Skip to main content
SpringerLink
Log in

Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem

  • Research Paper
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

The Multi-Depot Open Vehicle Routing Problem (MDOVRP) is only one example of several optimization problems that are classified as NP-hard. Therefore, heuristic and metaheuristic approaches are helpful in obtaining a near-optimal solution. A hybrid HHO algorithm called HHO-PSO is proposed in this work to address the MDOVRP. The goal is to minimize costs for the routes of a fleet of vehicles that start moving from depots and fulfill customers’ demands. To improve the exploration of the Harris Hawks Optimization (HHO) algorithm, the exploration method of Particle Swarm Optimization (PSO) which is more robust, is used in this paper. Experimental results proved that the proposed hybrid algorithm works better than the original PSO and HHO in discrete space in terms of balance, exploitation, and exploration to solve the MDOVRP. Moreover, the suggested algorithm is compared to five cutting-edge approaches on 24 MDOVRP instances with a broad number of customers. The computational findings reveal that the suggested approach outperformed the other comparable metaheuristic techniques in solving the MDOVRP.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Algorithm 1
Fig. 2

Similar content being viewed by others

References

  1. Rahmani Hosseinabadi AA et al (2018) OVRP_GELS: solving open vehicle routing problem using the gravitational emulation local search algorithm. Neural Comput Appl 29:955–968

    Article  Google Scholar 

  2. Li F, Golden B, Wasil E (2007) The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Oper Res 34(10):2918–2930

    Article  Google Scholar 

  3. Brandão J (2020) A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. Eur J Oper Res 284(2):559–571

    Article  MathSciNet  Google Scholar 

  4. Bezerra SN, de Souza SR, Souza MJF (2023) A general VNS for the multi-depot open vehicle routing problem with time windows. Optimi Lett 17(19):2033–2063

    Article  MathSciNet  Google Scholar 

  5. Hosseinabadi AAR et al (2016) Gravitational search algorithm to solve open vehicle routing problem. In: Innovations in bio-inspired computing and applications: proceedings of the 6th international conference on innovations in bio-inspired computing and applications (IBICA 2015) held in Kochi, India during December 16–18, 2015. Springer

  6. Pirozmand P et al (2021) A feature selection approach for spam detection in social networks using gravitational force-based heuristic algorithm. J Ambient Intell Humaniz Comput 14(3):1633–1646

    Article  Google Scholar 

  7. Peng Z et al (2021) TCDABCF: a trust-based community detection using artificial bee colony by feature fusion. Math Probl Eng 2021:1–19

    Google Scholar 

  8. Nategh MN, Hosseinabadi AAR, Balas VE (2018) Ant_VRP: ant-colony-based meta-heuristic algorithm to solve the vehicle routing problem. Int J Adv Intell Paradig 11(3–4):315–334

    Google Scholar 

  9. Stamadianos T et al (2023) A hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem. Ann Math Artif Intell: 1–24.

  10. Shams Lahroudi SH, Mahalleh F, Mirkamali S (2022) Multiobjective parallel algorithms for solving biobjective open shop scheduling problem. Complexity 2022:1–16

    Article  Google Scholar 

  11. Wu H et al (2021) A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows. Complex Intell Syst 9(3):2491–2508

    Article  Google Scholar 

  12. Mirjalili S, Mirjalili S, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61

    Article  Google Scholar 

  13. Singh N et al (2023) HSSAHHO: a novel hybrid Salp swarm-Harris hawks optimization algorithm for complex engineering problems. J Ambient Intell Humaniz Comput 14(9):11569–11605

    Article  Google Scholar 

  14. Daneshfaraz R et al (2023) Prediction of drop relative energy dissipation based on Harris Hawks Optimization algorithm. Iran J Sci Technol Trans Civ Eng 47(2):1197–1210

    Article  Google Scholar 

  15. Al-Betar MA et al (2021) Survival exploration strategies for Harris hawks optimizer. Expert Syst Appl 168:114243

    Article  Google Scholar 

  16. Pirozmand P et al (2023) An improved particle swarm optimization algorithm for task scheduling in cloud computing. J Ambient Intell Humaniz Comput 14(4):4313–4327

    Article  Google Scholar 

  17. Liu R, Jiang Z, Geng N (2014) A hybrid genetic algorithm for the multi-depot open vehicle routing problem. OR Spectrum 36:401–421

    Article  MathSciNet  Google Scholar 

  18. Lalla-Ruiz E et al (2016) An improved formulation for the multi-depot open vehicle routing problem. OR Spectrum 38:175–187

    Article  MathSciNet  Google Scholar 

  19. Soto M et al (2017) Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem. Comput Ind Eng 107:211–222

    Article  Google Scholar 

  20. Lahyani R, Gouguenheim A-L, Coelho LC (2019) A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems. Int J Prod Res 57(22):6963–6976

    Article  Google Scholar 

  21. Nucamendi-Guillén S et al (2021) The multi-depot open location routing problem with a heterogeneous fixed fleet. Expert Syst Appl 165:1–39

    Article  Google Scholar 

  22. Husakou A et al (2020) An application of the multi-depot heterogeneous fixed fleet open vehicle routing problem. Int J Adv Oper Manag 12(2):142–155

    Google Scholar 

  23. Sadati MEH, Çatay B, Aksen D (2021) An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems. Comput Oper Res 133:105269

    Article  MathSciNet  Google Scholar 

  24. Tavakkoli-Moghaddam R et al (2019) A multi-depot close and open vehicle routing problem with heterogeneous vehicles. In: International conference on industrial engineering and systems management (IESM). China

  25. Shen L, Tao F, Wang S (2018) Multi-depot open vehicle routing problem with time windows based on carbon trading. Int J Environ Res Public Health 15(9):2025

    Article  Google Scholar 

  26. Azadeh A, Farrokhi-Asl H (2019) The close–open mixed multi depot vehicle routing problem considering internal and external fleet of vehicles. Transp Lett 11(2):78–92

    Article  Google Scholar 

  27. Dalbah LM et al (2022) A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem. J King Saud Univ-Comput Inf Sci 34(8):4782–4795

    Google Scholar 

  28. Gharehchopogh FS (2023) An improved Harris Hawks optimization algorithm with multi-strategy for community detection in social network. J Bionic Eng 20(3):1175–1197

    Article  Google Scholar 

  29. Wang D, Tan D, Liu L (2018) Particle swarm optimization algorithm: an overview. Soft Comput 22:387–408

    Article  Google Scholar 

  30. 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). IEEE

  31. Heidari AA et al (2019) Harris hawks optimization: algorithm and applications. Futur Gener Comput Syst 97:849–872

    Article  Google Scholar 

  32. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581

    Article  Google Scholar 

  33. Doyuran T, Çatay B (2011) A robust enhancement to the Clarke-Wright savings algorithm. J Oper Res Soc 62:223–231

    Article  Google Scholar 

  34. Savings Algorithm (2013) Available from: https://neo.lcc.uma.es/vrp/solution-methods/heuristics/savings-algorithms/

  35. Cordeau J-F, Gendreau M, Laporte G (1998) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30:105–119

    Article  Google Scholar 

  36. MiarNaeimi F, Azizyan G, Rashki M (2021) Horse herd optimization algorithm: a nature-inspired algorithm for high-dimensional optimization problems. Knowl-Based Syst 213:106711

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EIT Data Science and Communication College, Zhejiang Yuexiu University, Shaoxing, China

    Zhihao Peng

  2. Faculty of Higher Education Holmes Institute, Sydney, Australia

    Poria Pirozmand

  3. School of Computer and Software, Dalian Neusoft Information University, Dalian, China

    Yaohua Xiong

Authors
  1. Zhihao Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Poria Pirozmand
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yaohua Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All authors contributed to the study conception and design. ZP: Developed the theory and performed the computations and also prepared the experimental results. PP: Drafted the work and ceated the related works. YX: Contributed to sample preparation and supervise the work. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Zhihao Peng.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Peng, Z., Pirozmand, P. & Xiong, Y. Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem. Evol. Intel. (2024). https://doi.org/10.1007/s12065-023-00898-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12065-023-00898-0

Keywords

Search

Navigation