{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T17:02:05Z","timestamp":1782320525828,"version":"3.54.5"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Key Project of Ningxia Natural Science Foundation","award":["2022AAC02043"],"award-info":[{"award-number":["2022AAC02043"]}]},{"name":"the National Natural Science Foundation of China under Grant","award":["11961001"],"award-info":[{"award-number":["11961001"]}]},{"name":"the National Natural Science Foundation of China under Grant","award":["61561001"],"award-info":[{"award-number":["61561001"]}]},{"name":"the Construction Project of First-class Subjects in Ningxia Higher Education","award":["NXYLXK2017B09"],"award-info":[{"award-number":["NXYLXK2017B09"]}]},{"name":"the Major Proprietary Funded Project of North Minzu University","award":["ZDZX201901"],"award-info":[{"award-number":["ZDZX201901"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10489-022-03912-7","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T12:06:48Z","timestamp":1658232408000},"page":"7326-7342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["A hybrid ant colony optimization with fireworks algorithm to solve capacitated vehicle routing problem"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2021-2097","authenticated-orcid":false,"given":"Yuelin","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongguang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wanting","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"3912_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53\u201366. https:\/\/doi.org\/10.1109\/4235.585892https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans Evol Comput"},{"key":"3912_CR2","doi-asserted-by":"publisher","unstructured":"Stutzle H, Hoos H (1997) Max-min ant system and local search for the traveling salesman problem. In: Proceedings of 1997 IEEE international conference on evolutionary computation, pp 309\u2013314. https:\/\/doi.org\/10.1109\/ICEC.1997.592327","DOI":"10.1109\/ICEC.1997.592327"},{"key":"3912_CR3","doi-asserted-by":"publisher","first-page":"100977","DOI":"10.1016\/j.swevo.2021.100977","volume":"68","author":"HT Zhao","year":"2022","unstructured":"Zhao HT, Zhang C, Zheng XY, Zhang C, Zhang B (2022) A decomposition-based many-objective ant colony optimization algorithm with adaptive solution construction and selection approaches. Swarm Evol Comput 68:100977. https:\/\/doi.org\/10.1016\/j.swevo.2021.100977https:\/\/doi.org\/10.1016\/j.swevo.2021.100977","journal-title":"Swarm Evol Comput"},{"key":"3912_CR4","doi-asserted-by":"publisher","first-page":"104408","DOI":"10.1016\/j.engappai.2021.104408","volume":"105","author":"N Rojas-Morales","year":"2021","unstructured":"Rojas-Morales N, Riff MC, Neveu B (2021) Learning and focusing strategies to improve aco that solves csp. Eng Appl Artif Intell 105:104408. https:\/\/doi.org\/10.1016\/j.engappai.2021.104408","journal-title":"Eng Appl Artif Intell"},{"key":"3912_CR5","doi-asserted-by":"publisher","first-page":"114021","DOI":"10.1016\/j.eswa.2020.114021","volume":"164","author":"BX Guan","year":"2021","unstructured":"Guan BX, Zhao Y, Li Y (2021) An improved ant colony optimization with an automatic updating mechanism for constraint satisfaction problems. Expert Syst Appl 164:114021. https:\/\/doi.org\/10.1016\/j.eswa.2020.114021","journal-title":"Expert Syst Appl"},{"key":"3912_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ins.2020.06.028","volume":"540","author":"HT Zhao","year":"2020","unstructured":"Zhao HT, Zhang C, Zhang B (2020) A decomposition-based many-objective ant colony optimization algorithm with adaptive reference points. Inf Sci 540:435\u2013448. https:\/\/doi.org\/10.1016\/j.ins.2020.06.028https:\/\/doi.org\/10.1016\/j.ins.2020.06.028","journal-title":"Inf Sci"},{"key":"3912_CR7","doi-asserted-by":"publisher","first-page":"106610","DOI":"10.1016\/j.cie.2020.106610","volume":"147","author":"I Dzalbs","year":"2020","unstructured":"Dzalbs I, Kalganova T (2020) Accelerating supply chains with ant colony optimization across a range of hardware solutions. Comput Ind Eng 147:106610. https:\/\/doi.org\/10.1016\/j.cie.2020.106610","journal-title":"Comput Ind Eng"},{"key":"3912_CR8","doi-asserted-by":"publisher","first-page":"107230","DOI":"10.1016\/j.cie.2021.107230","volume":"156","author":"CW Miao","year":"2021","unstructured":"Miao CW, Chen GZ, Yan CL, Wu YY (2021) Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm. Comput Ind Eng 156:107230. https:\/\/doi.org\/10.1016\/j.cie.2021.107230https:\/\/doi.org\/10.1016\/j.cie.2021.107230","journal-title":"Comput Ind Eng"},{"key":"3912_CR9","doi-asserted-by":"publisher","unstructured":"Wan YT, Zhong YF, Ma AL, Zhang LP (2022) An accurate uav 3-d path planning method for disaster emergency response based on an improved multiobjective swarm intelligence algorithm. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/tcyb.2022.3170580","DOI":"10.1109\/tcyb.2022.3170580"},{"key":"3912_CR10","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.jclepro.2019.03.185","volume":"227","author":"YB Li","year":"2019","unstructured":"Li YB, Soleimani H, Zohal M (2019) An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives. J Clean Prod 227:1161\u20131172. https:\/\/doi.org\/10.1016\/j.jclepro.2019.03.185","journal-title":"J Clean Prod"},{"key":"3912_CR11","doi-asserted-by":"publisher","first-page":"103582","DOI":"10.1016\/j.engappai.2020.103582","volume":"91","author":"XS Xiang","year":"2020","unstructured":"Xiang XS, Qiu JF, Xiao JH, Zhang XY (2020) Demand coverage diversity based ant colony optimization for dynamic vehicle routing problems. Eng Appl Artif Intell 91:103582. https:\/\/doi.org\/10.1016\/j.engappai.2020.103582https:\/\/doi.org\/10.1016\/j.engappai.2020.103582","journal-title":"Eng Appl Artif Intell"},{"key":"3912_CR12","doi-asserted-by":"publisher","first-page":"108036","DOI":"10.1016\/j.cie.2022.108036","volume":"168","author":"YB Dang","year":"2022","unstructured":"Dang YB, Allen TT, Singh M (2022) A heterogeneous vehicle routing problem with common carriers and time regulations: mathematical formulation and a two-color ant colony search. Comput Ind Eng 168:108036. https:\/\/doi.org\/10.1016\/j.cie.2022.108036","journal-title":"Comput Ind Eng"},{"key":"3912_CR13","doi-asserted-by":"publisher","first-page":"101046","DOI":"10.1016\/j.swevo.2022.101046","volume":"70","author":"Y Zhou","year":"2022","unstructured":"Zhou Y, Li WD, Wang X, Qiu YM, Shen WM (2022) Adaptive gradient descent enabled ant colony optimization for routing problems. Swarm Evol Comput 70:101046. https:\/\/doi.org\/10.1016\/j.swevo.2022.101046https:\/\/doi.org\/10.1016\/j.swevo.2022.101046","journal-title":"Swarm Evol Comput"},{"key":"3912_CR14","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ins.2019.03.070","volume":"490","author":"HZ Zhang","year":"2019","unstructured":"Zhang HZ, Zhang QW, Ma L, Zhang ZY, Liu Y (2019) A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inf Sci 490:166\u2013190. https:\/\/doi.org\/10.1016\/j.ins.2019.03.070","journal-title":"Inf Sci"},{"key":"3912_CR15","doi-asserted-by":"publisher","first-page":"113379","DOI":"10.1016\/j.eswa.2020.113379","volume":"157","author":"JC Molina","year":"2020","unstructured":"Molina JC, Salmeron JL, Eguia I (2020) An acs-based memetic algorithm for the heterogeneous vehicle routing problem with time windows. Expert Syst Appl 157:113379. https:\/\/doi.org\/10.1016\/j.eswa.2020.113379https:\/\/doi.org\/10.1016\/j.eswa.2020.113379","journal-title":"Expert Syst Appl"},{"key":"3912_CR16","doi-asserted-by":"publisher","first-page":"100675","DOI":"10.1016\/j.swevo.2020.100675","volume":"55","author":"Y Wang","year":"2020","unstructured":"Wang Y, Wang L, Chen GC, Cai ZQ, Zhou YQ, Xing LN (2020) An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol Comput 55:100675. https:\/\/doi.org\/10.1016\/j.swevo.2020.100675https:\/\/doi.org\/10.1016\/j.swevo.2020.100675","journal-title":"Swarm Evol Comput"},{"key":"3912_CR17","doi-asserted-by":"publisher","first-page":"032067","DOI":"10.1088\/1742-6596\/1802\/3\/032067","volume":"1802","author":"DQ Jiao","year":"2021","unstructured":"Jiao DQ, Liu C, Li ZR, Wang DH (2021) An improved ant colony algorithm for tsp application. J Phys Conf Ser 1802:032067. https:\/\/doi.org\/10.1088\/1742-6596\/1802\/3\/032067","journal-title":"J Phys Conf Ser"},{"key":"3912_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s13177-020-00224-3 10.1007\/s13177-020-00224-3","volume":"19","author":"CY Jiang","year":"2021","unstructured":"Jiang CY, Fu JF, Liu WY (2021) Research on vehicle routing planning based on adaptive ant colony and particle swarm optimization algorithm. Int J Intell Transp Syst Res 19:83\u201391. https:\/\/doi.org\/10.1007\/s13177-020-00224-3https:\/\/doi.org\/10.1007\/s13177-020-00224-3","journal-title":"Int J Intell Transp Syst Res"},{"key":"3912_CR19","doi-asserted-by":"publisher","first-page":"2558","DOI":"10.1002\/spe.2797","volume":"51","author":"C Iwendi","year":"2020","unstructured":"Iwendi C, Maddikunta PKR, Gadekallu TR, Lakshmanna K, Bashir AK, Piran MJ (2020) A metaheuristic optimization approach for energy efficiency in the iot networks. Softw Prac Exper 51:2558\u20132571. https:\/\/doi.org\/10.1002\/spe.2797","journal-title":"Softw Prac Exper"},{"key":"3912_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1155\/2021\/7156420","volume":"19","author":"S Agrawal","year":"2021","unstructured":"Agrawal S, Sarkar S, Alazab M, Maddikunta PKR, Gadekallu TR, Pham QV (2021) Genetic cfl: hyperparameter optimization in clustered federated learning. Comput Intell Neurosci 19:83\u201391. https:\/\/doi.org\/10.1155\/2021\/7156420","journal-title":"Comput Intell Neurosci"},{"key":"3912_CR21","doi-asserted-by":"publisher","first-page":"4015","DOI":"10.1007\/s10489-021-02625-7","volume":"52","author":"SK Sahana","year":"2022","unstructured":"Ankita, Sahana SK (2022) Ba-pso: a balanced pso to solve multi-objective grid scheduling problem. Appl Intell 52:4015\u20134027. https:\/\/doi.org\/10.1007\/s10489-021-02625-7","journal-title":"Appl Intell"},{"key":"3912_CR22","doi-asserted-by":"publisher","first-page":"107085","DOI":"10.1016\/j.asoc.2021.107085","volume":"102","author":"Y Huang","year":"2021","unstructured":"Huang Y, Shen XN, You X (2021) A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem. Appl Soft Comput 102:107085. https:\/\/doi.org\/10.1016\/j.asoc.2021.107085https:\/\/doi.org\/10.1016\/j.asoc.2021.107085","journal-title":"Appl Soft Comput"},{"key":"3912_CR23","doi-asserted-by":"publisher","first-page":"102021","DOI":"10.1016\/j.est.2020.102021","volume":"33","author":"X Zeng","year":"2021","unstructured":"Zeng X, Nazir MS, Khaksar M, Nishihara K, Tao H (2021) A day-ahead economic scheduling of microgrids equipped with plug-in hybrid electric vehicles using modified shuffled frog leaping algorithm. J Energy Storage 33:102021. https:\/\/doi.org\/10.1016\/j.est.2020.102021https:\/\/doi.org\/10.1016\/j.est.2020.102021","journal-title":"J Energy Storage"},{"key":"3912_CR24","doi-asserted-by":"publisher","first-page":"106955","DOI":"10.1016\/j.asoc.2020.106955","volume":"100","author":"SY Xiao","year":"2021","unstructured":"Xiao SY, Wang H, Wang WJ, Huang ZK, Zhou XY, Xu MY (2021) Artificial bee colony algorithm based on adaptive neighborhood search and gaussian perturbation. Appl Soft Comput 100:106955. https:\/\/doi.org\/10.1016\/j.asoc.2020.106955","journal-title":"Appl Soft Comput"},{"key":"3912_CR25","doi-asserted-by":"publisher","first-page":"113675","DOI":"10.1016\/j.eswa.2020.113675","volume":"161","author":"WQ Zou","year":"2020","unstructured":"Zou WQ, Pan QK, Meng T, Gao L, Wang YL (2020) An effective discrete artificial bee colony algorithm for multi-agvs dispatching problem in a matrix manufacturing workshop. Expert Syst Appl 161:113675. https:\/\/doi.org\/10.1016\/j.eswa.2020.113675","journal-title":"Expert Syst Appl"},{"key":"3912_CR26","doi-asserted-by":"publisher","first-page":"109644","DOI":"10.1016\/j.enbuild.2019.109644","volume":"208","author":"YJ Sun","year":"2020","unstructured":"Sun YJ, Ma R, Chen JY, Xu T (2020) Heuristic optimization for grid-interactive net-zero energy building design through the glowworm swarm algorithm. Energy Build 208:109644. https:\/\/doi.org\/10.1016\/j.enbuild.2019.109644","journal-title":"Energy Build"},{"key":"3912_CR27","doi-asserted-by":"publisher","first-page":"100751","DOI":"10.1016\/j.swevo.2020.100751","volume":"60","author":"R Salgotra","year":"2021","unstructured":"Salgotra R, Singh U, Saha S, Gandomi AH (2021) Self adaptive cuckoo search: analysis and experimentation. Swarm Evol Comput 60:100751. https:\/\/doi.org\/10.1016\/j.swevo.2020.100751","journal-title":"Swarm Evol Comput"},{"key":"3912_CR28","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1007\/s00500-020-05308-6","volume":"25","author":"F Zhu","year":"2021","unstructured":"Zhu F, Chen DB, Zou F (2021) A novel hybrid dynamic fireworks algorithm with particle swarm optimization. Soft Comput 25:2371\u20132398. https:\/\/doi.org\/10.1007\/s00500-020-05308-6","journal-title":"Soft Comput"},{"key":"3912_CR29","doi-asserted-by":"publisher","unstructured":"Tan H, Zhu YC (2010) Fireworks algorithm for optimization. Int Conf Swarm Intell:355\u2013364. https:\/\/doi.org\/10.1007\/978-3-642-13495-1_44","DOI":"10.1007\/978-3-642-13495-1_44"},{"key":"3912_CR30","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.asoc.2017.10.046","volume":"62","author":"JZ Li","year":"2018","unstructured":"Li JZ, Tan Y (2018) The bare bones fireworks algorithm: a minimalist global optimizer. Appl Soft Comput 62:454\u2013462. https:\/\/doi.org\/10.1016\/j.asoc.2017.10.046","journal-title":"Appl Soft Comput"},{"key":"3912_CR31","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.knosys.2018.08.016","volume":"163","author":"R Cheng","year":"2019","unstructured":"Cheng R, Bai YP, Zhao Y, Tan XH, Xu T (2019) Improved fireworks algorithm with information exchange for function optimization. Knowl-Based Syst 163:82\u201390. https:\/\/doi.org\/10.1016\/j.knosys.2018.08.016https:\/\/doi.org\/10.1016\/j.knosys.2018.08.016","journal-title":"Knowl-Based Syst"},{"key":"3912_CR32","doi-asserted-by":"publisher","first-page":"126008","DOI":"10.1016\/j.amc.2021.126008","volume":"399","author":"ZX He","year":"2021","unstructured":"He ZX, Pan YH, Wang KJ, Xiao LM, Wang X (2021) Area optimization for mprm logic circuits based on improved multiple disturbances fireworks algorithm. Appl Math Comput 399:126008. https:\/\/doi.org\/10.1016\/j.amc.2021.126008","journal-title":"Appl Math Comput"},{"key":"3912_CR33","doi-asserted-by":"publisher","first-page":"6951","DOI":"10.1007\/s10489-021-02256-y","volume":"51","author":"ZM Qiao","year":"2021","unstructured":"Qiao ZM, Ke LJ, Zhang GW, Wang XQ (2021) Adaptive collaborative optimization of traffic network signal timing based on immune-fireworks algorithm and hierarchical strategy. Appl Intell 51:6951\u20136967. https:\/\/doi.org\/10.1007\/s10489-021-02256-y","journal-title":"Appl Intell"},{"key":"3912_CR34","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1016\/j.apm.2019.10.069","volume":"80","author":"MA Elaziz","year":"2020","unstructured":"Elaziz MA, Li L, Jayasena KPN, Xiong SW (2020) Multiobjective big data optimization based on a hybrid salp swarm algorithm and differential evolution. Appl Math Model 80:929\u2013943. https:\/\/doi.org\/10.1016\/j.apm.2019.10.069","journal-title":"Appl Math Model"},{"key":"3912_CR35","doi-asserted-by":"publisher","first-page":"104252","DOI":"10.1016\/j.engappai.2021.104252","volume":"102","author":"YL Chen","year":"2021","unstructured":"Chen YL, He FZ, Zeng XT, Li HR, Liang YQ (2021) The explosion operation of fireworks algorithm boosts the coral reef optimization for multimodal medical image registration. Eng Appl Artif Intell 102:104252. https:\/\/doi.org\/10.1016\/j.engappai.2021.104252https:\/\/doi.org\/10.1016\/j.engappai.2021.104252","journal-title":"Eng Appl Artif Intell"},{"key":"3912_CR36","doi-asserted-by":"publisher","first-page":"107004","DOI":"10.1016\/j.ast.2021.107004","volume":"118","author":"XY Zhang","year":"2021","unstructured":"Zhang XY, Xia S, Zhang T, Li XZ (2021) Hybrid fwps cooperation algorithm based unmanned aerial vehicle constrained path planning. Aerosp Sci Technol 118:107004. https:\/\/doi.org\/10.1016\/j.ast.2021.107004https:\/\/doi.org\/10.1016\/j.ast.2021.107004","journal-title":"Aerosp Sci Technol"},{"key":"3912_CR37","doi-asserted-by":"publisher","first-page":"100575","DOI":"10.1016\/j.swevo.2019.100575","volume":"51","author":"LJ He","year":"2019","unstructured":"He LJ, Li WF, Zhang Y, Cao YL (2019) A discrete multi-objective fireworks algorithm for flowshop scheduling with sequence-dependent setup times. Swarm Evol Comput 51:100575. https:\/\/doi.org\/10.1016\/j.swevo.2019.100575","journal-title":"Swarm Evol Comput"},{"key":"3912_CR38","doi-asserted-by":"publisher","first-page":"115189","DOI":"10.1016\/j.eswa.2021.115189","volume":"183","author":"XJ Liu","year":"2021","unstructured":"Liu XJ, Qin XL (2021) A neighborhood information utilization fireworks algorithm and its application to traffic flow prediction. Expert Syst Appl 183:115189. https:\/\/doi.org\/10.1016\/j.eswa.2021.115189https:\/\/doi.org\/10.1016\/j.eswa.2021.115189","journal-title":"Expert Syst Appl"},{"key":"3912_CR39","first-page":"1","volume":"495","author":"P Augerat","year":"1995","unstructured":"Augerat P, Belenguer JM, Benavent E, Corberan A, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Rapport de recherche - IMAG 495:1\u201312","journal-title":"Rapport de recherche - IMAG"},{"key":"3912_CR40","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s40092-017-0227-5","volume":"14","author":"JH Santillan","year":"2018","unstructured":"Santillan JH, Tapucar S, Manliguez C, Calag V (2018) Cuckoo search via l\u00e9vy flights for the capacitated vehicle routing problem. J Ind Eng Int 14:293\u2013304. https:\/\/doi.org\/10.1007\/s40092-017-0227-5https:\/\/doi.org\/10.1007\/s40092-017-0227-5","journal-title":"J Ind Eng Int"},{"key":"3912_CR41","doi-asserted-by":"publisher","first-page":"86102","DOI":"10.1109\/ACCESS.2019.2925831","volume":"7","author":"N Lin","year":"2019","unstructured":"Lin N, Shi YJ, Zhang TL, Wang XP (2019) An effective order-aware hybrid genetic algorithm for capacitated vehicle routing problems in internet of things. IEEE Access 7:86102\u201386114. https:\/\/doi.org\/10.1109\/ACCESS.2019.2925831","journal-title":"IEEE Access"},{"key":"3912_CR42","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1504\/IJISE.2019.102471","volume":"33","author":"PP Matthopoulos","year":"2019","unstructured":"Matthopoulos PP, Sofianopoulou S (2019) A firefly algorithm for the heterogeneous fixed fleet vehicle routing problem. Int J Ind Syst Eng 33:204\u2013224. https:\/\/doi.org\/10.1504\/IJISE.2019.102471","journal-title":"Int J Ind Syst Eng"},{"key":"3912_CR43","doi-asserted-by":"publisher","first-page":"105728","DOI":"10.1016\/j.asoc.2019.105728","volume":"84","author":"AM Altabeeb","year":"2019","unstructured":"Altabeeb AM, Mohsen AM, Ghallab A (2019) An improved hybrid firefly algorithm for capacitated vehicle routing problem. Appl Soft Comput 84:105728. https:\/\/doi.org\/10.1016\/j.asoc.2019.105728https:\/\/doi.org\/10.1016\/j.asoc.2019.105728","journal-title":"Appl Soft Comput"},{"key":"3912_CR44","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.eswa.2016.05.023","volume":"61","author":"S Akpinar","year":"2016","unstructured":"Akpinar S (2016) Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Expert Syst Appl 61:28\u201338. https:\/\/doi.org\/10.1016\/j.eswa.2016.05.023","journal-title":"Expert Syst Appl"},{"key":"3912_CR45","doi-asserted-by":"publisher","first-page":"e08029","DOI":"10.1016\/j.heliyon.2021.e08029","volume":"7","author":"A Thammano","year":"2021","unstructured":"Thammano A, Rungwachira P (2021) Hybrid modified ant system with sweep algorithm and path relinking for the capacitated vehicle routing problem. Heliyon 7:e08029. https:\/\/doi.org\/10.1016\/j.heliyon.2021.e08029https:\/\/doi.org\/10.1016\/j.heliyon.2021.e08029","journal-title":"Heliyon"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03912-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03912-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03912-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T04:43:15Z","timestamp":1677472995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03912-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["3912"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03912-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"18 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}