{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:23:06Z","timestamp":1742923386527,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031530241"},{"type":"electronic","value":"9783031530258"}],"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-53025-8_6","type":"book-chapter","created":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T20:02:12Z","timestamp":1706731332000},"page":"78-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Pattern Mining Heuristic for\u00a0the\u00a0Extension of\u00a0Multi-trip Vehicle Routing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1478-2248","authenticated-orcid":false,"given":"Leila","family":"Karimi","sequence":"first","affiliation":[]},{"given":"Connor","family":"Little","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3187-112X","authenticated-orcid":false,"given":"Salimur","family":"Choudhury","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,1]]},"reference":[{"key":"6_CR1","unstructured":"Solomon\u2019s benchmark instances (2008). https:\/\/www.sintef.no\/projectweb\/top\/vrptw\/solomon-benchmark\/. Accessed 30 Mar 2023"},{"key":"6_CR2","unstructured":"Abdoun, O., Abouchabaka, J., Tajani, C.: Analyzing the performance of mutation operators to solve the travelling salesman problem. arXiv preprint arXiv:1203.3099 (2012)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"107957","DOI":"10.1016\/j.patcog.2021.107957","volume":"116","author":"F Arnold","year":"2021","unstructured":"Arnold, F., Santana, \u00cd., S\u00f6rensen, K., Vidal, T.: PILS: exploring high-order neighborhoods by pattern mining and injection. Pattern Recogn. 116, 107957 (2021)","journal-title":"Pattern Recogn."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.01.002","volume":"105","author":"F Arnold","year":"2019","unstructured":"Arnold, F., S\u00f6rensen, K.: Knowledge-guided local search for the vehicle routing problem. Comput. Oper. Res. 105, 32\u201346 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2009.06.034","volume":"202","author":"N Azi","year":"2010","unstructured":"Azi, N., Gendreau, M., Potvin, J.Y.: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3), 756\u2013763 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.4018\/IJAMC.2016100102","volume":"7","author":"M Berghida","year":"2016","unstructured":"Berghida, M., Boukra, A.: Quantum inspired algorithm for a VRP with heterogeneous fleet mixed backhauls and time windows. Int. J. Appl. Metaheuristic Comput. (IJAMC) 7(4), 18\u201338 (2016)","journal-title":"Int. J. Appl. Metaheuristic Comput. (IJAMC)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1057\/palgrave.jors.2600595","volume":"49","author":"JCS Brand\u00e3o","year":"1998","unstructured":"Brand\u00e3o, J.C.S., Mercer, A.: The multi-trip vehicle routing problem. J. Oper. Res. Soc. 49, 799\u2013805 (1998)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.ejor.2013.06.012","volume":"236","author":"D Cattaruzza","year":"2014","unstructured":"Cattaruzza, D., Absi, N., Feillet, D., Vidal, T.: A memetic algorithm for the multi trip vehicle routing problem. Eur. J. Oper. Res. 236(3), 833\u2013848 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR9","unstructured":"Fleischmann, B.: The vehicle routing problem with multiple use of vehicles. Fachbereich Wirtschaftswissenschaften, Universit\u00e4t Hamburg (1990)"},{"issue":"12","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/S0305-0548(98)00100-2","volume":"26","author":"M Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Musaraganyi, C., Taillard, \u00c9.D.: A Tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 26(12), 1153\u20131173 (1999)","journal-title":"Comput. Oper. Res."},{"key":"6_CR11","first-page":"366","volume":"7","author":"F Hernandez","year":"2010","unstructured":"Hernandez, F., Feillet, D., Giroudeau, R., Naud, O.: An exact method to solve the multitrip vehicle routing problem with time windows and limited duration. TRISTAN 7, 366\u2013369 (2010)","journal-title":"TRISTAN"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.asoc.2014.11.005","volume":"27","author":"S Karakati\u010d","year":"2015","unstructured":"Karakati\u010d, S., Podgorelec, V.: A survey of genetic algorithms for solving multi depot vehicle routing problem. Appl. Soft Comput. 27, 519\u2013532 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"11","key":"6_CR13","doi-asserted-by":"publisher","first-page":"412","DOI":"10.3390\/a15110412","volume":"15","author":"L Karimi","year":"2022","unstructured":"Karimi, L., Nawrin Ferdous, C.: Branch and price algorithm for multi-trip vehicle routing with a variable number of wagons and time windows. Algorithms 15(11), 412 (2022)","journal-title":"Algorithms"},{"key":"6_CR14","unstructured":"Karimi, L., et al.: Algorithms for multi-trip vehicle routing and device to device communications. Ph.D. thesis, Lethbridge, Alta.: Department of Mathematics and Computer Science (2022)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch, S., Chauhan, S.S., Kumar, V.: A review on genetic algorithm: past, present, and future. Multimedia Tools Appl. 80, 8091\u20138126 (2021)","journal-title":"Multimedia Tools Appl."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2015.07.020","volume":"249","author":"\u00c7 Ko\u00e7","year":"2016","unstructured":"Ko\u00e7, \u00c7., Bekta\u015f, T., Jabali, O., Laporte, G.: Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res. 249(1), 1\u201321 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra, J.K., Kan, A.R.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221\u2013227 (1981)","journal-title":"Networks"},{"issue":"22","key":"6_CR18","doi-asserted-by":"publisher","first-page":"4308","DOI":"10.3390\/math10224308","volume":"10","author":"C Little","year":"2022","unstructured":"Little, C., Choudhury, S., Hu, T., Salomaa, K.: Comparison of genetic operators for the multiobjective pickup and delivery problem. Mathematics 10(22), 4308 (2022)","journal-title":"Mathematics"},{"key":"6_CR19","unstructured":"Little, C., et al.: An exploration of heuristics applied to genetic algorithms on the capacitated pickup and delivery problem with time windows. Master\u2019s thesis (2023)"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.cor.2018.07.012","volume":"101","author":"G Macrina","year":"2019","unstructured":"Macrina, G., Pugliese, L.D.P., Guerriero, F., Laporte, G.: The green mixed fleet vehicle routing problem with partial battery recharging and time windows. Comput. Oper. Res. 101, 183\u2013199 (2019)","journal-title":"Comput. Oper. Res."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1016\/j.procs.2015.05.382","volume":"51","author":"S Pace","year":"2015","unstructured":"Pace, S., Turky, A., Moser, I., Aleti, A.: Distributing fibre boards: a practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. Procedia Comput. Sci. 51, 2257\u20132266 (2015)","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ejor.2020.09.022","volume":"291","author":"B Pan","year":"2021","unstructured":"Pan, B., Zhang, Z., Lim, A.: Multi-trip time-dependent vehicle routing problem with time windows. Eur. J. Oper. Res. 291(1), 218\u2013231 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-017-2642-9","volume":"273","author":"PHV Penna","year":"2019","unstructured":"Penna, P.H.V., Subramanian, A., Ochi, L.S., Vidal, T., Prins, C.: A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Ann. Oper. Res. 273(1), 5\u201374 (2019)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1016516326823","volume":"1","author":"C Prins","year":"2002","unstructured":"Prins, C.: Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case. J. Math. Model. Algorithms 1(2), 135\u2013150 (2002)","journal-title":"J. Math. Model. Algorithms"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"106571","DOI":"10.1016\/j.cie.2020.106571","volume":"146","author":"K Sethanan","year":"2020","unstructured":"Sethanan, K., Jamrus, T.: Hybrid differential evolution algorithm and genetic operator for multi-trip vehicle routing problem with backhauls and heterogeneous fleet in the beverage logistics industry. Comput. Ind. Eng. 146, 106571 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"MM Solomon","year":"1988","unstructured":"Solomon, M.M., Desrosiers, J.: Survey paper-time window constrained routing and scheduling problems. Transp. Sci. 22(1), 1\u201313 (1988)","journal-title":"Transp. Sci."},{"issue":"3","key":"6_CR28","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"106189","DOI":"10.1016\/j.cor.2023.106189","volume":"153","author":"BS Vieira","year":"2023","unstructured":"Vieira, B.S., Ribeiro, G.M., Bahiense, L.: Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem. Comput. Oper. Res. 153, 106189 (2023)","journal-title":"Comput. Oper. Res."},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"107649","DOI":"10.1016\/j.cie.2021.107649","volume":"161","author":"E Ya\u011fmur","year":"2021","unstructured":"Ya\u011fmur, E., Kesen, S.E.: Multi-trip heterogeneous vehicle routing problem coordinated with production scheduling: memetic algorithm and simulated annealing approaches. Comput. Ind. Eng. 161, 107649 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"101866","DOI":"10.1016\/j.tre.2020.101866","volume":"135","author":"L Zhen","year":"2020","unstructured":"Zhen, L., Ma, C., Wang, K., Xiao, L., Zhang, W.: Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transp. Res. Part E: Logistics Transp. Rev. 135, 101866 (2020)","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53025-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T20:14:26Z","timestamp":1706732066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53025-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031530241","9783031530258"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53025-8_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ponta Delgada","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ol2a.ipb.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"162","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":"66","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":"0","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":"41% - 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":"4","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)"}}]}}