{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T04:12:04Z","timestamp":1744171924615,"version":"3.40.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Ministry of Chinese Education, Humanities and Social Sciences","award":["17YJA630037"],"award-info":[{"award-number":["17YJA630037"]}]},{"name":"the National Science and Technology Support Program of China","award":["71331002"],"award-info":[{"award-number":["71331002"]}]},{"name":"Project of Graduate Teaching Quality in Hefei University of Technology","award":["110-4116000050"],"award-info":[{"award-number":["110-4116000050"]}]},{"name":"Khalifa University of Science and Technology","award":["RC2 DSO"],"award-info":[{"award-number":["RC2 DSO"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11590-020-01693-x","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T07:03:06Z","timestamp":1609743786000},"page":"333-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak"],"prefix":"10.1007","volume":"16","author":[{"given":"Li","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Xiaoning","family":"Zang","sequence":"additional","affiliation":[]},{"given":"Junfeng","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Changyong","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"1693_CR1","unstructured":"MedSci homepage, https:\/\/www.medsci.cn\/article\/show_article.do?id=3ced19388666in. Accessed 10 May 2020"},{"key":"1693_CR2","doi-asserted-by":"publisher","first-page":"118200","DOI":"10.1016\/j.jclepro.2019.118200","volume":"240","author":"AM Fathollahi-Fard","year":"2019","unstructured":"Fathollahi-Fard, A.M., Govindan, K., Hajiaghaei-Keshteli, M., Ahmadi, A.: A green home health care supply chain: New modified simulated annealing algorithms. J. Clean. Prod. 240, 118200 (2019)","journal-title":"J. Clean. Prod."},{"key":"1693_CR3","doi-asserted-by":"publisher","first-page":"106913","DOI":"10.1016\/j.compchemeng.2020.106913","volume":"139","author":"P Karakostas","year":"2020","unstructured":"Karakostas, P., Panoskaltsis, N., Mantalaris, A., Georgiadis, M.C.: Optimization of CAR T-cell therapies supply chains. Comput. Chem. Eng. 139, 106913 (2020)","journal-title":"Comput. Chem. Eng."},{"key":"1693_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF02023807","volume":"6","author":"G Laporte","year":"1986","unstructured":"Laporte, G., Nobert, Y., Arpin, D.: An exact algorithm for solving a capacitated location-routing problem. Ann. Oper. Res. 6, 291\u2013310 (1986)","journal-title":"Ann. Oper. Res."},{"key":"1693_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/net.3230220204","volume":"22","author":"U Akinc","year":"1992","unstructured":"Akinc, U., Srikanth, K.: Optimal routing and process scheduling for a mobile service facility. Networks 22, 163\u2013183 (1992)","journal-title":"Networks"},{"key":"1693_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF02568604","volume":"4","author":"JE Beasley","year":"1996","unstructured":"Beasley, J.E., Nascimento, E.M.: The vehicle routing-allocation problem: a unifying framework. TOP 4, 65\u201386 (1996)","journal-title":"TOP"},{"key":"1693_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1057\/palgrave.jors.2602165","volume":"58","author":"L Vogt","year":"2007","unstructured":"Vogt, L., Poojari, C.A., Beasley, J.E.: A tabu search algorithm for the single vehicle routing allocation problem. J. Oper. Res. Soc. 58, 467\u2013480 (2007)","journal-title":"J. Oper. Res. Soc."},{"key":"1693_CR8","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.ejor.2020.01.053","volume":"285","author":"P Baniasadi","year":"2020","unstructured":"Baniasadi, P., Foumani, M., Smith-Miles, K., Ejov, V.: A transformation technique for the clustered generalized traveling salesman problem with applications to logistics. Eur. J. Oper. Res. 285, 444\u2013457 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"1693_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1057\/jors.2012.32","volume":"64","author":"A Ghoniem","year":"2013","unstructured":"Ghoniem, A., Scherrer, C.R., Solak, S.: A specialized column generation approach for a vehicle routing problem with demand allocation. J. Oper. Res. Soc. 64, 114\u2013124 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"1693_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10479-012-1068-7","volume":"221","author":"S Solak","year":"2014","unstructured":"Solak, S., Scherrer, C., Ghoniem, A.: The stop-and-drop problem in nonprofit food distribution networks. Ann. Oper. Res. 221, 407\u2013426 (2014)","journal-title":"Ann. Oper. Res."},{"key":"1693_CR11","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.ejor.2018.06.049","volume":"272","author":"M Reihaneh","year":"2019","unstructured":"Reihaneh, M., Ghoniem, A.: A branch-and-price algorithm for a vehicle routing with demand allocation problem. Eur. J. Oper. Res. 272, 523\u2013538 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"1693_CR12","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0377-2217(02)00831-7","volume":"151","author":"JAM Perez","year":"2003","unstructured":"Perez, J.A.M., Moreno-Vega, J.M., Martin, I.R.: Variable neighborhood tabu search and its application to the median cycle problem. Eur. J. Oper. Res. 151, 365\u2013378 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"1693_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1057\/palgrave.jors.2601672","volume":"55","author":"J Renaud","year":"2004","unstructured":"Renaud, J., Boctor, F.F., Laporte, G.: Efficient heuristics for Median Cycle Problems. J. Oper. Res. Soc. 55, 179\u2013186 (2004)","journal-title":"J. Oper. Res. Soc."},{"issue":"2015","key":"1693_CR14","first-page":"343","volume":"246","author":"HI Calvete","year":"2013","unstructured":"Calvete, H.I., Gale, C., Iranzo, J.A.: An efficient evolutionary algorithm for the ring star problem (vol 231, pg 22. Eur. J. Oper. Res. 246(2015), 343\u2013343 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"1693_CR15","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R Baldacci","year":"2007","unstructured":"Baldacci, R., Dell\u2019Amico, M., Gonzalez, J.S.: The capacitated m-ring-star problem. Oper. Res. 55, 1147\u20131162 (2007)","journal-title":"Oper. Res."},{"key":"1693_CR16","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.ejor.2010.06.030","volume":"207","author":"Z Naji-Azimi","year":"2010","unstructured":"Naji-Azimi, Z., Salari, M., Toth, P.: A heuristic procedure for the Capacitated m-ring-star problem. Eur. J. Oper. Res. 207, 1227\u20131234 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1693_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2011.08.026","volume":"217","author":"Z Naji-Azimi","year":"2012","unstructured":"Naji-Azimi, Z., Salari, M., Toth, P.: An integer linear programming based heuristic for the capacitated m-ring-star problem. Eur. J. Oper. Res. 217, 17\u201325 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"1693_CR18","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"JR Current","year":"1989","unstructured":"Current, J.R., Schilling, D.A.: The covering salesman problem. Transp. Sci. 23, 208\u2013213 (1989)","journal-title":"Transp. Sci."},{"key":"1693_CR19","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.45.4.568","volume":"45","author":"M Gendreau","year":"1997","unstructured":"Gendreau, M., Laporte, G., Semet, F.: The covering tour problem. Oper. Res. 45, 568\u2013576 (1997)","journal-title":"Oper. Res."},{"key":"1693_CR20","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/ijoc.1110.0480","volume":"24","author":"B Golden","year":"2012","unstructured":"Golden, B., Naji-Azimi, Z., Raghavan, S., Salari, M., Toth, P.: The generalized covering salesman problem. Informs J. Comput. 24, 534\u2013553 (2012)","journal-title":"Informs J. Comput."},{"key":"1693_CR21","doi-asserted-by":"publisher","first-page":"2594","DOI":"10.1016\/j.cor.2012.01.004","volume":"39","author":"M Salari","year":"2012","unstructured":"Salari, M., Naji-Azimi, Z.: An integer programming-based local search for the covering salesman problem. Comput. Oper. Res. 39, 2594\u20132602 (2012)","journal-title":"Comput. Oper. Res."},{"key":"1693_CR22","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.cie.2015.02.019","volume":"83","author":"M Salari","year":"2015","unstructured":"Salari, M., Reihaneh, M., Sabbagh, M.S.: Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput. Ind. Eng. 83, 244\u2013251 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"1693_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers, M., Laporte, G.: Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints. Oper. Res. Lett. 10, 27\u201336 (1991)","journal-title":"Oper. Res. Lett."},{"key":"1693_CR24","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/S0377-2217(03)00377-1","volume":"158","author":"T Bektas","year":"2004","unstructured":"Bektas, T.: A note on the lifted Miller\u2013Tucker\u2013Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Res. 158, 793\u2013795 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"1693_CR25","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C Miller","year":"1960","unstructured":"Miller, C.: Integer programming formulations and traveling salesman problems. J. Assoc. Comput. Mach. 7, 326\u2013329 (1960)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1693_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2836-1","volume-title":"Practical Bilevel Optimization, Algorithms and Applications","author":"JF Bard","year":"1998","unstructured":"Bard, J.F.: Practical Bilevel Optimization, Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"1693_CR27","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153, 235\u2013256 (2007)","journal-title":"Ann. Oper. Res."},{"key":"1693_CR28","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht, Boston, London (2002)"},{"key":"1693_CR29","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1693_CR30","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.asoc.2018.02.032","volume":"66","author":"Y Qiu","year":"2018","unstructured":"Qiu, Y., Wang, L., Xu, X., Fang, X., Pardalos, P.M.: A variable neighborhood search heuristic algorithm for production routing problems. Appl. Soft Comput. 66, 311\u2013318 (2018)","journal-title":"Appl. Soft Comput."},{"key":"1693_CR31","doi-asserted-by":"publisher","first-page":"113444","DOI":"10.1016\/j.eswa.2020.113444","volume":"153","author":"P Karakostas","year":"2020","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: Adaptive variable neighborhood search solution methods for the fleet size and mix pollution location-inventory-routing problem. Expert Syst. Appl. 153, 113444 (2020)","journal-title":"Expert Syst. Appl."},{"key":"1693_CR32","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.cie.2018.06.036","volume":"123","author":"A Gruler","year":"2018","unstructured":"Gruler, A., Panadero, J., de Armas, J., Moreno Perez, J.A., Juan, A.A.: Combining variable neighborhood search with simulation for the inventory routing problem with stochastic demands and stock-outs. Comput. Ind. Eng. 123, 278\u2013288 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"1693_CR33","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.compchemeng.2019.04.015","volume":"126","author":"P Karakostas","year":"2019","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing. Comput. Chem. Eng. 126, 263\u2013279 (2019)","journal-title":"Comput. Chem. Eng."},{"key":"1693_CR34","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling-salesman problem. Oper. Res. 21, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"1693_CR35","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"1693_CR36","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01693-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01693-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01693-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T05:45:14Z","timestamp":1744091114000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01693-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1693"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01693-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,1,4]]},"assertion":[{"value":"3 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}