{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T16:37:53Z","timestamp":1779295073924,"version":"3.51.4"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Gulf University for Science and Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The vehicle routing problem (VRP) is one of the challenging problems in optimization and can be described as combinatorial optimization and NP-hard problem. Researchers have used many artificial intelligence techniques in order to try to solve this problem. Among these techniques, metaheuristic algorithms that can perform random search are the most promising because they can be used to find the right solution in the shortest possible time. Therefore, in this paper, the Harris hawks optimization (HHO) algorithm was used to attempt to solve the VRP. The algorithm was applied to 10 scenarios and the experimental results revealed that the HHO had a strong ability to check for and find the best route as compared to other metaheuristic algorithms, namely, simulated annealing and artificial bee colony optimization. The comparison was based on three criteria: minimum objective function obtained, minimum number of iterations required and satisfaction of capacity constraints. In all scenarios, the HHO showed clear superiority over the other methods.<\/jats:p>","DOI":"10.1186\/s40537-022-00593-4","type":"journal-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T01:02:58Z","timestamp":1650848578000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Vehicle routing problems based on Harris Hawks optimization"],"prefix":"10.1186","volume":"9","author":[{"given":"Mohammed","family":"Alweshah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0021-2364","authenticated-orcid":false,"given":"Muder","family":"Almiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nedaa","family":"Almansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saleh","family":"Al Khalaileh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamza","family":"Aldabbas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Waleed","family":"Alomoush","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Almahdi","family":"Alshareef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"593_CR1","unstructured":"Nazari M, Oroojlooy A, Snyder L, Tak\u00e1c M. Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems, 2018, pp. 9839\u20139849."},{"key":"593_CR2","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers K, Ramaekers K, Van Nieuwenhuyse I. The vehicle routing problem: state of the art classification and review. Comput Ind Eng. 2016;99:300\u201313.","journal-title":"Comput Ind Eng"},{"key":"593_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jocs.2017.04.003","volume":"21","author":"MA Mohammed","year":"2017","unstructured":"Mohammed MA, AbdGhani MK, Hamed RI, Mostafa SA, Ahmad MS, Ibrahim DA. Solving vehicle routing problem by using improved genetic algorithm for optimal solution. J Comput Sci. 2017;21:255\u201362.","journal-title":"J Comput Sci"},{"key":"593_CR4","first-page":"201","volume":"14","author":"P Zhao","year":"2019","unstructured":"Zhao P, Luo W, Han X. Time-dependent and bi-objective vehicle routing problem with time windows. Adv Prod Eng Manage. 2019;14:201\u201312.","journal-title":"Adv Prod Eng Manage"},{"key":"593_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF02941184","volume":"7","author":"Y Marinakis","year":"2007","unstructured":"Marinakis Y, Migdalas A. Annotated bibliography in vehicle routing. Oper Res Int J. 2007;7:27\u201346.","journal-title":"Oper Res Int J"},{"key":"593_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.4018\/IJAMC.2016100102","volume":"7","author":"M Berghida","year":"2016","unstructured":"Berghida M, Boukra A. Quantum inspired algorithm for a VRP with heterogeneous fleet mixed backhauls and time windows. Int J Appl Metaheuristic Comput. 2016;7:18\u201338.","journal-title":"Int J Appl Metaheuristic Comput"},{"key":"593_CR7","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A. The vehicle routing problem: a taxonomic review. Comput Ind Eng. 2009;57:1472\u201383.","journal-title":"Comput Ind Eng"},{"key":"593_CR8","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D. The vehicle routing problem. SIAM, 2002.","DOI":"10.1137\/1.9780898718515"},{"key":"593_CR9","unstructured":"Bellman RP, Udeanu SR, Hammer PL, Fouquet ET. M\u00e9thodes bool\u00e9ennes en recherche op\u00e9rationnelle: Dunod, 1970."},{"key":"593_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0010-4485(81)90207-4","volume":"13","author":"D Himmelblau","year":"1981","unstructured":"Himmelblau D. Some practical experiences in applying nonlinear programming to CAD. Comput Aided Des. 1981;13:317\u201326.","journal-title":"Comput Aided Des"},{"key":"593_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1051\/ro\/197610V100551","volume":"10","author":"N Christofides","year":"1976","unstructured":"Christofides N. The vehicle routing problem, Revue fran\u00e7aise d\u2019automatique, informatique, recherche op\u00e9rationnelle. Recherche op\u00e9rationnelle. 1976;10:55\u201370.","journal-title":"Recherche op\u00e9rationnelle"},{"key":"593_CR12","unstructured":"]12[ Beale E, Small R. Mixed integer programming by a branch and bound technique. In: Proceedings of the IFIP Congress, 1965, pp. 450\u2013451."},{"key":"593_CR13","first-page":"99","volume":"6","author":"HY Zeng","year":"2019","unstructured":"Zeng HY. Improved particle swarm optimization based on Tabu search for VRP. J Appl Sci Eng Innov. 2019;6:99\u2013103.","journal-title":"J Appl Sci Eng Innov"},{"key":"593_CR14","first-page":"89","volume-title":"Operational research in the digital Era\u2014ICT challenges","author":"SP Gayialis","year":"2009","unstructured":"Gayialis SP, Konstantakopoulos GD, Tatsiopoulos IP. Vehicle routing problem for urban freight transportation: a review of the recent literature. In: Operational research in the digital Era\u2014ICT challenges. Berlin: Springer; 2009. p. 89\u2013104."},{"key":"593_CR15","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.jclepro.2017.10.124","volume":"172","author":"H Soleimani","year":"2018","unstructured":"Soleimani H, Chaharlang Y, Ghaderi H. Collection and distribution of returnedremanufactured products in a vehicle routing problem with pickup and delivery considering sustainable and green criteria. J Clean Prod. 2018;172:960\u201370.","journal-title":"J Clean Prod"},{"key":"593_CR16","doi-asserted-by":"crossref","unstructured":"Iswari T, Asih AMS. Comparing genetic algorithm and particle swarm optimization for solving capacitated vehicle routing problem. In: IOP Conference Series: Materials Science and Engineering, 2018, p. 012004.","DOI":"10.1088\/1757-899X\/337\/1\/012004"},{"key":"593_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1504\/IJBIC.2018.091704","volume":"11","author":"T Saeheaw","year":"2018","unstructured":"Saeheaw T, Charoenchai N. A comparative study among different parallel hybrid artificial intelligent approaches to solve the capacitated vehicle routing problem. Int J Bio-Inspired Comput. 2018;11:171\u201391.","journal-title":"Int J Bio-Inspired Comput"},{"key":"593_CR18","unstructured":"]18[ Raeesi R. Mathematical models and solution algorithms for the vehicle routing problem with environmental considerations. Lancaster University, 2019."},{"key":"593_CR19","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-319-91086-4_17","volume-title":"Handbook of metaheuristics","author":"T St\u00fctzle","year":"2019","unstructured":"St\u00fctzle T, L\u00f3pez-Ib\u00e1\u00f1ez M. Automated design of metaheuristic algorithms. In: Handbook of metaheuristics. Berlin: Springer; 2019. p. 541\u201379."},{"key":"593_CR20","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ins.2019.08.017","volume":"507","author":"J Pei","year":"2020","unstructured":"Pei J, Mladenovi\u0107 N, Uro\u0161evi\u0107 D, Brimberg J, Liu X. Solving the traveling repairman problem with profits: a Novel variable neighborhood search approach. Inf Sci. 2020;507:108\u201323.","journal-title":"Inf Sci"},{"key":"593_CR21","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1002\/net.21876","volume":"73","author":"P Matl","year":"2019","unstructured":"Matl P, Hartl RF, Vidal T. Leveraging single-objective heuristics to solve bi-objective problems: Heuristic box splitting and its application to vehicle routing. Networks. 2019;73:382\u2013400.","journal-title":"Networks"},{"key":"593_CR22","unstructured":"Khabou A. Transportation optimization for the collection of end-of-life vehicles. \u00c9cole de technologie sup\u00e9rieure, 2019."},{"key":"593_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41604-019-00010-9","volume":"2","author":"J Rasku","year":"2019","unstructured":"Rasku J, Musliu N, K\u00e4rkk\u00e4inen T. On automatic algorithm configuration of vehicle routing problem solvers. J Vehicle Routing Alg. 2019;2:1\u201322.","journal-title":"J Vehicle Routing Alg"},{"key":"593_CR24","doi-asserted-by":"publisher","first-page":"323","DOI":"10.32890\/jict2018.17.2.7","volume":"17","author":"D Albashish","year":"2018","unstructured":"Albashish D, Sahran S, Abdullah A, Adam A, Alweshah M. A hierarchical classifier for multiclass prostate histopathology image Gleason grading. J Inform Commun Technol. 2018;17:323\u201346.","journal-title":"J Inform Commun Technol"},{"key":"593_CR25","unstructured":"Alweshah M, Qadoura MA, Hammouri AI, Azmi MS, AlKhalaileh S. Flower pollination algorithm for solving classification problems. Int J Adv Soft Comput Appl. 2020;12."},{"key":"593_CR26","doi-asserted-by":"crossref","unstructured":"Alweshah M, Ramadan E, Ryalat MH, Almi\u2019ani M, Hammouri AI. Water evaporation algorithm with probabilistic neural network for solving classification problems. Jordanian J Comput Inform Technol (JJCIT). 2020;6.","DOI":"10.5455\/jjcit.71-1566466063"},{"key":"593_CR27","doi-asserted-by":"crossref","unstructured":"Alweshah M, Rababa L, Ryalat MH, Al Momani A, Ababneh MF. African buffalo algorithm: Training the probabilistic neural network to solve classification problems. J King Saud Univ-Comput Inform Sci. 2020.","DOI":"10.1007\/s10586-019-03038-5"},{"key":"593_CR28","doi-asserted-by":"publisher","first-page":"5679","DOI":"10.1007\/s00521-018-3402-8","volume":"31","author":"M Alweshah","year":"2019","unstructured":"Alweshah M. Construction biogeography-based optimization algorithm for solving classification problems. Neural Comput Appl. 2019;31:5679\u201388.","journal-title":"Neural Comput Appl"},{"key":"593_CR29","doi-asserted-by":"publisher","first-page":"107629","DOI":"10.1016\/j.knosys.2021.107629","volume":"235","author":"M Alweshah","year":"2022","unstructured":"Alweshah M, Alkhalaileh S, Al-Betar MA, Bakar AA. Coronavirus herd immunity optimizer with greedy crossover for feature selection in medical diagnosis. Knowl-Based Syst. 2022;235:107629.","journal-title":"Knowl-Based Syst"},{"key":"593_CR30","doi-asserted-by":"crossref","unstructured":"Alweshah M, Alkhalaileh S, Albashish D, Mafarja M, Bsoul Q, Dorgham O. A hybrid mine blast algorithm for feature selection problems. Soft Comput. 2020; 1\u201318.","DOI":"10.1007\/s00500-020-05164-4"},{"key":"593_CR31","doi-asserted-by":"crossref","unstructured":"Alweshah M, Al Khalaileh S, Gupta BB, Almomani A, Hammouri AI, Al-Betar MA. The monarch butterfly optimization algorithm for solving feature selection problems. Neural Comput Appl. 2020; 1\u201315.","DOI":"10.1007\/s00521-020-05210-0"},{"key":"593_CR32","first-page":"951","volume":"23","author":"V Tongur","year":"2020","unstructured":"Tongur V, Hacibeyoglu M, Ulker E. Solving a big-scaled hospital facility layout problem with meta-heuristics algorithms. Eng Sci Technol Int J. 2020;23:951\u20139.","journal-title":"Eng Sci Technol Int J"},{"key":"593_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14419\/ijsw.v7i1.29497","volume":"7","author":"SM Almufti","year":"2019","unstructured":"Almufti SM. Historical survey on metaheuristics algorithms. Int J Sci World. 2019;7:1.","journal-title":"Int J Sci World"},{"key":"593_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-11593-7","volume-title":"Metaheuristics algorithms in power systems","author":"E Cuevas","year":"2019","unstructured":"Cuevas E, Espejo EB, Enr\u00edquez AC. Metaheuristics algorithms in power systems, vol. 822. Berlin: Springer; 2019."},{"key":"593_CR35","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cor.2019.06.009","volume":"111","author":"H \u00d6ztop","year":"2019","unstructured":"\u00d6ztop H, Tasgetiren MF, Eliiyi DT, Pan Q-K. Metaheuristic algorithms for the hybrid flowshop scheduling problem. Comput Oper Res. 2019;111:177\u201396.","journal-title":"Comput Oper Res"},{"key":"593_CR36","doi-asserted-by":"crossref","unstructured":"Almomani A, Alweshah M, Al S. Metaheuristic algorithms-based feature selection approach for intrusion detection. In: machine learning for computer and cyber security: principle, algorithms, and practices. 2019; p. 184.","DOI":"10.1201\/9780429504044-8"},{"key":"593_CR37","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-662-45049-9_59","volume-title":"Bio-inspired computing theories and applications","author":"K Shao","year":"2014","unstructured":"Shao K, Zhou K, Qiu J, Zhao J. ABC algorithm for VRP. In: Bio-inspired computing theories and applications. Berlin: Springer; 2014. p. 370\u20133."},{"key":"593_CR38","doi-asserted-by":"crossref","unstructured":"He Y, Wen J, Huang M. Study on emergency relief VRP based on clustering and PSO. In: 2015 11th International Conference on Computational Intelligence and Security (CIS), 2015, pp. 43\u201347.","DOI":"10.1109\/CIS.2015.19"},{"key":"593_CR39","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-1-4471-2321-7_43","volume-title":"Industrial engineering: innovative networks","author":"FJ Diego","year":"2012","unstructured":"Diego FJ, G\u00f3mez EM, Ortega-Mier M, Garc\u00eda-S\u00e1nchez \u00c1. Parallel CUDA architecture for solving de VRP with ACO. In: Industrial engineering: innovative networks. Berlin: Springer; 2012. p. 385\u201393."},{"key":"593_CR40","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ins.2015.07.009","volume":"325","author":"ET Yassen","year":"2015","unstructured":"Yassen ET, Ayob M, Nazri MZA, Sabar NR. Meta-harmony search algorithm for the vehicle routing problem with time windows. Inf Sci. 2015;325:140\u201358.","journal-title":"Inf Sci"},{"key":"593_CR41","unstructured":"Abedinzadeh S, Ghoroghi A, Erfanian HR. Application of hybrid GA-SA heuristic for green location routing problem with simultaneous pickup and delivery."},{"key":"593_CR42","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-1-4615-5755-5_2","volume-title":"Fleet management and logistics","author":"BL Golden","year":"1998","unstructured":"Golden BL, Wasil EA, Kelly JP, Chao I-M. The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Fleet management and logistics. Berlin: Springer; 1998. p. 33\u201356."},{"key":"593_CR43","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O, Gendreau M. Vehicle routing problem with time windows, Part II: Metaheuristics. Transp Sci. 2005;39:119\u201339.","journal-title":"Transp Sci"},{"key":"593_CR44","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0305-0548(99)00101-X","volume":"28","author":"A Van Breedam","year":"2001","unstructured":"Van Breedam A. Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput Oper Res. 2001;28:289\u2013315.","journal-title":"Comput Oper Res"},{"key":"593_CR45","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10852-005-9033-y","volume":"5","author":"L Bianchi","year":"2006","unstructured":"Bianchi L, Birattari M, Chiarandini M, Manfrin M, Mastrolilli M, Paquete L, Rossi-Doria O, Schiavinotto T. Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J Mathe Model Alg. 2006;5:91\u2013110.","journal-title":"J Mathe Model Alg"},{"key":"593_CR46","doi-asserted-by":"publisher","first-page":"106561","DOI":"10.1016\/j.asoc.2020.106561","volume":"95","author":"M-X Song","year":"2020","unstructured":"Song M-X, Li J-Q, Han Y-Q, Han Y-Y, Liu L-L, Sun Q. \u201cMetaheuristics for solving the vehicle routing problem with the time windows and energy consumption in cold chain logistics. Appl Soft Comput. 2020;95:106561.","journal-title":"Appl Soft Comput"},{"key":"593_CR47","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-981-13-0761-4_52","volume-title":"Harmony search and nature inspired optimization algorithms","author":"A Dixit","year":"2019","unstructured":"Dixit A, Mishra A, Shukla A. Vehicle routing problem with time windows using metaheuristic algorithms: a survey. In: Harmony search and nature inspired optimization algorithms. Berlin: Springer; 2019. p. 539\u201346."},{"key":"593_CR48","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.eswa.2018.10.036","volume":"118","author":"AE Gutierrez-Rodr\u00edguez","year":"2019","unstructured":"Gutierrez-Rodr\u00edguez AE, Conant-Pablos SE, Ortiz-Bayliss JC, Terashima-Mar\u00edn H. Selecting meta-heuristics for solving vehicle routing problems with time windows via metalearning. Expert Syst Appl. 2019;118:470\u201381.","journal-title":"Expert Syst Appl"},{"key":"593_CR49","doi-asserted-by":"publisher","first-page":"106242","DOI":"10.1016\/j.cie.2019.106242","volume":"140","author":"R Elshaer","year":"2020","unstructured":"Elshaer R, Awad H. A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Comput Indus Eng. 2020;140:106242.","journal-title":"Comput Indus Eng."},{"key":"593_CR50","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, Mirjalili S, Faris H, Aljarah I, Mafarja M, Chen H. Harris hawks optimization: algorithm and applications. Futur Gener Comput Syst. 2019;97:849\u201372.","journal-title":"Futur Gener Comput Syst"},{"key":"593_CR51","doi-asserted-by":"publisher","first-page":"744","DOI":"10.3139\/120.111379","volume":"61","author":"BS Y\u0131ld\u0131z","year":"2019","unstructured":"Y\u0131ld\u0131z BS, Y\u0131ld\u0131z AR. The Harris hawks optimization algorithm, salp swarm algorithm, grasshopper optimization algorithm and dragonfly algorithm for structural design optimization of vehicle components. Materials Testing. 2019;61:744\u20138.","journal-title":"Materials Testing"},{"key":"593_CR52","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00366-019-00828-8","volume":"37","author":"H Moayedi","year":"2021","unstructured":"Moayedi H, Osouli A, Nguyen H, Rashid ASA. A novel Harris hawks\u2019 optimization and k-fold cross-validation predicting slope stability. Eng Comput. 2021;37:369\u201379.","journal-title":"Eng Comput"},{"key":"593_CR53","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.future.2020.04.008","volume":"111","author":"H Chen","year":"2020","unstructured":"Chen H, Heidari AA, Chen H, Wang M, Pan Z, Gandomi AH. Multi-population differential evolution-assisted Harris hawks optimization: framework and case studies. Futur Gener Comput Syst. 2020;111:175\u201398.","journal-title":"Futur Gener Comput Syst"},{"key":"593_CR54","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"Szeto WY, Wu Y, Ho SC. An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur J Oper Res. 2011;215:126\u201335.","journal-title":"Eur J Oper Res"},{"key":"593_CR55","doi-asserted-by":"crossref","unstructured":"Wang Y, Wang L, Chen G, Cai Z, Zhou Y, Xing L. An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol Comput. 2020;100675.","DOI":"10.1016\/j.swevo.2020.100675"},{"key":"593_CR56","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1080\/0952813X.2019.1652356","volume":"32","author":"B Rabbouch","year":"2020","unstructured":"Rabbouch B, Sa\u00e2daoui F, Mraihi R. Empirical-type simulated annealing for solving the capacitated vehicle routing problem. J Exp Theor Artif Intell. 2020;32:437\u201352.","journal-title":"J Exp Theor Artif Intell"},{"key":"593_CR57","first-page":"12171235","volume":"28","author":"I Ilhan","year":"2020","unstructured":"Ilhan I. A population based simulated annealing algorithm for capacitated vehicle routing problem. Turk J Electr Eng Comput Sci. 2020;28:12171235.","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"593_CR58","doi-asserted-by":"crossref","unstructured":"Stodola P. Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem. Nat Comput. 2020; 1\u201313.","DOI":"10.1155\/2020\/8839526"},{"key":"593_CR59","first-page":"1","volume":"3","author":"AA Muazu","year":"2020","unstructured":"Muazu AA, Nura A. Efficient assignment algorithms for multi depot vehicle routing problem using genetic algorithm. Ilorin J Comput Sci Inform Technol. 2020;3:1\u201310.","journal-title":"Ilorin J Comput Sci Inform Technol"},{"key":"593_CR60","doi-asserted-by":"crossref","unstructured":"Sethanan K, Jamrus T. Hybrid differential evolution algorithm and genetic operator for multi-trip vehicle routing problem with backhauls and heterogeneous fleet in the beverage logistics industry. Comput Indus Eng. 2020;106571.","DOI":"10.1016\/j.cie.2020.106571"},{"key":"593_CR61","doi-asserted-by":"crossref","unstructured":"Wang Q, Peng S, Liu S. Optimization of electric vehicle routing problem using tabu search. In: 2020 Chinese Control And Decision Conference (CCDC), 2020, pp. 2220\u20132224.","DOI":"10.1109\/CCDC49329.2020.9164769"},{"key":"593_CR62","doi-asserted-by":"publisher","first-page":"15","DOI":"10.12928\/ijio.v1i1.1421","volume":"1","author":"M Akbar","year":"2020","unstructured":"Akbar M, Aurachmana R. Hybrid genetic\u2013tabu search algorithm to optimize the route for capacitated vehicle routing problem with time window. Int J Ind Optim. 2020;1:15.","journal-title":"Int J Ind Optim"},{"key":"593_CR63","doi-asserted-by":"publisher","first-page":"118778","DOI":"10.1016\/j.jclepro.2019.118778","volume":"244","author":"H Chen","year":"2020","unstructured":"Chen H, Jiao S, Wang M, Heidari AA, Zhao X. Parameters identification of photovoltaic cells and modules using diversification-enriched Harris hawks optimization with chaotic drifts. J Cleaner Product. 2020;244:118778.","journal-title":"J Cleaner Product"},{"key":"593_CR64","doi-asserted-by":"crossref","unstructured":"Chen H, Heidari AA, Chen H, Wang M, Pan Z, Gandomi AH. Multi-population differential evolution-assisted Harris hawks optimization: framework and case studies. Future Gen Comput Syst. 2020.","DOI":"10.1016\/j.future.2020.04.008"},{"key":"593_CR65","doi-asserted-by":"publisher","first-page":"3590","DOI":"10.3390\/s19163590","volume":"19","author":"DT Bui","year":"2019","unstructured":"Bui DT, Moayedi H, Kalantar B, Osouli A, Pradhan B, Nguyen H, Rashid ASA. A novel swarm intelligence\u2014Harris hawks optimization for spatial assessment of landslide susceptibility. Sensors. 2019;19:3590.","journal-title":"Sensors"},{"key":"593_CR66","doi-asserted-by":"publisher","first-page":"251","DOI":"10.3139\/120.111478","volume":"62","author":"E Kurtulu\u015f","year":"2020","unstructured":"Kurtulu\u015f E, Y\u0131ld\u0131z AR, Sait SM, Bureerat S. A novel hybrid Harris hawks-simulated annealing algorithm and RBF-based metamodel for design optimization of highway guardrails. Materials Testing. 2020;62:251\u201360.","journal-title":"Materials Testing"},{"key":"593_CR67","doi-asserted-by":"crossref","unstructured":"Abbasi A, Firouzi B, Sendur P. On the application of Harris hawks optimization (HHO) algorithm to the design of microchannel heat sinks. Eng Comput. 2019;1\u201320.","DOI":"10.1007\/s00366-019-00892-0"},{"key":"593_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10515-021-00306-w","volume":"29","author":"K Thirugnanasambandam","year":"2022","unstructured":"Thirugnanasambandam K, Rajeswari M, Bhattacharyya D, Kim J-Y. Directed Artificial Bee Colony algorithm with revamped search strategy to solve global numerical optimization problems. Autom Softw Eng. 2022;29:1\u201331.","journal-title":"Autom Softw Eng"},{"key":"593_CR69","first-page":"187","volume-title":"Advances in smart vehicular technology transportation communication and applications","author":"X Zhang","year":"2020","unstructured":"Zhang X, Tang L, Chu S-C, Weng S, Pan J-S. Hybrid optimization algorithm based on QUATRE and ABC algorithms. In: Advances in smart vehicular technology transportation communication and applications. Berlin: Springer; 2020. p. 187\u201397."},{"key":"593_CR70","doi-asserted-by":"publisher","first-page":"23","DOI":"10.20965\/jaciii.2022.p0023","volume":"26","author":"D Jia","year":"2022","unstructured":"Jia D. A culture-based artificial bee colony algorithm for optimization in dynamic environments. J Adv Comput Intell Intell Informat. 2022;26:23\u20137.","journal-title":"J Adv Comput Intell Intell Informat"},{"key":"593_CR71","doi-asserted-by":"publisher","first-page":"113760","DOI":"10.1016\/j.cam.2021.113760","volume":"400","author":"Q Gao","year":"2022","unstructured":"Gao Q, Xu H, Li A. The analysis of commodity demand predication in supply chain network based on particle swarm optimization algorithm. J Comput Appl Math. 2022;400:113760.","journal-title":"J Comput Appl Math"},{"key":"593_CR72","unstructured":"Peters E, Shyamsundar P, Li AC, Perdue G. Noise-aware qubit assignment on NISQ hardware using simulated annealing and Loschmidt Echoes. arXiv preprint arXiv:2201.00445, 2022."}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-022-00593-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-022-00593-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-022-00593-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T02:36:16Z","timestamp":1675391776000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-022-00593-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":72,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["593"],"URL":"https:\/\/doi.org\/10.1186\/s40537-022-00593-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-962688\/v1","asserted-by":"object"}]},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"14 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We confirm that any aspect of the work covered in this manuscript that has involved human patients has been conducted with the ethical approval of all relevant bodies and that such approvals are acknowledged within the manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"We give my consent for the publication of identifiable details, which can include photograph(s) and\/or videos and\/or case history and\/or details within the text (\u201cMaterial\u201d) to be published in the above Journal and Article. I confirm that I have seen and been given the opportunity to read both the Material and the Article to be published by Journal of big data.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The author(s) declare(s) that they have no competing interests. We wish to confirm that there are no known conflicts of interest associated with this publication.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"42"}}