Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand

Author(s):  
Zuhaimy Ismail ◽  
Irhamah
2012 ◽  
Vol 538-541 ◽  
pp. 3230-3234
Author(s):  
Jian Li ◽  
Dong Lu ◽  
Ming Dai

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