摘要
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.
- 出版日期2011
- 单位湖南大学