{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T07:48:12Z","timestamp":1776325692547,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,21]],"date-time":"2021-03-21T00:00:00Z","timestamp":1616284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,21]],"date-time":"2021-03-21T00:00:00Z","timestamp":1616284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Ministry of Chinese Education, Humanities, and Social Sciences project","award":["17YJA630037"],"award-info":[{"award-number":["17YJA630037"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11590-021-01709-0","type":"journal-article","created":{"date-parts":[[2021,3,21]],"date-time":"2021-03-21T09:02:21Z","timestamp":1616317341000},"page":"375-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A covering traveling salesman problem with profit in the last mile delivery"],"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":[]}],"member":"297","published-online":{"date-parts":[[2021,3,21]]},"reference":[{"key":"1709_CR1","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.ejor.2017.08.011","volume":"265","author":"L Zhou","year":"2018","unstructured":"Zhou, L., Baldacci, R., Vigo, D., Wang, X.: A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution. Eur. J. Oper. Res. 265, 765\u2013778 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1709_CR2","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","volume":"26","author":"M Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Vigo, D.: Heuristics for the traveling salesman problem with pickup and delivery. Comput. Oper. Res. 26, 699\u2013714 (1999)","journal-title":"Comput. Oper. Res."},{"key":"1709_CR3","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s11590-014-0828-5","volume":"9","author":"HH Hoos","year":"2015","unstructured":"Hoos, H.H., St\u00fctzle, T.: On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances. Optimization Letters 9, 1247\u20131254 (2015)","journal-title":"Optimization Letters"},{"key":"1709_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.ejor.2017.11.063","volume":"267","author":"R Bernardino","year":"2018","unstructured":"Bernardino, R., Paias, A.: Solving the family traveling salesman problem. Eur. J. Oper. Res. 267, 453\u2013466 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"1709_CR5","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. Transportation Science 23, 208\u2013213 (1989)","journal-title":"Transportation Science"},{"key":"1709_CR6","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":"1709_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0305-0548(99)00006-4","volume":"27","author":"M Hachicha","year":"2000","unstructured":"Hachicha, M., Hodgson, M.J., Laporte, G., Semet, F.: Heuristics for the multi-vehicle covering tour problem. Computers Operations Research 27, 29\u201342 (2000)","journal-title":"Computers Operations Research"},{"key":"1709_CR8","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.cor.2016.06.019","volume":"76","author":"G Ozbaygin","year":"2016","unstructured":"Ozbaygin, G., Yaman, H., Karasan, O.E.: Time constrained maximal covering salesman problem with weighted demands and partial coverage. Comput. Oper. Res. 76, 226\u2013237 (2016)","journal-title":"Comput. Oper. Res."},{"key":"1709_CR9","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":"1709_CR10","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. Computers Industrial Engineering 83, 244\u2013251 (2015)","journal-title":"Computers Industrial Engineering"},{"key":"1709_CR11","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":"1709_CR12","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. Journal of the Operational Research Society 55, 179\u2013186 (2004)","journal-title":"Journal of the Operational Research Society"},{"key":"1709_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"M Labbe","year":"2004","unstructured":"Labbe, M., Laporte, G., Martin, I.R., Gonzalez, J.J.S.: The Ring Star Problem: Polyhedral analysis and exact algorithm. Networks 43, 177\u2013189 (2004)","journal-title":"Networks"},{"key":"1709_CR14","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1016\/j.dam.2011.01.015","volume":"159","author":"L Simonetti","year":"2011","unstructured":"Simonetti, L., Frota, Y., de Souza, C.C.: The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm. Discrete Applied Mathematics 159, 1901\u20131914 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"1709_CR15","doi-asserted-by":"crossref","unstructured":"S. Kedad-Sidhoum, N. Viet Hung, An exact algorithm for solving the ring star problem, Optimization, 59 (2010) 125\u2013140.","DOI":"10.1080\/02331930903500332"},{"issue":"2015","key":"1709_CR16","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":"1709_CR17","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":"1709_CR18","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10898-016-0431-7","volume":"67","author":"K Sundar","year":"2017","unstructured":"Sundar, K., Rathinam, S.: Multiple depot ring star problem: a polyhedral study and an exact algorithm. J. Global Optim. 67, 527\u2013551 (2017)","journal-title":"J. Global Optim."},{"key":"1709_CR19","doi-asserted-by":"publisher","first-page":"2728","DOI":"10.1016\/j.dam.2011.11.029","volume":"160","author":"EA Hoshino","year":"2012","unstructured":"Hoshino, E.A., de Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discrete Applied Mathematics 160, 2728\u20132741 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"1709_CR20","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":"1709_CR21","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":"1709_CR22","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.ejor.2017.04.025","volume":"262","author":"R Baldacci","year":"2017","unstructured":"Baldacci, R., Hill, A., Hoshino, E.A., Lim, A.: Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. Eur. J. Oper. Res. 262, 879\u2013893 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"1709_CR23","doi-asserted-by":"crossref","unstructured":"J. Edwards, A. McKinnon, T. Cherrett, F. McLeod, L.Y. Song, Carbon Dioxide Benefits of Using Collection-Delivery Points for Failed Home Deliveries in the United Kingdom, Transp. Res. Record, (2010) 136\u2013143.","DOI":"10.3141\/2191-17"},{"key":"1709_CR24","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1080\/13675560600859565","volume":"9","author":"F McLeod","year":"2006","unstructured":"McLeod, F., Cherrett, T., Song, L.: Transport impacts of local collection\/delivery points. International Journal of Logistics Research and Applications 9, 307\u2013317 (2006)","journal-title":"International Journal of Logistics Research and Applications"},{"key":"1709_CR25","doi-asserted-by":"crossref","unstructured":"X. Wang, L. Zhan, J. Ruan, J. Zhang, How to Choose \"Last Mile'' Delivery Modes for E-Fulfillment, Mathematical Problems in Engineering, (2014).","DOI":"10.1155\/2014\/417129"},{"key":"1709_CR26","doi-asserted-by":"crossref","unstructured":"A.T. Collins, Behavioural Influences on the Environmental Impact of Collection\/Delivery Points, in: Green Logistics and Transportation, Springer International Publishing Switzerland, 2015.","DOI":"10.1007\/978-3-319-17181-4_2"},{"key":"1709_CR27","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/j.asoc.2014.08.057","volume":"24","author":"MH Shaelaie","year":"2014","unstructured":"Shaelaie, M.H., Salari, M., Naji-Azimi, Z.: The generalized covering traveling salesman problem. Applied Soft Computing 24, 867\u2013878 (2014)","journal-title":"Applied Soft Computing"},{"key":"1709_CR28","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.asoc.2019.03.001","volume":"78","author":"V Pandiri","year":"2019","unstructured":"Pandiri, V., Singh, A.: An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. Applied Soft Computing 78, 481\u2013495 (2019)","journal-title":"Applied Soft Computing"},{"key":"1709_CR29","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-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 10, 27\u201336 (1991)","journal-title":"Operations Research Letters"},{"key":"1709_CR30","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/S0377-2217(03)00377-1","volume":"158","author":"I Kara","year":"2004","unstructured":"Kara, I., Laporte, G., Bektas, T.: A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Res. 158, 793\u2013795 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"1709_CR31","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":"1709_CR32","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"VC Hemmelmayr","year":"2009","unstructured":"Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195, 791\u2013802 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1709_CR33","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cor.2012.05.009","volume":"40","author":"B Jarboui","year":"2013","unstructured":"Jarboui, B., Derbel, H., Hanafi, S., Mladenovic, N.: Variable neighborhood search for location routing. Comput. Oper. Res. 40, 47\u201357 (2013)","journal-title":"Comput. Oper. Res."},{"key":"1709_CR34","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10898-014-0213-z","volume":"63","author":"A Duarte","year":"2015","unstructured":"Duarte, A., Pantrigo, J.J., Pardo, E.G., Mladenovic, N.: Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J. Global Optim. 63, 515\u2013536 (2015)","journal-title":"J. Global Optim."},{"key":"1709_CR35","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":"1709_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 Journal on Computing 3, 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01709-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01709-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01709-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:41:56Z","timestamp":1641814916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01709-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,21]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1709"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01709-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,21]]},"assertion":[{"value":"19 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}