Probabilistic, maximal covering location-allocation models for congested systems.
Several probabilistic maximal covering location-allocation models with constrained waiting time for queue length are presented to consider service congestion in service networks such as health and emergency medical services and banking or distributed ticket-selling services. The first model takes in...
| Publicado en: | Journal of Regional Science Vol. 38; no. 3; pp. 401 - 425 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Wiley-Blackwell
August 1998
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ssf&AN=512686930&site=ehost-live header: @attributes: shortDbName: ssf uiTerm: 512686930 longDbName: Social Sciences Full Text (H.W. Wilson) uiTag: AN controlInfo: bkinfo: jinfo: jid: 00224146 RSC jtl: Journal of Regional Science issn: 00224146 maglogo: N pubinfo: dt: August 1998 vid: 38 iid: 3 pid: 480 pub: Wiley-Blackwell artinfo: ui: 512686930 10.1111/0022-4146.00100 ppf: 401 ppct: 24 formats: tig: atl: Probabilistic, maximal covering location-allocation models for congested systems. aug: au: Marianov, Vladimir Serra, Daniel su: Geography -- Methodology Geography -- Statistical methods Queuing theory sug: subj: Geography -- Methodology Geography -- Statistical methods Queuing theory ab: Several probabilistic maximal covering location-allocation models with constrained waiting time for queue length are presented to consider service congestion in service networks such as health and emergency medical services and banking or distributed ticket-selling services. The first model takes into account the location of a certain number of single-server centers such that the maximum population is served within a standard distance, and nobody stands in line longer than a given time, or with more than a predetermined number of other users. Several maximal coverage models are consequently generated with one or more servers per service center. Finally, a new heuristic is developed to solve the models and is tested in a 30-node network. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: N holdings: @attributes: islocal: N |
|---|