期刊
TRANSPORTATION SCIENCE
卷 44, 期 1, 页码 125-135出版社
INFORMS
DOI: 10.1287/trsc.1090.0290
关键词
capacitated arc-routing problem; stochastic programming with recourse; a priori optimization; adaptive large neighbourhood search
资金
- Canadian Natural Sciences and Engineering Research Council [39682-05]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据