The Vehicle Routing Problem (VRP) with stochastic demands was discussed. In this kind of VRP, the number of vehicles to serve customers and the number of customers served by each vehicle were unfixed before performing an optimization. A tabu search algorithm was designed for this purpose. In the algorithm, a vehicle-customer structure concept was designed to simplify the neighborhood structure. In order to analyze the effectiveness of the tabu search algorithm, a genetic algorithm and a hybrid algorithm were designed. The computational result showed that the tabu search algorithm based on the vehicle-customer structure was more effective than two other algorithms for the Vehicle Routing Problem with stochastic demands.
A Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands
Sixth International Conference of Traffic and Transportation Studies Congress (ICTTS) ; 2008 ; Nanning, China
2008-07-17
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
British Library Online Contents | 2006
|A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
Online Contents | 2006
|A tabu search heuristic for the vehicle routing problem
TIBKAT | 1992
|An Algorithm for Vehicle Routing Problem with Soft Time Windows Using Tabu Search
British Library Conference Proceedings | 2009
|Study on the Model and Tabu Search Algorithm for Vehicle Routing Problem with Backhauls
British Library Conference Proceedings | 2004
|