The Reliable Hub-and-spoke Design Problem: Models and Algorithms

Published: 2011/05/30, Updated: 2011/05/31

Applications - OR and Management Sciences, Facility Planning and Design, Network Optimization Branch-and-Bound, lagrangian relaxation, reliable hub-and-spoke Short URL: https://optimization-online.org/?p=11591

This paper presents a study on reliable single and multiple allocation hub-and-spoke network design problems where disruptions at hubs and the resulting hub unavailability can be mitigated by backup hubs and alternative routes. It builds nonlinear mixed integer programming models and presents linearized formulas. To solve those difficult problems, Lagrangian relaxation and Branch-and-Bound methods are developed to efficiently obtain optimal solutions. Numerical studies of proposed solution methods on practical instances along with a few insights of system design are reported

The Reliable Hub-and-spoke Design Problem: Models and Algorithms

Citation

Article