{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:49Z","timestamp":1750220389080,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T00:00:00Z","timestamp":1625616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The National Centre for Research and Development","award":["POIR.01.01.01-00-0012\/19"],"award-info":[{"award-number":["POIR.01.01.01-00-0012\/19"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,7]]},"DOI":"10.1145\/3449726.3459574","type":"proceedings-article","created":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T14:50:12Z","timestamp":1625755812000},"page":"121-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Effective recombination operators for the family of vehicle routing problems"],"prefix":"10.1145","author":[{"given":"Piotr","family":"Cybula","sequence":"first","affiliation":[{"name":"University of Lodz, Emapa S.A., Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Rogalski","sequence":"additional","affiliation":[{"name":"University of Lodz, Emapa S.A., Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Sielski","sequence":"additional","affiliation":[{"name":"University of Lodz, Emapa S.A., Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Jaszkiewicz","sequence":"additional","affiliation":[{"name":"Poznan University of Technology, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemys\u0142aw","family":"Pe\u0142ka","sequence":"additional","affiliation":[{"name":"Emapa S.A., Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Elhadja Chaalal, and Aziz Moukrim.","author":"Amarouche Youcef","year":"2020","unstructured":"Youcef Amarouche , Rym Nesrine Guibadj , Elhadja Chaalal, and Aziz Moukrim. 2020 . Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows. COMPUTERS & OPERATIONS RESEARCH 123 (NOV 2020). Youcef Amarouche, Rym Nesrine Guibadj, Elhadja Chaalal, and Aziz Moukrim. 2020. Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows. COMPUTERS & OPERATIONS RESEARCH 123 (NOV 2020)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G"},{"key":"e_1_3_2_1_3_1","volume-title":"SI (JUN","author":"Curtois Timothy","year":"2018","unstructured":"Timothy Curtois , Dario Landa-Silva , Yi Qu , and Wasakorn Laesanklang . 2018. Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows. EURO JOURNAL ON TRANSPORTATION AND LOGISTICS 7, 2 , SI (JUN 2018 ), 151--192. Timothy Curtois, Dario Landa-Silva, Yi Qu, and Wasakorn Laesanklang. 2018. Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows. EURO JOURNAL ON TRANSPORTATION AND LOGISTICS 7, 2, SI (JUN 2018), 151--192."},{"volume-title":"A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows","author":"Gehring Hermann","key":"e_1_3_2_1_4_1","unstructured":"Hermann Gehring and J\u00f6rg Homberger . 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows . In University of Jyvaskyla . 57--64. Hermann Gehring and J\u00f6rg Homberger. 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In University of Jyvaskyla. 57--64."},{"key":"e_1_3_2_1_5_1","volume-title":"MISTA 2015: Proceedings of the 7th Multidisciplinary International Scheduling Conference, Prague, Czech Republic. 276--295","author":"Gunawan Aldy","year":"2015","unstructured":"Aldy Gunawan , Hoong Chuin Lau , and Kun Lu . 2015 . SAILS: Hybrid algorithm for the Team Orienteering Problem with Time Windows . In MISTA 2015: Proceedings of the 7th Multidisciplinary International Scheduling Conference, Prague, Czech Republic. 276--295 . Aldy Gunawan, Hoong Chuin Lau, and Kun Lu. 2015. SAILS: Hybrid algorithm for the Team Orienteering Problem with Time Windows. In MISTA 2015: Proceedings of the 7th Multidisciplinary International Scheduling Conference, Prague, Czech Republic. 276--295."},{"key":"e_1_3_2_1_6_1","unstructured":"H.B. Li and A. Lim. 2001. A metaheuristic for the pickup and delivery problem with time windows. In ICTAI 2001: 13TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE PROCEEDINGS (Proceedings-International Conference on Tools With Artificial Intelligence). IEEE Comp Soc; IEEE CS Virtual Intelligence Task Force; Informat Technol Res Inst; Wright State Univ; AIIS Inc 160--167. 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2001) DALLAS TX NOV 07-09 2001.  H.B. Li and A. Lim. 2001. A metaheuristic for the pickup and delivery problem with time windows. In ICTAI 2001: 13TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE PROCEEDINGS (Proceedings-International Conference on Tools With Artificial Intelligence) . IEEE Comp Soc; IEEE CS Virtual Intelligence Task Force; Informat Technol Res Inst; Wright State Univ; AIIS Inc 160--167. 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2001) DALLAS TX NOV 07-09 2001."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.022"},{"key":"e_1_3_2_1_8_1","first-page":"536","article-title":"A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6238 LNCS","volume":"1","author":"Nagata Y.","year":"2010","unstructured":"Y. Nagata and S. Kobayashi . 2010 . A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6238 LNCS , PART 1 (2010), 536 -- 545 . Y. Nagata and S. Kobayashi. 2010. A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6238 LNCS, PART 1 (2010), 536--545.","journal-title":"PART"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.018"}],"event":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lille France","acronym":"GECCO '21"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449726.3459574","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449726.3459574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:34Z","timestamp":1750191514000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449726.3459574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,7]]},"references-count":9,"alternative-id":["10.1145\/3449726.3459574","10.1145\/3449726"],"URL":"https:\/\/doi.org\/10.1145\/3449726.3459574","relation":{},"subject":[],"published":{"date-parts":[[2021,7,7]]},"assertion":[{"value":"2021-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}