.png){kind=icon}
返回
Probabilistic, maximal covering location-allocation models for congested systems
.png){kind=icon}
PRE
AI
DOI：10.1111/0022-4146.00100.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
When dealing with the design of service networks, such as health and emergency medical services, banking or distributed ticket-selling services, the location of service centers has a strong influence on the congestion at each of them, and, consequently, on the quality of service. In this paper, several probabilistic maximal covering location-allocation models with constrained waiting time for queue length are presented to consider service congestion. The first model considers the location of a given number of single-server centers such that the maximum population is served within a standard distance, and nobody stands in line for longer than a given time or with more than a predetermined number of other users. Several maximal coverage models are then formulated with one or more servers per service center. A new heuristic is developed to solve the models and tested in a 30-node network.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
