Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data |
| |
| Authors: | Siqian Shen Mingdi You Yintai Ma |
| |
| Affiliation: | 1. Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan;2. Department of Industrial Engineering, Tsinghua University, Beijing, China |
| |
| Abstract: | Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017 |
| |
| Keywords: | two‐stage stochastic optimization robust optimization mixed‐integer linear programming (MILP) linearization techniques cutting‐plane algorithms valid inequalities |
|
|
