Probabilistic maximal covering location-allocation models with constrained waiting time or queue length for congested systems
When dealing with the design of service networks, such as health and EMS 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 models are presented to consider service congestion. The first model addresses the issue of the location of the least number of single--server centers such that all the population is served within a standard distance, and nobody stands in line for a time longer than a given time--limit, or with more than a predetermined number of other clients. We then formulate several maximal coverage models, with one or more servers per service center. A new heuristic is developed to solve the models and tested in a 30--nodes network.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Berman, Oded & Mandowsky, Ronald R., 1986. "Location-allocation on congested networks," European Journal of Operational Research, Elsevier, vol. 26(2), pages 238-250, August.
When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:177. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.