On test functions for evolutionary multi-objective optimization
Okabe, T, Jin, Y, Olhofer, M and Sendhoff, B (2004) On test functions for evolutionary multi-objective optimization
Available under License : See the attached licence file.
Official URL: http://dx.doi.org/10.1007/978-3-540-30217-9_80
In order to evaluate the relative performance of optimization algorithms benchmark problems are frequently used. In the case of multi-objective optimization (MOO), we will show in this paper that most known benchmark problems belong to a constrained class of functions with piecewise linear Pareto fronts in the parameter space. We present a straightforward way to define benchmark problems with an arbitrary Pareto front both in the fitness and parameter spaces. Furthermore, we introduce a difficulty measure based on the mapping of probability density functions from parameter to fitness space. Finally, we evaluate two MOO algorithms for new benchmark problems. © Springer-Verlag 2004.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||The original publication is available at http://www.springerlink.com|
|Divisions:||Faculty of Engineering and Physical Sciences > Computing Science|
|Deposited By:||Symplectic Elements|
|Deposited On:||20 Jul 2012 13:20|
|Last Modified:||02 Mar 2013 14:43|
Repository Staff Only: item control page