IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v5y2013i4p515-534d29596.html
   My bibliography  Save this article

Managing Emergencies Optimally Using a Random Neural Network-Based Algorithm

Author

Listed:
  • Qing Han

    (Intelligent Systems & Networks Group, EEE, Imperial College, London SW7 2BT, UK)

Abstract

Emergency rescues require that first responders provide support to evacuate injured and other civilians who are obstructed by the hazards. In this case, the emergency personnel can take actions strategically in order to rescue people maximally, efficiently and quickly. The paper studies the effectiveness of a random neural network (RNN)-based task assignment algorithm involving optimally matching emergency personnel and injured civilians, so that the emergency personnel can aid trapped people to move towards evacuation exits in real-time. The evaluations are run on a decision support evacuation system using the Distributed Building Evacuation Simulator (DBES) multi-agent platform in various emergency scenarios. The simulation results indicate that the RNN-based task assignment algorithm provides a near-optimal solution to resource allocation problems, which avoids resource wastage and improves the efficiency of the emergency rescue process.

Suggested Citation

  • Qing Han, 2013. "Managing Emergencies Optimally Using a Random Neural Network-Based Algorithm," Future Internet, MDPI, vol. 5(4), pages 1-20, October.
    • Handle: RePEc:gam:jftint:v:5:y:2013:i:4:p:515-534:d:29596
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/5/4/515/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/5/4/515/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Antoine Desmet & Erol Gelenbe, 2013. "Graph and Analytical Models for Emergency Evacuation," Future Internet, MDPI, vol. 5(1), pages 1-10, February.
    2. Gelenbe, Erol & Cao, Yonghuan, 1998. "Autonomous search for mines," European Journal of Operational Research, Elsevier, vol. 108(2), pages 319-333, July.
    3. MacGregor Smith, J., 1991. "State-dependent queueing models in emergency evacuation networks," Transportation Research Part B: Methodological, Elsevier, vol. 25(6), pages 373-389, December.
    4. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Georgios Fragkos & Pavlos Athanasios Apostolopoulos & Eirini Eleni Tsiropoulou, 2019. "ESCAPE: Evacuation Strategy through Clustering and Autonomous Operation in Public Safety Systems," Future Internet, MDPI, vol. 11(1), pages 1-17, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Erol Gelenbe & Fang-Jing Wu, 2013. "Future Research on Cyber-Physical Emergency Management Systems," Future Internet, MDPI, vol. 5(3), pages 1-19, June.
    2. Huibo Bi, 2014. "Routing Diverse Evacuees with the Cognitive Packet Network Algorithm," Future Internet, MDPI, vol. 6(2), pages 1-20, April.
    3. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    4. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    5. 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.
    6. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
    7. Qingzhu Yao & Xiaoyan Zhu & Way Kuo, 2014. "A Birnbaum-importance based genetic local search algorithm for component assignment problems," Annals of Operations Research, Springer, vol. 212(1), pages 185-200, January.
    8. Cai, Zhiqiang & Si, Shubin & Sun, Shudong & Li, Caitao, 2016. "Optimization of linear consecutive-k-out-of-n system with a Birnbaum importance-based genetic algorithm," Reliability Engineering and System Safety, Elsevier, vol. 152(C), pages 248-258.
    9. Cova, Thomas J. & Johnson, Justin P., 2003. "A network flow model for lane-based evacuation routing," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(7), pages 579-604, August.
    10. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    11. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    12. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    13. Krumke, Sven O. & Thielen, Clemens, 2013. "The generalized assignment problem with minimum quantities," European Journal of Operational Research, Elsevier, vol. 228(1), pages 46-55.
    14. Batel Ziv & Yisrael Parmet, 2022. "Improving nonconformity responsibility decisions: a semi-automated model based on CRISP-DM," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(2), pages 657-667, April.
    15. Talmor, Irit, 2022. "Solving the problem of maximizing diversity in public sector teams," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).
    16. Camacho-Sanchez, Carolay & Yie-Pinedo, Ruben & Galindo, Gina, 2023. "Humanitarian demining for the clearance of landmine-affected areas," Socio-Economic Planning Sciences, Elsevier, vol. 88(C).
    17. Zheng, Feifeng & Cheng, Yongxi & Xu, Yinfeng & Liu, Ming, 2013. "Competitive strategies for an online generalized assignment problem with a service consecution constraint," European Journal of Operational Research, Elsevier, vol. 229(1), pages 59-66.
    18. Ágoston, Kolos Csaba & Biró, Péter & Szántó, Richárd, 2018. "Stable project allocation under distributional constraints," Operations Research Perspectives, Elsevier, vol. 5(C), pages 59-68.
    19. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
    20. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.

    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:gam:jftint:v:5:y:2013:i:4:p:515-534:d:29596. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.