{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T13:03:08Z","timestamp":1780578188089,"version":"3.54.1"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.eswa.2026.133077","type":"journal-article","created":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T09:57:02Z","timestamp":1780567022000},"page":"133077","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A population-based large neighborhood search algorithm for the multi-depot multiple traveling salesman problem"],"prefix":"10.1016","volume":"330","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-6770-8782","authenticated-orcid":false,"given":"Yupeng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3006-7903","authenticated-orcid":false,"given":"Wei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9549-1919","authenticated-orcid":false,"given":"Wenjuan","family":"Gu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9336-0376","authenticated-orcid":false,"given":"Yongguang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2625-0935","authenticated-orcid":false,"given":"Jiting","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.eswa.2026.133077_sbref0001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00291-020-00607-8","article-title":"Last-mile delivery concepts: A survey from an operational research perspective","volume":"43","author":"Boysen","year":"2021","journal-title":"OR Spectrum"},{"issue":"2","key":"10.1016\/j.eswa.2026.133077_sbref0002","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1142\/S0219622007002447","article-title":"A grouping genetic algorithm for the multiple traveling salesperson problem","volume":"6","author":"Brown","year":"2007","journal-title":"International Journal of Information Technology & Decision Making"},{"issue":"2","key":"10.1016\/j.eswa.2026.133077_sbref0003","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/trsc.1070.0209","article-title":"Routing for relief efforts","volume":"42","author":"Campbell","year":"2008","journal-title":"Transportation Science"},{"key":"10.1016\/j.eswa.2026.133077_bib0004","first-page":"31","article-title":"Solving min-max multi-depot vehicle routing problem","volume":"55","author":"Carlsson","year":"2009","journal-title":"Lectures on Global Optimization"},{"issue":"1","key":"10.1016\/j.eswa.2026.133077_sbref0005","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.ejor.2005.04.027","article-title":"A new approach to solving the multiple traveling salesperson problem using genetic algorithms","volume":"175","author":"Carter","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133077_sbref0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2021.100369","article-title":"A comprehensive survey on the multiple traveling salesman problem: Applications, approaches and taxonomy","volume":"40","author":"Cheikhrouhou","year":"2021","journal-title":"Computer Science Review"},{"issue":"3","key":"10.1016\/j.eswa.2026.133077_sbref0007","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1016\/j.ejor.2021.02.027","article-title":"An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots","volume":"294","author":"Chen","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133077_sbref0008","article-title":"Optimizing dynamic flexible job shop scheduling using an evolutionary multi-task optimization framework and genetic programming","author":"Chen","year":"2025","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.eswa.2026.133077_sbref0009","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.trc.2012.03.007","article-title":"Consistency in multi-vehicle inventory-routing","volume":"24","author":"Coelho","year":"2012","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"11","key":"10.1016\/j.eswa.2026.133077_sbref0010","doi-asserted-by":"crossref","first-page":"2537","DOI":"10.1016\/j.cor.2011.12.020","article-title":"The inventory-routing problem with transshipment","volume":"39","author":"Coelho","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.eswa.2026.133077_sbref0011","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.ejor.2012.06.044","article-title":"An adaptive large neighborhood search heuristic for the pollution-routing problem","volume":"223","author":"Demir","year":"2012","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133077_sbref0012","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.matcom.2025.02.026","article-title":"Solving the permutation flow shop scheduling problem with sequence-dependent setup time via iterative greedy algorithm and imitation learning","volume":"234","author":"Du","year":"2025","journal-title":"Mathematics and Computers in Simulation"},{"key":"10.1016\/j.eswa.2026.133077_sbref0013","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.trb.2020.11.012","article-title":"A large neighborhood search approach to the vehicle routing problem with delivery options","volume":"144","author":"Dumez","year":"2021","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"10.1016\/j.eswa.2026.133077_sbref0014","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.29.3.267","article-title":"The m-traveling salesman problem with minmax objective","volume":"29","author":"Fran\u00e7a","year":"1995","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.eswa.2026.133077_sbref0015","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1016\/j.asoc.2010.03.002","article-title":"An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems","volume":"11","author":"Ghafurian","year":"2011","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.eswa.2026.133077_sbref0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.07.019","article-title":"Adaptive large neighborhood search for the commodity constrained split delivery VRP","volume":"112","author":"Gu","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133077_sbref0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105726","article-title":"Hybrid search with neighborhood reduction for the multiple traveling salesman problem","volume":"142","author":"He","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.eswa.2026.133077_sbref0018","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/j.ejor.2022.11.010","article-title":"Memetic search for the minmax multiple traveling salesman problem with single and multiple depots","volume":"307","author":"He","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133077_sbref0019","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.112867","article-title":"A new efficient hybrid algorithm for large scale multiple traveling salesman problems","volume":"139","author":"Jiang","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.133077_sbref0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.103976","article-title":"A multi-mode hybrid electric vehicle routing problem with time windows","volume":"195","author":"Jiang","year":"2025","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.eswa.2026.133077_sbref0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105192","article-title":"Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach","volume":"129","author":"Karabulut","year":"2021","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.eswa.2026.133077_sbref0022","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10479-018-3076-8","article-title":"Shared mobility systems: An updated survey","volume":"271","author":"Laporte","year":"2018","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.eswa.2026.133077_sbref0023","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/j.asoc.2018.11.048","article-title":"Mission-oriented ant-team ACO for min-max MTSP","volume":"76","author":"Lu","year":"2019","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.eswa.2026.133077_sbref0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106455","article-title":"A hybrid genetic algorithm for the min-max multiple traveling salesman problem","volume":"162","author":"Mahmoudinazlou","year":"2024","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.eswa.2026.133077_sbref0025","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","article-title":"A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem","volume":"25","author":"Nagata","year":"2013","journal-title":"INFORMS Journal on Computing"},{"issue":"8","key":"10.1016\/j.eswa.2026.133077_sbref0026","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133077_bib0027","first-page":"99","article-title":"Large neighborhood search","author":"Pisinger","year":"2019"},{"key":"10.1016\/j.eswa.2026.133077_bib0028","series-title":"Proceedings of the statistical data analysis based on the L1 norm conference, neuchatel, switzerland","article-title":"Clustering by means of medoids","volume":"vol. 31","author":"Rdusseeun","year":"1987"},{"issue":"4","key":"10.1016\/j.eswa.2026.133077_sbref0029","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transportation Science"},{"issue":"1-2","key":"10.1016\/j.eswa.2026.133077_sbref0030","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/s10479-018-2807-1","article-title":"An integrated routing and scheduling model for evacuation and commodity distribution in large-scale disaster relief operations: A case study","volume":"283","author":"Sabouhi","year":"2019","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/j.eswa.2026.133077_sbref0031","doi-asserted-by":"crossref","DOI":"10.1007\/s12065-025-01035-9","article-title":"A linear partitioning diversity metric for evaluation of permutation-based metaheuristic algorithms","volume":"18","author":"Shahbazi","year":"2025","journal-title":"Evolutionary Intelligence"},{"key":"10.1016\/j.eswa.2026.133077_bib0032","series-title":"Principles and practice of constraint programming \u2014 CP98","first-page":"417","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"issue":"1","key":"10.1016\/j.eswa.2026.133077_sbref0033","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00500-008-0312-1","article-title":"A new grouping genetic algorithm approach to the multiple traveling salesperson problem","volume":"13","author":"Singh","year":"2009","journal-title":"Soft Computing"},{"key":"10.1016\/j.eswa.2026.133077_sbref0034","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.cie.2015.10.010","article-title":"A general variable neighborhood search heuristic for multiple traveling salesmen problem","volume":"90","author":"Soylu","year":"2015","journal-title":"Computers & Industrial Engineering"},{"issue":"11","key":"10.1016\/j.eswa.2026.133077_sbref0035","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","article-title":"A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery","volume":"37","author":"Subramanian","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"7","key":"10.1016\/j.eswa.2026.133077_sbref0036","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1287\/mnsc.19.7.790","article-title":"Computational experience with an m-salesman traveling salesman algorithm","volume":"19","author":"Svestka","year":"1973","journal-title":"Management Science"},{"key":"10.1016\/j.eswa.2026.133077_sbref0037","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125446","article-title":"A hybrid artificial bee colony algorithm with high robustness for the multiple traveling salesman problem with multiple depots","volume":"260","author":"Tong","year":"2025","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.1016\/j.eswa.2026.133077_sbref0038","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ejor.2020.10.045","article-title":"Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search","volume":"292","author":"Turke\u0160","year":"2021","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.eswa.2026.133077_sbref0039","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","article-title":"New benchmark instances for the capacitated vehicle routing problem","volume":"257","author":"Uchoa","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133077_sbref0040","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.asoc.2014.09.029","article-title":"Two metaheuristic approaches for the multiple traveling salesperson problem","volume":"26","author":"Venkatesh","year":"2015","journal-title":"Applied Soft Computing"},{"issue":"3","key":"10.1016\/j.eswa.2026.133077_sbref0041","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","article-title":"A hybrid genetic algorithm for multidepot and periodic vehicle routing problems","volume":"60","author":"Vidal","year":"2012","journal-title":"Operations Research"},{"issue":"9","key":"10.1016\/j.eswa.2026.133077_sbref0042","doi-asserted-by":"crossref","first-page":"1430","DOI":"10.1057\/jors.2014.108","article-title":"The min-max multi-depot vehicle routing problem: Heuristics and computational results","volume":"66","author":"Wang","year":"2015","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.eswa.2026.133077_sbref0043","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.cie.2016.12.017","article-title":"Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem","volume":"106","author":"Wang","year":"2017","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.eswa.2026.133077_sbref0044","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ejor.2013.01.043","article-title":"A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms","volume":"228","author":"Yuan","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133077_sbref0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105772","article-title":"An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem","volume":"143","author":"Zheng","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133077_sbref0046","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.asoc.2017.12.031","article-title":"A comparative study of improved GA and PSO in solving multiple traveling salesmen problem","volume":"64","author":"Zhou","year":"2018","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.eswa.2026.133077_sbref0047","series-title":"Machine learning: ECML 2004","first-page":"537","article-title":"Population diversity in permutation-based genetic algorithm","volume":"vol. 3201","author":"Zhu","year":"2004"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426019883?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426019883?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T12:03:07Z","timestamp":1780574587000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417426019883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":47,"alternative-id":["S0957417426019883"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2026.133077","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A population-based large neighborhood search algorithm for the multi-depot multiple traveling salesman problem","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2026.133077","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"133077"}}