期刊
SIAM JOURNAL ON OPTIMIZATION
卷 28, 期 1, 页码 875-903出版社
SIAM PUBLICATIONS
DOI: 10.1137/17M1128204
关键词
network design; stochastic programming; Benders decomposition
资金
- Natural Sciences and Engineering Council of Canada (NSERC)
This paper describes a Benders decomposition algorithm capable of efficiently solving large-scale instances of the well-known multicommodity capacitated network design problem with demand uncertainty. The problem is important because it models many applications, including telecommunications, transportation, and logistics. This problem has been tackled in the literature with meta-heuristics and exact methods, but many benchmark instances, even though of moderate size, remain unsolved. To successfully apply the Benders method to these instances, we propose various acceleration techniques, including the use of cutting planes, partial decomposition, heuristics, stronger cuts, reduction and warm-start strategies. Extensive computational experiments on benchmark instances were conducted to evaluate the efficiency and robustness of the algorithm as well as of the proposed strategies. The numerical results confirm the superiority of the proposed algorithm over existing ones.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据