{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T04:06:32Z","timestamp":1774065992466,"version":"3.50.1"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319684956","type":"print"},{"value":"9783319684963","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68496-3_2","type":"book-chapter","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T08:25:00Z","timestamp":1506414300000},"page":"19-33","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid Heuristic for the Clustered Orienteering Problem"],"prefix":"10.1007","author":[{"given":"Ala-Eddine","family":"Yahiaoui","sequence":"first","affiliation":[]},{"given":"Aziz","family":"Moukrim","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Serairi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/j.ejor.2014.04.006","volume":"238","author":"E Angelelli","year":"2014","unstructured":"Angelelli, E., Archetti, C., Vindigni, M.: The clustered orienteering problem. European Journal of Operational Research 238(2), 404\u2013414 (2014)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"JE Beasley","year":"1983","unstructured":"Beasley, J.E.: Route first-cluster second methods for vehicle routing. Omega 11(4), 403\u2013408 (1983)","journal-title":"Omega"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bouly, H., Dang, D.-C., Moukrim, A.: A memetic algorithm for the team orienteering problem. 4OR 8(1) 49\u201370 (2010)","DOI":"10.1007\/s10288-008-0094-4"},{"issue":"2","key":"2_CR4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti, M., Gonzalez, J.J.S., Toth, P.: Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing 10(2), 133\u2013148 (1998)","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"2_CR5","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21(2), 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Handbook of Metaheuristics, pp. 399\u2013419. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_13"},{"issue":"12","key":"2_CR7","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. Computers & Operations Research 31(12), 1985\u20132002 (2004)","journal-title":"Computers & Operations Research"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.trc.2014.01.011","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. Transportation Research Part C: Emerging Technologies 40, 179\u2013200 (2014)","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"1","key":"2_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10732-017-9324-2","volume":"23","author":"L Vargas","year":"2017","unstructured":"Vargas, L., Jozefowiez, N., Ngueveu, S.U.: A dynamic programming operator for tour location problems applied to the covering tour problem. Journal of Heuristics 23(1), 53\u201380 (2017)","journal-title":"Journal of Heuristics"},{"issue":"2","key":"2_CR10","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1287\/trsc.2015.0584","volume":"50","author":"T Vidal","year":"2015","unstructured":"Vidal, T., Maculan, N., Ochi, L.S., Vaz Penna, P.H.: Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transportation Science 50(2), 720\u2013734 (2015)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68496-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T19:56:27Z","timestamp":1570132587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68496-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684956","9783319684963"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68496-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}