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

Wang Y, Zheng X. J. Appl. Fire Sci. 2013; 23(3): 283-297.

Copyright

(Copyright © 2013, Baywood Publishing)

DOI

10.2190/AF.23.3.b

PMID

unavailable

Abstract

The present article studies the method of locating evacuation signs in a room full of smoke and a two steps optimization algorithm is proposed to obtain the best locations of evacuation signs in a building room. The efficiency of signs is validated by evacuation simulation with a cellular automaton (CA) model. The problem of signs location is divided into two optimization problems: maximal covering location problem and P-center problem, which are foundational problems in facility location problems. Maximal covering location problem is solved with Greedy Adding algorithm to obtain the initial locations of evacuation signs, which is not necessarily the best result. P-center problem is solved with an enumeration-like algorithm to obtain the final locations of all signs. The result of optimization shows pedestrians in a room full of smoke can find the shortest path to exit with the guidance of evacuation signs, so the evacuation time is shortest and people are safest.

NEW SEARCH


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