Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios

详细信息    查看全文

• 作者：Zhouchun Huang ; Qipeng P. Zheng ; Eduardo L. Pasiliao…
• 关键词：Reliable routing ; Traveling salesman problem ; Shortest path problem ; Arc failures ; Benders decomposition ; Compact formulation
• 刊名：Annals of Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：249
• 期：1-2
• 页码：141-162
• 全文大小：
• 刊物类别：Business and Economics
• 刊物主题：Operation Research/Decision Theory; Combinatorics; Theory of Computation;
• 出版者：Springer US
• ISSN：1572-9338
• 卷排序：249

文摘

Network routing problems are often modeled with the assumption that the network structure is deterministic, though they are often subject to uncertainty in many real-life scenarios. In this paper, we study the traveling salesman and the shortest path problems with uncertain topologies modeled by arc failures. We present the formulations that incorporate chance constraints to ensure reliability of the selected route considering all arc failure scenarios. Due to the computational complexity and large scales of these stochastic network optimization problems, we consider two cutting plane methods and a Benders decomposition algorithm to respectively solve them. We also consider to solve the reformulations of the problems obtained by taking the logarithm transformation of the chance constraints. Numerical experiments are performed to obtain results for comparisons among these proposed methods.