Research on fire escape paths for complex public buildings with multiple starting and end points
by Yi Zhang; Chi Wang; Wenwen Tong; Tianqi Liu
International Journal of Simulation and Process Modelling (IJSPM), Vol. 19, No. 1/2, 2022

Abstract: In order to solve the path planning problem in the escape and evacuation of dense crowds in complex buildings, an improved Dijkstra's algorithm is proposed in this paper to carry out a research on the planning of the shortest escape path from the starting point of the crowds to the security exit of the building. In order to test the effect of the algorithm, the simulation of the proposed improved algorithm has been carried out in the paper using real commercial bodies as a model with different numbers of people and different distribution densities. The experimental results verify that the proposed algorithm is fast and efficient and can effectively improve the escape efficiency of the crowds, which has strong application value.

Online publication date: Mon, 17-Apr-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Simulation and Process Modelling (IJSPM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com