期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 70, 期 11, 页码 1983-1996出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/01605682.2018.1500977
关键词
Network design; greedy heuristic; capacity scaling
The capacitated multicommodity network design problem represents a network design system and has a wide range of real-life applications, such as the construction of logistics networks, transportation networks, communication networks, and production networks. In this article, we introduce a fast greedy algorithm for solving the capacitated multicommodity network design problem. The greedy algorithm is based on link-rerouting and partial link-rerouting heuristics for the uncapacitated multicommodity network design problem. This algorithm involves a capacity scaling for reducing the number of candidate arcs and a restricted branch-and-bound for improving solutions. The algorithm succeeds in finding good solutions within a short computation time. The average computation time for solving benchmark problem instances is only several tens of seconds.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据