Hierarchical Location-Allocation Models for Congested Systems

Univ. Pompeu Fabra, Economics and Business Working Paper No. 425

29 Pages Posted: 16 May 2000

See all articles by Vladimir Marianov

Vladimir Marianov

Pontificia Universidad Catolica de Chile

Daniel Serra

Universitat Pompeu Fabra - Faculty of Economic and Business Sciences

Date Written: January 2000

Abstract

In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where requests are attended first by lower level servers, 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 locations that will cover a given region within given distance or time limits. 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 are put forward addressing other types of spatial configurations.

JEL Classification: C61, R12, R53

Suggested Citation

Marianov, Vladimir and Serra, Daniel, Hierarchical Location-Allocation Models for Congested Systems (January 2000). Univ. Pompeu Fabra, Economics and Business Working Paper No. 425, Available at SSRN: https://ssrn.com/abstract=224545 or http://dx.doi.org/10.2139/ssrn.224545

Vladimir Marianov (Contact Author)

Pontificia Universidad Catolica de Chile ( email )

Av. Vicuna Mackenna 4860
Department of Electrical Engineering
Santiago
Chile
(562) 354 4974 (Phone)
(562) 552 2563 (Fax)

Daniel Serra

Universitat Pompeu Fabra - Faculty of Economic and Business Sciences ( email )

Ramon Trias Fargas 25-27
Barcelona, 08005
Spain
(34) 93 542 16 66 (Phone)
(34) 93 542 17 46 (Fax)

Here is the Coronavirus
related research on SSRN

Paper statistics

Downloads
121
Abstract Views
1,875
rank
258,243
PlumX Metrics