Show simple item record

dc.contributor.advisorNicholson, Charles
dc.contributor.authorChang, Yanbin
dc.date.accessioned2018-05-11T16:23:51Z
dc.date.available2018-05-11T16:23:51Z
dc.date.issued2018-05-11
dc.identifier.urihttps://hdl.handle.net/11244/299893
dc.description.abstractThis study addresses optimization modeling for recovery of a transportation system after a major disaster. In particular, a novel metric based on the shape of the recovery curve is introduced as the objective to minimize. This metric is computed as the distance from the pre-disaster system performance at a time immediately before disruption to the two-dimensional location of the centroid point of the area beneath the recovery curve. The recovery trajectories derived from optimization models with this new metric are considered along with two other recovery goals from literature, i.e., minimizing the total recovery time and minimizing the skew of the recovery trajectory. A genetic algorithm is implemented to search for optimal restoration schedules under each objective and empirical analysis is used to evaluate the corresponding quality of the solutions. Additionally, a particle swarm optimization algorithm is employed as an alternative metaheuristic and the quality of the recovery schedules, as well as the observed computational efficiency is analyzed.en_US
dc.languageen_USen_US
dc.subjectpost-disaster networken_US
dc.subjectGomory-Hu Treeen_US
dc.subjectcentroid of recovery trajectory distanceen_US
dc.subjectGenetic algorithms and particle swarm optimizationen_US
dc.titleHeuristic Approach to Network Recoveryen_US
dc.contributor.committeeMemberBarker, Kash
dc.contributor.committeeMemberAllen, Janet
dc.date.manuscript2018-05-10
dc.thesis.degreeMaster of Scienceen_US
ou.groupCollege of Engineering::School of Industrial and Systems Engineeringen_US
shareok.nativefileaccessrestricteden_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record