A note on bound constraints handling for the IEEE CEC'05 benchmark function suite.
The benchmark functions and some of the algorithms proposed for the special session on real parameter optimization of the 2005 IEEE Congress on Evolutionary Computation (CEC'05) have played and still play an important role in the assessment of the state of the art in continuous optimization. In this article, we show that if bound constraints are not enforced for the final reported solutions, state-of-the-art algorithms produce infeasible best candidate solutions for the majority of functions of the IEEE CEC'05 benchmark function suite. This occurs even though the optima of the CEC'05 functions are within the specified bounds. This phenomenon has important implications on algorithm comparisons, and therefore on algorithm designs. This article's goal is to draw the attention of the community to the fact that some authors might have drawn wrong conclusions from experiments using the CEC'05 problems.
State Key Laboratory of Complex System Simulation, Beijing Institute of System Engineering, Beijing, China liaotianjun@gmail.com.
Tianjun
T
Liao
Daniel
D
Molina
Marco A Montes
MA
de Oca
Thomas
T
Stützle
D000465:Algorithms; D019985:Benchmarking / Q000379:methods*; D003205:Computing Methodologies; D008962:Models, Theoretical