Optimization Online


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

Yu An (yan2***at***mail.usf.edu)
Yu Zhang (yuzhang***at***usf.edu)
Bo Zeng (bzeng***at***usf.edu)

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

Keywords: reliable hub-and-spoke, Lagrangian Relaxation, Branch-and-Bound

Category 1: Applications -- OR and Management Sciences

Category 2: Applications -- Science and Engineering (Facility Planning and Design )

Category 3: Network Optimization

Citation: University of South Florida, May 2011

Download: [PDF]

Entry Submitted: 05/30/2011
Entry Accepted: 05/31/2011
Entry Last Modified: 05/31/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society