scholarly journals A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows

2004 ◽  
Vol 38 (4) ◽  
pp. 515-530 ◽  
Author(s):  
Russell Bent ◽  
Pascal Van Hentenryck
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Two Stage ◽  
Routing Problem

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