Random Dynamics Optimum Tracking with Evolution Strategies
| dc.contributor.author | Arnold, Dirk V. | de |
| dc.contributor.author | Beyer, Hans-Georg | de |
| dc.date.accessioned | 2004-12-07T08:21:08Z | |
| dc.date.available | 2004-12-07T08:21:08Z | |
| dc.date.created | 2002 | de |
| dc.date.issued | 2002-04-08 | de |
| dc.description.abstract | Dynamic optimization is frequently cited as a prime application area for evolutionary algorithms. In contrast to static optimization, the objective in dynamic optimization is to continuously adapt the solution to a changing environment - a task that evolutionary algorithms are believed to be good at. At the time being, however, almost all knowledge with regard to the performance of evolutionary algorithms in dynamic environments is of an empirical nature. In this paper, tools devised originally for the analysis in static environments are applied to study the performance of a popular type of recombinative evolution strategy with cumulative mutation strength adaptation on a dynamic problem. With relatively little effort, scaling laws that quite accurately describe the behavior of the strategy and that greatly contribute to its understanding are derived and their implications are discussed. | en |
| dc.format.extent | 163928 bytes | |
| dc.format.extent | 166665 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/5423 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15283 | |
| dc.language.iso | en | de |
| dc.publisher | Universität Dortmund | de |
| dc.relation.ispartofseries | Reihe Computational Intelligence ; 130 | de |
| dc.subject.ddc | 004 | de |
| dc.title | Random Dynamics Optimum Tracking with Evolution Strategies | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | |
| dcterms.accessRights | open access |