{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:02:48Z","timestamp":1773658968509,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s12065-025-01115-w","type":"journal-article","created":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T04:42:16Z","timestamp":1766119336000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving adaptive large neighborhood search: an evaluation of parallel approaches with deep learning integration"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6393-6346","authenticated-orcid":false,"given":"Carlos Antonio","family":"Marino","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,19]]},"reference":[{"key":"1115_CR1","first-page":"1","volume":"43","author":"BL Golden","year":"2008","unstructured":"Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges. Operations Res\/Comput Sci Interfaces Ser 43:1\u201333","journal-title":"Operations Res\/Comput Sci Interfaces Ser"},{"issue":"3","key":"1115_CR2","first-page":"811","volume":"260","author":"J C\u00e1ceres-Cruz","year":"2017","unstructured":"C\u00e1ceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2017) The vehicle routing problem with stochastic demands: a comprehensive review. Eur J Oper Res 260(3):811\u2013828","journal-title":"Eur J Oper Res"},{"key":"1115_CR3","first-page":"157","volume":"1","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau J-F, Laporte G, Savelsbergh MWP, Vigo D (2007) The vehicle routing problem with time windows. Soc Ind Appl Math 1:157\u2013193","journal-title":"Soc Ind Appl Math"},{"issue":"1","key":"1115_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"TL Magnanti","year":"1984","unstructured":"Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18(1):1\u201355","journal-title":"Transp Sci"},{"key":"1115_CR5","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-1-4419-1665-5_17","volume-title":"Handbook of metaheuristics","author":"TG Crainic","year":"2010","unstructured":"Crainic TG, Toulouse M (2010) Parallel meta-heuristics. Handbook of metaheuristics. Springer, Boston, pp 497\u2013541"},{"issue":"4","key":"1115_CR6","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"key":"1115_CR7","unstructured":"Esmaeili B, Sastry C, Sinha S, Paige B, Kohli P, Siddharth N, Rezende D, Teh YW, Goyal A, Hjelm RD (2019) Structured disentangled representations. In: The 22nd international conference on Artificial Intelligence and statistics. Okinawa. pp 2525\u20132534"},{"key":"1115_CR8","unstructured":"Locatello F, Bauer S, Lucic M, Gelly S, Sch\u00f6lkopf B, Bachem O (2019) Challenging common assumptions in the unsupervised learning of disentangled representations. In: International conference on machine learning 2019, California. pp 4114\u20134124"},{"key":"1115_CR9","unstructured":"Kingma DP, Welling M (2013) Auto-encoding variational Bayes. arXiv preprint arXiv:1312.6114"},{"key":"1115_CR10","unstructured":"Burda Y, Grosse RB, Salakhutdinov R (2016) Importance weighted autoencoders. arXiv preprint arXiv:1509.00519"},{"key":"1115_CR11","unstructured":"Chen RT, Li X, Grosse R, Duvenaud DK (2018) Isolating sources of disentanglement in variational autoencoders. pp 2610\u20132620"},{"key":"1115_CR12","doi-asserted-by":"crossref","unstructured":"Kotary J, Fioretto F, Van Hentenryck P, Wilder B (2021) End-to-End Constrained Optimization Learning: a Survey. arXiv preprint arXiv:2103.16378","DOI":"10.24963\/ijcai.2021\/610"},{"issue":"9","key":"1115_CR13","doi-asserted-by":"crossref","first-page":"4033","DOI":"10.1109\/TNNLS.2020.3016078","volume":"32","author":"Y Wang","year":"2021","unstructured":"Wang Y, Li Z, Chen Y (2021) Learning to design circuits: graph-based generative models for electronic design automation. IEEE Trans Neural Netw Learn Syst 32(9):4033\u20134044","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"8","key":"1115_CR14","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9 Taillard","year":"1993","unstructured":"Taillard \u00c9 (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661\u2013673","journal-title":"Networks"},{"issue":"9","key":"1115_CR15","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1016\/0305-0548(94)90073-6","volume":"21","author":"B-L Garcia","year":"1994","unstructured":"Garcia B-L, Potvin J-Y, Rousseau J-M (1994) A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Comput Operations Res 21(9):1025\u20131033","journal-title":"Comput Operations Res"},{"issue":"3","key":"1115_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"C-N Fiechter","year":"1994","unstructured":"Fiechter C-N (1994) A parallel tabu search algorithm for large traveling salesman problems. Discret Appl Math 51(3):243\u2013267","journal-title":"Discret Appl Math"},{"issue":"4","key":"1115_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Guertin F, Potvin J-Y, Taillard \u00c9 (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33(4):381\u2013390","journal-title":"Transp Sci"},{"issue":"9","key":"1115_CR18","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","volume":"39","author":"J-F Cordeau","year":"2012","unstructured":"Cordeau J-F, Maischberger M (2012) A parallel iterated tabu search heuristic for vehicle routing problems. Comput Operations Res 39(9):2033\u20132050","journal-title":"Comput Operations Res"},{"key":"1115_CR19","first-page":"185","volume-title":"Parallel algorithms for solving rich vehicle routing problems","author":"M Blocho","year":"2020","unstructured":"Blocho M (2020) Parallel algorithms for solving rich vehicle routing problems. Elsevier, Amsterdam, pp 185\u2013201"},{"key":"1115_CR20","first-page":"398","volume-title":"Parallel genetic algorithms, population genetics and combinatorial optimization","author":"H M\u00fchlenbein","year":"1989","unstructured":"M\u00fchlenbein H (1989) Parallel genetic algorithms, population genetics and combinatorial optimization. Springer, Cham, pp 398\u2013406"},{"key":"1115_CR21","first-page":"57","volume":"2","author":"H Gehring","year":"1999","unstructured":"Gehring H, Homberger J (1999) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows 2:57\u201364","journal-title":"A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows"},{"issue":"1","key":"1115_CR22","first-page":"35","volume":"18","author":"H Gehring","year":"2001","unstructured":"Gehring H, Homberger J (2001) A parallel two-phase metaheuristic for routing problems with time-windows. Asia Pac J Operational Res 18(1):35\u201348","journal-title":"Asia Pac J Operational Res"},{"issue":"12","key":"1115_CR23","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1016\/S0305-0548(03)00163-1","volume":"31","author":"J Berger","year":"2004","unstructured":"Berger J, Barkaoui M (2004) A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Comput Operations Res 31(12):2037\u20132053","journal-title":"Comput Operations Res"},{"key":"1115_CR24","unstructured":"Er HR, Erdogan N (2014) Parallel genetic algorithm to solve traveling salesman problem on MapReduce framework using Hadoop cluster. arXiv preprint arXiv:1401.6267"},{"issue":"4","key":"1115_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1080\/10798587.2005.10642906","volume":"11","author":"L Wang","year":"2005","unstructured":"Wang L, Maciejewski AA, Siegel HJ, Roychowdhury VP, Eldridge BD (2005) A study of five parallel approaches to a genetic algorithm for the traveling salesman problem. Intell Autom Soft Comput 11(4):217\u2013234","journal-title":"Intell Autom Soft Comput"},{"issue":"9","key":"1115_CR26","doi-asserted-by":"publisher","first-page":"9769","DOI":"10.1109\/TKDE.2023.3249799","volume":"35","author":"Z Jianan","year":"2023","unstructured":"Jianan Z, Yaoxin W, Zhiguang C, Wen S, Jie Z, Zhenghua C (2023) Learning large neighborhood search for vehicle routing in airport ground handling. IEEE Trans Knowl Data Eng 35(9):9769\u20139784. https:\/\/doi.org\/10.1109\/TKDE.2023.3249799","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1115_CR27","unstructured":"Fu L, Xi L, Yaoxin W, Zhenkun W, Tong X, Mingxuan Y, Qingfu Z (2025) Boosting neural combinatorial optimization for large-scale vehicle routing problems. In: Proceedings of the international conference on representation Learning (ICLR) 2025."},{"key":"1115_CR28","first-page":"399","volume-title":"Large neighborhood search","author":"D Pisinger","year":"2010","unstructured":"Pisinger D, Ropke S (2010) Large neighborhood search. Springer, Cham, pp 399\u2013419"},{"key":"1115_CR29","first-page":"473","volume-title":"Meta-heuristics","author":"P Kilby","year":"1999","unstructured":"Kilby P, Prosser P, Shaw P (1999) Guided local search for the vehicle routing problem. Meta-heuristics. Springer, Boston, pp 473\u2013486"},{"issue":"1","key":"1115_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/trsc.1090.0290","volume":"44","author":"G Laporte","year":"2010","unstructured":"Laporte G, Musmanno R, Vocaturo F (2010) An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transp Sci 44(1):125\u2013135","journal-title":"Transp Sci"},{"issue":"2","key":"1115_CR31","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290(2):405\u2013421","journal-title":"Eur J Oper Res"},{"issue":"13","key":"1115_CR32","doi-asserted-by":"publisher","first-page":"15600","DOI":"10.1007\/s10489-022-03191-2","volume":"52","author":"Z Zhou","year":"2022","unstructured":"Zhou Z, Zhu P, Zeng Z, Xiao J, Lu H, Zhou Z (2022) Robot navigation in a crowd by integrating deep reinforcement learning and online planning. Appl Intell 52(13):15600\u201315616","journal-title":"Appl Intell"},{"key":"1115_CR33","unstructured":"Ke X, Zhang J, Pan S et al. (2020) Combining graph neural networks with adaptive large neighborhood search for solving the traveling salesman problem"},{"key":"1115_CR34","unstructured":"Nazari M, Oroojlooy A, Snyder LV, Tak\u00e1c M (2018) Reinforcement learning for solving the vehicle routing problem. arXiv preprint arXiv:1802.04240"},{"key":"1115_CR35","first-page":"17388","volume":"34","author":"Y Wu","year":"2021","unstructured":"Wu Y, Song W, Cao Z, Zhang J (2021) Learning large neighborhood search policy for integer programming. Adv Neural Inf Process Syst 34:17388\u201317399","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"1115_CR36","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290(2):405\u2013421","journal-title":"Eur J Oper Res"},{"key":"1115_CR37","first-page":"121","volume":"54","author":"G Gange","year":"2021","unstructured":"Gange G, Harabor D, Kilby P (2021) Machine learning in combinatorial optimization: a survey. Artif Intell Rev 54:121\u2013146","journal-title":"Artif Intell Rev"},{"issue":"4","key":"1115_CR38","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search: a tutorial. Interfaces 20(4):74\u201394","journal-title":"Interfaces"},{"issue":"11","key":"1115_CR39","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Operations Res 24(11):1097\u20131100","journal-title":"Comput Operations Res"},{"key":"1115_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.121926","volume":"266","author":"CA Marino","year":"2020","unstructured":"Marino CA, Marufuzzaman M (2020) Unsupervised learning for deploying smart charging public infrastructure for electric vehicles in sprawling cities. J Clean Prod 266:121926","journal-title":"J Clean Prod"},{"key":"1115_CR41","unstructured":"Yuanyao C, Rongsheng C, Fu L, Zhenkun W (2025) Improving generalization of neural combinatorial optimization for vehicle routing problems via test-time projection learning. arXiv preprint arXiv:2506.02392"},{"key":"1115_CR42","doi-asserted-by":"publisher","first-page":"87193","DOI":"10.1109\/ACCESS.2025.3569578","volume":"13","author":"N Peri\u0107","year":"2025","unstructured":"Peri\u0107 N, Begovi\u0107 S, Le\u0161i\u0107 V (2025) Optimization of heterogeneous last-mile delivery of fresh products considering traffic congestions and other real-world parameters. IEEE Access 13:87193\u201387207. https:\/\/doi.org\/10.1109\/ACCESS.2025.3569578","journal-title":"IEEE Access"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01115-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-025-01115-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01115-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:09:14Z","timestamp":1773655754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-025-01115-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,19]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1115"],"URL":"https:\/\/doi.org\/10.1007\/s12065-025-01115-w","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,19]]},"assertion":[{"value":"15 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"No applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"7"}}