期刊
JOURNAL OF COMBINATORIAL OPTIMIZATION
卷 30, 期 2, 页码 320-334出版社
SPRINGER
DOI: 10.1007/s10878-014-9751-z
关键词
Hazmat transportation network design; Uncertain edge risk; Computational complexity; Robust optimization; Heuristic algorithms
资金
- National Natural Science Foundation of China [70971008]
- Ministry of Education, Humanities and Social Sciences Planning Project [09YJC630008]
In this paper, we reconsider the hazardous materials transportation network design problem with uncertain edge risk (HTNDPUR) which is proved as strong NP-hard. The natural ways to handle NP-hard problems are approximation solutions or FPT algorithms. We prove that the HTNDPUR does not admit any approximation, neither any FPT algorithm, unless P = NP. Furthermore, we utilize the minimax regret criterion to model the HTNDPUR as a bi-level integer programming formulation under edge risk uncertainty, where an interval of possible risk values is associated with each arc. We present a robust heuristic approach that always finds a robust and stable hazmat transportation network. At the end, we test our method on a network of Guangdong province in China to illustrate the efficiency of the algorithm. Our experimental results illustrate that the robust interval risk scenario network performs better than the deterministic scenario network.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据