Article
Formulations and Decomposition Methods for the Incomplete Hub Location Network Design Problem with and without Hop-constraints
Applied Mathematical Modelling
(2017)
Abstract
The incomplete hub location problem with and without hop-constraints is modeled using a Leontief substitution system approach. The Leontief formalism provides a set of important theoretical properties and delivers formulations with tight linear bounds that can explicitly incorporate hop constraints for each origin-destination pair of demands. Furthermore, the proposed formulations are amenable to a Benders decomposition technique which can solve large scale test instances. The performance of the devised algorithm is primarily due to a new general scheme for separating Benders feasibility cuts. The novel cuts render a stabilizing effect that is directly responsible for the solution of instances up to 80 nodes.
Keywords
- Hub location problems,
- Hub and spoke networks,
- Leontief flow substitution systems,
- Benders decomposition method,
- Improved Benders feasibility cuts
Disciplines
Publication Date
January 11, 2017
DOI
10.1016/j.apm.2017.06.035
Citation Information
Ricardo S. de Camargo, Gilberto de Miranda, Morton E. O’Kelly and James F. Campbell. "Formulations and Decomposition Methods for the Incomplete Hub Location Network Design Problem with and without Hop-constraints" Applied Mathematical Modelling Vol. 51 (2017) p. 274 - 301 Available at: http://works.bepress.com/james-campbell/1/