{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:59:20Z","timestamp":1774630760266,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:00:00Z","timestamp":1654905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:00:00Z","timestamp":1654905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["51875466"],"award-info":[{"award-number":["51875466"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52175251"],"award-info":[{"award-number":["52175251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s00500-022-07198-2","type":"journal-article","created":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T08:02:55Z","timestamp":1654934575000},"page":"8745-8756","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A dynamic space reduction ant colony optimization for capacitated vehicle routing problem"],"prefix":"10.1007","volume":"26","author":[{"given":"Jinsi","family":"Cai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8745-320X","authenticated-orcid":false,"given":"Peng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Siqing","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Huachao","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"7198_CR1","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":"7198_CR2","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.105728","journal-title":"Appl Soft Comput"},{"key":"7198_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.endm.2017.03.030","volume":"58","author":"M Amous","year":"2017","unstructured":"Amous M, Toumi S, Jarboui B, Eddaly M (2017) A variable neighborhood search algorithm for the capacitated vehicle routing problem. Electron Notes Discrete Math 58:231\u2013238. https:\/\/doi.org\/10.1016\/j.endm.2017.03.030","journal-title":"Electron Notes Discrete Math"},{"key":"7198_CR4","unstructured":"Augerat (2006) The VRP Web. http:\/\/neo.lcc.uma.es\/radi-aeb\/WebVRP\/"},{"key":"7198_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Program 115:351\u2013385. https:\/\/doi.org\/10.1007\/s10107-007-0178-5","journal-title":"Math Program"},{"issue":"1","key":"7198_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur J Oper Res 218(1):1\u20136. https:\/\/doi.org\/10.1016\/j.ejor.2011.07.037","journal-title":"Eur J Oper Res"},{"key":"7198_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D Costa","year":"1997","unstructured":"Costa D, Hertz A (1997) Ants can colour graphs. J Oper Res Soc 48:295\u2013305. https:\/\/doi.org\/10.1057\/palgrave.jors.2600357","journal-title":"J Oper Res Soc"},{"issue":"1","key":"7198_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391. https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manag Sci"},{"key":"7198_CR9","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms. Ph.D. Thesis, Politecnico di Milano."},{"issue":"1","key":"7198_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybernet Part B Cybernet 26(1):29\u201341. https:\/\/doi.org\/10.1109\/3477.484436","journal-title":"IEEE Trans Syst Man Cybernet Part B Cybernet"},{"key":"7198_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.swevo.2011.10.002","volume":"2","author":"J Euchi","year":"2012","unstructured":"Euchi J, Mraihi R (2012) The urban bus routing problem in the Tunisian case by the hybrid artificial ant colony algorithm. Swarm Evol Comput 2:15\u201324. https:\/\/doi.org\/10.1016\/j.swevo.2011.10.002","journal-title":"Swarm Evol Comput"},{"key":"7198_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10479-005-3971-7","volume":"140","author":"M Gendreau","year":"2005","unstructured":"Gendreau M, Potvin JY (2005) Metaheuristics in combinatorial optimization. Ann Oper Res 140:189\u2013213. https:\/\/doi.org\/10.1007\/s10479-005-3971-7","journal-title":"Ann Oper Res"},{"key":"7198_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8_7","volume-title":"The vehicle routing problem: latest advances and new challenges. Operations research\/computer science interfaces","author":"M Gendreau","year":"2008","unstructured":"Gendreau M, Potvin JY, Br\u00e4umlaysy O, Hasle G, L\u00f8kketangen A (2008) Metaheuristics for the vehicle routing problem and its extensions: a categorized bibliography. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges. Operations research\/computer science interfaces, vol 43. Springer, Boston. https:\/\/doi.org\/10.1007\/978-0-387-77778-8_7"},{"key":"7198_CR14","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.jocs.2017.12.012","volume":"25","author":"R Goel","year":"2018","unstructured":"Goel R, Maini R (2018) A hybrid of ant colony and firefly algorithms (HAFA) for solving vehicle routing problems. J Comput Sci 25:28\u201337. https:\/\/doi.org\/10.1016\/j.jocs.2017.12.012","journal-title":"J Comput Sci"},{"key":"7198_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00170-007-1203-9","volume":"39","author":"R Huang","year":"2008","unstructured":"Huang R, Yang C (2008) Ant colony system for job shop scheduling with time windows. Int J Adv Manuf Technol 39:151\u2013157. https:\/\/doi.org\/10.1007\/s00170-007-1203-9","journal-title":"Int J Adv Manuf Technol"},{"key":"7198_CR16","doi-asserted-by":"publisher","unstructured":"Jangra R, Kait R (2017) Analysis and comparison among ant system; ant colony system and max-min ant system with different parameters setting. In: 2017 3rd international conference on computational intelligence & communication technology (CICT), pp 1\u20134. https:\/\/doi.org\/10.1109\/CIACT.2017.7977376.","DOI":"10.1109\/CIACT.2017.7977376"},{"issue":"1","key":"7198_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.asoc.2009.07.003","volume":"10","author":"A Juan","year":"2010","unstructured":"Juan A, Faulin J, Ruiz R et al (2010) The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem. Appl Soft Comput 10(1):215\u2013224. https:\/\/doi.org\/10.1016\/j.asoc.2009.07.003","journal-title":"Appl Soft Comput"},{"key":"7198_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2012\/726564","volume":"8","author":"Y Kao","year":"2012","unstructured":"Kao Y, Chen M, Huang Y (2012) A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems. Math Probl Eng 8:1\u201317. https:\/\/doi.org\/10.1155\/2012\/726564","journal-title":"Math Probl Eng"},{"key":"7198_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. Complex Comput Comput. https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","journal-title":"Complex Comput Comput"},{"issue":"2","key":"7198_CR20","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1016\/j.eswa.2007.11.060","volume":"36","author":"S Lin","year":"2009","unstructured":"Lin S, Lee Z, Ying K, Lee C (2009) Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Syst Appl 36(2):1505\u20131512. https:\/\/doi.org\/10.1016\/j.eswa.2007.11.060","journal-title":"Expert Syst Appl"},{"key":"7198_CR21","doi-asserted-by":"publisher","first-page":"86102","DOI":"10.1109\/ACCESS.2019.2925831","volume":"7","author":"N Lin","year":"2019","unstructured":"Lin N, Shi Y, Zhang T, Wang X (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":"7198_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.omega.2017.05.002","volume":"76","author":"A Mahdi","year":"2018","unstructured":"Mahdi A, Shokouhi N (2018) Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search. Omega 76:85\u201399. https:\/\/doi.org\/10.1016\/j.omega.2017.05.002","journal-title":"Omega"},{"key":"7198_CR23","doi-asserted-by":"publisher","unstructured":"Melo L, Pereira F, Costa E (2014) Extended experiments with ant colony optimization with heterogeneous ants for large dynamic traveling salesperson problems. In: 2014 14th international conference on computational science and its applications, pp 171\u2013175. https:\/\/doi.org\/10.1109\/ICCSA.2014.39","DOI":"10.1109\/ICCSA.2014.39"},{"key":"7198_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.swevo.2013.05.005","volume":"13","author":"KV Narasimha","year":"2013","unstructured":"Narasimha KV, Kivelevitch E, Sharma B, Kumar M (2013) An ant colony optimization technique for solving min\u2013max multi-depot vehicle routing problem. Swarm Evol Comput 13:63\u201373. https:\/\/doi.org\/10.1016\/j.swevo.2013.05.005","journal-title":"Swarm Evol Comput"},{"key":"7198_CR25","doi-asserted-by":"publisher","unstructured":"Oliveira S, Hussin MS, Roli A, Dorigo M, St\u00fctzle T (2017) Analysis of the population-based ant colony optimization algorithm for the TSP and the QAP. In: 2017 IEEE congress on evolutionary computation (CEC), pp 1734\u20131741. https:\/\/doi.org\/10.1109\/CEC.2017.7969511","DOI":"10.1109\/CEC.2017.7969511"},{"key":"7198_CR26","doi-asserted-by":"publisher","unstructured":"Situ X, Chen W, Gong Y, et al (2017) A parallel Ant Colony System based on region decomposition for Taxi-Passenger Matching. In: 2017 IEEE congress on evolutionary computation (CEC), pp 960\u2013967. https:\/\/doi.org\/10.1109\/CEC.2017.7969412","DOI":"10.1109\/CEC.2017.7969412"},{"issue":"1","key":"7198_CR27","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeo","year":"2011","unstructured":"Szeo WY, Wu Y, Ho SC (2011) An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur J Oper Res 215(1):126\u2013135. https:\/\/doi.org\/10.1016\/j.ejor.2011.06.006","journal-title":"Eur J Oper Res"},{"issue":"11","key":"7198_CR28","doi-asserted-by":"publisher","first-page":"3132","DOI":"10.1109\/TITS.2016.2542264","volume":"17","author":"X Wang","year":"2016","unstructured":"Wang X, Choi T, Liu H, Yue X (2016) Novel ant colony optimization methods for simplifying solution construction in vehicle routing problems. IEEE Trans Intell Transp Syst 17(11):3132\u20133141. https:\/\/doi.org\/10.1109\/TITS.2016.2542264","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"7198_CR29","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ins.2019.03.070","volume":"490","author":"H Zhang","year":"2019","unstructured":"Zhang H, Zhang Q, Ma L, Zhang Z, 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"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07198-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07198-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07198-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T16:27:20Z","timestamp":1660062440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07198-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,11]]},"references-count":29,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["7198"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07198-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,11]]},"assertion":[{"value":"25 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2022","order":2,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}