2009
DOI: 10.1111/j.1538-4632.2009.00747.x
|View full text |Cite
|
Sign up to set email alerts
|

Computational Comparison of Five Maximal Covering Models for Locating Ambulances

Abstract: This article categorizes existing maximum coverage optimization models for locating ambulances based on whether the models incorporate uncertainty about (1) ambulance availability and (2) response times. Data from Edmonton, Alberta, Canada are used to test five different models, using the approximate hypercube model to compare solution quality between models. The basic maximum covering model, which ignores these two sources of uncertainty, generates solutions that perform far worse than those generated by more… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 48 publications
(31 citation statements)
references
References 22 publications
(37 reference statements)
0
29
0
Order By: Relevance
“…In particular, we assume that the RT is lognormally distributed, as commonly reported in the literature [13].…”
Section: The Ems Casementioning
confidence: 99%
See 1 more Smart Citation
“…In particular, we assume that the RT is lognormally distributed, as commonly reported in the literature [13].…”
Section: The Ems Casementioning
confidence: 99%
“…Moreover, constraints (9,10), where δ is a non-Archimedean number, guarantee that only non-dominated efficient solutions in the DEA model are investigated. Finally, restrictions (11)(12)(13) define the nature of decision variables. Our model resembles the Klimberg's and Ratick's [16] model, even though some distinguishing features can be highlighted.…”
Section: Designing An Equitable and Efficient Systemmentioning
confidence: 99%
“…Erkut et al [22] solve the non-linear model for 180 demand points and 16 bases, but note that finding optimal solution for instances with more bases would be problematic. To apply the model to determine optimal base locations rather than an optimal distribution of the ambulances given a fixed set of bases, we need to solve instances with more base locations.…”
Section: Figmentioning
confidence: 99%
“…Problem (MALP) [11,12], Queuing Maximum Availability Location Problem (Q-MALP) [10], and Multiserver Queuing Maximum Availability Location Problem (MQ-MALP) [12] models. In all covering models, the aim is to find a set of optimal locations of facilities, such as ambulances, that can cover all or a maximum number of demand points, where coverage is defined similarly in some models while differently in others.…”
Section: Journal Of Computational Engineeringmentioning
confidence: 99%