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

Hongtao Lei, Gilbert Laporte, Bo Guo

Research output: Contribution to journalArticlepeer-review

35 Citations (Scopus)

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 languageEnglish
Pages (from-to)99-118
Number of pages20
JournalTOP
Volume20
Issue number1
DOIs
Publication statusPublished - 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

Fingerprint Dive into the research topics of 'A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times'. Together they form a unique fingerprint.

Cite this