{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T06:05:06Z","timestamp":1750831506787,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700545"},{"type":"electronic","value":"9783031700552"}],"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-70055-2_3","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:02:54Z","timestamp":1725649374000},"page":"36-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["GPGLS: Genetic Programming Guided Local Search for\u00a0Large-Scale Vehicle Routing Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5667-3325","authenticated-orcid":false,"given":"Saining","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8371-559X","authenticated-orcid":false,"given":"Joao Guilherme","family":"Cavalcanti Costa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0682-1363","authenticated-orcid":false,"given":"Yi","family":"Mei","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4463-9538","authenticated-orcid":false,"given":"Mengjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.03.006","volume":"107","author":"F Arnold","year":"2019","unstructured":"Arnold, F., Gendreau, M., S\u00f6rensen, K.: Efficiently solving very large-scale routing problems. Comput. Oper. Res. 107, 32\u201342 (2019)","journal-title":"Comput. Oper. Res."},{"key":"3_CR2","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."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.cor.2018.02.007","volume":"106","author":"F Arnold","year":"2019","unstructured":"Arnold, F., S\u00f6rensen, K.: What makes a VRP solution good? the generation of problem-specific knowledge for heuristics. Comput. Oper. Res. 106, 280\u2013288 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"JE Bell","year":"2004","unstructured":"Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18(1), 41\u201348 (2004)","journal-title":"Adv. Eng. Inform."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E., et al.: Iterated local search vs. hyper-heuristics: towards general-purpose search algorithms. In: IEEE Congress on Evolutionary Computation, pp.\u00a01\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5586064"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64, 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chen, A.I., Yang, G.K., Wu, Z.M.: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J. Zhejiang Univ.-Sci. A 7(4), 607\u2013614 (2006)","DOI":"10.1631\/jzus.2006.A0607"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Costa, J.G.C., Mei, Y., Zhang, M.: Adaptive search space through evolutionary hyper-heuristics for the large-scale vehicle routing problem. In: 2020 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 2415\u20132422. IEEE (2020)","DOI":"10.1109\/SSCI47803.2020.9308239"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Costa, J.G.C., Mei, Y., Zhang, M.: Guided local search with an adaptive neighbourhood size heuristic for large scale vehicle routing problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 213\u2013221 (2022)","DOI":"10.1145\/3512290.3528865"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Garrido, P., Castro, C.: Stable solving of CVRPs using hyperheuristics. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 255\u2013262 (2009)","DOI":"10.1145\/1569901.1569938"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10732-010-9126-2","volume":"16","author":"P Garrido","year":"2010","unstructured":"Garrido, P., Riff, M.C.: Dvrp: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic. J. Heuristics 16, 795\u2013834 (2010)","journal-title":"J. Heuristics"},{"issue":"12","key":"3_CR13","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":"3_CR14","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated VRP. In: The Vehicle Routing Problem, pp. 129\u2013154. SIAM (2002)","DOI":"10.1137\/1.9780898718515.ch6"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Potvin, J.Y., et\u00a0al.: Handbook of Metaheuristics, vol.\u00a02. Springer, Cham (2010)","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"3_CR16","unstructured":"Gendreau, M., Tarantilis, C.D.: Solving large-scale vehicle routing problems with time windows: the state-of-the-art. Cirrelt Montreal (2010)"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340\u2013349 (1974)","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"3_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discret. Appl. Math. 65(1\u20133), 223\u2013253 (1996)","journal-title":"Discret. Appl. Math."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10732-006-4192-1","volume":"12","author":"SC Ho","year":"2006","unstructured":"Ho, S.C., Gendreau, M.: Path relinking for the vehicle routing problem. J. Heuristics 12, 55\u201372 (2006)","journal-title":"J. Heuristics"},{"issue":"8","key":"3_CR20","first-page":"5809","volume":"8","author":"M Huang","year":"2012","unstructured":"Huang, M., Hu, X.: Large scale vehicle routing problem: an overview of algorithms and an intelligent procedure. Int. J. Innov. Comput. Inf. Control 8(8), 5809\u20135819 (2012)","journal-title":"Int. J. Innov. Comput. Inf. Control"},{"issue":"9","key":"3_CR21","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J Kyt\u00f6joki","year":"2007","unstructured":"Kyt\u00f6joki, J., Nuortio, T., Br\u00e4ysy, O., Gendreau, M.: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput. Oper. Res. 34(9), 2743\u20132757 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"3_CR22","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1002\/nav.20261","volume":"54","author":"G Laporte","year":"2007","unstructured":"Laporte, G.: What you should know about the vehicle routing problem. Naval Res. Logist. (NRL) 54(8), 811\u2013819 (2007)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"4","key":"3_CR23","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408\u2013416 (2009)","journal-title":"Transp. Sci."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Laporte, G., Nobert, Y.: A branch and bound algorithm for the capacitated vehicle routing problem. Oper.-Res.-Spektrum 5, 77\u201385 (1983)","DOI":"10.1007\/BF01720015"},{"issue":"2","key":"3_CR25","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"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1109\/TETCI.2023.3296671","volume":"8","author":"XC Liao","year":"2023","unstructured":"Liao, X.C., Chen, W.N., Jia, Y.H., Qiu, W.J.: Towards scalable dynamic traffic assignment with streaming agents: a decentralized control approach using genetic programming. IEEE Trans. Emerg. Top. Comput. Intell. 8, 942\u2013955 (2023)","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"MacLachlan, J., Mei, Y., Zhang, F., Zhang, M.: Genetic programming for vehicle subset selection in ambulance dispatching. In: 2022 IEEE Congress on Evolutionary Computation (CEC), pp.\u00a01\u20138. IEEE (2022)","DOI":"10.1109\/CEC55065.2022.9870323"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10107-020-01523-z","volume":"183","author":"A Pessoa","year":"2020","unstructured":"Pessoa, A., Sadykov, R., Uchoa, E., Vanderbeck, F.: A generic exact solver for vehicle routing and related problems. Math. Program. 183, 483\u2013523 (2020)","journal-title":"Math. Program."},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Sabar, N.R., Zhang, X.J., Song, A.: A math-hyper-heuristic approach for large-scale vehicle routing problems with time windows. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 830\u2013837. IEEE (2015)","DOI":"10.1109\/CEC.2015.7256977"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Sim, K., Hart, E.: A combined generative and selective hyper-heuristic for the vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 1093\u20131100 (2016)","DOI":"10.1145\/2908812.2908942"},{"issue":"10","key":"3_CR32","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"A Subramanian","year":"2013","unstructured":"Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40(10), 2519\u20132531 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"3_CR33","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard, \u00c9., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"issue":"3","key":"3_CR34","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845\u2013858 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"105643","DOI":"10.1016\/j.cor.2021.105643","volume":"140","author":"T Vidal","year":"2022","unstructured":"Vidal, T.: Hybrid genetic search for the CVRP: open-source implementation and swap* neighborhood. Comput. Oper. Res. 140, 105643 (2022)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"3_CR36","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."},{"issue":"3","key":"3_CR37","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658\u2013673 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR38","doi-asserted-by":"publisher","unstructured":"Voudouris, C., Tsang, E.P., Alsheddy, A.: Guided local search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research Management Science, vol. 146, pp. 321\u2013361. Springer, Boston, MA (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_11","DOI":"10.1007\/978-1-4419-1665-5_11"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70055-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:03:26Z","timestamp":1725649406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70055-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700545","9783031700552"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70055-2_3","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":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}