Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems

Abstract

When dealing with the design of service networks, such as health andemergency medical services, banking or distributed ticket‐selling services, the location of servicecenters has a strong influence on the congestion at each of them, and, consequently, on thequality of service. In this paper, several probabilistic maximal coveringlocation—allocation models with constrained waiting time for queue length are presentedto consider service congestion. The first model considers the location of a given number ofsingle‐server centers such that the maximum population is served within a standard distance, andnobody stands in line for longer than a given time or with more than a predetermined number ofother users. Several maximal coverage models are then formulated with one or more servers perservice center. A new heuristic is developed to solve the models and tested in a 30‐node network.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 160 citations exist upstream.