{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:17:54Z","timestamp":1743128274508,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031629112"},{"type":"electronic","value":"9783031629129"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62912-9_10","type":"book-chapter","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:01:37Z","timestamp":1718550097000},"page":"103-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["VNS with\u00a0Path Relinking for\u00a0the\u00a0Profitable Close-Enough Arc Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6978-6780","authenticated-orcid":false,"given":"Miguel","family":"Reula","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9311-7504","authenticated-orcid":false,"given":"Consuelo","family":"Parre\u00f1o-Torres","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9995-010X","authenticated-orcid":false,"given":"Anna","family":"Mart\u00ednez-Gavara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7265-823X","authenticated-orcid":false,"given":"Rafael","family":"Mart\u00ed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.ejor.2021.10.047","volume":"300","author":"N Bianchessi","year":"2022","unstructured":"Bianchessi, N., Corber\u00e1n, \u00c1., Plana, I., Reula, M., Sanchis, J.M.: The min-max close-enough arc routing problem. Eur. J. Oper. Res. 300(3), 837\u2013851 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105653","volume":"140","author":"N Bianchessi","year":"2022","unstructured":"Bianchessi, N., Corber\u00e1n, \u00c1., Plana, I., Reula, M., Sanchis, J.M.: The profitable close-enough arc routing problem. Comput. Oper. Res. 140, 105653 (2022)","journal-title":"Comput. Oper. Res."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/s11750-019-00507-3","volume":"27","author":"\u00c1 Corber\u00e1n","year":"2019","unstructured":"Corber\u00e1n, \u00c1., Plana, I., Reula, M., Sanchis, J.M.: A matheuristic for the distance-constrained close-enough arc routing problem. TOP 27, 312\u2013326 (2019)","journal-title":"TOP"},{"key":"10_CR4","unstructured":"Corber\u00e1n, \u00c1., Plana, I., Reula, M., Sanchis, J.M.. PCEARP Instances. https:\/\/www.uv.es\/plani\/instancias.html. Accessed May 2023"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11(1), 44\u201352 (1999)","journal-title":"INFORMS J. Comput."},{"key":"10_CR6","unstructured":"Laguna, M., Mart\u00ed, R., Mart\u00ednez-Gavara, A., P\u00e9rez-Pel\u00f3, S., Resende, M.: 20-years of GRASP with path relinking. Eur. J. Oper. Res. (2024, forthcoming)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/net.21729","volume":"69","author":"A Renaud","year":"2017","unstructured":"Renaud, A., Absi, N., Feillet, D.: The stochastic close-enough arc routing problem. Networks 69, 205\u2013221 (2017)","journal-title":"Networks"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120513","volume":"230","author":"M Reula","year":"2023","unstructured":"Reula, M., Mart\u00ed, R.: Heuristics for the profitable close-enough arc routing problem. Expert Syst. Appl. 230, 120513 (2023)","journal-title":"Expert Syst. Appl."},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105844","volume":"145","author":"D Sinha Roy","year":"2022","unstructured":"Sinha Roy, D., Defryn, C., Golden, B., Wasil, E.: Data-driven optimization and statistical modeling to improve meter reading for utility companies. Comput. Oper. Res. 145, 105844 (2022)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62912-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:10:28Z","timestamp":1718550628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62912-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629112","9783031629129"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62912-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lorient","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mic2024.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}