haku: @journal_id 112 / yhteensä: 1577
viite: 118 / 1577
| Tekijä: | Gendreau, M. Laporte, G. Seguin, R. |
| Otsikko: | A tabu search heuristic for the vehicle routing problem with stochastic demands and customers |
| Lehti: | Operations Research
1996 : MAY-JUN, VOL. 44:3, p. 469-477 |
| Asiasana: | OPERATIONAL RESEARCH HEURISTIC METHODS DEMAND |
| Kieli: | eng |
| Tiivistelmä: | 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. The capacitated Vehicle Routing Problem (VRP) lies at the center of distribution management and has been extensively studied by operation researchers. |
SCIMA