IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v28y1982i4p366-378.html
   My bibliography  Save this article

An Algorithm for the Initial Dispatch of Fire Companies

Author

Listed:
  • E. Ignall

    (Columbia University)

  • G. Carter

    (The Rand Corporation)

  • K. Rider

    (Deloitte Haskins & Sells)

Abstract

In response to an incoming fire alarm, someone must decide how many and which engine and ladder companies (firefighters and their apparatus) to dispatch to the scene. Traditional dispatching policies assume that all of the designated companies are available at the time the alarm is received. These policies do not consider the workload imposed on firefighters, and do not work well at the high alarm rates now characteristic of parts of large cities. Our procedure, designed for use in New York City's computed-aided Management Information and Control System, makes good initial dispatch decisions at all alarm rates. It uses response times to serious fires to measure performance and recognizes that the dispatcher has incomplete information about the seriousness of the incident when the decision is made. A simulation comparison of our procedure with the traditional policy was made using actual incidents from July 1972. Our procedure reduced the average second engine and second ladder response times to serious fires by 25 to 45 seconds, while keeping total workload essentially unchanged. This reduction, which is about 10--15% of the five and a half minutes obtained for the traditional policy, results primarily from our procedure's deciding how many to send based on historical information on the chance that an alarm from a given location at a given time of day is serious. For example, the fraction of fires in occupied structures getting an initial second engine rose from 65% with the traditional policy to 85% with our procedure, although both policies sent an initial second engine to the same fraction of all incidents. Our procedure also reduced the number of relocations of engine companies and ladder companies substantially. The approach we used should be valuable in the design of computer-aided dispatching systems in other cities. In particular, others may find it helpful to review the way in which the objective function is developed, the way particular aspects of the dispatch problem are treated, the provision of several parameters for tuning behavior, and features of the simulation testing.

Suggested Citation

  • E. Ignall & G. Carter & K. Rider, 1982. "An Algorithm for the Initial Dispatch of Fire Companies," Management Science, INFORMS, vol. 28(4), pages 366-378, April.
  • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:4:p:366-378
    DOI: 10.1287/mnsc.28.4.366
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.28.4.366
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.28.4.366?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Phillip R. Jenkins & Matthew J. Robbins & Brian J. Lunday, 2021. "Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 2-26, January.
    2. Linda V. Green & Peter J. Kolesar, 2004. "ANNIVERSARY ARTICLE: Improving Emergency Responsiveness with Management Science," Management Science, INFORMS, vol. 50(8), pages 1001-1014, August.
    3. Alfonso J. Pedraza-Martinez & Sameer Hasija & Luk N. Van Wassenhove, 2020. "Fleet Coordination in Decentralized Humanitarian Operations Funded by Earmarked Donations," Operations Research, INFORMS, vol. 68(4), pages 984-999, July.
    4. Rettke, Aaron J. & Robbins, Matthew J. & Lunday, Brian J., 2016. "Approximate dynamic programming for the dispatch of military medical evacuation assets," European Journal of Operational Research, Elsevier, vol. 254(3), pages 824-839.
    5. Adam Behrendt & Vineet M. Payyappalli & Jun Zhuang, 2019. "Modeling the Cost Effectiveness of Fire Protection Resource Allocation in the United States: Models and a 1980–2014 Case Study," Risk Analysis, John Wiley & Sons, vol. 39(6), pages 1358-1381, June.
    6. Peter J. Kolesar, 2012. "OM Forum --Some Lessons on Operations Management Model Implementation Drawn from the RAND Fire Project," Manufacturing & Service Operations Management, INFORMS, vol. 14(1), pages 1-6, January.
    7. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    8. Laura A. McLay & Maria E. Mayorga, 2013. "A Dispatching Model for Server-to-Customer Systems That Balances Efficiency and Equity," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 205-220, May.
    9. Wang, Qingyi & Reed, Ashley & Nie, Xiaofeng, 2022. "Joint initial dispatching of official responders and registered volunteers during catastrophic mass-casualty incidents," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    10. Drent, Collin & Keizer, Minou Olde & Houtum, Geert-Jan van, 2020. "Dynamic dispatching and repositioning policies for fast-response service networks," European Journal of Operational Research, Elsevier, vol. 285(2), pages 583-598.
    11. N C Simpson & P G Hancock, 2009. "Fifty years of operational research and emergency response," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 126-139, May.
    12. Sardar Ansari & Laura Albert McLay & Maria E. Mayorga, 2017. "A Maximum Expected Covering Problem for District Design," Transportation Science, INFORMS, vol. 51(1), pages 376-390, February.
    13. Robbins, Matthew J. & Jenkins, Phillip R. & Bastian, Nathaniel D. & Lunday, Brian J., 2020. "Approximate dynamic programming for the aeromedical evacuation dispatching problem: Value function approximation utilizing multiple level aggregation," Omega, Elsevier, vol. 91(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:28:y:1982:i:4:p:366-378. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.