Tabu Search Algorithm for Dynamic Vehicle Routing Problems Under Real-Time Information

2004 ◽  
Vol 1882 (1) ◽  
pp. 140-149 ◽  
Author(s):  
Tsai-Yun Liao
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Real Time ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems ◽  
Real Time Information ◽  
Time Information

Study of Solution Approach for Dynamic Vehicle Routing Problems with Real-Time Information

2003 ◽  
Vol 1857 (1) ◽  
pp. 102-108 ◽  
Author(s):  
Ta-Yin Hu ◽  
Tsai-Yun Liao ◽  
Ying-Chih Lu
Keyword(s):  
Vehicle Routing ◽  
Real Time ◽  
Information Technologies ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems ◽  
Solution Approach ◽  
Traffic Conditions ◽  
Real Time Information ◽  
Time Information

Recent advances in commercial vehicle operations (CVO), especially in communication and information technologies, allow the study of dynamic vehicle routing problems under new and updated information, such as traffic conditions and new customers. Two major operational benefits of CVO include ( a) dynamically assigning vehicles to time-sensitive demands, and ( b) efficiently rerouting vehicles according to current traffic conditions. In this research, stochastic vehicle routing problems (SVRP) are considered and extended to incorporate real-time information for dynamic vehicle routing problems. The SVRP model is formulated by a chance-constrained model and is solved by CPLEX with branch-and-bound techniques. Numerical experiments are conducted in a Taichung city network to investigate dynamic vehicle routing strategies under real-time information supply strategies and to assess the effectiveness of such strategies in a dynamic perspective.

A Study on Vehicle Routing Problems Considering IoT based Real Time Information

2016 ◽  
Author(s):  
Kangbae Lee ◽  
Doo-hwan Kim ◽  
Hyung Rim Choi ◽  
Byung Kwon Park ◽  
Min Je Cho ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Real Time ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Real Time Information ◽  
Time Information

A Hybrid Metaheuristic for the Multiple Depot Vehicle Routing Problems with Mix Pickups and Deliveries

2012 ◽  
Vol 538-541 ◽  
pp. 3230-3234
Author(s):  
Jian Li ◽  
Dong Lu ◽  
Ming Dai
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Vehicle Routing ◽  
Search Algorithm ◽  
Real Life ◽  
Tabu Search Algorithm ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Benchmark Instances ◽  
Multiple Depot

The multiple depot vehicle routing problems with mix pickups and deliveries are often met in real-life scenarios of transportation logistics, but it has not received much attention by researchers. In this problem, to allocate borderline customer to appropriate depot is a difficulty to overcome. In this paper, a genetic algorithm is supposed to allocate them. Then the tabu search algorithm is incorporated into the genetic algorithm to solve the single depot vehicle routing problems with mix pickups and deliveries. The proposed algorithm is successfully applied to benchmark instances in the literature, generating new best solutions.

Sign in / Sign up

Export Citation Format

Share Document