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

Hits:

Journal:Annals of Operations Research

Abstract: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.

Volume:249

Issue:1

Page Number:141-162

Translation or Not:no

Date of Publication:2018-02-01

Included Journals:SCIE

Co-author:Qipeng P. Zheng,Eduardo L. Pasiliao,Daniel Simmons