{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T01:16:45Z","timestamp":1770859005662,"version":"3.50.1"},"reference-count":52,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1016\/j.asoc.2025.114234","type":"journal-article","created":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T07:55:00Z","timestamp":1766130900000},"page":"114234","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Evolving routing and sequencing policies for dynamic vehicle routing problem with time windows"],"prefix":"10.1016","volume":"189","author":[{"given":"Nguyen Thi","family":"Tam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2206-4939","authenticated-orcid":false,"given":"Ngo Duy","family":"Anh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7685-6069","authenticated-orcid":false,"given":"Dao Van","family":"Tung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1976-6113","authenticated-orcid":false,"given":"Binh","family":"Huynh Thi Thanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le Trong","family":"Vinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2025.114234_bib0005","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.aej.2022.09.008","article-title":"An improved tabu search algorithm for solving heterogeneous fixed fleet open vehicle routing problem with time windows","volume":"64","author":"Ahmed","year":"2023","journal-title":"Alex. Eng. J."},{"key":"10.1016\/j.asoc.2025.114234_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.energy.2021.122626","article-title":"Dynamic energy scheduling and routing of multiple electric vehicles using deep reinforcement learning","volume":"244","author":"Alqahtani","year":"2022","journal-title":"Energy"},{"issue":"6","key":"10.1016\/j.asoc.2025.114234_bib0015","article-title":"Hybrid genetic algorithms and simulated annealing for multi-trip vehicle routing problem with time windows","volume":"8","author":"Ariyani","year":"2018","journal-title":"Int. J. Electr. Comput. Eng."},{"issue":"3\u20134","key":"10.1016\/j.asoc.2025.114234_bib0020","first-page":"261","article-title":"Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints","volume":"6","author":"Baker","year":"1986","journal-title":"Am. J. Math. Manag. Sci."},{"issue":"1","key":"10.1016\/j.asoc.2025.114234_bib0025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","article-title":"Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints","volume":"218","author":"Baldacci","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2025.114234_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2021.102496","article-title":"Dynamic stochastic electric vehicle routing with safe reinforcement learning","volume":"157","author":"Basso","year":"2022","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"issue":"4","key":"10.1016\/j.asoc.2025.114234_bib0035","first-page":"587","article-title":"Memetic algorithm for the dynamic vehicle routing problem with simultaneous delivery and pickup","volume":"13","author":"Berahhou","year":"2022","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"10.1016\/j.asoc.2025.114234_bib0040","doi-asserted-by":"crossref","first-page":"463","DOI":"10.17535\/crorr.2017.0029","article-title":"Two models of the capacitated vehicle routing problem","volume":"8","author":"Borcinova","year":"2017","journal-title":"Croat. Oper. Res. Rev."},{"issue":"3","key":"10.1016\/j.asoc.2025.114234_bib0045","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1016\/j.ejor.2021.06.021","article-title":"Deep q-learning for same-day delivery with vehicles and drones","volume":"298","author":"Chen","year":"2022","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2025.114234_bib0050","doi-asserted-by":"crossref","first-page":"2935","DOI":"10.1007\/s00500-020-05350-4","article-title":"A multiple ant colony system with random variable neighborhood descent for the dynamic vehicle routing problem with time windows","volume":"25","author":"da Silva Junior","year":"2021","journal-title":"Soft Comput."},{"issue":"1","key":"10.1016\/j.asoc.2025.114234_bib0055","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Manage. Sci."},{"issue":"4","key":"10.1016\/j.asoc.2025.114234_bib0060","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1287\/trsc.2020.0976","article-title":"New exact algorithm for the vehicle routing problem with stochastic demands","volume":"54","author":"Florio","year":"2020","journal-title":"Transp. Sci."},{"issue":"1","key":"10.1016\/j.asoc.2025.114234_bib0065","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1287\/trsc.2020.1002","article-title":"A branch-and-price algorithm for the vehicle routing problem with stochastic demands and probabilistic duration constraints","volume":"55","author":"Florio","year":"2021","journal-title":"Transp. Sci."},{"key":"10.1016\/j.asoc.2025.114234_bib0070","article-title":"A parallel two-phase metaheuristic for routing problems with time windows","volume":"18","author":"Gehring","year":"2001","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"10.1016\/j.asoc.2025.114234_bib0075","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.108489","article-title":"A deep reinforcement learning approach for the meal delivery problem","volume":"243","author":"Jahanshahi","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.asoc.2025.114234_bib0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104606","article-title":"A hybrid algorithm for time-dependent vehicle routing problem with soft time windows and stochastic factors","volume":"109","author":"Jie","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.asoc.2025.114234_bib0085","series-title":"Proceedings of the International Conference on Automated Planning and Scheduling","first-page":"394","article-title":"Deep reinforcement learning approach to solve dynamic vehicle routing problem with stochastic customers","volume":"vol. 30","author":"Joe","year":"2020"},{"issue":"3","key":"10.1016\/j.asoc.2025.114234_bib0090","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1287\/trsc.2021.1042","article-title":"Dynamic ride-hailing with electric vehicles","volume":"56","author":"Kullman","year":"2022","journal-title":"Transp. Sci."},{"key":"10.1016\/j.asoc.2025.114234_bib0095","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107868","article-title":"A hybrid tabu search\u2013variable neighborhood descent algorithm for the cumulative capacitated vehicle routing problem with time windows in humanitarian applications","volume":"164","author":"Kyriakakis","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2025.114234_bib0100","series-title":"Surveys in Combinatorial Optimization, vol. 132, North-Holland Mathematics Studies","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0304-0208(08)73235-3","article-title":"Exact algorithms for the vehicle routing problem**the authors are grateful to the Canadian Natural Sciences and Engineering Research Council (grants a4747 and a5486) and to the Quebec government (Fcac grant 80eq04228) for their financial support","author":"Laporte","year":"1987"},{"key":"10.1016\/j.asoc.2025.114234_bib0105","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101529","article-title":"Handling dynamic capacitated vehicle routing problems based on adaptive genetic algorithm with elastic strategy","volume":"86","author":"Li","year":"2024","journal-title":"Swarm Evol. Comput."},{"issue":"8","key":"10.1016\/j.asoc.2025.114234_bib0110","doi-asserted-by":"crossref","first-page":"11528","DOI":"10.1109\/TITS.2021.3105232","article-title":"Deep reinforcement learning for the electric vehicle routing problem with time windows","volume":"23","author":"Lin","year":"2022","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.asoc.2025.114234_bib0115","doi-asserted-by":"crossref","first-page":"118302","DOI":"10.1109\/ACCESS.2022.3221191","article-title":"A hybrid bso-aco for dynamic vehicle routing problem on real-world road networks","volume":"10","author":"Liu","year":"2022","journal-title":"IEEE Access"},{"key":"10.1016\/j.asoc.2025.114234_bib0120","article-title":"A hybrid brain storm optimization algorithm for dynamic vehicle routing problem with time windows","author":"Liu","year":"2023","journal-title":"IEEE Access"},{"key":"10.1016\/j.asoc.2025.114234_bib0125","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.3390\/jmse12071167","article-title":"A quick pheromone matrix adaptation ant colony optimization for dynamic customers in the vehicle routing problem","volume":"12","author":"Liu","year":"2024","journal-title":"J. Mar. Sci. Eng."},{"issue":"5","key":"10.1016\/j.asoc.2025.114234_bib0130","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TEVC.2012.2227326","article-title":"A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem","volume":"17","author":"Nguyen","year":"2012","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2025.114234_bib0135","first-page":"1","article-title":"On the application of a modified genetic algorithm for solving vehicle routing problems with time windows and split delivery","volume":"52","author":"Olaniyi","year":"2022","journal-title":"IAENG Int. J. Appl. Math."},{"issue":"1","key":"10.1016\/j.asoc.2025.114234_bib0140","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10489-022-03456-w","article-title":"Deep reinforcement learning for the dynamic and uncertain vehicle routing problem","volume":"53","author":"Pan","year":"2023","journal-title":"Applied Intelligence"},{"key":"10.1016\/j.asoc.2025.114234_bib0145","series-title":"Lectures on Global Optimization","volume":"vol. 55","author":"Pardalos","year":"2009"},{"key":"10.1016\/j.asoc.2025.114234_bib0150","series-title":"Proceedings of the Genetic and Evolutionary Computation Conference","first-page":"277","article-title":"Pareto front grid guided multiobjective optimization in dynamic pickup and delivery problem considering two-sided fairness","author":"Phan Duc","year":"2025"},{"issue":"1","key":"10.1016\/j.asoc.2025.114234_bib0155","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/net.21628","article-title":"Dynamic vehicle routing problems: three decades and counting","volume":"67","author":"Psaraftis","year":"2016","journal-title":"Networks"},{"key":"10.1016\/j.asoc.2025.114234_bib0160","article-title":"Recent dynamic vehicle routing problems: a survey","volume":"160","author":"Rios","year":"2021","journal-title":"Comput. Ind. Eng."},{"issue":"10","key":"10.1016\/j.asoc.2025.114234_bib0165","doi-asserted-by":"crossref","first-page":"17491","DOI":"10.1109\/TITS.2022.3150471","article-title":"Memory-based ant colony system approach for multi-source data associated dynamic electric vehicle dispatch optimization","volume":"23","author":"Shi","year":"2022","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"2","key":"10.1016\/j.asoc.2025.114234_bib0170","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/j.asoc.2025.114234_bib0175","article-title":"Solving dynamic vehicle routing problem with time windows by ant colony system with bipartite graph matching","volume":"25","author":"Teng","year":"2024","journal-title":"Egypt. Inform. J."},{"key":"10.1016\/j.asoc.2025.114234_bib0180","article-title":"A matheuristic approach for delivery planning and dynamic vehicle routing in logistics 4.0","author":"Tresca","year":"2024","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.asoc.2025.114234_bib0185","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105856","article-title":"Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions","volume":"146","author":"Voigt","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2025.114234_bib0190","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110122","article-title":"An adaptive large neighborhood search for the multi-depot dynamic vehicle routing problem with time windows","volume":"191","author":"Wang","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2025.114234_bib0195","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.109700","article-title":"The multi-depot pickup and delivery vehicle routing problem with time windows and dynamic demands","volume":"139","author":"Wang","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.asoc.2025.114234_bib0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2024.103503","article-title":"The multidepot vehicle routing problem with intelligent recycling prices and transportation resource sharing","volume":"185","author":"Wang","year":"2024","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"10.1016\/j.asoc.2025.114234_bib0205","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2020.102118","article-title":"Green logistics location-routing problem with eco-packages","volume":"143","author":"Wang","year":"2020","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"10.1016\/j.asoc.2025.114234_bib0210","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2024.103798","article-title":"Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows","volume":"192","author":"Wang","year":"2024","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"10.1016\/j.asoc.2025.114234_bib0215","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117926","article-title":"Collaborative multicenter reverse logistics network design with dynamic customer demands","volume":"206","author":"Wang","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"10.1016\/j.asoc.2025.114234_bib0220","doi-asserted-by":"crossref","first-page":"1702","DOI":"10.3390\/math12111702","article-title":"Solving the vehicle routing problem with time windows using modified rat swarm optimization algorithm based on large neighborhood search","volume":"12","author":"Wei","year":"2024","journal-title":"Mathematics"},{"key":"10.1016\/j.asoc.2025.114234_bib0225","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2024.103954","article-title":"The two-echelon truck-unmanned ground vehicle routing problem with time-dependent travel times","volume":"194","author":"Wei","year":"2025","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"10.1016\/j.asoc.2025.114234_bib0230","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107899","article-title":"A combined ga-ts algorithm for two-echelon dynamic vehicle routing with proactive satellite stations","volume":"164","author":"Xue","year":"2022","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.asoc.2025.114234_bib0235","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1051\/ro\/2024069","article-title":"An improved sequential insertion algorithm and tabu search to vehicle routing problem with time windows","volume":"58","author":"Yue","year":"2024","journal-title":"RAIRO-Oper. Res."},{"key":"10.1016\/j.asoc.2025.114234_bib0240","series-title":"AI 2018: Advances in Artificial Intelligence: 31st Australasian Joint Conference, Wellington, New Zealand, December 11-14, 2018, Proceedings 31","first-page":"472","article-title":"Genetic programming with multi-tree representation for dynamic flexible job shop scheduling","author":"Zhang","year":"2018"},{"issue":"2","key":"10.1016\/j.asoc.2025.114234_bib0245","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.ejor.2022.07.015","article-title":"Solving large-scale dynamic vehicle routing problems with stochastic requests","volume":"306","author":"Zhang","year":"2023","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2025.114234_bib0250","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.3390\/su15021741","article-title":"An adaptive tabu search algorithm for solving the two-dimensional loading constrained vehicle routing problem with stochastic customers","volume":"15","author":"Zhang","year":"2023","journal-title":"Sustainability"},{"key":"10.1016\/j.asoc.2025.114234_bib0255","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109443","article-title":"Reinforcement learning-based approach for dynamic vehicle routing problem with stochastic demand","volume":"182","author":"Zhou","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2025.114234_bib0260","doi-asserted-by":"crossref","DOI":"10.1109\/TITS.2024.3438788","article-title":"Learning-based optimization algorithms for routing problems: bibliometric analysis and literature review","author":"Zhou","year":"2024","journal-title":"IEEE Trans. Intell. Transp. Syst."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494625015479?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494625015479?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T00:40:52Z","timestamp":1770856852000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494625015479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":52,"alternative-id":["S1568494625015479"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2025.114234","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Evolving routing and sequencing policies for dynamic vehicle routing problem with time windows","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2025.114234","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"114234"}}