Hierarchical location-allocation models for congested systems
In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where lower level servers attend requests first, and then, some of the served customers are referred to higher level servers. In the first model, the objective is to find the minimum number of servers and their locations that will cover a given region with a distance or time standard. The second model is cast as a Maximal Covering Location formulation. A heuristic procedure is then presented together with computational experience. Finally, some extensions of these models that address other types of spatial configurations are offered.
(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.:
- Marianov, Vladimir & ReVelle, Charles, 1996. "The Queueing Maximal availability location problem: A model for the siting of emergency vehicles," European Journal of Operational Research, Elsevier, vol. 93(1), pages 110-120, August.
- Batta, Rajan, 1989. "A queueing-location model with expected service time dependent queueing disciplines," European Journal of Operational Research, Elsevier, vol. 39(2), pages 192-205, March.
- Marianov, Vladimir & Revelle, Charles, 1994. "The queuing probabilistic location set covering problem and some extensions," Socio-Economic Planning Sciences, Elsevier, vol. 28(3), pages 167-178.
- Daniel Serra, 1993. "The coherent covering location problem," Economics Working Papers 20, Department of Economics and Business, Universitat Pompeu Fabra.
- Serra, Daniel & Marianov, Vladimir & ReVelle, Charles, 1992. "The maximum-capture hierarchical location problem," European Journal of Operational Research, Elsevier, vol. 62(3), pages 363-371, November.
- Vladimir Marianov & Daniel Serra, 1994. "Probabilistic maximal covering location models for congested systems," Economics Working Papers 70, Department of Economics and Business, Universitat Pompeu Fabra.
- Daniel Serra & Charles Revelle, 1992. "The PQ-Median problem: Location and districting of hierarchical facilities. Part I," Economics Working Papers 12, Department of Economics and Business, Universitat Pompeu Fabra.
- Daniel Serra & Charles Revelle, 1992. "The PQ-Median problem: Location and districting of hierarchical facilities. Part II: Heuristic solution methods," Economics Working Papers 13, Department of Economics and Business, Universitat Pompeu Fabra.
- Berman, Oded & Mandowsky, Ronald R., 1986. "Location-allocation on congested networks," European Journal of Operational Research, Elsevier, vol. 26(2), pages 238-250, August.
- ReVelle, Charles, 1993. "Facility siting and integer-friendly programming," European Journal of Operational Research, Elsevier, vol. 65(2), pages 147-158, March.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:135:y:2001:i:1:p:195-208. 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: (Dana Niculescu)
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.