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

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

0.00 Avg rating0 Votes
Article ID: iaor20123781
Volume: 20
Issue: 1
Start Page Number: 99
End Page Number: 118
Publication Date: Apr 2012
Journal: TOP
Authors: , ,
Keywords: heuristics, stochastic processes
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.

Reviews

Required fields are marked *. Your email address will not be published.