Journal
TRANSPORTATION SCIENCE
Volume 44, Issue 1, Pages 125-135Publisher
INFORMS
DOI: 10.1287/trsc.1090.0290
Keywords
capacitated arc-routing problem; stochastic programming with recourse; a priori optimization; adaptive large neighbourhood search
Categories
Funding
- Canadian Natural Sciences and Engineering Research Council [39682-05]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available