qin zhao

Ms. qin zhao

Wuhan University of Technology

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
LLLinfan Liu
Linfan Liu
HZHua-Jun Zhang
Hua-Jun Zhang
JXJupeng Xie
Jupeng Xie
qin zhaoqin zhao
qin zhao
The emergency evacuation route planning of cruise ships directly affects the safety of all crew members and passengers during emergencies. Research on the planning of emergency evacuation routes for cruise ships is a frontier subject of maritime safety. This study proposes an improved ant colony system (IACS) to solve the evacuation route planning of crowds on cruise ships. The IACS, which is different from common single-path ant colony system (ACS) evacuation algorithms, is used to solve the multipath planning problem of crowd evacuation from cruise ships by considering crowd density and speed in the model. An increasing flow method is introduced into the IACS to improve the efficiency of the proposed algorithm. Numerical experiments show that this method meets the requirements of evacuation analysis guidelines for new and existing passenger ships (MSC.1/Circ.1533)and can effectively and efficiently plan the emergency evacuation path for cruise ship crowd.

2 August 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
HZHua-Jun Zhang
Hua-Jun Zhang
qin zhaoqin zhao
qin zhao
ZCZihui Cheng
Zihui Cheng
LLLinfan Liu
Linfan Liu
YSYixin Su
Yixin Su
In order to find the optimal path for emergency evacuation, this paper proposes a dynamic path optimization algorithm based on real-time information to search the optimal path and it takes fire accident as an example to introduce the algorithm principle. Before the accidents, it uses the Dijkstra algorithm to get the prior evacuation network which includes evacuation paths from each node to the exit port. When the accidents occur, the evacuees are unable to pass through the passage where the accident point and the blocking point are located, then the proposed method uses the breadth-first search strategy to solve the path optimization problem based on the prior evacuation network, and it dynamically updates the evacuation path according to the real-time information. Because the prior evacuation network includes global optimal evacuation paths from each node to the exit port, the breadth-first search algorithm only searches local optimal paths to avoid the blockage node or dangerous area. Because the online optimization solves a local pathfinding problem and the entire topology optimization is an offline calculation, the proposed method can find the optimal path in a short time when the accident situation changes. The simulation tests the performances of the proposed algorithm with different situations based on the topology of a building, and the results show that the proposed algorithm is effective to get the optimal path in a short time when it faces changes caused by the factors such as evacuee size, people distribution, blockage location, and accident points.