Hierarchical location-allocation models for congested systems

Vladimir Marianov and Daniel Serra ()

Economics Working Papers from Department of Economics and Business, Universitat Pompeu Fabra

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.

Keywords: Hierarchical location; congestion; queueing (search for similar items in EconPapers)
JEL-codes: C61 R12 R53 (search for similar items in EconPapers)
Date: 2000-01
New Economics Papers: this item is included in nep-ind
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://econ-papers.upf.edu/papers/425.pdf Whole Paper (application/pdf)

Related works:
Journal Article: Hierarchical location-allocation models for congested systems (2001)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:upf:upfgen:425

Access Statistics for this paper

More papers in Economics Working Papers from Department of Economics and Business, Universitat Pompeu Fabra
Bibliographic data for series maintained by ( this e-mail address is bad, please contact ).