Extensions to the Hub Location Problem: Formulations and Numerical Examples
Open Access
- 1 October 1998
- journal article
- Published by Wiley in Geographical Analysis
- Vol. 30 (4), 315-330
- https://doi.org/10.1111/j.1538-4632.1998.tb00405.x
Abstract
Although a tremendous amount of analytical research is being conducted on the hub location problem, few models exist that extend the number of characteristics found in actual hub-and-spoke networks. Four extensions are presented in this paper: (1) a capacitated network model; (2) a minimum threshold model; (3) a model that endogenously determines the number of open hubs for the network; and (4) a model that incorporates a flow-dependent cost function for the spokes as well as the interhub links. Both the capacitated and the minimum threshold models drop the assumption of a completely interconnected network commonly found in hub location models. Numerical results show that total network costs are often minimized by closing a few interhub links. The third extension is the first known hub location model to determine the optimal number of hubs based on the needs of the network. In this model, the number of open hubs depends on the distribution of flows in the network and how cost effectively the flows can be moved across the network. Previous models that endogenously determined the number of open hubs utilized a fixed cost for establishing each hub in order to limit the number of hubs in the network. The final extension recognizes the potential of all links to amalgamate flows and includes a separate flow-dependent cost function for the spokes in addition to the one for the interhub links. Numerical results are shown for all four models.Keywords
This publication has 11 references indexed in Scilit:
- Hub location with flow economies of scaleTransportation Research Part B: Methodological, 1998
- CorrespondenceAnthropological Forum, 1997
- Tight linear programming relaxations of uncapacitated p-hub median problemsEuropean Journal of Operational Research, 1996
- Efficient algorithms for the uncapacitated single allocation p-hub median problemLocation Science, 1996
- Hub network design with single and multiple allocation: A computational studyLocation Science, 1996
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problemEuropean Journal of Operational Research, 1994
- The hub network design problemJournal of Transport Geography, 1994
- Integer programming formulations of discrete hub location problemsEuropean Journal of Operational Research, 1994
- A quadratic integer program for the location of interacting hub facilitiesEuropean Journal of Operational Research, 1987
- Airline hubbing—Some implications for airport economicsTransportation Research Part A: General, 1985