{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T04:27:27Z","timestamp":1774499247064,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T00:00:00Z","timestamp":1706227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T00:00:00Z","timestamp":1706227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s12065-023-00898-0","type":"journal-article","created":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T17:02:13Z","timestamp":1706288533000},"page":"2495-2513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Improved Harris Hawks Optimizer algorithm to solve the multi-depot open vehicle routing problem"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8340-7003","authenticated-orcid":false,"given":"Zhihao","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Poria","family":"Pirozmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaohua","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,26]]},"reference":[{"key":"898_CR1","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1007\/s00521-016-2608-x","volume":"29","author":"AA Rahmani Hosseinabadi","year":"2018","unstructured":"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\u2013968","journal-title":"Neural Comput Appl"},{"issue":"10","key":"898_CR2","doi-asserted-by":"publisher","first-page":"2918","DOI":"10.1016\/j.cor.2005.11.018","volume":"34","author":"F Li","year":"2007","unstructured":"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\u20132930","journal-title":"Comput Oper Res"},{"issue":"2","key":"898_CR3","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ejor.2020.01.008","volume":"284","author":"J Brand\u00e3o","year":"2020","unstructured":"Brand\u00e3o J (2020) A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. Eur J Oper Res 284(2):559\u2013571","journal-title":"Eur J Oper Res"},{"issue":"19","key":"898_CR4","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1007\/s11590-023-01990-1","volume":"17","author":"SN Bezerra","year":"2023","unstructured":"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\u20132063","journal-title":"Optimi Lett"},{"key":"898_CR5","doi-asserted-by":"crossref","unstructured":"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\u201318, 2015. Springer","DOI":"10.1007\/978-3-319-28031-8_8"},{"issue":"3","key":"898_CR6","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1007\/s12652-021-03385-5","volume":"14","author":"P Pirozmand","year":"2021","unstructured":"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\u20131646","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"898_CR7","first-page":"1","volume":"2021","author":"Z Peng","year":"2021","unstructured":"Peng Z et al (2021) TCDABCF: a trust-based community detection using artificial bee colony by feature fusion. Math Probl Eng 2021:1\u201319","journal-title":"Math Probl Eng"},{"issue":"3\u20134","key":"898_CR8","first-page":"315","volume":"11","author":"MN Nategh","year":"2018","unstructured":"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\u20134):315\u2013334","journal-title":"Int J Adv Intell Paradig"},{"key":"898_CR9","doi-asserted-by":"crossref","unstructured":"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\u201324.","DOI":"10.1007\/s10472-023-09858-x"},{"key":"898_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2022\/5043058","volume":"2022","author":"SH Shams Lahroudi","year":"2022","unstructured":"Shams Lahroudi SH, Mahalleh F, Mirkamali S (2022) Multiobjective parallel algorithms for solving biobjective open shop scheduling problem. Complexity 2022:1\u201316","journal-title":"Complexity"},{"issue":"3","key":"898_CR11","doi-asserted-by":"publisher","first-page":"2491","DOI":"10.1007\/s40747-021-00401-1","volume":"9","author":"H Wu","year":"2021","unstructured":"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\u20132508","journal-title":"Complex Intell Syst"},{"key":"898_CR12","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili S, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"issue":"9","key":"898_CR13","doi-asserted-by":"publisher","first-page":"11569","DOI":"10.1007\/s12652-022-03724-0","volume":"14","author":"N Singh","year":"2023","unstructured":"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\u201311605","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"2","key":"898_CR14","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1007\/s40996-022-00987-7","volume":"47","author":"R Daneshfaraz","year":"2023","unstructured":"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\u20131210","journal-title":"Iran J Sci Technol Trans Civ Eng"},{"key":"898_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114243","volume":"168","author":"MA Al-Betar","year":"2021","unstructured":"Al-Betar MA et al (2021) Survival exploration strategies for Harris hawks optimizer. Expert Syst Appl 168:114243","journal-title":"Expert Syst Appl"},{"issue":"4","key":"898_CR16","doi-asserted-by":"publisher","first-page":"4313","DOI":"10.1007\/s12652-023-04541-9","volume":"14","author":"P Pirozmand","year":"2023","unstructured":"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\u20134327","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"898_CR17","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00291-012-0289-0","volume":"36","author":"R Liu","year":"2014","unstructured":"Liu R, Jiang Z, Geng N (2014) A hybrid genetic algorithm for the multi-depot open vehicle routing problem. OR Spectrum 36:401\u2013421","journal-title":"OR Spectrum"},{"key":"898_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00291-015-0408-9","volume":"38","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz E et al (2016) An improved formulation for the multi-depot open vehicle routing problem. OR Spectrum 38:175\u2013187","journal-title":"OR Spectrum"},{"key":"898_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cie.2017.03.022","volume":"107","author":"M Soto","year":"2017","unstructured":"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\u2013222","journal-title":"Comput Ind Eng"},{"issue":"22","key":"898_CR20","doi-asserted-by":"publisher","first-page":"6963","DOI":"10.1080\/00207543.2019.1572929","volume":"57","author":"R Lahyani","year":"2019","unstructured":"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\u20136976","journal-title":"Int J Prod Res"},{"key":"898_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2020.113846","volume":"165","author":"S Nucamendi-Guill\u00e9n","year":"2021","unstructured":"Nucamendi-Guill\u00e9n S et al (2021) The multi-depot open location routing problem with a heterogeneous fixed fleet. Expert Syst Appl 165:1\u201339","journal-title":"Expert Syst Appl"},{"issue":"2","key":"898_CR22","first-page":"142","volume":"12","author":"A Husakou","year":"2020","unstructured":"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\u2013155","journal-title":"Int J Adv Oper Manag"},{"key":"898_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105269","volume":"133","author":"MEH Sadati","year":"2021","unstructured":"Sadati MEH, \u00c7atay 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","journal-title":"Comput Oper Res"},{"key":"898_CR24","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/IESM45758.2019.8948137"},{"issue":"9","key":"898_CR25","doi-asserted-by":"publisher","first-page":"2025","DOI":"10.3390\/ijerph15092025","volume":"15","author":"L Shen","year":"2018","unstructured":"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","journal-title":"Int J Environ Res Public Health"},{"issue":"2","key":"898_CR26","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1080\/19427867.2016.1274468","volume":"11","author":"A Azadeh","year":"2019","unstructured":"Azadeh A, Farrokhi-Asl H (2019) The close\u2013open mixed multi depot vehicle routing problem considering internal and external fleet of vehicles. Transp Lett 11(2):78\u201392","journal-title":"Transp Lett"},{"issue":"8","key":"898_CR27","first-page":"4782","volume":"34","author":"LM Dalbah","year":"2022","unstructured":"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\u20134795","journal-title":"J King Saud Univ-Comput Inf Sci"},{"issue":"3","key":"898_CR28","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1007\/s42235-022-00303-z","volume":"20","author":"FS Gharehchopogh","year":"2023","unstructured":"Gharehchopogh FS (2023) An improved Harris Hawks optimization algorithm with multi-strategy for community detection in social network. J Bionic Eng 20(3):1175\u20131197","journal-title":"J Bionic Eng"},{"key":"898_CR29","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00500-016-2474-6","volume":"22","author":"D Wang","year":"2018","unstructured":"Wang D, Tan D, Liu L (2018) Particle swarm optimization algorithm: an overview. Soft Comput 22:387\u2013408","journal-title":"Soft Comput"},{"key":"898_CR30","unstructured":"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"},{"key":"898_CR31","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari AA et al (2019) Harris hawks optimization: algorithm and applications. Futur Gener Comput Syst 97:849\u2013872","journal-title":"Futur Gener Comput Syst"},{"issue":"4","key":"898_CR32","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","journal-title":"Oper Res"},{"key":"898_CR33","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1057\/jors.2009.176","volume":"62","author":"T Doyuran","year":"2011","unstructured":"Doyuran T, \u00c7atay B (2011) A robust enhancement to the Clarke-Wright savings algorithm. J Oper Res Soc 62:223\u2013231","journal-title":"J Oper Res Soc"},{"key":"898_CR34","unstructured":"Savings Algorithm (2013) Available from: https:\/\/neo.lcc.uma.es\/vrp\/solution-methods\/heuristics\/savings-algorithms\/"},{"key":"898_CR35","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J-F Cordeau","year":"1998","unstructured":"Cordeau J-F, Gendreau M, Laporte G (1998) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30:105\u2013119","journal-title":"Networks"},{"key":"898_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106711","volume":"213","author":"F MiarNaeimi","year":"2021","unstructured":"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","journal-title":"Knowl-Based Syst"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-023-00898-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-023-00898-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-023-00898-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T05:23:43Z","timestamp":1720675423000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-023-00898-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,26]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["898"],"URL":"https:\/\/doi.org\/10.1007\/s12065-023-00898-0","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,26]]},"assertion":[{"value":"26 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}