Insertion heuristic algorithm for dynamic vehicle routing problem with time window

2010 ◽  
Author(s):  
Lv Meidan ◽  
Sheng yehua ◽  
Wang jing ◽  
Zheng Feifei
Keyword(s):  
Vehicle Routing ◽  
Heuristic Algorithm ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem ◽  
Insertion Heuristic

Dynamic Vehicle Routing Problem and its Algorithm Analysis

2010 ◽  
Vol 129-131 ◽  
pp. 1381-1384
Author(s):  
Lu Lin
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Research Direction ◽  
Algorithm Analysis ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem ◽  
Moving Vehicle ◽  
Strong Dynamic

Based on systematically illustrating the current research of dynamic vehicle routing problem and one-off optimization strategies, the paper takes dynamic vehicle routing problem with time window as the study object, proposed a new INTER-SQM dynamic programming strategy to optimize the traffic path of moving vehicle, which highlights the robustness of INTER-SQM strategy, the corresponding ant colony optimization is presented also. Random test compares the operating performance of various optimization strategies in different strong dynamic degrees scenario, discusses the characteristics of the INTER-SQM strategy and points out the research direction of dynamic vehicle routing problem.

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.

Sign in / Sign up

Export Citation Format

Share Document