• Spatial Information Research
• /
• v.21 no.5
• /
• pp.33-41
• /
• 2013

Recently, the number of disasters has been seriously increasing. The total damages by the natural or man-made disasters during the past years resulted in tremendous fatalities and recovery costs. It is necessary to have efficient emergency evacuation management which is concerned with identifying evacuation route, and the estimation of evacuation and clearance times. An emergency evacuation model is important in identifying critical locations, and developing various evacuation strategies. In that existing evacuation models have focused on route analysis for indoor evacuation, there are only a few models for areawide emergency evacuation analysis. Therefore, we developed a mesoscopic model by using Cube Avenue and performed evacuation simulation, targeting road network in City of Fargo, North Dakota. Consequently, a mesoscopic model developed in this study is used to carry out dynamic analysis using network and input variable of existing travel demand model. The results of this study show that the model is an appropriate tool for areawide emergency evacuation analysis to save time and cost. Henceforth, the results of this study can be applied to develop a disaster evacuation model which can be used for a variety of disaster simulation and evaluation based on scenarios in the local metropolitan area.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.1
• /
• pp.27-42
• /
• 2019

It is not easy to evacuate when people face with emergency situation in deep underground space because space perception and synthetic judgement are readily lowered. In stead of evacuating safely outside within the given time, evacuation safety zone is required to be designed and installed. In this study, PATS (Pedestrian movement based Assessment Toolkit for Simulation) is applied to build a comprehensive and analytic framework for seeking the optimal (or proper) numbers and locations of evacuation safety zone. With two scenarios of emergency situation at intermodal transfer center with the 6 floor in underground, the problematic location on the evacuation path has been identified and the proper locations has been presented.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.21 no.2
• /
• pp.56-67
• /
• 2018

In general, fire and evacuation simulators are used independently to diagnose the safety of building. Because this method does not reflect the movement of pedestrians considering fire spread, it is difficult to expect diagnosis of safety with high accuracy. In this study, we propose the simulation method that can describe the movement of pedestrians in the fire emergency. Our method reflects the FDS fire spread data into FFM and explains the situation in which a pedestrian recognize a fire and escapes to a safe route. This study consists of data linkage between FDS and FFM and development of improved FFM. Experiment of the proposed method is progressed using the EgresSIM. Simulation result shows that the number of evacuees on each exit is affected by the presence or absence of fire and it was confirmed that the evacuation time increase and the bottleneck phenomenon deepened by exit.

• Proceedings of the Korea Institute of Fire Science and Engineering Conference
• /
• 2008.11a
• /
• pp.304-309
• /
• 2008

본 논문은 기존 기발된 재실자의 탈출 계획 및 예측 프로그램 개발에 대해 길 찾기를 위한 알고리즘으로는 Dijkstra 알고리즘, Best-First Search 알고리즘, Johnson 알고리즘 등이 있으며 가장 안정적으로 알고리즘 구현이 가능한 A*알고리즘을 적용하였다. 따라서, 본 개발 프로그램은 재실자가 대피 목적지를 향한 최적의 길 찾기를 이용하여 가장 가까운 거리에 있는 탈출구를 효율적으로 찾을 수가 있으며 재실자의 사실감 있는 대피 이동 동선의 구현을 위해 기존의 경직된 경로를 매끄럽게 구현하였다. 탈출구는 흐름율과 정체 반경을 적용하여 재실자가 탈출구에 밀집하였을 경우 병목 현상이 발생하도록 하여 대피현상이 실제 상황과 유사하도록 프로그램을 구축하였다. 본 대피프로그램은 실제 건물의 CAD도면을 import 가능하도록 구축함으로서 대피평가시간을 절약할 수 있도록 하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.307-310
• /
• 2009

본 논문은 대형 건축물 내에서의 보행자 대피 시뮬레이션을 위해, 광범위한 네트워크 모델과 세밀한 네트워크 모델을 통합하는 방법과보행자가 자연스럽게 벽이나 장애물을 피하면서 이동할 수 있도록 하는 개선된 보행자 이동 모델을 제안한다. 제안하는 네트워크 모델을 통해 기존의 광범위 네트워크 모델에서 분석할 수 없는 보행자 개개인의 이동정보를 세밀한 네트워크보다 적은 양의 연산으로 계산할 수 있었고, 개선된 보행자 이동 모델을 통해 보행자가 자연스럽게 벽이나 장애물을 피하면서 이동할 수 있도록 하였다. 제안하는 방법을 대형 건축물인 코엑스 몰에 적용하여 대피 시뮬레이션을 수행한 결과, 3000명의 보행자에 대해 초당 10번 이상의 시뮬레이션 정보를 계산할 수 있었고, 대피 시의 방향 유도에 따른 대피 시간을 확인할 수 있었다.

• Journal of the Korean Society for Railway
• /
• v.10 no.5
• /
• pp.569-575
• /
• 2007

This paper presents a study on a Dijkstra algorithm for shortest paths to destinations and a modified algorithm of Multicommodity Network Flow Problem Model with a network transformation for evacuation planning from railroad accident in a directed network.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2019.05a
• /
• pp.82-82
• /
• 2019

해상에서 긴급상황 발생 시 선박운항자는 짧은 시간에 신속 정확한 의사 결정을 할 필요가 있다. 이를 위해서 해양사고(충돌, 좌초, 화재, 엔진고장, 조타고장) 심각성에 따른 대피항로(해경선, 비상투묘, 표류, 임의좌주, 주변선박) 선정 알고리즘을 설계하였고, 선박운항자를 위한 긴급대피지원안내 시스템을 개발 중에 있다. 본 연구에서는 대피항로 선정 지원 기술 중 비상투묘와 충돌위험도를 중심으로 시스템 적용 모델의 타당성의 평가하고 알고리즘의 신뢰성을 검증하였다. 비상투묘 지원 기술의 검증을 위해 국내외 해양사고 보고서 및 재결서를 분석하고 알고리즘에 적용해 결과를 비교하였다. 충돌위험도를 검증하기 위해 재결서의 선박 충돌 사고 사례를 시뮬레이션으로 재현하였고, 시뮬레이션 기록 데이터를 기반으로 PARK model, IWRAP MK2 프로그램을 이용해 충돌위험도를 평가하였다. 본 연구의 결과를 통해 해양사고 발생 시 선박과 인명 피해를 최소화할 수 있을 것으로 예상된다.

• Journal of the Society of Disaster Information
• /
• v.16 no.1
• /
• pp.123-132
• /
• 2020

Purpose: In this study, the authors propose a flood evacuation plan for skyscrapers with law related to underground space of skyscrapers, domestic and international underground space flood case study and simulation test. Method: This study compares the evacuation pattern of various case from flooded underground spaces extending over several floors with respect to the number of evacuation routes with. Also, simulation test was performed by setting up the virtual underground spaces consisting of three-stories basement and changing the number of the ground entrance, area of the basement and the flooding heights of the basement. Result: There was no difference in evacuation route according to the inundation risk even if there was an area corresponding to risk level 4. This is because the risk in the starting area is greater than that in the evacuation route. Especially, even if the risk of evacuation route increases with time, there is no change in route because the route must be passed to reach the evacuation site. Conclusion: In this study, there was no difference in evacuation route according to the inundation risk. However, if the size and shape of the underground space of each building is different, the depth of inundation with time may be different.

• Journal of the Korean Society for Railway
• /
• v.19 no.2
• /
• pp.234-242
• /
• 2016

In express operation plans for urban trains, it is effective for the reduction of the number of sidetracks to apply a high performance train that has improved acceleration/deceleration ability and a regular train to local and express trains, respectively. In this research, based on a plan to use a high performance train for a local train, an optimization methodology is suggested to reduce the number of sidetracks and the operation time of the local train simultaneously. The optimization solver applied in this research is a genetic algorithm; headway, location of sidetrack and waiting time at the sidetrack are considered as design variables in the optimization problem. Consequently, by applying this system to Seoul metro line no.7, the effect of the suggested methodology was verified by obtaining the proper optimum solution.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.7
• /
• pp.159-172
• /
• 2016

This paper presents a novel algorithm for searching evacuation paths in indoor disaster environments. The proposed method significantly improves the time complexity to find the paths to the evacuation exit by introducing a light-weight Disaster Evacuation Graph (DEG) for a building in terms of the size of the graph. With the DEG, the method also considers load balancing and bottleneck capacity of the paths to the evacuation exit simultaneously. The behavior of the algorithm consists of two phases: horizontal tiering (HT) and vertical tiering (VT). The HT phase finds a possible optimal path from anywhere of a specific floor to the evacuation stairs of the floor. Thus, after finishing the HT phases of all floors in parallel the VT phase begins to integrate all results from the previous HT phases to determine a evacuation path from anywhere of a floor to the safety zone of the building that could be the entrance or the roof of the building. It should be noted that the path produced by the algorithm. And, in order to define the range of graph to process, tiering scheme is used. In order to test the performance of the method, computing times and evacuation times are compared to the existing path searching algorithms. The result shows the proposed method is better than the existing algorithms in terms of the computing time and evacuation time. It is useful in a large-scale building to find the evacuation routes for evacuees quickly.