Show simple item record

dc.contributor.advisorSen, Suvrajeeten_US
dc.contributor.authorVohnout, Sonia Isabel, 1964-
dc.creatorVohnout, Sonia Isabel, 1964-en_US
dc.date.accessioned2013-05-16T09:48:23Z
dc.date.available2013-05-16T09:48:23Z
dc.date.issued1990en_US
dc.identifier.urihttp://hdl.handle.net/10150/291952
dc.description.abstractThis thesis discusses an algorithm and two heuristics for solving a particular network optimization problem: The node-disjoint paths problem. The goal of this optimization problem is to find two node-disjoint paths between a given origin-destination pair whose total cost is minimum. This problem is shown to be NP-Hard. Two heuristics are investigated in this thesis. The sequential shortest paths heuristic, is the faster of the two methods, but the quality of the solution may be sacrificed. On the other hand, the simultaneous shortest paths heuristic, which yields very good solutions, has higher complexity. We also discuss an implicit enumeration algorithm that is used to verify the quality of the solution obtained from the heuristics.
dc.language.isoen_USen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.subjectOperations Research.en_US
dc.titleDiverse routing in network planningen_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.levelmastersen_US
dc.identifier.proquest1341290en_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.nameM.S.en_US
dc.identifier.bibrecord.b26341657en_US
refterms.dateFOA2018-04-26T22:23:29Z
html.description.abstractThis thesis discusses an algorithm and two heuristics for solving a particular network optimization problem: The node-disjoint paths problem. The goal of this optimization problem is to find two node-disjoint paths between a given origin-destination pair whose total cost is minimum. This problem is shown to be NP-Hard. Two heuristics are investigated in this thesis. The sequential shortest paths heuristic, is the faster of the two methods, but the quality of the solution may be sacrificed. On the other hand, the simultaneous shortest paths heuristic, which yields very good solutions, has higher complexity. We also discuss an implicit enumeration algorithm that is used to verify the quality of the solution obtained from the heuristics.


Files in this item

Thumbnail
Name:
azu_td_1341290_sip1_m.pdf
Size:
1.679Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record