{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:16:39Z","timestamp":1753272999875,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190839"},{"type":"electronic","value":"9783319190846"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19084-6_16","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"170-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Selector Operator-Based Adaptive Large Neighborhood Search for the Covering Tour Problem"],"prefix":"10.1007","author":[{"given":"Leticia","family":"Vargas","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Jozefowiez","sequence":"additional","affiliation":[]},{"given":"Sandra Ulrich","family":"Ngueveu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/0-387-23667-8_3","volume-title":"Metaheuristic Optimization Via Memory and Evolution","author":"R Baldacci","year":"2005","unstructured":"Baldacci, R., Boschetti, M.A., Maniezzo, V., Zamboni, M.: Scatter search methods for the covering tour problem. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization Via Memory and Evolution, pp. 59\u201391. Kluwer, Boston (2005)"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"J Beasley","year":"1983","unstructured":"Beasley, J.: Route first-cluster second methods for vehicle routing. OMEGA Int. J. Manag. Sci. 11, 403\u2013408 (1983)","journal-title":"OMEGA Int. J. Manag. Sci."},{"key":"16_CR3","doi-asserted-by":"crossref","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":"16_CR4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","volume":"73","author":"JR Current","year":"1994","unstructured":"Current, J.R., Schilling, D.A.: The median tour and maximal covering problems. European J. Oper. Res. 73, 114\u2013126 (1994)","journal-title":"European J. Oper. Res."},{"key":"16_CR5","unstructured":"Desrochers, M.: An algorithm for the shortest path problem with resource constraints. Technical report G-88-27, GERAD. Montr\u00e9al (1988)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44, 216\u2013229 (2004)","journal-title":"Networks"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45, 378\u2013394 (1997)","journal-title":"Oper. Res."},{"key":"16_CR8","doi-asserted-by":"crossref","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":"16_CR9","doi-asserted-by":"crossref","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":"16_CR10","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1111\/0022-4146.00113","volume":"38","author":"J Hodgson","year":"1998","unstructured":"Hodgson, J., Laporte, G., Semet, F.: A covering tour model for planning mobile health care facilities in Suhum district. Ghana. Jl Reg. Sci. 38, 621\u2013638 (1998)","journal-title":"Ghana. Jl Reg. Sci."},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"1929","DOI":"10.1016\/j.cor.2005.07.022","volume":"34","author":"N Jozefowiez","year":"2007","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: The bi-objective covering tour problem. Comput. Oper. Res. 34, 1929\u20131942 (2007)","journal-title":"Comput. Oper. Res."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1137\/1.9780898718515.ch5","volume-title":"The Vehicle Routing Problem","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Semet, F.: Classical and new heuristics for the vehicle routing problem. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 109\u2013128. SIAM, Philadelphia (2002)"},{"key":"16_CR13","unstructured":"Motta, L., Ochi, L.S., Martinhon, C.: GRASP metaheuristics to the generalized covering tour problem. In: MIC 2001-4th Metaheuristics International Conference, Porto, Portugal, pp. 387\u2013391 (2001)"},{"key":"16_CR14","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, pp. 399\u2013419. Springer, New York (2010)"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31, 1985\u20132002 (2004)","journal-title":"Comput. Oper. Res."},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1080\/00207540802426599","volume":"47","author":"C Prins","year":"2009","unstructured":"Prins, C., Labadi, N., Reghioui, M.: Tour splitting algorithms for vehicle routing problems. Int. J. Prod. Res. 47, 507\u2013535 (2009)","journal-title":"Int. J. Prod. Res."},{"key":"16_CR18","first-page":"179","volume":"40","author":"C Prins","year":"2014","unstructured":"Prins, C., Lacomme, P., Prodhon, C.: Order-first split-second methods for vehicle routing problems: a review. Transp. Res. 40, 179\u2013200 (2014)","journal-title":"Transp. Res."},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB - a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"16_CR20","unstructured":"Ribeiro, G., Laporte, G.: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. CIRRELT (2011)"},{"key":"16_CR21","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transport. Sci. 40, 455\u2013472 (2006)","journal-title":"Transport. Sci."},{"key":"16_CR22","doi-asserted-by":"crossref","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":"16_CR23","unstructured":"Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report. University of Strathclyde, Scotland (1997)"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19084-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T09:49:08Z","timestamp":1676454548000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}