Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems
针对医疗、银行等拥挤服务系统，提出了考虑排队等待时间约束的概率性最大覆盖选址分配模型，并开发了启发式算法在30节点网络上测试。
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.