Hierarchical location-allocation models for congested systems
Loading...
Date
2001
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
ELSEVIER SCIENCE BV
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 (MCL) 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. (C) 2001 Elsevier Science B.V. All rights reserved.
Description
Keywords
location, hierarchical models, congestion, covering location models