A. Auger and N. Hansen, Performance Evaluation of an Advanced Local Search Evolutionary Algorithm, 2005 IEEE Congress on Evolutionary Computation, 2005.
DOI : 10.1109/CEC.2005.1554903

A. Auger and N. Hansen, A Restart CMA Evolution Strategy With Increasing Population Size, 2005 IEEE Congress on Evolutionary Computation, 2005.
DOI : 10.1109/CEC.2005.1554902

M. Clerc and J. Kennedy, The particle swarm - explosion, stability, and convergence in a multidimensional complex space, IEEE Transactions on Evolutionary Computation, vol.6, issue.1, pp.58-73, 2002.
DOI : 10.1109/4235.985692

B. Efron and R. Tibshirani, An Introduction to the Bootstrap, 1993.
DOI : 10.1007/978-1-4899-4541-9

V. Feoktistov, Differential Evolution: In Search of Solutions. Optimization and Its Applications, 2006.

S. Gelly, S. Ruette, and O. Teytaud, Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime, Evolutionary Computation, vol.26, issue.3, pp.411-434, 2007.
DOI : 10.1137/0801010
URL : https://hal.archives-ouvertes.fr/inria-00173221

N. Hansen and S. Kern, Evaluating the CMA Evolution Strategy on Multimodal Test Functions, Parallel Problem Solving from Nature -PPSN VIII, pp.282-291, 2004.
DOI : 10.1007/978-3-540-30217-9_29

N. Hansen, S. D. Müller, and P. Koumoutsakos, Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES), Evolutionary Computation, vol.11, issue.1, pp.1-18, 2003.
DOI : 10.1162/106365601750190398

N. Hansen and A. Ostermeier, Adapting arbitrary normal mutation distributions in evolutionstrategies: the covariance matrix adaptation, Proceedings of the IEEE Congress on Evolutionary Computation, pp.312-317, 1996.

N. Hansen and A. Ostermeier, Completely Derandomized Self-Adaptation in Evolution Strategies, Evolutionary Computation, vol.9, issue.2, pp.159-195, 2001.
DOI : 10.1016/0004-3702(95)00124-7

C. Igel and M. Toussaint, On classes of functions for which No Free Lunch results hold, Information Processing Letters, vol.86, issue.6, pp.317-321, 2003.
DOI : 10.1016/S0020-0190(03)00222-9

C. Igel and M. Toussaint, A No-Free-Lunch theorem for non-uniform distributions of target functions, Journal of Mathematical Modelling and Algorithms, vol.1, issue.(1), pp.313-322, 2004.
DOI : 10.1007/s10852-005-2586-y

J. Kennedy and R. Eberhart, Particle swarm optimization, Proceedings of ICNN'95, International Conference on Neural Networks, pp.1942-1948, 1995.
DOI : 10.1109/ICNN.1995.488968

S. Kern, S. D. Müller, N. Hansen, D. Büche, J. Ocenasek et al., Learning probability distributions in continuous evolutionary algorithms ??? a comparative review, Natural Computing, vol.3, issue.1, pp.77-112, 2004.
DOI : 10.1023/B:NACO.0000023416.59689.4e

S. Kok, A. Wilke, and . Groenwold, Recent Developments of the Particle Swarm Optimization Algorithm, Proc of International Conference on Computational Intelligence, 2005.

V. Miranda, Evolutionary Algorithms with Particle Swarm Movements, Proceedings of the 13th International Conference on, Intelligent Systems Application to Power Systems, 2005.
DOI : 10.1109/ISAP.2005.1599236

N. Radcliffe and P. Surry, Fundamental limitations on search algorithms: Evolutionary computing in perspective, Lecture Notes in Computer Science, vol.1000, pp.275-291, 1995.
DOI : 10.1007/BFb0015249

R. Salomon, Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms, Biosystems, vol.39, issue.3, pp.263-278, 1996.
DOI : 10.1016/0303-2647(96)01621-8

C. Schumacher, L. Vose, and . Whitley, The no free lunch and problem description length, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pp.565-570, 2001.

Y. Shang and Y. Qiu, A Note on the Extended Rosenbrock Function, Evolutionary Computation, vol.14, issue.1, pp.119-126, 2006.
DOI : 10.1109/4235.771163

Y. Shi and R. Eberhart, A modified particle swarm optimizer, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360), pp.69-73, 1998.
DOI : 10.1109/ICEC.1998.699146

Y. Shi, E. D. Eberhart, and . Center, Empirical study of particle swarm optimization, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 1999.
DOI : 10.1109/CEC.1999.785511

D. N. Wilke, S. Kok, and A. A. Groenwold, Comparison of linear and classical velocity update rules in particle swarm optimization: notes on diversity, International Journal for Numerical Methods in Engineering, vol.38, issue.8, pp.962-984, 2007.
DOI : 10.1002/nme.1867

D. N. Wilke, S. Kok, and A. A. Groenwold, Comparison of linear and classical velocity update rules in particle swarm optimization: notes on scale and frame invariance, International Journal for Numerical Methods in Engineering, vol.1, issue.8, pp.985-1008, 2007.
DOI : 10.1002/nme.1914

D. H. Wolpert and W. G. Macready, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.67-82, 1997.
DOI : 10.1109/4235.585893