{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:59:10Z","timestamp":1777607950372,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T00:00:00Z","timestamp":1600041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T00:00:00Z","timestamp":1600041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012554","name":"Foundation for Distinguished Young Talents in Higher Education of Henan","doi-asserted-by":"publisher","award":["17YJA630037"],"award-info":[{"award-number":["17YJA630037"]}],"id":[{"id":"10.13039\/501100012554","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012154","name":"Graduate Research and Innovation Projects of Jiangsu Province","doi-asserted-by":"crossref","award":["110-4116000050"],"award-info":[{"award-number":["110-4116000050"]}],"id":[{"id":"10.13039\/501100012154","id-type":"DOI","asserted-by":"crossref"}]}],"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-01642-8","type":"journal-article","created":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T19:02:58Z","timestamp":1600110178000},"page":"175-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A parallel variable neighborhood search for solving covering salesman problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Xiaoning","family":"Zang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5599-7395","authenticated-orcid":false,"given":"Li","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Mustapha","family":"Ratli","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Ding","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,14]]},"reference":[{"key":"1642_CR1","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":"1642_CR2","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":"1642_CR3","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":"1642_CR4","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":"1642_CR5","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":"1642_CR6","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40, 1086\u20131094 (1992)","journal-title":"Oper. Res."},{"key":"1642_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120886","volume-title":"Combinatorial Optimization Mathematical Programming Studies","author":"E Balas","year":"1980","unstructured":"Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. In: Padberg, M.W. (ed.) Combinatorial Optimization Mathematical Programming Studies, vol. 12. Springer, Berlin, Heidelberg (1980). https:\/\/doi.org\/10.1007\/BFb0120886"},{"key":"1642_CR8","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. Comput. Oper. Res. 27, 29\u201342 (2000)","journal-title":"Comput. Oper. Res."},{"key":"1642_CR9","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. Appl. Soft Comput. 24, 867\u2013878 (2014)","journal-title":"Appl. Soft Comput."},{"key":"1642_CR10","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":"1642_CR11","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":"1","key":"1642_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2015.04.049","volume":"246","author":"HI Calvete","year":"2015","unstructured":"Calvete, H.I., Gale, C., Iranzo, J.A.: An efficient evolutionary algorithm for the ring star problem. Eur. J. Oper. Res. 246(1), 22\u201333 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1642_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":"1642_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 Appl. Math. 159, 1901\u20131914 (2011)","journal-title":"Discrete Appl. Math."},{"key":"1642_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1080\/02331930903500332","volume":"59","author":"S Kedad-Sidhoum","year":"2010","unstructured":"Kedad-Sidhoum, S., Viet Hung, N.: An exact algorithm for solving the ring star problem. Optimization 59, 125\u2013140 (2010)","journal-title":"Optimization"},{"key":"1642_CR16","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"1642_CR17","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10898-007-9144-2","volume":"39","author":"HI Calvete","year":"2007","unstructured":"Calvete, H.I., Gale, C.: Linear bilevel multi-follower programming with independent followers. J. Glob. Optim. 39, 409\u2013417 (2007)","journal-title":"J. Glob. Optim."},{"key":"1642_CR18","first-page":"365","volume":"7","author":"M Affenzeller","year":"2009","unstructured":"Affenzeller, M., Winkler, S.M., Wagner, S., Beham, A.: Genetic algorithms and genetic programming: modern concepts and practical applications. Parallel Process. Lett. 7, 365\u2013379 (2009)","journal-title":"Parallel Process. Lett."},{"key":"1642_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.ejor.2009.07.026","volume":"203","author":"R Baldacci","year":"2010","unstructured":"Baldacci, R., Dell\u2019Amico, M.: Heuristic algorithms for the multi-depot ring-star problem. Eur. J. Oper. Res. 203, 270\u2013281 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1642_CR20","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":"1642_CR21","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":"1642_CR22","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":"1642_CR23","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":"1642_CR24","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovic, N., Todosijevic, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5, 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"key":"1642_CR25","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1111\/itor.12282","volume":"24","author":"A Mjirda","year":"2017","unstructured":"Mjirda, A., Todosijevic, R., Hanafi, S., Hansen, P., Mladenovic, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24, 615\u2013633 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"1642_CR26","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11590-015-0973-5","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg, J., Mladenovic, N., Todosijevic, R., Urosevic, D.: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. Optim. Lett. 11, 313\u2013327 (2017)","journal-title":"Optim. Lett."},{"key":"1642_CR27","doi-asserted-by":"publisher","DOI":"10.1002\/0471739383.ch19","volume-title":"Parallel Metaheuristics Applications","author":"TG Crainic","year":"2005","unstructured":"Crainic, T.G., Hail, N.: Parallel Metaheuristics Applications. Wiley, New York (2005)"},{"key":"1642_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ijpe.2012.10.013","volume":"145","author":"M Eskandarpour","year":"2013","unstructured":"Eskandarpour, M., Zegordi, S.H., Nikbakhsh, E.: A parallel variable neighborhood search for the multi-objective sustainable post-sales network design problem. Int. J. Prod. Econ. 145, 117\u2013131 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"1642_CR29","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11590-012-0472-x","volume":"8","author":"L-Y Wang","year":"2014","unstructured":"Wang, L.-Y., Huang, X., Ji, P., Feng, E.-M.: Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time. Optim. Lett. 8, 129\u2013134 (2014)","journal-title":"Optim. Lett."},{"key":"1642_CR30","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.cor.2017.03.009","volume":"85","author":"O Polat","year":"2017","unstructured":"Polat, O.: A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups. Comput. Oper. Res. 85, 71\u201386 (2017)","journal-title":"Comput. Oper. Res."},{"key":"1642_CR31","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.asoc.2019.04.033","volume":"80","author":"A Herran","year":"2019","unstructured":"Herran, A., Colmenar, J.M., Duarte, A.: A variable neighborhood search approach for the Hamiltonian p-median problem. Appl. Soft Comput. 80, 603\u2013616 (2019)","journal-title":"Appl. Soft Comput."},{"key":"1642_CR32","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":"1642_CR33","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-01642-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01642-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01642-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:40:46Z","timestamp":1641814846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01642-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,14]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1642"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01642-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,14]]},"assertion":[{"value":"15 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}