Abstract
This paper describes a generalized variable neighborhood search heuristic for the Capacitated Vehicle Routing Problem with Stochastic Service Times, in which the service times at vertices are stochastic. The heuristic is tested on randomly generated instances and compared with two other heuristics and with an alternative solution strategy. Computational results show the superiority and effectiveness of the proposed heuristic.
| Original language | English |
|---|---|
| Pages (from-to) | 99-118 |
| Number of pages | 20 |
| Journal | TOP |
| Volume | 20 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Apr 2012 |
Funding
Acknowledgements This work was partly supported by the Canadian Natural Sciences and Engineering Research Council under grant 39682-10, by the Elite Plan Program of the Chinese National University of Defense Technology, and by the Chinese National Natural Science Foundation under grant 70971132. This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.
Keywords
- Generalized variable neighborhood search
- Route duration
- Stochastic service time
- Stochastic vehicle routing
ASJC Scopus subject areas
- Modelling and Simulation
- Discrete Mathematics and Combinatorics
- Management Science and Operations Research
- Information Systems and Management