Robust Network Capacity Expansion with Non-linear Costs

Garuba, Francis and Goerigk, Marc and Jacko, Peter (2019) Robust Network Capacity Expansion with Non-linear Costs. In: 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2019 :. OASICS . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, DEU, 5.1-5.13. ISBN 9783959771283

Text (ATMOS-v2019-article)
ATMOS_v2019_article.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (474kB)

Abstract

The network capacity expansion problem is a key network optimization problem practitioners regularly face. There is an uncertainty associated with the future traffic demand, which we address using a scenario-based robust optimization approach. In most literature on network design, the costs are assumed to be linear functions of the added capacity, which is not true in practice. To address this, two non-linear cost functions are investigated: (i) a linear cost with a fixed charge that is triggered if any arc capacity is modified, and (ii) its generalization to piecewise-linear costs. The resulting mixed-integer programming model is developed with the objective of minimizing the costs. Numerical experiments were carried out for networks taken from the SNDlib database. We show that networks of realistic sizes can be designed using non-linear cost functions on a standard computer in a practical amount of time within negligible suboptimality. Although solution times increase in comparison to a linear-cost or to a non-robust model, we find solutions to be beneficial in practice. We further illustrate that including additional scenarios follows the law of diminishing returns, indicating that little is gained by considering more than a handful of scenarios. Finally, we show that the results of a robust optimization model compare favourably to the traditional deterministic model optimized for the best-case, expected, or worst-case traffic demand, suggesting that it should be used whenever computationally feasible.