A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
成果类型：
Article
署名作者：
Gendreau, M; Laporte, G; Seguin, R
署名单位：
Universite de Montreal; HEC Montreal
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.44.3.469
发表日期：
1996
页码：
469-477
关键词：
摘要：
This paper considers a version of the stochastic vehicle routing problem where customers are present at locations with some probabilities and have random demands. A tabu search heuristic is developed for this problem. Comparisons with known optimal solutions on problems whose sizes vary from 6 to 46 customers indicate that the heuristic produces an optimal solution in 89.45% of cases, with an average deviation of 0.38% from optimality.