{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:10:57Z","timestamp":1777129857108,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72074198"],"award-info":[{"award-number":["72074198"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71874165"],"award-info":[{"award-number":["71874165"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71573237"],"award-info":[{"award-number":["71573237"]}],"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":[[2023,11]]},"DOI":"10.1007\/s00500-023-08811-8","type":"journal-article","created":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T15:01:23Z","timestamp":1688914883000},"page":"15699-15717","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A mathematical method for solving multi-depot vehicle routing problem"],"prefix":"10.1007","volume":"27","author":[{"given":"Fang","family":"wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haixiang","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenwen","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jundong","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengli","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,9]]},"reference":[{"key":"8811_CR1","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1016\/j.jclepro.2019.04.250","volume":"230","author":"H Asefi","year":"2019","unstructured":"Asefi H, Shahparvari S, Chhetri P, Lim S (2019) Variable fleet size and mix VRP with fleet heterogeneity in integrated solid waste management. J Clean Prod 230:1376\u20131395","journal-title":"J Clean Prod"},{"issue":"2","key":"8811_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.5267\/j.dsl.2022.11.004","volume":"12","author":"J Azuero-Ortiz","year":"2023","unstructured":"Azuero-Ortiz J, Gaviria-Hern\u00e1ndez M, Jim\u00e9nez-Rodr\u00edguez V, Vale-Santiago E, Gonz\u00e1lez-Neira E (2023) Design of a hybridization between Tabu search and PAES algorithms to solve a multi-depot, multi-product green vehicle routing problem. Decis Sci Lett 12(2):441\u2013456","journal-title":"Decis Sci Lett"},{"key":"8811_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.endm.2018.03.022","volume":"66","author":"SN Bezerra","year":"2018","unstructured":"Bezerra SN, Souza SRD, Souza MJF (2018) A GVNS algorithm for solving the multi-depot vehicle routing problem. Electron Notes Discrete Math 66:167\u2013174","journal-title":"Electron Notes Discrete Math"},{"key":"8811_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109869","volume":"132","author":"Q Bo","year":"2023","unstructured":"Bo Q, Cheng W, Khishe M (2023) Evolving chimp optimization algorithm by weighted opposition-based technique and greedy search for multimodal engineering problems. Appl Soft Comput 132:109869","journal-title":"Appl Soft Comput"},{"issue":"5","key":"8811_CR5","first-page":"70","volume":"23","author":"W Cai","year":"2014","unstructured":"Cai W, Wang Y, Yu B (2014) Improved ant colony algorithm for period vehicle routing problem. Oper Res Manag Sci 23(5):70\u201377","journal-title":"Oper Res Manag Sci"},{"issue":"1","key":"8811_CR6","doi-asserted-by":"publisher","first-page":"124","DOI":"10.3390\/sym15010124","volume":"15","author":"CM Chen","year":"2023","unstructured":"Chen CM, Lv S, Ning J, Wu JMT (2023) A genetic algorithm for the waitable time-varying multi-depot green vehicle routing problem. Symmetry 15(1):124","journal-title":"Symmetry"},{"key":"8811_CR7","doi-asserted-by":"crossref","unstructured":"Dokeroglu T, & Ozdemir YS (2023) A new robust Harris Hawk optimization algorithm for large quadratic assignment problems. Neural Comput Appl, 1\u201314.","DOI":"10.1007\/s00521-023-08387-2"},{"issue":"1","key":"8811_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s10668-021-02066-9","volume":"25","author":"X Ge","year":"2023","unstructured":"Ge X, Jin Y, Zhang L (2023) Genetic-based algorithms for cash-in-transit multi depot vehicle routing problems: economic and environmental optimization. Environ Dev Sustain 25(1):557\u2013586","journal-title":"Environ Dev Sustain"},{"key":"8811_CR9","doi-asserted-by":"crossref","unstructured":"Gu, Z., Zhu, Y., Wang, Y., Du, X., Guizani, M., & Tian, Z. (2022). Applying artificial bee colony algorithm to the multidepot vehicle routing problem.\u00a0Software: Practice and Experience,\u00a052(3), 756\u2013771.","DOI":"10.1002\/spe.2838"},{"issue":"1","key":"8811_CR10","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1080\/21680566.2023.2185498","volume":"11","author":"H Hu","year":"2023","unstructured":"Hu H, Li X, Ha M, Wang X, Shang C, Shen Q (2023) Multi-depot vehicle routing programming for hazmat transportation with weight variation risk. Transportmetrica B Trans Dyn 11(1):1136\u20131160","journal-title":"Transportmetrica B Trans Dyn"},{"key":"8811_CR11","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ins.2017.01.020","volume":"391","author":"ND Jana","year":"2017","unstructured":"Jana ND, Sil J, Das S (2017) Selection of appropriate metaheuristic algorithms for protein structure prediction in AB off-lattice model: a perspective from fitness landscape analysis. Inf Sci 391:28\u201364","journal-title":"Inf Sci"},{"key":"8811_CR12","doi-asserted-by":"crossref","unstructured":"Kim J, Manna A, Roy A, & Moon I (2023) Clustered vehicle routing problem for waste collection with smart operational management approaches.\u00a0Int Transact Oper Res.","DOI":"10.1111\/itor.13282"},{"key":"8811_CR13","unstructured":"Kronmueller M, Fielbaum A, & Alonso-Mora J (2023) Pooled grocery delivery with tight deadlines from multiple depots.\u00a0arXiv preprint arXiv:2303.11804."},{"issue":"2","key":"8811_CR14","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.ejor.2022.11.023","volume":"308","author":"C Lavigne","year":"2023","unstructured":"Lavigne C, Inghels D, Dullaert W, Dewil R (2023) A memetic algorithm for solving rich waste collection problems. Eur J Oper Res 308(2):581\u2013604","journal-title":"Eur J Oper Res"},{"key":"8811_CR15","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.jclepro.2019.03.185","volume":"227","author":"Y Li","year":"2019","unstructured":"Li Y, 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","journal-title":"J Clean Prod"},{"issue":"14","key":"8811_CR16","first-page":"232","volume":"53","author":"H Ling","year":"2017","unstructured":"Ling H, Gu J (2017) Study on multi-depot open vehicle routing problem with soft time windows. Comput Eng Appl 53(14):232\u2013239","journal-title":"Comput Eng Appl"},{"key":"8811_CR17","doi-asserted-by":"crossref","unstructured":"Londo\u00f1oa AA, Gonzaleza WG, Giraldob ODM, & Willmer J (2023) A new matheheuristic approach based on Chu-Beasley genetic approach for the multi-depot electric vehicle routing problem. Int J Ind Eng Comput, 14 (2023).","DOI":"10.5267\/j.ijiec.2023.3.002"},{"issue":"7","key":"8811_CR18","first-page":"251","volume":"50","author":"HB Luo","year":"2014","unstructured":"Luo HB (2014) Study on multi-depots and multi-vehicles vehicle scheduling problem based on improved particle swarm optimization. Comput Eng Appl 50(7):251\u2013253","journal-title":"Comput Eng Appl"},{"key":"8811_CR19","first-page":"107","volume":"2","author":"Y Ma","year":"2014","unstructured":"Ma Y, Yao T, Zhang F (2014) Multi-depot multi-type vehicle scheduling problem and its genitic algorithm. Math Pract Theory 2:107\u2013114","journal-title":"Math Pract Theory"},{"key":"8811_CR20","doi-asserted-by":"crossref","unstructured":"Manullang MJC, Priandana K, & Hardhienata MKD (2023) Optimum trajectory of multi-UAV for fertilization of paddy fields using ant colony optimization (ACO) and 2-opt algorithms. In\u00a0AIP conference proceedings\u00a0(Vol. 2482, No. 1, p. 020004). AIP Publishing LLC.","DOI":"10.1063\/5.0110697"},{"key":"8811_CR21","doi-asserted-by":"crossref","unstructured":"Nia AR, Awasthi A, & Bhuiyan N (2023). Integrate exergy costs and carbon reduction policy in order to optimize the sustainability development of coal supply chains in uncertain conditions.\u00a0Int J Prod Econ, 108772.","DOI":"10.1016\/j.ijpe.2023.108772"},{"key":"8811_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101228","volume":"77","author":"T Ren","year":"2023","unstructured":"Ren T, Luo T, Jia B, Yang B, Wang L, Xing L (2023) Improved ant colony optimization for the vehicle routing problem with split pickup and split delivery. Swarm Evol Comput 77:101228","journal-title":"Swarm Evol Comput"},{"key":"8811_CR23","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Maya NE, Flores JJ, Verel S, & Graff M (2023). Models to classify the difficulty of genetic algorithms to solve continuous optimization problems.\u00a0Natl Comput, 1\u201321.","DOI":"10.1007\/s11047-022-09936-9"},{"key":"8811_CR24","doi-asserted-by":"crossref","unstructured":"Sadati MEH, Aksen D, & Aras N (2020) A Trilevel r-Interdiction selective multi-depot vehicle routing problem with depot protection. Comput Oper Res, 104996.","DOI":"10.1016\/j.cor.2020.104996"},{"key":"8811_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.113099","volume":"145","author":"A Soeanu","year":"2020","unstructured":"Soeanu A, Ray S, Berger J, Boukhtouta A, Debbabi M (2020) Multi-depot vehicle routing problem with risk mitigation: model and solution algorithm. Expert Syst Appl 145:113099","journal-title":"Expert Syst Appl"},{"issue":"10","key":"8811_CR26","doi-asserted-by":"publisher","first-page":"2228","DOI":"10.1016\/j.ifacol.2022.10.039","volume":"55","author":"I Torres-P\u00e9rez","year":"2022","unstructured":"Torres-P\u00e9rez I, Rosete A, Sosa-G\u00f3mez G, Rojas O (2022) New heuristics for assigning in the multi-depot vehicle routing problem. IFAC-PapersOnLine 55(10):2228\u20132233","journal-title":"IFAC-PapersOnLine"},{"key":"8811_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119118","volume":"214","author":"FY Vincent","year":"2023","unstructured":"Vincent FY, Aloina G, Jodiawan P, Gunawan A, Huang TC (2023) The vehicle routing problem with simultaneous pickup and delivery and occasional drivers. Expert Syst Appl 214:119118","journal-title":"Expert Syst Appl"},{"issue":"3","key":"8811_CR28","doi-asserted-by":"publisher","first-page":"861","DOI":"10.3390\/pr11030861","volume":"11","author":"Z Wang","year":"2023","unstructured":"Wang Z, Wu Y (2023) An ant colony optimization-simulated annealing algorithm for solving a multiload AGVs workshop scheduling problem with limited buffer capacity. Processes 11(3):861","journal-title":"Processes"},{"key":"8811_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107774","volume":"112","author":"C Wang","year":"2021","unstructured":"Wang C, Guo C, Zuo X (2021) Solving multi-depot electric vehicle scheduling problem by column generation and genetic algorithm. Appl Soft Comput 112:107774","journal-title":"Appl Soft Comput"},{"issue":"3","key":"8811_CR30","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.3390\/su14031264","volume":"14","author":"S Wang","year":"2022","unstructured":"Wang S, Han C, Yu Y, Huang M, Sun W, Kaku I (2022) Reducing carbon emissions for the vehicle routing problem by utilizing multiple depots. Sustainability 14(3):1264","journal-title":"Sustainability"},{"key":"8811_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109922","volume":"133","author":"Y Wang","year":"2023","unstructured":"Wang Y, Wei Y, Wang X, Wang Z, Wang H (2023) A clustering-based extended genetic algorithm for the multidepot vehicle routing problem with time windows and three-dimensional loading constraints. Appl Soft Comput 133:109922","journal-title":"Appl Soft Comput"},{"issue":"27","key":"8811_CR32","first-page":"27","volume":"48","author":"T Wang","year":"2012","unstructured":"Wang T, Wu K (2012) Study on multi-depot vehicle routing problem with time windows based on particle swarm optimization. Jisuanji Gongcheng Yu Yingyong (comput Eng Appl) 48(27):27\u201330","journal-title":"Jisuanji Gongcheng Yu Yingyong (comput Eng Appl)"},{"issue":"3","key":"8811_CR33","doi-asserted-by":"publisher","first-page":"681","DOI":"10.3390\/agriculture13030681","volume":"13","author":"D Wu","year":"2023","unstructured":"Wu D, Li J, Cui J, Hu D (2023) Research on the time-dependent vehicle routing problem for fresh agricultural products based on customer value. Agriculture 13(3):681","journal-title":"Agriculture"},{"key":"8811_CR34","doi-asserted-by":"crossref","unstructured":"Wu H, & Gao Y (2023) An ant colony optimization based on local search for the vehicle routing problem with simultaneous pickup-delivery and time window. Appl Soft Comput, 110203.","DOI":"10.1016\/j.asoc.2023.110203"},{"key":"8811_CR35","doi-asserted-by":"crossref","unstructured":"Xu H, Pu P, & Duan F (2018) A hybrid ant colony optimization for dynamic multidepot vehicle routing problem. Discrete Dynam Nat Soc, 2018.","DOI":"10.1155\/2018\/3624728"},{"key":"8811_CR36","doi-asserted-by":"crossref","unstructured":"Xue S (2023) An adaptive ant colony algorithm for crowdsourcing multi-depot vehicle routing problem with time windows. Sustain Oper Comput.","DOI":"10.2139\/ssrn.4259914"},{"key":"8811_CR37","first-page":"11","volume":"5","author":"K Yan","year":"2017","unstructured":"Yan K, Li A, Guo J, Chen B (2017) Research on multi-depot vehicle routing problem based on time window. Geospatial Inform 5:11","journal-title":"Geospatial Inform"},{"issue":"1\u20132","key":"8811_CR38","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10479-017-2531-2","volume":"273","author":"B Yao","year":"2019","unstructured":"Yao B, Chen C, Song X, Yang X (2019) Fresh seafood delivery routing problem using an improved ant colony optimization. Ann Oper Res 273(1\u20132):163\u2013186","journal-title":"Ann Oper Res"},{"issue":"1","key":"8811_CR39","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1057\/jors.2009.161","volume":"62","author":"B Yu","year":"2011","unstructured":"Yu B, Yang ZZ, Xie JX (2011) A parallel improved ant colony optimization for multi-depot vehicle routing problem. J Oper Res Soc 62(1):183\u2013188","journal-title":"J Oper Res Soc"},{"issue":"2","key":"8811_CR40","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1080\/13675567.2013.810712","volume":"16","author":"B Yu","year":"2013","unstructured":"Yu B, Ma N, Cai W, Li T, Yuan X, Yao B (2013) Improved ant colony optimization for the dynamic multi-depot vehicle routing problem. Int J Log Res Appl 16(2):144\u2013157","journal-title":"Int J Log Res Appl"},{"key":"8811_CR41","unstructured":"Yuan, X., Zhang, Q., Liu, H., & Wu, L. (2020). Solving MDVRP with grey delivery time based on improved quantum evolutionary algorithm. J Grey Syst, 32(3)."},{"issue":"9","key":"8811_CR42","doi-asserted-by":"publisher","first-page":"11859","DOI":"10.1016\/j.eswa.2011.03.077","volume":"38","author":"GN Y\u00fccenur","year":"2011","unstructured":"Y\u00fccenur GN, Demirel N\u00c7 (2011) A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Syst Appl 38(9):11859\u201311865","journal-title":"Expert Syst Appl"},{"issue":"8","key":"8811_CR43","doi-asserted-by":"publisher","first-page":"3500","DOI":"10.3390\/su12083500","volume":"12","author":"W Zhang","year":"2020","unstructured":"Zhang W, Gajpal Y, Appadoo SS, Wei Q (2020) Multi-depot green vehicle routing problem to minimize carbon emissions. Sustainability 12(8):3500","journal-title":"Sustainability"},{"issue":"6","key":"8811_CR44","first-page":"83","volume":"27","author":"J Zhang","year":"2009","unstructured":"Zhang J, Tang JF, Pan ZD (2009) A scatter search algorithm for multi-depot vehicle routing problem. Syst Eng 27(6):83","journal-title":"Syst Eng"},{"key":"8811_CR45","doi-asserted-by":"crossref","unstructured":"Zheng YJ, Chen X, Yan HF, & Zhang MX (2023). Evolutionary algorithm for vehicle routing for shared e-bicycle battery replacement and recycling. Appl Soft Comput, 110023.","DOI":"10.1016\/j.asoc.2023.110023"},{"key":"8811_CR46","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ins.2022.11.056","volume":"619","author":"X Zhou","year":"2023","unstructured":"Zhou X, Song J, Wu S, Wang M (2023) Artificial bee colony algorithm based on online fitness landscape analysis. Inf Sci 619:603\u2013629","journal-title":"Inf Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08811-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-08811-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08811-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:16:02Z","timestamp":1694776562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-08811-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,9]]},"references-count":46,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["8811"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-08811-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,9]]},"assertion":[{"value":"11 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2023","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. The authors declare the following financial interests\/personal relationships which may be considered as potential competing interests:","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No conflict of interest exists in submitting this manuscript, and all authors approve the manuscript for publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"On behalf of my co-authors, I would like to declare that the work described was original research that has not been published previously and is not under consideration for publication elsewhere, in whole or in part.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}