재난 지역 다수 조난자 구조를 위한 최적 경로 계획 알고리즘 연구
A Study on the Optimal Routing Planning Algorithm for Rescue of Multiple Victims in Disaster Area
김기태(국방대학교); 조성진(국방대학교); 전건욱(국방대학교)
12권 2호, 17~23쪽
초록
The large-scale disasters occur to unexpected accidents such as natural disasters(earthquake, typhoon, tsunami, etc.), and human-caused accidents(fire, collapse, terror etc.). Rescue teams perform rescue activities to save many lives in large-scale disaster area. The main purpose of this study is to compose a optimal routing planning for rescue of multiple victims in disaster area. A realistic routing planning with rescue limit time which considers rehabilitation and reconstruction will be suggested in this study. A mathematical programming model and a hybrid genetic algorithm will be suggested to minimize the total spending time. By comparing the result, the suggested algorithm gives a better solution than existing algorithms.
Abstract
The large-scale disasters occur to unexpected accidents such as natural disasters(earthquake, typhoon, tsunami, etc.), and human-caused accidents(fire, collapse, terror etc.). Rescue teams perform rescue activities to save many lives in large-scale disaster area. The main purpose of this study is to compose a optimal routing planning for rescue of multiple victims in disaster area. A realistic routing planning with rescue limit time which considers rehabilitation and reconstruction will be suggested in this study. A mathematical programming model and a hybrid genetic algorithm will be suggested to minimize the total spending time. By comparing the result, the suggested algorithm gives a better solution than existing algorithms.
- 발행기관:
- 대한안전경영과학회
- 분류:
- 안전공학