scholarly journals Affine recourse for the robust network design problem: Between static and dynamic routing

Networks ◽  
2012 ◽  
Vol 61 (2) ◽  
pp. 180-198 ◽  
Author(s):  
Michael Poss ◽  
Christian Raack
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Dynamic Routing ◽  
Network Design Problem ◽  
Robust Network Design ◽  
Robust Network

Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations

2012 ◽  
Vol 60 (3) ◽  
pp. 604-610 ◽  
Author(s):  
Chungmok Lee ◽  
Kyungsik Lee ◽  
Kyungchul Park ◽  
Sungsoo Park
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Technical Note ◽  
Network Design Problem ◽  
Branch And Price ◽  
Robust Network Design ◽  
Robust Network

scholarly journals Single-commodity robust network design problem: Complexity, instances and heuristic solutions

2014 ◽  
Vol 238 (3) ◽  
pp. 711-723 ◽  
Author(s):  
Eduardo Álvarez-Miranda ◽  
Valentina Cacchiani ◽  
Andrea Lodi ◽  
Tiziano Parriani ◽  
Daniel R. Schmidt
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Problem Complexity ◽  
Robust Network Design ◽  
Robust Network ◽  
Single Commodity

scholarly journals Dynamic Network Design Problem under Demand Uncertainty: An Adjustable Robust Optimization Approach

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Hua Sun ◽  
Ziyou Gao ◽  
Fangxia Zhao
Keyword(s):  
Linear Programming ◽  
Robust Optimization ◽  
Network Design ◽  
Design Problem ◽  
Demand Uncertainty ◽  
Network Design Problem ◽  
Transmission Model ◽  
Optimization Approach ◽  
Robust Network Design ◽  
Adjustable Robust Optimization

This paper develops an adjustable robust optimization approach for a network design problem explicitly incorporating traffic dynamics and demand uncertainty. In particular, a cell transmission model based network design problem of linear programming type is considered to describe dynamic traffic flows, and a polyhedral uncertainty set is used to characterize the demand uncertainty. The major contribution of this paper is to formulate such an adjustable robust network design problem as a tractable linear programming model and justify the model which is less conservative by comparing its solution performance with the robust solution from the usual robust model. The numerical results using one network from the literature demonstrate the modeling advantage of the adjustable robust optimization and provided strategic managerial insights for enacting capacity expansion policies under demand uncertainty.

Algorithms for a network design problem with crossing supermodular demands

Networks ◽  
2004 ◽  
Vol 43 (4) ◽  
pp. 256-265 ◽  
Author(s):  
Vardges Melkonian ◽  
�va Tardos
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem
Sign in / Sign up

Export Citation Format

Share Document