{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T16:13:56Z","timestamp":1774282436067,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031265037","type":"print"},{"value":"9783031265044","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_2","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"17-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A BRKGA with\u00a0Implicit Path-Relinking for\u00a0the\u00a0Vehicle Routing Problem with\u00a0Occasional Drivers and\u00a0Time Windows"],"prefix":"10.1007","author":[{"given":"Paola","family":"Festa","sequence":"first","affiliation":[]},{"given":"Francesca","family":"Guerriero","sequence":"additional","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"Edoardo","family":"Scalzo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Andrade, C.E., Miyazawa, F.K., Resende, M.G.C.: Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013, New York, NY, USA, pp. 463\u2013470 (2013)","DOI":"10.1145\/2463372.2463434"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2019.11.037","volume":"289","author":"CE Andrade","year":"2021","unstructured":"Andrade, C.E., Toso, R.F., Gon\u00e7alves, J.F., Resende, M.G.C.: The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications. Eur. J. Oper. Res. 289(1), 17\u201330 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ejor.2016.03.049","volume":"254","author":"C Archetti","year":"2016","unstructured":"Archetti, C., Savelsbergh, M., Speranza, M.G.: The vehicle routing problem with occasional drivers. Eur. J. Oper. Res. 254(2), 472\u2013480 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"105144","DOI":"10.1016\/j.cor.2020.105144","volume":"127","author":"C Archetti","year":"2021","unstructured":"Archetti, C., Guerriero, F., Macrina, G.: The online vehicle routing problem with occasional drivers. Comput. Oper. Res. 127, 105144 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2_CR5","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. INFORMS J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"INFORMS J. Comput."},{"key":"2_CR6","series-title":"AIRO Springer Series","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-86841-3_18","volume-title":"Optimization and Decision Science","author":"L Di Puglia Pugliese","year":"2021","unstructured":"Di Puglia Pugliese, L., Guerriero, F., Macrina, G., Scalzo, E.: Crowd-shipping and occasional depots in the last mile delivery. In: Cerulli, R., Dell\u2019Amico, M., Guerriero, F., Pacciarelli, D., Sforza, A. (eds.) Optimization and Decision Science. ASS, vol. 7, pp. 213\u2013225. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86841-3_18"},{"issue":"5","key":"2_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10732-010-9142-2","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C., Mendes, J.J.M.: A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. J. Heurist. 17(5), 467\u2013486 (2011)","journal-title":"J. Heurist."},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1002\/net.21685","volume":"68","author":"MC Lopes","year":"2016","unstructured":"Lopes, M.C., Andrade, C.E., Queiroz, T.A., Resende, M.G.C., Miyazawa, F.K.: Heuristics for a hub location-routing problem. Networks 68(1), 54\u201390 (2016)","journal-title":"Networks"},{"key":"2_CR9","unstructured":"Lucena, M.L., Andrade, C.E., Resende, M.G.C., Miyazawa, F.K.: Some extensions of biased random-key genetic algorithms. In Proceedings of the Forty-Sixth Brazilian Symposium of Operational Research, pp. 2469\u20132480 (2014)"},{"key":"2_CR10","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"2_CR11","series-title":"AIRO Springer Series","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-030-00473-6_38","volume-title":"New Trends in Emerging Complex Real Life Problems","author":"G Macrina","year":"2018","unstructured":"Macrina, G., Guerriero, F.: The green vehicle routing problem with occasional drivers. In: Daniele, P., Scrimali, L. (eds.) New Trends in Emerging Complex Real Life Problems. ASS, vol. 1, pp. 357\u2013366. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00473-6_38"},{"key":"2_CR12","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-319-67308-0_58","volume-title":"Optimization and Decision Science: Methodologies and Applications","author":"G Macrina","year":"2017","unstructured":"Macrina, G., Di Puglia Pugliese, L., Guerriero, F., Lagan\u00e0, D.: The vehicle routing problem with occasional drivers and time windows. In: Sforza, A., Sterle, C. (eds.) ODS 2017. SPMS, vol. 217, pp. 577\u2013587. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67308-0_58"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Macrina, G., Di Puglia Pugliese, L., Guerriero, F.: A variable neighborhood search for the vehicle routing problem with occasional drivers and time windows. In: Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, vol. 1, pp. 270\u2013277 (2020a)","DOI":"10.5220\/0009193302700277"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Macrina, G., Di Puglia Pugliese, L., Guerriero, F., Laporte, G.: Crowd-shipping with time windows and transshipment nodes. Comput. Oper. Res. 113, 104806 (2020b)","DOI":"10.1016\/j.cor.2019.104806"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Macrina, G., Di Puglia Pugliese, L., Guerriero, F.: Crowd-shipping: a new efficient and eco-friendly delivery strategy. Proc. Manuf. 42, 483\u2013487 (2020c). International Conference on Industry 4.0 and Smart Manufacturing (ISM 2019)","DOI":"10.1016\/j.promfg.2020.02.048"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s11590-011-0322-2","volume":"5","author":"MGC Resende","year":"2011","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Restart strategies for grasp with path-relinking heuristics. Optim. Lett. 5, 467\u2013478 (2011)","journal-title":"Optim. Lett."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s11590-011-0285-3","volume":"6","author":"MGC Resende","year":"2011","unstructured":"Resende, M.G.C., Toso, R.F., Gon\u00e7alves, J.F., Silva, R.M.: A biased random-key genetic algorithm for the Steiner triple covering problem. Optim. Lett. 6, 605\u2013619 (2011)","journal-title":"Optim. Lett."},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1111\/itor.12507","volume":"25","author":"A Reyes","year":"2018","unstructured":"Reyes, A., Ribeiro, C.C.: Extending time-to-target plots to multiple instances. Int. Trans. Oper. Res. 25, 1515\u20131536 (2018)","journal-title":"Int. Trans. Oper. Res."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254\u2013265 (1987)","journal-title":"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-26504-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:02:41Z","timestamp":1688198561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","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":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}