Testing local search move operators on the vehicle routing problem with split deliveries and time windows

2015 ◽  
Vol 56 ◽  
pp. 93-109 ◽  
Author(s):  
Marcus E. McNabb ◽  
Jeffery D. Weir ◽  
Raymond R. Hill ◽  
Shane N. Hall
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Split Deliveries

On-Line Vehicle Routing with Time Windows: Optimization-Based Heuristics Approach for Freight Demands Requested in Real-Time

1998 ◽  
Vol 1617 (1) ◽  
pp. 171-178 ◽  
Author(s):  
How-Ming Shieh ◽  
Ming-Der May
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Real Time ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Benchmark Problems ◽  
Routing Problem ◽  
Anytime Algorithm ◽  
Search Heuristics ◽  
On Line

The problem of the on-line version of the vehicle routing problem with time windows (VRPTW) differs from the traditional off-line problem in the dynamical arrival of requests and the execution of the partial tour during the run time. The study develops an on-line optimization-based heuristic that combined the concepts of the “on-line algorithm,” “anytime algorithm,” and local search heuristics to solve the on-line version of VRPTW. The solution heuristic is evaluated with modified Solomon’s problems. By comparing with these benchmark problems, the different results between on-line and off-line algorithms are indicated.

Sign in / Sign up

Export Citation Format

Share Document