The vehicle routing problem with stochastic demands is considered in this paper, and an effective tabu search algorithm for the proposed problem. The goal consists of minimizing the vehicle number and expected distance traveled in order to serve all customers’ demands. Finally, a numerical example is given to show the effectiveness of the algorithm.
An Effective Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands
Advanced Materials Research ; 282-283 ; 375-378
04.07.2011
4 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
Online Contents | 2006
|A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
British Library Online Contents | 2006
|