On the impact of objective function transformations on evolutionary and black-box algorithms |
| |
Authors: | Tobias Storch |
| |
Affiliation: | (1) Department of Computer Science II, University of Dortmund, 44221 Dortmund, Germany |
| |
Abstract: | Different objective functions characterize different problems. However, certain fitness transformations can lead to easier problems although they are still a model of the considered problem. In this article, the class of not worsening transformations for a simple population-based evolutionary algorithm (EA) is described completely. That is the class of functions that transfers easy problems in easy ones and difficult problems in difficult ones. Surprisingly, this class for the rank-based EA equals that for all black-box algorithms. The importance of the black-box algorithms' knowledge of the transformation is also pointed out. Hence, a comparison with the class of not worsening transformations for a similar EA which applies fitness-proportional selection, shows that is a proper superset of . Moreover, is a proper subset of the corresponding class for random search. Finally, the minimal and maximal classes of not worsening transformations are described completely, too. |
| |
Keywords: | Evolutionary algorithm Black-box algorithm Runtime analysis |
本文献已被 SpringerLink 等数据库收录! |
|