Probabilistic, maximal covering location-allocation models for congested systems

Simple item page
dc.contributor.authorMarianov, V
dc.contributor.authorSerra, D
dc.date.accessioned2024-01-10T13:16:39Z
dc.date.available2024-01-10T13:16:39Z
dc.date.issued1998
dc.description.abstractWhen 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.
dc.format.extent24 páginas
dc.fuente.origenWOS
dc.identifier.doi10.1111/0022-4146.00100
dc.identifier.issn0022-4146
dc.identifier.urihttps://doi.org/10.1111/0022-4146.00100
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/78602
dc.identifier.wosidWOS:000075447100002
dc.information.autorucIngeniería;Marianov V;S/I;99349
dc.issue.numero3
dc.language.isoen
dc.nota.accesoSin adjunto
dc.pagina.final424
dc.pagina.inicio401
dc.publisherBLACKWELL PUBLISHERS
dc.revistaJOURNAL OF REGIONAL SCIENCE
dc.rightsregistro bibliográfico
dc.titleProbabilistic, maximal covering location-allocation models for congested systems
dc.typeartículo
dc.volumen38
sipa.codpersvinculados99349
sipa.indexWOS
sipa.indexScopus
sipa.trazabilidadCarga SIPA;09-01-2024
Files
Collections
Artículos de revistas