SAFETYLIT WEEKLY UPDATE

We compile citations and summaries of about 400 new articles every week.
RSS Feed

HELP: Tutorials | FAQ
CONTACT US: Contact info

Search Results

Journal Article

Citation

Li XJ, Chen WB, Chen RX, Chang CT, Chen SH. Comput. Ind. Eng. 2023; 177: e109014.

Copyright

(Copyright © 2023, Elsevier Publishing)

DOI

10.1016/j.cie.2023.109014

PMID

unavailable

Abstract

Evacuation in the event of a fire in an urban underground complexes (UUC) is a big challenge. How to conduct limited evacuation in case of a fire in UUC is a problem worthy of attention. A hexagonal grid was used to balance the timing of each move to the adjacent grid to synchronize fire diffusion and crowd evacuation. This paper proposes an improved ant colony (IACO) algorithm to determine the shortest evacuation path in the case of a fire under an UUC considering real-time fire diffusion. The proposed model was verified under various scenarios. The results show that compared with the traditional quadrilateral raster map, the hexagon raster map can ensure that the moving distance in any direction is equal. The proposed IACO contributes to the body of knowledge resulted in shorter evacuation paths and avoided detours into dangerous areas and "through the wall" errors. These findings could be used to improve fire safety management plans and select evacuation technology, while assisting in the development of intelligent emergency evacuation systems.


Language: en

Keywords

Ant colony algorithm; Emergency evacuation; Fire dynamics software; Real-time impact; Shortest path

NEW SEARCH


All SafetyLit records are available for automatic download to Zotero & Mendeley
Print