A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution

Abstract

The maximum covering location model has been used extensively in analyzing locations for public service facilities. The model is extended to account for the chance that when a demand arrives at the system it will not be covered since all facilities capable of covering the demand are engaged serving other demands. An integer programming formulation of the new problem is presented. Several properties of the formulation are proven. A heuristic solution algorithm is presented and computational results with the algorithm are discussed. Directions for future study are also discussed.

Cite this work

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

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

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