An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands

An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands

0.00 Avg rating0 Votes
Article ID: iaor20101951
Volume: 44
Issue: 1
Start Page Number: 125
End Page Number: 135
Publication Date: Feb 2010
Journal: Transportation Science
Authors: , ,
Keywords: heuristics
Abstract:

The capacitated arc-routing problem with stochastic demands (CARPSD) is an extension of the well-known capacitated arc-routing problem (CARP) in which demands are stochastic. This leads to the possibility of route failures whenever the realized demand exceeds the vehicle capacity. This paper presents the CARPSD in the context of garbage collection. It describes an adaptive large-scale neighbourhood search heuristic for the problem. Computational results show the superiority of this algorithm over an alternative solution approach.

Reviews

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