A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times

Hongtao Lei ^[1] ; Gilbert Laporte ^[2] ; Bo Guo ^[1]
1. [1] National University of Defense Technology
  
  National University of Defense Technology
  
  China
2. [2] Canada Research Chair in Distribution Management and CIRRELT, Canadá
Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 20, Nº. 1, 2012, págs. 99-118
Idioma: inglés
Enlaces
- Texto completo (pdf)
Resumen
- 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.