An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem-Reference-Cited by-同舟云学术

An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem

Published:2024-04 Issue: Volume:164 Page:106531
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Sze Jeeu Fong^ORCID,Salhi Said,Wassan Niaz

Publisher

Elsevier BV

Reference64 articles.

1. The secure time-dependent vehicle routing problem with uncertain demands;Allahyari;Comput. Oper. Res.,2021

2. Scenario-based planning for partially dynamic vehicle routing with stochastic customers;Bent;Oper. Res.,2004

3. A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction;Bezerra;Comput. Oper. Res.,2023

4. Variable neighborhood search: The power of change and simplicity;Brimberg;Comput. Oper. Res.,2023

5. The real-time time-dependent vehicle routing problem;Chen;Transp. Res. Part E: Logist. Transp. Rev.,2006

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A practical vehicle routing problem in small and medium cities for fuel consumption minimization;Cleaner Logistics and Supply Chain;2024-09

2. General VNS for asymmetric vehicle routing problem with time and capacity constraints;Computers & Operations Research;2024-07

3. Planning centralised logistics of products with specific characteristics under extreme situations, sudden changes and dynamic conditions;International Journal of Systems Science: Operations & Logistics;2024-06-12