An Efficient Building Evacuation Algorithm in Congested Networks
This paper proposes a new network model for the building evacuation problem considering congestion levels and provides a mixed integer linear programming (MILP) model and an efficient heuristic algorithm solving the problem. Constructing an optimization model with several congestion levels, we intro...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8911370/ |
id |
doaj-2eb6426ca6174e64a8009ec08b4377fc |
---|---|
record_format |
Article |
spelling |
doaj-2eb6426ca6174e64a8009ec08b4377fc2021-03-30T00:24:19ZengIEEEIEEE Access2169-35362019-01-01716948016949410.1109/ACCESS.2019.29554778911370An Efficient Building Evacuation Algorithm in Congested NetworksChang Hyup Oh0Min Hee Kim1Byung-In Kim2https://orcid.org/0000-0003-4526-2509Young Myoung Ko3https://orcid.org/0000-0003-0659-6688Department of Industrial and Management Engineering, Pohang University of Science and Technology, Pohang, South KoreaDepartment of Industrial and Systems Engineering, University of Wisconsin–Madison, Madison, WI, USADepartment of Industrial and Management Engineering, Pohang University of Science and Technology, Pohang, South KoreaDepartment of Industrial and Management Engineering, Pohang University of Science and Technology, Pohang, South KoreaThis paper proposes a new network model for the building evacuation problem considering congestion levels and provides a mixed integer linear programming (MILP) model and an efficient heuristic algorithm solving the problem. Constructing an optimization model with several congestion levels, we introduce a new network called the multi-class time-expanded (MCTE) network having several exclusive arcs connecting the same tail and head nodes. The MCTE networks make both the MILP model and the heuristic algorithm reflect a realistic situation in congested networks. Considering MCTE networks makes the problem difficult to solve, which motivates us to develop an efficient heuristic algorithm. We test our heuristic algorithm using several real-world networks such as a multiplex cinema, a subway station, and a large-size complex shopping mall in addition to an artificial network for clear comparison between the proposed algorithm and the MILP approaches. The results indicate that the proposed algorithm runs fast and produces a near-optimal solution compared with those from MILP models with a commercial solver.https://ieeexplore.ieee.org/document/8911370/Building evacuationcongested networksmovement evacuation modelmulti-class time-expanded networks |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Chang Hyup Oh Min Hee Kim Byung-In Kim Young Myoung Ko |
spellingShingle |
Chang Hyup Oh Min Hee Kim Byung-In Kim Young Myoung Ko An Efficient Building Evacuation Algorithm in Congested Networks IEEE Access Building evacuation congested networks movement evacuation model multi-class time-expanded networks |
author_facet |
Chang Hyup Oh Min Hee Kim Byung-In Kim Young Myoung Ko |
author_sort |
Chang Hyup Oh |
title |
An Efficient Building Evacuation Algorithm in Congested Networks |
title_short |
An Efficient Building Evacuation Algorithm in Congested Networks |
title_full |
An Efficient Building Evacuation Algorithm in Congested Networks |
title_fullStr |
An Efficient Building Evacuation Algorithm in Congested Networks |
title_full_unstemmed |
An Efficient Building Evacuation Algorithm in Congested Networks |
title_sort |
efficient building evacuation algorithm in congested networks |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2019-01-01 |
description |
This paper proposes a new network model for the building evacuation problem considering congestion levels and provides a mixed integer linear programming (MILP) model and an efficient heuristic algorithm solving the problem. Constructing an optimization model with several congestion levels, we introduce a new network called the multi-class time-expanded (MCTE) network having several exclusive arcs connecting the same tail and head nodes. The MCTE networks make both the MILP model and the heuristic algorithm reflect a realistic situation in congested networks. Considering MCTE networks makes the problem difficult to solve, which motivates us to develop an efficient heuristic algorithm. We test our heuristic algorithm using several real-world networks such as a multiplex cinema, a subway station, and a large-size complex shopping mall in addition to an artificial network for clear comparison between the proposed algorithm and the MILP approaches. The results indicate that the proposed algorithm runs fast and produces a near-optimal solution compared with those from MILP models with a commercial solver. |
topic |
Building evacuation congested networks movement evacuation model multi-class time-expanded networks |
url |
https://ieeexplore.ieee.org/document/8911370/ |
work_keys_str_mv |
AT changhyupoh anefficientbuildingevacuationalgorithmincongestednetworks AT minheekim anefficientbuildingevacuationalgorithmincongestednetworks AT byunginkim anefficientbuildingevacuationalgorithmincongestednetworks AT youngmyoungko anefficientbuildingevacuationalgorithmincongestednetworks AT changhyupoh efficientbuildingevacuationalgorithmincongestednetworks AT minheekim efficientbuildingevacuationalgorithmincongestednetworks AT byunginkim efficientbuildingevacuationalgorithmincongestednetworks AT youngmyoungko efficientbuildingevacuationalgorithmincongestednetworks |
_version_ |
1724188317800464384 |