Location of hubs in a competitive environment
We 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.
(This abstract was borrowed from another version of this item.)
If 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.
References listed on IDEAS
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.:
- 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.
- 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.
- 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.
- Klincewicz, J. G., 1991. "Heuristics for the p-hub location problem," European Journal of Operational Research, Elsevier, vol. 53(1), pages 25-37, July.
- Campbell, James F., 1993. "Continuous and discrete demand hub location problems," Transportation Research Part B: Methodological, Elsevier, vol. 27(6), pages 473-482, December.
- 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.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:114:y:1999:i:2:p:363-371. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
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.