Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/5992
Title: | A generalized approach to construct benchmark problems for dynamic optimization |
Authors: | Li, C Yang, S |
Keywords: | Evolutionary algorithms;Dynamic environments;Generalized dynamic benchmark generator |
Issue Date: | 2008 |
Publisher: | Springer |
Citation: | 7th International Conference on Simulated Evolution and Learning (SEAL 2008), Lecture Notes in Computer Science 5361: 391 - 400, 2008 |
Abstract: | There has been a growing interest in studying evolutionary algorithms in dynamic environments in recent years due to its importance in real applications. However, different dynamic test problems have been used to test and compare the performance of algorithms. This paper proposes a generalized dynamic benchmark generator (GDBG) that can be instantiated into the binary space, real space and combinatorial space. This generator can present a set of different properties to test algorithms by tuning some control parameters. Some experiments are carried out on the real space to study the performance of the generator. |
Description: | Copyright @ Springer-Verlag Berlin Heidelberg 2008. |
URI: | http://www.springerlink.com/content/567l022t27l67x10/ http://bura.brunel.ac.uk/handle/2438/5992 |
DOI: | http://dx.doi.org/10.1007/978-3-540-89694-4_40 |
ISSN: | 0302-9743 |
Appears in Collections: | Computer Science Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 534.99 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.