{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T23:24:25Z","timestamp":1781565865110,"version":"3.54.5"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10878-025-01364-6","type":"journal-article","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T07:21:35Z","timestamp":1761376895000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Reinforcement learning-guided adaptive large neighborhood search for vehicle routing problem with time windows"],"prefix":"10.1007","volume":"50","author":[{"given":"Zhaohui","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiao","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weibang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5972-5793","authenticated-orcid":false,"given":"Xiangsheng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,25]]},"reference":[{"issue":"8","key":"1364_CR1","doi-asserted-by":"publisher","first-page":"6707","DOI":"10.1007\/s00500-021-05669-6","volume":"25","author":"N Akbarpour","year":"2021","unstructured":"Akbarpour N, Salehi-Amiri A, Hajiaghaei-Keshteli M, Oliva D (2021) An innovative waste management system in a smart city under stochastic optimization using vehicle routing problem. Soft Comput 25(8):6707\u20136727. https:\/\/doi.org\/10.1007\/s00500-021-05669-6","journal-title":"Soft Comput"},{"issue":"3","key":"1364_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1287\/trsc.1100.0363","volume":"45","author":"C Archetti","year":"2011","unstructured":"Archetti C, Bouchard M, Desaulniers G (2011) Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transp Sci 45(3):285\u2013298. https:\/\/doi.org\/10.1287\/trsc.1100.0363","journal-title":"Transp Sci"},{"issue":"1","key":"1364_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur J Oper Res 218(1):1\u20136. https:\/\/doi.org\/10.1016\/j.ejor.2011.07.037","journal-title":"Eur J Oper Res"},{"issue":"6","key":"1364_CR4","doi-asserted-by":"publisher","first-page":"4754","DOI":"10.1109\/TITS.2023.3334976","volume":"25","author":"A Bogyrbayeva","year":"2024","unstructured":"Bogyrbayeva A, Meraliyev M, Mustakhov T, Dauletbayev B (2024) Machine learning to solve vehicle routing problems: a survey. IEEE Trans Intell Transp Syst 25(6):4754\u20134772. https:\/\/doi.org\/10.1109\/TITS.2023.3334976","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1364_CR5","doi-asserted-by":"publisher","unstructured":"Cappart Q, Moisan T, Rousseau LM, Pr\u00e9mont-Schwarz I, Cire AA (2021) Combining reinforcement learning and constraint programming for combinatorial optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence 35(5):3677\u20133687. https:\/\/doi.org\/10.1609\/aaai.v35i5.16484","DOI":"10.1609\/aaai.v35i5.16484"},{"issue":"5","key":"1364_CR6","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1051\/ro\/2019080","volume":"54","author":"B Chen","year":"2020","unstructured":"Chen B, Qu R, Bai R, Laesanklang W (2020) A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes. RAIRO - Oper Res 54(5):1467\u20131494. https:\/\/doi.org\/10.1051\/ro\/2019080","journal-title":"RAIRO - Oper Res"},{"issue":"4","key":"1364_CR7","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 JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581. https:\/\/doi.org\/10.1287\/opre.12.4.568","journal-title":"Oper Res"},{"issue":"4","key":"1364_CR8","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1287\/trsc.2018.0878","volume":"53","author":"L Costa","year":"2019","unstructured":"Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transp Sci 53(4):946\u2013985. https:\/\/doi.org\/10.1287\/trsc.2018.0878","journal-title":"Transp Sci"},{"issue":"5","key":"1364_CR9","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/s42979-021-00779-2","volume":"2","author":"P Da Costa","year":"2021","unstructured":"Da Costa P, Rhuggenaath J, Zhang Y, Akcay A, Kaymak U (2021) Learning 2-opt heuristics for routing problems via deep reinforcement learning. SN Comput Sci 2(5):388. https:\/\/doi.org\/10.1007\/s42979-021-00779-2","journal-title":"SN Comput Sci"},{"issue":"8","key":"1364_CR10","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.3390\/sym16081030","volume":"16","author":"J Deng","year":"2024","unstructured":"Deng J, Wang J, Wang X, Cai Y, Liu P (2024) Multi-Task Multi-Objective Evolutionary Search Based on Deep Reinforcement Learning for Multi-Objective Vehicle Routing Problems with Time Windows. SYMMETRY-BASEL 16(8):1030. https:\/\/doi.org\/10.3390\/sym16081030","journal-title":"SYMMETRY-BASEL"},{"key":"1364_CR11","doi-asserted-by":"publisher","unstructured":"Dixit A, Mishra A, Shukla A (2019) Vehicle Routing Problem with Time Windows Using Meta-Heuristic Algorithms: A Survey. In: Yadav N, Yadav A, Bansal JC, Deep K, Kim JH (eds) Harmony Search and Nature Inspired Optimization Algorithms, vol 741, Springer Singapore, pp 539\u2013546, https:\/\/doi.org\/10.1007\/978-981-13-0761-4_52","DOI":"10.1007\/978-981-13-0761-4_52"},{"issue":"4","key":"1364_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339. https:\/\/doi.org\/10.1109\/MCI.2006.329691","journal-title":"IEEE Comput Intell Mag"},{"key":"1364_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104919","volume":"118","author":"DL Enthoven","year":"2020","unstructured":"Enthoven DL, Jargalsaikhan B, Roodbergen KJ, Uit Het Broek MAJ, Schrotenboer AH (2020) The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers. Comput Oper Res 118:104919. https:\/\/doi.org\/10.1016\/j.cor.2020.104919","journal-title":"Comput Oper Res"},{"key":"1364_CR14","unstructured":"Falkner JK, Schmidt-Thieme L (2020) Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention. arXiv:2006.09100"},{"key":"1364_CR15","doi-asserted-by":"publisher","unstructured":"Fernandes FC, De\u00a0Souza SR, Silva MAL, Borges HE, Ribeiro FF (2009) A multiagent architecture for solving combinatorial optimization problems through metaheuristics. In: 2009 IEEE International Conference on Systems, Man and Cybernetics, IEEE, pp 3071\u20133076, https:\/\/doi.org\/10.1109\/ICSMC.2009.5345934","DOI":"10.1109\/ICSMC.2009.5345934"},{"key":"1364_CR16","unstructured":"Gambardella LM, Taillard E, Agazzi G (1999) MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. Technical Report, Istituto Dalle Molle Di Studi Sull Intelligenza Artificiale"},{"key":"1364_CR17","unstructured":"Gao L, Chen M, Chen Q, Luo G, Zhu N, Liu Z (2020) Learn to Design the Heuristics for Vehicle Routing Problem. arXiv:2002.08539"},{"key":"1364_CR18","doi-asserted-by":"publisher","unstructured":"Gupta A, Ghosh S, Dhara A (2022) Deep Reinforcement Learning Algorithm for Fast Solutions to Vehicle Routing Problem with Time-Windows. In: Proceedings of the 5th Joint International Conference on Data Science & Management of Data (9th ACM IKDD CODS and 27th COMAD), ACM, pp 236\u2013240, https:\/\/doi.org\/10.1145\/3493700.3493723","DOI":"10.1145\/3493700.3493723"},{"issue":"12","key":"1364_CR19","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0305-0548(03)00155-2","volume":"31","author":"S Ho","year":"2004","unstructured":"Ho S, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 31(12):1947\u20131964. https:\/\/doi.org\/10.1016\/S0305-0548(03)00155-2","journal-title":"Comput Oper Res"},{"key":"1364_CR20","doi-asserted-by":"publisher","unstructured":"Hottung A, Tierney K (2020) Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem. https:\/\/doi.org\/10.3233\/FAIA200124, arXiv:1911.09539","DOI":"10.3233\/FAIA200124"},{"key":"1364_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106791","volume":"172","author":"SN Johnn","year":"2024","unstructured":"Johnn SN, Darvariu VA, Handl J, Kalcsics J (2024) A graph reinforcement learning framework for neural adaptive large neighbourhood search. Comput Oper Res 172:106791. https:\/\/doi.org\/10.1016\/j.cor.2024.106791","journal-title":"Comput Oper Res"},{"issue":"1","key":"1364_CR22","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ejor.2023.01.017","volume":"309","author":"J Kallestad","year":"2023","unstructured":"Kallestad J, Hasibi R, Hemmati A, S\u00f6rensen K (2023) A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems. Eur J Oper Res 309(1):446\u2013468. https:\/\/doi.org\/10.1016\/j.ejor.2023.01.017","journal-title":"Eur J Oper Res"},{"issue":"4","key":"1364_CR23","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/TITS.2015.2395536","volume":"16","author":"G Kim","year":"2015","unstructured":"Kim G, Ong YS, Heng CK, Tan PS, Zhang NA (2015) City vehicle routing problem (city VRP): a review. IEEE Trans Intell Transp Syst 16(4):1654\u20131666. https:\/\/doi.org\/10.1109\/TITS.2015.2395536","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1364_CR24","unstructured":"Kool W, van Hoof H, Welling M (2019) Attention, Learn to Solve Routing Problems! arXiv:1803.08475"},{"key":"1364_CR25","doi-asserted-by":"publisher","unstructured":"Kosolsombat S, Ratanavilisagul C (2023) Applied Deep Reinforcement Learning for Solving the Vehicle Routing Problem with Time Windows. In: 2023 8th International Conference on Computational Intelligence and Applications (ICCIA), IEEE, pp 21\u201325, https:\/\/doi.org\/10.1109\/ICCIA59741.2023.00012","DOI":"10.1109\/ICCIA59741.2023.00012"},{"key":"1364_CR26","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.cor.2015.08.008","volume":"66","author":"B Li","year":"2016","unstructured":"Li B, Krushinsky D, Van Woensel T, Reijers HA (2016) An adaptive large neighborhood search heuristic for the share-a-ride problem. Comput Oper Res 66:170\u2013180. https:\/\/doi.org\/10.1016\/j.cor.2015.08.008","journal-title":"Comput Oper Res"},{"issue":"6","key":"1364_CR27","doi-asserted-by":"publisher","first-page":"3103","DOI":"10.1109\/TCYB.2020.2977661","volume":"51","author":"K Li","year":"2021","unstructured":"Li K, Zhang T, Wang R (2021) Deep reinforcement learning for multiobjective optimization. IEEE Trans Cybernet 51(6):3103\u20133114. https:\/\/doi.org\/10.1109\/TCYB.2020.2977661","journal-title":"IEEE Trans Cybernet"},{"issue":"1","key":"1364_CR28","doi-asserted-by":"publisher","first-page":"23809","DOI":"10.1038\/s41598-024-74432-2","volume":"14","author":"S Liu","year":"2024","unstructured":"Liu S, Sun J, Duan X, Liu G (2024) Parallel adaptive large neighborhood search based on spark to solve VRPTW. Sci Rep 14(1):23809. https:\/\/doi.org\/10.1038\/s41598-024-74432-2","journal-title":"Sci Rep"},{"issue":"15","key":"1364_CR29","doi-asserted-by":"publisher","first-page":"12004","DOI":"10.3390\/su151512004","volume":"15","author":"X Liu","year":"2023","unstructured":"Liu X, Chen YL, Por LY, Ku CS (2023) A systematic literature review of vehicle routing problems with time windows. Sustainability 15(15):12004. https:\/\/doi.org\/10.3390\/su151512004","journal-title":"Sustainability"},{"key":"1364_CR30","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.eswa.2019.04.056","volume":"131","author":"MA Lopes Silva","year":"2019","unstructured":"Lopes Silva MA, De Souza SR, Freitas Souza MJ, Bazzan ALC (2019) A reinforcement learning-based multi-agent framework applied for solving routing and scheduling problems. Expert Syst Appl 131:148\u2013171. https:\/\/doi.org\/10.1016\/j.eswa.2019.04.056","journal-title":"Expert Syst Appl"},{"key":"1364_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.107080","volume":"153","author":"LDC Martins","year":"2021","unstructured":"Martins LDC, De La Torre R, Corlu CG, Juan AA, Masmoudi MA (2021) Optimizing ride-sharing operations in smart sustainable cities: challenges and the need for agile algorithms. Comput Ind Eng 153:107080. https:\/\/doi.org\/10.1016\/j.cie.2020.107080","journal-title":"Comput Ind Eng"},{"key":"1364_CR32","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1016\/j.trpro.2017.05.453","volume":"25","author":"H Mei","year":"2017","unstructured":"Mei H, Jingshuai Y, Teng M, Xiuli L, Ting W (2017) The modeling of milk-run vehicle routing problem based on improved c-w algorithm that joined time window. Transportation Research Procedia 25:716\u2013728. https:\/\/doi.org\/10.1016\/j.trpro.2017.05.453","journal-title":"Transportation Research Procedia"},{"key":"1364_CR33","unstructured":"Nazari M, Oroojlooy A, Snyder L, Takac M (2018) Reinforcement Learning for Solving the Vehicle Routing Problem. In: Advances in Neural Information Processing Systems, Curran Associates, Inc., vol\u00a031"},{"issue":"8","key":"1364_CR34","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403\u20132435. https:\/\/doi.org\/10.1016\/j.cor.2005.09.012","journal-title":"Comput Oper Res"},{"key":"1364_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107252","volume":"156","author":"W Qin","year":"2021","unstructured":"Qin W, Zhuang Z, Huang Z, Huang H (2021) A novel reinforcement learning-based hyper-heuristic for heterogeneous vehicle routing problem. Comput Ind Eng 156:107252. https:\/\/doi.org\/10.1016\/j.cie.2021.107252","journal-title":"Comput Ind Eng"},{"issue":"10","key":"1364_CR36","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1016\/j.cor.2011.11.016","volume":"39","author":"Y Qu","year":"2012","unstructured":"Qu Y, Bard JF (2012) A grasp with adaptive large neighborhood search for pickup and delivery problems with transshipment. Comput Oper Res 39(10):2439\u20132456. https:\/\/doi.org\/10.1016\/j.cor.2011.11.016","journal-title":"Comput Oper Res"},{"key":"1364_CR37","doi-asserted-by":"publisher","unstructured":"Reijnen R, Zhang Y, Lau HC, Bukhsh Z (2024) Online control of adaptive large neighborhood search using deep reinforcement learning. In: Proceedings of the International Conference on Automated Planning and Scheduling 34:475\u2013483. https:\/\/doi.org\/10.1609\/icaps.v34i1.31507","DOI":"10.1609\/icaps.v34i1.31507"},{"key":"1364_CR38","doi-asserted-by":"publisher","unstructured":"Republic DoTaLIoTaBi\u010cBC, Je\u0159\u00e1bek K, Majercak P, Kliestik T, Valaskova K (2016) Application of Clark and Wright\u2019s Savings Algorithm Model to Solve Routing Problem in Supply Logistics. Na\u0161e more 63(3):115\u2013119, https:\/\/doi.org\/10.17818\/NM\/2016\/SI7","DOI":"10.17818\/NM\/2016\/SI7"},{"issue":"4","key":"1364_CR39","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. https:\/\/doi.org\/10.1287\/trsc.1050.0135","journal-title":"Transp Sci"},{"issue":"5","key":"1364_CR40","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s10732-018-9377-x","volume":"24","author":"A Santini","year":"2018","unstructured":"Santini A, Ropke S, Hvattum LM (2018) A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic. J Heuristics 24(5):783\u2013815. https:\/\/doi.org\/10.1007\/s10732-018-9377-x","journal-title":"J Heuristics"},{"key":"1364_CR41","doi-asserted-by":"publisher","unstructured":"Schulman J, Wolski F, Dhariwal P, Radford A, Klimov O (2017) Proximal Policy Optimization Algorithms. https:\/\/doi.org\/10.48550\/arXiv.1707.06347, arXiv:1707.06347","DOI":"10.48550\/arXiv.1707.06347"},{"key":"1364_CR42","doi-asserted-by":"publisher","unstructured":"Shaw P (1998) Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Goos G, Hartmanis J, Leeuwen JV, Maher M, Puget JF (eds) Principles and Practice of Constraint Programming \u2014 CP98, vol 1520, Springer Berlin Heidelberg, pp 417\u2013431, https:\/\/doi.org\/10.1007\/3-540-49481-2_30","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"2","key":"1364_CR43","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Oper Res 35(2):254\u2013265 arXiv:170697","journal-title":"Oper Res"},{"key":"1364_CR44","doi-asserted-by":"publisher","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, https:\/\/doi.org\/10.1137\/1.9780898718515","DOI":"10.1137\/1.9780898718515"},{"issue":"2","key":"1364_CR45","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2020.10.045","volume":"292","author":"R Turke\u0161","year":"2021","unstructured":"Turke\u0161 R, S\u00f6rensen K, Hvattum LM (2021) Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search. Eur J Oper Res 292(2):423\u2013442. https:\/\/doi.org\/10.1016\/j.ejor.2020.10.045","journal-title":"Eur J Oper Res"},{"issue":"8","key":"1364_CR46","doi-asserted-by":"publisher","first-page":"5375","DOI":"10.1016\/j.asoc.2011.05.021","volume":"11","author":"Z Ursani","year":"2011","unstructured":"Ursani Z, Essam D, Cornforth D, Stocker R (2011) Localized genetic algorithm for vehicle routing problem with time windows. Appl Soft Comput 11(8):5375\u20135390. https:\/\/doi.org\/10.1016\/j.asoc.2011.05.021","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1364_CR47","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ejor.2024.05.033","volume":"322","author":"S Voigt","year":"2025","unstructured":"Voigt S (2025) A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems. Eur J Oper Res 322(2):357\u2013375. https:\/\/doi.org\/10.1016\/j.ejor.2024.05.033","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1364_CR48","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/TETCI.2024.3444698","volume":"9","author":"C Wang","year":"2025","unstructured":"Wang C, Cao M, Jiang H, Xiang X, Zhang X (2025) A deep reinforcement learning-based adaptive large neighborhood search for capacitated electric vehicle routing problems. IEEE Trans Emerg Top Comput Intell 9(1):131\u2013144. https:\/\/doi.org\/10.1109\/TETCI.2024.3444698","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"1364_CR49","doi-asserted-by":"publisher","unstructured":"Wang Z, Yan Q, Wang L, Hei X (2023) Solving the Vehicle Routing Problem with Time Window based on Reinforcement Learning. In: 2023 19th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), IEEE, pp 1\u20137, https:\/\/doi.org\/10.1109\/ICNC-FSKD59587.2023.10280869","DOI":"10.1109\/ICNC-FSKD59587.2023.10280869"},{"key":"1364_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105903","volume":"146","author":"ST Windras Mara","year":"2022","unstructured":"Windras Mara ST, Norcahyo R, Jodiawan P, Lusiantoro L, Rifai AP (2022) A survey of adaptive large neighborhood search algorithms and applications. Comput Oper Res 146:105903. https:\/\/doi.org\/10.1016\/j.cor.2022.105903","journal-title":"Comput Oper Res"},{"key":"1364_CR51","doi-asserted-by":"crossref","unstructured":"Wu R, Wang R, Hao J, Wu Q, Wang P, Niyato D (2024) Multiobjective Vehicle Routing Optimization with Time Windows: A Hybrid Approach Using Deep Reinforcement Learning and NSGA-II. arXiv:2407.13113","DOI":"10.1109\/TITS.2024.3515997"},{"issue":"9","key":"1364_CR52","doi-asserted-by":"publisher","first-page":"5057","DOI":"10.1109\/TNNLS.2021.3068828","volume":"33","author":"Y Wu","year":"2022","unstructured":"Wu Y, Song W, Cao Z, Zhang J, Lim A (2022) Learning improvement heuristics for solving routing problems. IEEE Trans Neural Netw Learn Syst 33(9):5057\u20135069. https:\/\/doi.org\/10.1109\/TNNLS.2021.3068828","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1364_CR53","doi-asserted-by":"publisher","unstructured":"Zhang Y, Wang J, Zhang Z (2022) Edge-based Formulation with Graph Attention Network for Practical Vehicle Routing Problem with Time Windows. In: 2022 International Joint Conference on Neural Networks (IJCNN), IEEE, pp 01\u201308, https:\/\/doi.org\/10.1109\/IJCNN55064.2022.9892537","DOI":"10.1109\/IJCNN55064.2022.9892537"},{"issue":"11","key":"1364_CR54","doi-asserted-by":"publisher","first-page":"7208","DOI":"10.1109\/TITS.2020.3003163","volume":"22","author":"J Zhao","year":"2021","unstructured":"Zhao J, Mao M, Zhao X, Zou J (2021) A hybrid of deep reinforcement learning and local search for the vehicle routing problems. IEEE Trans Intell Transp Syst 22(11):7208\u20137218. https:\/\/doi.org\/10.1109\/TITS.2020.3003163","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1364_CR55","doi-asserted-by":"publisher","unstructured":"Zhong Y, Pan X (2007) A Hybrid Optimization Solution to VRPTW Based on Simulated Annealing. In: 2007 IEEE International Conference on Automation and Logistics, IEEE, pp 3113\u20133117, https:\/\/doi.org\/10.1109\/ICAL.2007.4339117","DOI":"10.1109\/ICAL.2007.4339117"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01364-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01364-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01364-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T15:03:17Z","timestamp":1767193397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01364-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,25]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1364"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01364-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,25]]},"assertion":[{"value":"25 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"35"}}