Show simple item record

dc.contributor.authorLi, Changheen
dc.contributor.authorYang, Shengxiangen
dc.date.accessioned2013-06-11T10:55:39Z
dc.date.available2013-06-11T10:55:39Z
dc.date.issued2008
dc.identifier.citationLi, C. and Yang, S. (2008) A generalized approach to construct benchmark problems for dynamic optimization. In: Simulated evolution and learning: proceedings of the 7th international conference, SEAL 2008, Melbourne, Australia, December 7-10, 2008. Berlin: Springer-Verlag, pp. 391-400.en
dc.identifier.isbn9783540896937
dc.identifier.urihttp://hdl.handle.net/2086/8719
dc.description.abstractThere 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.en
dc.language.isoenen
dc.publisherSpringer-Verlag.en
dc.relation.ispartofseriesLecture Notes in Computer Science;Vol. 5361
dc.titleA generalized approach to construct benchmark problems for dynamic optimization.en
dc.typeArticleen
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-540-89694-4_40
dc.researchgroupCentre for Computational Intelligenceen
dc.peerreviewedYesen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record