{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:11:22Z","timestamp":1743052282000,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031779404"},{"type":"electronic","value":"9783031779411"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-77941-1_16","type":"book-chapter","created":{"date-parts":[[2025,1,26]],"date-time":"2025-01-26T08:44:40Z","timestamp":1737881080000},"page":"214-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving a Shareable-Setup Time Prize Collection VRP Applied to an Electrical Maintenance Sector"],"prefix":"10.1007","author":[{"given":"R. F.","family":"Tavares","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Nogueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. O.","family":"Batalha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. A.","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. F.","family":"Moralles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Seeberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Mendonca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Goncalves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,27]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2017.01.007","volume":"82","author":"V Akbari","year":"2017","unstructured":"Akbari, V., Salman, F.S.: Multi-vehicle prize collecting arc routing for connectivity problem. Comput. Oper. Res. 82, 52\u201368 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.01.007","journal-title":"Comput. Oper. Res."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.cie.2019.06.051","volume":"135","author":"L Assuncao","year":"2019","unstructured":"Assuncao, L., Mateus, G.R.: A cutting-plane algorithm for the steiner team orienteering problem. Comput. Indust. Eng. 135, 922\u2013939 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.06.051","journal-title":"Comput. Indust. Eng."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1111\/itor.12422","volume":"25","author":"N Bianchessi","year":"2018","unstructured":"Bianchessi, N., Mansini, R., Speranza, M.G.: A branch-and-cut algorithm for the team orienteering problem. Int. Trans. Oper. Res. 25(2), 627\u2013635 (2018). https:\/\/doi.org\/10.1111\/itor.12422","journal-title":"Int. Trans. Oper. Res."},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Dasdemir, E., Batta, R., K\u00f6ksalan, M., Tezcaner \u00d6zt\u00fcrk, D.: Uav routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections. Comput. Oper. Res. 145, 105882 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105882","DOI":"10.1016\/j.cor.2022.105882"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ejor.2022.07.012","volume":"306","author":"A Froger","year":"2023","unstructured":"Froger, A., Sadykov, R.: New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources. Eur. J. Oper. Res. 306(1), 65\u201382 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.asoc.2016.02.040","volume":"43","author":"K Li","year":"2016","unstructured":"Li, K., Tian, H.: A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem. Appl. Soft Comput. 43, 469\u2013479 (2016). https:\/\/doi.org\/10.1016\/j.asoc.2016.02.040","journal-title":"Appl. Soft Comput."},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Rigakis, M., Trachanatzi, D., Marinaki, M., Marinakis, Y.: Tourist group itinerary design: When the firefly algorithm meets the n-person battle of sexes. Knowl.-Based Syst. 228, 107257 (2021). https:\/\/doi.org\/10.1016\/j.knosys.2021.107257","DOI":"10.1016\/j.knosys.2021.107257"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Souza Almeida, L., Ghasemi, A., Goerlandt, F.: E-arcp: An exact solution approach to the collaborative multi-vehicle prize collecting arc routing for connectivity problem. SoftwareX 23, 101465 (2023). https:\/\/doi.org\/10.1016\/j.softx.2023.101465","DOI":"10.1016\/j.softx.2023.101465"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Souza Almeida, L., Goerlandt, F., Pelot, R., S\u00f6rensen, K.: A greedy randomized adaptive search procedure (grasp) for the multi-vehicle prize collecting arc routing for connectivity problem. Comput. Oper. Res. 143, 105804 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.105804","DOI":"10.1016\/j.cor.2022.105804"},{"issue":"11","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1007\/s00170-005-0014-0","volume":"29","author":"L Tang","year":"2006","unstructured":"Tang, L., Wang, X.: Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem. Int. J. Adv. Manufact. Technol. 29(11), 1246\u20131258 (2006). https:\/\/doi.org\/10.1007\/s00170-005-0014-0","journal-title":"Int. J. Adv. Manufact. Technol."},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Trachanatzi, D., Rigakis, M., Marinaki, M., Marinakis, Y.: A firefly algorithm for the environmental prize-collecting vehicle routing problem. Swarm Evol. Comput. 57, 100712 (2020). https:\/\/doi.org\/10.1016\/j.swevo.2020.100712","DOI":"10.1016\/j.swevo.2020.100712"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Trachanatzi, D., Rigakis, M., Marinaki, M., Marinakis, Y.: An interactive preference-guided firefly algorithm for personalized tourist itineraries. Expert Syst. Appl. 159, 113563 (2020). https:\/\/doi.org\/10.1016\/j.eswa.2020.113563","DOI":"10.1016\/j.eswa.2020.113563"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cie.2015.09.001","volume":"90","author":"VF Yu","year":"2015","unstructured":"Yu, V.F., Lin, S.W.: Iterated greedy heuristic for the time-dependent prize-collecting arc routing problem. Comput. Indust. Eng. 90, 54\u201366 (2015). https:\/\/doi.org\/10.1016\/j.cie.2015.09.001","journal-title":"Comput. Indust. Eng."}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77941-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,26]],"date-time":"2025-01-26T08:44:42Z","timestamp":1737881082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77941-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031779404","9783031779411"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77941-1_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"27 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubrovnik","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","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":"13 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2024.sciencesconf.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}