Genetic Algorithms for Solving Disjoint PathProblem with Proportional Path-Costs

Show full item record

Title: Genetic Algorithms for Solving Disjoint PathProblem with Proportional Path-Costs
Author: Ozcam, Burcu
Advisors: Dr. Shu-Cherng Fang, Chair
Dr. Henry L. W. Nuttle, Co-Chair
Dr. Russell E. King, Advisory Committee, Member
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.
Date: 2001-07-02
Degree: MS
Discipline: Industrial Engineering
URI: http://www.lib.ncsu.edu/resolver/1840.16/23


Files in this item

Files Size Format View
etd.pdf 458.9Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record