The DOI matches its Crossref record.
An Algorithm for the Dynamic Relocation of Fire Companies
Abstract
When all the fire companies in a region are engaged in fighting fires, protection against a future fire is considerably reduced. It is standard practice in many urban fire departments to protect the exposed region by relocating outside fire companies temporarily to some of the vacant houses. In New York City, situations requiring such relocations arise ten times a day on the average. The Fire Department of the City of New York (FDNY) currently makes its relocations according to a system of preplanned moves. This system was designed at a time when alarm rates were low and is based on the assumption that only one fire is in progress at a time. Because of the high alarm rates currently being experienced in parts of New York City, this assumption is no longer valid, and the preplanned relocation system breaks down at the times when it is needed most. This paper describes a computer-based method for determining relocations that overcomes the deficiencies of the existing method by utilizing the computer’s ability to (1) store up-to-date information about the status of all fires in progress and the location and activity of all fire companies, (2) generate and compare many alternative relocation plans quickly. The method, which will become part of the FDNY’s real-time Management Information and Control System (MICS), is designed to be fast and to require little computer memory. After giving some background of the problem and the objectives of relocation, we give the problem a mathematical programming formulation and then describe the heuristic algorithm to be used for generating relocations in the MICS. The remainder of the paper is devoted to a discussion of an example illustrating how the algorithm works, a rigorous test of the algorithm using a computer simulation model of Fire-Department operations, and a description of the current use of the computer algorithm by dispatchers in an interactive time-shared environment. The results of the testing indicate that the proposed algorithm is a significant improvement over existing methods, particularly in crisis situations. Although designed to solve a problem for the New York City Fire Department, the algorithm should be applicable to other cities.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Customer Contact Approach to Services: Theoretical Bases and Practical Extensions
Chase, R. B. (1981) · Operations Research · doi:10.1287/opre.29.4.698 · Cited by 602
Approximate Dynamic Programming for Ambulance Redeployment
Maxwell, M. S., Restrepo, M., Henderson, S. G., & Topaloglu, H. (2010) · INFORMS Journal on Computing · doi:10.1287/ijoc.1090.0345 · Cited by 283
Aldabbas, M., Venteicher, F., Gerber, L., & Widmer, M. (2018) · Foundations of Computing and Decision Sciences · doi:10.1515/fcds-2018-0006 · Cited by 10
“Kolesar and Walker [17] Computer based method and heuristic method for the dynamic relocation of fire companies in New York City.”
Method
Metadata
- Authors
- Kolesar, P., & Walker, W. E.
- Venue
- Operations Research
- Published
- 1974-04
- Volume
- 22
- Issue
- 2
- Pages
- 249-274
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2014406364
- Cited by
- 186
- References
- 0
- FWCI
- 7.74
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.