Time-efficient Evacuation Routing Algorithm Incorporating Contraflow

<p>In emergency situations such as hurricane Sandy, an effective evacuation plan possibly with contraflows is required. In order to achieve an effective evacuation plan, evacuation time and computation time need to be short. In this thesis two aspects of evacuation algorithms are discussed: minimum time evacuation using contraflow and minimum time using evacuation routing planning. To make evacuation time shorter by using contraflow algorithm, Maximum Throughput Flow Contraflow Routing algorithm (MTFC) is presented. The MTFC shows similar evacuation time to the Greedy contraflow routing algorithm with shorter computation time. The Greedy algorithm is based on CCRP++ which is known as an effective local optimal evacuation planning algorithm. But CCRP++ has problems such as outdated earliest arrival time (EA), and long execution time. For a minimum time evacuation routing planning, approaches using dynamic and static multiple paths that will enhance CCRP++ are proposed in this thesis. The computational results of this algorithm show enhanced overall performance over the CCRP++ using MTFC as input data. The evacuation planner algorithm shows shorter evacuation time than CCRP++ in most cases and shorter execution time than CCRP++ in all cases.</p>

Name thesis:degree_name

Master of Science (MS)

Level thesis:degree_level

Thesis - University Access Only

Discipline thesis:degree_discipline

Electrical Engineering and Computer Science

Year dc:date.available

2013

Author dc:creator

• Lee, Jonguk

Contributors dc:contributor

• Manki Min

• Electrical and Computer Engineering

Statement dc:rights

• <p>In Copyright - Non-Commercial Use Permitted<br /><a href="http://rightsstatements.org/vocab/InC-NC/1.0/">http://rightsstatements.org/vocab/InC-NC/1.0/</a></p>

Language dc:language

en

Repository record dc:identifier

https://openprairie.sdstate.edu/etd/1456

OAI identifier oai:identifier

oai:openprairie.sdstate.edu:etd-2460