论文信息 - Real-Parameter Black-Box Optimization Benchmarking 2009: Experimental Setup

Real-Parameter Black-Box Optimization Benchmarking 2009: Experimental Setup

Quantifying and comparing performance of numerical optimization algorithms is an important aspect of research in search and optimization. However, this task turns out to be tedious and dicult

[1] Acknowledgments , 2006, Molecular and Cellular Endocrinology.

[2] Raymond Ros,et al. Black-box optimization benchmarking the IPOP-CMA-ES on the noiseless testbed: comparison to the BIPOP-CMA-ES , 2010, GECCO '10.

[3] Robert Tibshirani,et al. An Introduction to the Bootstrap , 1994 .

[4] K. Price. Differential evolution vs. the functions of the 2/sup nd/ ICEO , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[5] Nikolaus Hansen,et al. A restart CMA evolution strategy with increasing population size , 2005, 2005 IEEE Congress on Evolutionary Computation.

[6] Ouyang Yu,et al. Horizontal and Vertical , 2003 .

[7] Anne Auger,et al. Performance evaluation of an advanced local search evolutionary algorithm , 2005, 2005 IEEE Congress on Evolutionary Computation.

[8] Vitaliy Feoktistov,et al. Differential Evolution: In Search of Solutions (Springer Optimization and Its Applications) , 2006 .

[9] Anne Auger,et al. Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions , 2009 .

[10] Fernando G. Lobo,et al. A parameter-less genetic algorithm , 1999, GECCO.

[11] Vitaliy Feoktistov. Differential Evolution: In Search of Solutions , 2006 .

[12] Thomas Stützle,et al. Evaluating Las Vegas Algorithms: Pitfalls and Remedies , 1998, UAI.

[13] Anne Auger,et al. Benchmarking the pure random search on the BBOB-2009 testbed , 2009, GECCO '09.