Please use this identifier to cite or link to this item:
Title: Non-stationary problem optimization using the primal-dual genetic algorithm
Authors: Yang, S
Keywords: Biological cells;Computer science;DNA;Encoding;Evolutionary computation;Genetic algorithms;Hamming distance;Organisms;Robustness;Trajectory
Issue Date: 2003
Publisher: IEEE
Citation: IEEE Congress on Evolutionary Computation (CEC 2003), 3: 2246 - 2253, 08 - 12 Dec 2003
Abstract: Genetic algorithms (GAs) have been widely used for stationary optimization problems where the fitness landscape does not change during the computation. However, the environments of real world problems may change over time, which puts forward serious challenge to traditional GAs. In this paper, we introduce the application of a new variation of GA called the primal-dual genetic algorithm (PDGA) for problem optimization in nonstationary environments. Inspired by the complementarity and dominance mechanisms in nature, PDGA operates on a pair of chromosomes that are primal-dual to each other in the sense of maximum distance in genotype in a given distance space. This paper investigates an important aspect of PDGA, its adaptability to dynamic environments. A set of dynamic problems are generated from a set of stationary benchmark problems using a dynamic problem generating technique proposed in this paper. Experimental study over these dynamic problems suggests that PDGA can solve complex dynamic problems more efficiently than traditional GA and a peer GA, the dual genetic algorithm. The experimental results show that PDGA has strong viability and robustness in dynamic environments.
Description: This article is posted here with permission from IEEE - Copyright @ 2003 IEEE
ISBN: 0-7803-7804-0
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf570.76 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.