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 |
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