The Maximal Expected Covering Location Problem: Revisited

Rajan Batta · June M. Dolan · Nirup N. Krishnamurthy

261 citations0/0 files storedTransportation Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Vehicle Routing Optimization Methods Military Defense Systems Analysis

Abstract

The Maximal Expected Coverage Location Problem (MEXCLP) addresses the problem of optimally locating servers so as to maximize the expected coverage of demand while taking into account the possibility of servers being unavailable when a call enters the service system. In this paper, an attempt is made to relax three of MEXCLP's assumptions: servers operate independently, servers have the same busy probabilities, and server busy probabilities are invariant with respect to their locations. We embed the hypercube queueing model in a single node substitution heuristic optimization procedure, to determine a set of server locations which “maximize” the expected coverage. Our empirical findings indicate that there is disagreement between the expected coverage predicted by the MEXCLP model and the hypercube optimization procedure. There is substantial agreement, however, between the locations generated by the two procedures. We also consider a simple “adjustment” to the MEXCLP model, based upon random sampling of servers without replacement; the same adjustment has been used previously to derive a hypercube approximation procedure. We discuss modifications and enhancements to the MEXCLP's heuristic solution procedure for this adjusted model. Our empirical findings indicate that there is better agreement between the expected coverage predicted by the adjusted model and the hypercube optimization procedure. The locations generated by the adjusted model, however, are of the same overall quality as those generated by the MEXCLP model. Readers should view the results of this paper in light of the fact that we are able to relax the MEXCLP by assuming that the operating characteristics of the service system fit the description of the hypercube queueing model, such as Poisson arrivals and exponential service times, which may not be strictly true in practice.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 261 citations exist upstream.

References

1974THE MAXIMAL COVERING LOCATION PROBLEM 1983A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution 1982Urban operations research 1974A hypercube queuing model for facility location and redistricting in urban emergency services 1986Concepts and Applications of Backup Coverage 1981A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment 1975Approximating the Performance of Urban Emergency Service Systems

Cited by

2005Location of Health Care Facilities 1994Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky 2018Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles 1998A multi-objective model for locating fire stations 2008A probabilistic model applied to emergency service vehicle location 2009A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.