Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/5857
Title: | Constructing dynamic test environments for genetic algorithms based on problem difficulty |
Authors: | Yang, S |
Keywords: | Decomposable trap function;Dynamic environment generator;Dynamic optimization problems;Dynamic test environments;Genetic algorithms;Problem difficulty |
Issue Date: | 2004 |
Publisher: | IEEE |
Citation: | IEEE Congress on Evolutionary Computation (CEC 2004), 2: 1262 - 1269, 19 - 23 Jun 2004 |
Abstract: | In recent years the study of dynamic optimization problems has attracted an increasing interest from the community of genetic algorithms and researchers have developed a variety of approaches into genetic algorithms to solve these problems. In order to compare their performance, an important issue is the construction of standardized dynamic test environments. Based on the concept of problem difficulty, This work proposes a new dynamic environment generator using a decomposable trap function. With this generator, it is possible to systematically construct dynamic environments with changing and bounding difficulty and hence, we can test different genetic algorithms under dynamic environments with changing but controllable difficulty levels. |
Description: | This article is posted here with permission from IEEE - Copyright @ 2004 IEEE |
URI: | http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1331042 http://bura.brunel.ac.uk/handle/2438/5857 |
DOI: | http://dx.doi.org/10.1109/CEC.2004.1331042 |
ISBN: | 0-7803-8515-2 |
Appears in Collections: | Publications Computer Science Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 574.18 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.