2017
DOI: 10.1287/trsc.2015.0610
|View full text |Cite
|
Sign up to set email alerts
|

A Maximum Expected Covering Problem for District Design

Abstract: The optimal location of ambulances in a geographic region is interrelated with how the ambulances are dispatched to patients. Papers in the literature often treat the location and dispatching of ambulance separately. In this paper, we propose a novel mixed integer linear programming (MILP) model that determines how to locate and dispatch ambulances through district design. The model allows for uncertainty in both ambulance travel times and ambulance availability, and it maximizes the coverage level, i.e., the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 31 publications
(15 citation statements)
references
References 32 publications
0
15
0
Order By: Relevance
“…All these approaches neglect some of the system dynamics, e.g., server interdependencies, which could lead to errors in determining the level of coverage. Ansari et al [7] propose a model that relaxes the assumption of independently operating ambulances. The Maximum Expected Covering Problem for District Design (MECPDD) is a stochastic model that accounts for travel time and server availability uncertainties and balances the busyness among the servers by introducing lower and upper capacity bounds on the servers.…”
Section: Capacitated Extensionsmentioning
confidence: 99%
See 3 more Smart Citations
“…All these approaches neglect some of the system dynamics, e.g., server interdependencies, which could lead to errors in determining the level of coverage. Ansari et al [7] propose a model that relaxes the assumption of independently operating ambulances. The Maximum Expected Covering Problem for District Design (MECPDD) is a stochastic model that accounts for travel time and server availability uncertainties and balances the busyness among the servers by introducing lower and upper capacity bounds on the servers.…”
Section: Capacitated Extensionsmentioning
confidence: 99%
“…In contrast to the idea of Shariat-Mohaymany et al [8] that limit demand capacities for each server, we suggest an extension of the upper bound capacity utilization approach that integrates site interdependencies by limiting the demand capacities for each site. As opposed to the iterative hypercube approach by Ansari et al [7], we use a level based approach to handle the non-linearities imposed by the probabilistic nature of site interdependencies. Thereby, we are able to solve the proposed model using commercial solvers.…”
Section: Contributionmentioning
confidence: 99%
See 2 more Smart Citations
“…In their work, the purpose of fairness is to make same mean response times and also same server's workload. Ansari et al [43] used this approximation algorithm to estimate the correction factors, the average server workload and the individual server workload and treated them as constants in an MILP model. This model maximizes the number of high-priority calls that can be covered within a time threshold (i.e., the coverage level) and balanced server workload by determining the location of ambulances and dispatching policy simultaneously.…”
Section: Single Dispatch Total Backup and Non-homogeneous Serversmentioning
confidence: 99%