Browsing by Author "Ozcam, Burcu"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • No Thumbnail Available
    Genetic Algorithms for Solving Disjoint PathProblem with Proportional Path-Costs
    (2001-07-02) Ozcam, Burcu; Dr. Shu-Cherng Fang, Chair; Dr. Henry L. W. Nuttle, Co-Chair; Dr. Russell E. King, Advisory Committee, Member
    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.
  • No Thumbnail Available
    Solving Semi-Infinite Variational Inequalities
    (2006-08-02) Ozcam, Burcu; Dr. Xiuli Chao, Committee Member; Dr. Elmor L. Peterson, Committee Member; Dr. Shu-Cherng Fang, Committee Chair; Dr. Henry L.W. Nuttle, Committee Co-Chair
    The variational inequality problem arises in numerous contexts. In this dissertation, we consider solving a semi-infinite variational inequality problem, which is a variational inequality problem defined on a domain described by infinitely many constraints. We present characterization and the solution analysis for semi-infinite variational inequalities. After introducing the solution analysis, three solution methodologies, namely a discretizationbased smoothing method, an exchange method and an entropic analytic center cutting plane method are proposed. A comprehensive computational results with the comparison of the algorithms is provided.