Location of hubs in a competitive environment
AbstractWe offer a formulation that locates hubs on a network in a competitive environment; that is, customer capture is sought, which happens whenever the location of a new hub results in a reduction of the current cost (time, distance) needed by the traffic that goes from the specified origin to the specified destination. The formulation presented here reduces the number of variables and constraints as compared to existing covering models. This model is suited for both air passenger and cargo transportation. In this model, each origin-destination flow can go through either one or two hubs, and each demand point can be assigned to more than a hub, depending on the different destinations of its traffic. Links (``spokes'' have no capacity limit. Computational experience is provided.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 114 (1999)
Issue (Month): 2 (April)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Other versions of this item:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- R12 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General Regional Economics - - - Size and Spatial Distributions of Regional Economic Activity; Interregional Trade (economic geography)
- R53 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Regional Government Analysis - - - Public Facility Location Analysis; Public Investment and Capital Stock
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Aykin, Turgut, 1995. "The hub location and routing problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 200-219, May.
- Skorin-Kapov, Darko & Skorin-Kapov, Jadranka & O'Kelly, Morton, 1996. "Tight linear programming relaxations of uncapacitated p-hub median problems," European Journal of Operational Research, Elsevier, vol. 94(3), pages 582-593, November.
- Campbell, James F., 1994. "Integer programming formulations of discrete hub location problems," European Journal of Operational Research, Elsevier, vol. 72(2), pages 387-405, January.
- Skorin-Kapov, Darko & Skorin-Kapov, Jadranka, 1994. "On tabu search for the location of interacting hub facilities," European Journal of Operational Research, Elsevier, vol. 73(3), pages 502-509, March.
- Campbell, James F., 1993. "Continuous and discrete demand hub location problems," Transportation Research Part B: Methodological, Elsevier, vol. 27(6), pages 473-482, December.
- Klincewicz, J. G., 1991. "Heuristics for the p-hub location problem," European Journal of Operational Research, Elsevier, vol. 53(1), pages 25-37, July.
- P J Densham & G Rushton, 1992. "Strategies for solving large location-allocation problems by heuristic methods," Environment and Planning A, Pion Ltd, London, vol. 24(2), pages 289-304, February.
- O'kelly, Morton E., 1987. "A quadratic integer program for the location of interacting hub facilities," European Journal of Operational Research, Elsevier, vol. 32(3), pages 393-404, December.
- Adler, Nicole & Berechman, Joseph, 2001. "Evaluating optimal multi-hub networks in a deregulated aviation market with an application to Western Europe," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(5), pages 373-390, June.
- Vladimir Marianov & Daniel Serra, 2000. "Location models for airline hubs behaving as M/D/c queues," Economics Working Papers 453, Department of Economics and Business, Universitat Pompeu Fabra.
- Adler, Nicole, 2001. "Competition in a deregulated air transportation market," European Journal of Operational Research, Elsevier, vol. 129(2), pages 337-345, March.
- Aros-Vera, Felipe & Marianov, Vladimir & Mitchell, John E., 2013. "p-Hub approach for the optimal park-and-ride facility location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 277-285.
- Daniel Serra, 2003. "Location of multiple server common service centers or public facilities for minimizing general congestion and travel cost functions," Economics Working Papers 658, Department of Economics and Business, Universitat Pompeu Fabra.
- Adler, Nicole & Smilowitz, Karen, 2007. "Hub-and-spoke network alliances and mergers: Price-location competition in the airline industry," Transportation Research Part B: Methodological, Elsevier, vol. 41(4), pages 394-409, May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.