Advanced Search
MyIDEAS: Login to save this paper or follow this series

Hierarchical location-allocation models for congested systems

Contents:

Author Info

  • Vladimir Marianov
  • Daniel Serra

    ()

Abstract

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.

Download Info

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.
File URL: http://www.econ.upf.edu/docs/papers/downloads/425.pdf
File Function: Whole Paper
Download Restriction: no

Bibliographic Info

Paper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 425.

as in new window
Length:
Date of creation: Jan 2000
Date of revision:
Handle: RePEc:upf:upfgen:425

Contact details of provider:
Web page: http://www.econ.upf.edu/

Related research

Keywords: Hierarchical location; congestion; queueing;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Berman, Oded & Mandowsky, Ronald R., 1986. "Location-allocation on congested networks," European Journal of Operational Research, Elsevier, vol. 26(2), pages 238-250, August.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. Daniel Serra, 1993. "The coherent covering location problem," Economics Working Papers 20, Department of Economics and Business, Universitat Pompeu Fabra.
  8. 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.
  9. ReVelle, Charles, 1993. "Facility siting and integer-friendly programming," European Journal of Operational Research, Elsevier, vol. 65(2), pages 147-158, March.
  10. 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.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Daniel Serra & Francisco Silva, 2002. "Locating emergency services with priority rules: The priority queuing covering location problem," Economics Working Papers 642, Department of Economics and Business, Universitat Pompeu Fabra, revised May 2008.
  2. 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.
  3. Robert Cromley & Dean Hanink, 2008. "Population growth and the development of a central place system," Journal of Geographical Systems, Springer, vol. 10(4), pages 383-405, December.
  4. Jayaraman, Vaidyanathan & Gupta, Rakesh & Pirkul, Hasan, 2003. "Selecting hierarchical facilities in a service-operations environment," European Journal of Operational Research, Elsevier, vol. 147(3), pages 613-628, June.
  5. Boffey, Brian & Galvao, Roberto & Espejo, Luis, 2007. "A review of congestion models in the location of facilities with immobile servers," European Journal of Operational Research, Elsevier, vol. 178(3), pages 643-662, May.
  6. Shariat-Mohaymany, Afshin & Babaei, Mohsen & Moadi, Saeed & Amiripour, Sayyed Mahdi, 2012. "Linear upper-bound unavailability set covering models for locating ambulances: Application to Tehran rural roads," European Journal of Operational Research, Elsevier, vol. 221(1), pages 263-272.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:425. 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: ().

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.