Priority-Oriented Route Network Planning for Evacuation in Constrained Space Scenarios

Yi Hong (), Deying Li, Qiang Wu and Hua Xu
Additional contact information
Yi Hong: Beijing Institute of Petrochemical Technology
Deying Li: Renmin University of China
Qiang Wu: China University of Mining and Technology, Beijing
Hua Xu: Beijing Institute of Petrochemical Technology

Journal of Optimization Theory and Applications, 2019, vol. 181, issue 1, No 14, 279-297

Abstract: Abstract Evacuation planning in three-dimensional (3D) constrained space scenarios is an important kind of emergency management problems. In this paper, we investigate a path planning problem in constrained space evacuation for 3D scenarios, named the Priority-based Route Network Constructing Problem, which has two objectives of maximizing the evacuation exits’ utilization efficiency and minimizing the whole evacuation delay. We propose a 3-phase heuristic to construct a route network based on the Minimum Weighted Set Cover. In the experimental evaluation, we compare the proposed algorithm with the existing algorithms and implement our algorithm in underground mine evacuation, which is a typical kind of constrained space scenarios. Both types of results indicate our strategy can enhance the utilization efficiency of the escaping exits and guarantee a tolerable range of the global escaping time-consumption with a low running time.

Keywords: Path planning problem; Constrained space evacuation; 3D scenarios; Route network; Minimum weighted set cover; 90B20; 90B50; 90C35 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-018-1386-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:181:y:2019:i:1:d:10.1007_s10957-018-1386-2

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-018-1386-2

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().