{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd-2460"},"canonical_url":"https://search.dev.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd-2460","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Time-efficient Evacuation Routing Algorithm Incorporating Contraflow","abstract":"<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>","abstract_html":"&lt;p&gt;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.&lt;/p&gt;","abstract_has_math":false,"creators":["Lee, Jonguk"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis - University Access Only","degree_discipline":"Electrical Engineering and Computer Science","degree_department":null,"school":null,"contributors":["Manki Min"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-01-01T08:00:00Z","date_published":"2013-01-01T08:00:00Z","updated_at":"2026-07-24T04:29:08Z","subjects":["Electrical and Computer Engineering"],"languages":["en"],"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>"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd/1456","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Manki Min"]},{"key":"dc:creator","label":"Author","values":["Lee, Jonguk"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2017-08-07T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering and Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - University Access Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical and Computer Engineering"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["<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>"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd/1456"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:title","label":"Title","values":["Time-efficient Evacuation Routing Algorithm Incorporating Contraflow"]}]}],"canonical_facts":{"dc:contributor":["Manki Min"],"dc:creator":["Lee, Jonguk"],"dc:date.available":["2017-08-07T07:00:00Z"],"dc:description.abstract":["<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>"],"dc:identifier":["https://openprairie.sdstate.edu/etd/1456"],"dc:language":["en"],"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>"],"dc:subject":["Electrical and Computer Engineering"],"dc:title":["Time-efficient Evacuation Routing Algorithm Incorporating Contraflow"],"thesis:degree_discipline":["Electrical Engineering and Computer Science"],"thesis:degree_level":["Thesis - University Access Only"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-07-24T04:29:08Z"}