An EBM Based Dynamic Vehicle Routing Algorithm

2009 ◽  
Author(s):  
Wenxue Cai ◽  
Zefeng Wu ◽  
Xiaoyu Huang ◽  
Huiling Zhong
Keyword(s):  
Vehicle Routing ◽  
Routing Algorithm ◽  
Dynamic Vehicle Routing

scholarly journals A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Shifeng Chen ◽  
Rong Chen ◽  
Jian Gao
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Time Windows ◽  
Harmony Search ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem

The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem. It is usually modelled in a static fashion; however, in practice, new requests by customers arrive after the initial workday plan is in progress. In this case, routes must be replanned dynamically. This paper investigates the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in which customers’ requests either can be known at the beginning of working day or occur dynamically over time. We propose a hybrid heuristic algorithm that combines the harmony search (HS) algorithm and the Variable Neighbourhood Descent (VND) algorithm. It uses the HS to provide global exploration capabilities and uses the VND for its local search capability. In order to prevent premature convergence of the solution, we evaluate the population diversity by using entropy. Computational results on the Lackner benchmark problems show that the proposed algorithm is competitive with the best existing algorithms from the literature.

Recent dynamic vehicle routing problems: a survey

2021 ◽  
pp. 107604
Author(s):  
Brenner Humberto Ojeda Rios ◽  
Eduardo C. Xavier ◽  
Flávio K. Miyazawa ◽  
Pedro Amorim ◽  
Eduardo Curcio ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems
Sign in / Sign up

Export Citation Format

Share Document