Genetic Algorithms for Solving Disjoint PathProblem with Proportional Path-Costs
| dc.contributor.advisor | Dr. Shu-Cherng Fang, Chair | en_US |
| dc.contributor.advisor | Dr. Henry L. W. Nuttle, Co-Chair | en_US |
| dc.contributor.advisor | Dr. Russell E. King, Advisory Committee, Member | en_US |
| dc.contributor.author | Ozcam, Burcu | en_US |
| dc.date.accessioned | 2010-04-02T17:52:38Z | |
| dc.date.available | 2010-04-02T17:52:38Z | |
| dc.date.issued | 2001-07-02 | en_US |
| dc.degree.discipline | Industrial Engineering | en_US |
| dc.degree.level | Master's Thesis | en_US |
| dc.degree.name | MS | en_US |
| dc.description.abstract | This study was conducted to develop solution algorithms for the edge-disjoint path problem with proportional path-costs in an undirected network with single source-destination pair. Edge-disjoint path problem arises in connectivity analysis, network flow problems, VLSI-design and variety of applications. The complexity of all the variants of the disjoint path problemsis NP-hard. We proposed two genetic algorithms which differ in solution representation.The performance of both algorithms tested on small, medium and large size complete graphs using different cost structures. As a result, genetic algorithm with priority-based encoding is shown to beinefficient, whereas genetic algorithm with variable-length path encoding is shown to be satisfactoryfor finding the edge-disjoint paths with proportional path-costs. | en_US |
| dc.identifier.other | etd-20010629-132423 | en_US |
| dc.identifier.uri | http://www.lib.ncsu.edu/resolver/1840.16/23 | |
| dc.rights | I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. | en_US |
| dc.title | Genetic Algorithms for Solving Disjoint PathProblem with Proportional Path-Costs | en_US |
Files
Original bundle
1 - 1 of 1
