S. Yan and B. Minsker, A dynamic meta-model approach to genetic algorithm solution of a risk-based groundwater remediation design model, Proc. of the 2004 World Water & Environmental Resources Congress, 2004.

A. R. Center, Aerodynamic design using neural networks, the amount of computation needed to optimize a design is reduced, NASA Tech Briefs Online, 2003.

B. Grossman, Surrogate models in aircraf design, Proc. of the 1st Int. Work. on Surrogate Modelling and Space Mapping for Engineering Optimization, 2000.

D. Hopkins, T. Lavelle, and S. Patnaik, Neural network and regression methods demonstrated in the design optimization of a subsonic aircraft, NASA Glen Research Center Research & Technology, 2002.

M. Husken, Y. Jin, and B. Sendhoff, Structure optimization of neural networks for evolutionary design optimization, Workshops of the GECCO 2002, pp.13-16, 2002.

A. Keane and P. Nair, Computational Approaches for Aerospace Design: The Pursuit of Excellence, 2005.
DOI : 10.1002/0470855487

M. V. Grieken, Optimisation pour l'apprentissage et apprentissage pour l'optimisation, 2004.
URL : https://hal.archives-ouvertes.fr/tel-00010106

J. Kleijnen, Sensitivity analysis of simulation experiments: regression analysis and statistical design, Mathematics and Computers in Simulation, vol.34, issue.3-4, pp.297-315, 1992.
DOI : 10.1016/0378-4754(92)90007-4

S. Ibric, M. Jovanovic, Z. Djuric, J. Parojcic, S. Petrovic et al., Artificial neural networks in the modeling and optimization of aspirin extended release tablets with Eudragit L100 as matrix substance, AAPS Pharm. Sci. Tech, vol.4, issue.1, 2003.

A. Conn, K. Scheinberg, and L. Toint, Recent progress in unconstrained nonlinear optimization without derivatives, Mathematical Programming, 1997.
DOI : 10.1007/BF02614326

M. J. Powell, Unconstrained minimization algorithms without computation of derivatives, Bollettino della Unione Matematica Italiana, pp.60-69, 1974.

H. Mühlenbein and T. Mahnig, Evolutionary computation and Wright's equation, Theoretical Computer Science, vol.287, issue.1, pp.145-165, 2002.
DOI : 10.1016/S0304-3975(02)00098-1

G. R. Harik, F. G. Lobo, and D. E. Goldberg, The compact genetic algorithm, IEEE Transactions on Evolutionary Computation, vol.3, issue.4, p.287, 1999.
DOI : 10.1109/4235.797971

S. Baluja, Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning, School of Computer Science, 1994.

S. Droste, Not all linear functions are equally difficult for the compact genetic algorithm, Proceedings of the 2005 conference on Genetic and evolutionary computation , GECCO '05, pp.679-686, 2005.
DOI : 10.1145/1068009.1068124

J. L. Shapiro, The sensitivity of PBIL to its learning rate, and how detailed balance can remove it, Foundations of Genetic Algorithms VII, 2002.

H. Mühlenbein and R. Höns, The Estimation of Distributions and the Minimum Relative Entropy Principle, Evolutionary Computation, vol.13, issue.1, pp.1-27, 2005.
DOI : 10.1023/A:1007324100110

K. Abboud, AlgorithmesévolutionnairesAlgorithmes´Algorithmesévolutionnaires assistés par des méthodes d'apprentissage en grande dimension, 2004.

Y. Jin and B. Sendhoff, Reducing Fitness Evaluations Using Clustering Techniques and Neural Network Ensembles, Proc. of the 2004 Genetic and Evolutionary Computing COnference, 2004.
DOI : 10.1007/978-3-540-24854-5_71
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.466.9186

Y. S. Ong, K. Lum, P. B. Nair, D. Shi, and Z. Zhang, Global convergence of unconstrained and bound constrained surrogate-assisted evolutionary search in aerodynamic shape design, The 2003 Congress on Evolutionary Computation, 2003. CEC '03., pp.1856-1863, 2003.
DOI : 10.1109/CEC.2003.1299898

H. Kim and S. Cho, An efficient genetic algorithms with less fitness evaluation by clustering, Proc. of the IEEE Congress on Evolutionary Computation, pp.887-894, 2001.

Y. Jin, M. Olhofer, and B. Sendhoff, On evolutionary optimization with approximate fitness functions, Proc. of the Genetic and Evolutionary Computation COnference, 2000.

J. Branke and C. Schmidt, Faster convergence by means of fitness estimation, Soft Computing, vol.9, issue.1, pp.13-20, 2005.
DOI : 10.1007/s00500-003-0329-4

M. Emmerich, A. Giotis, M. Ozdenir, T. Bäck, and K. Giannakoglou, Metamodel???Assisted Evolution Strategies, Proceedings of the 7 th Conference on Parallel Problems Solving from Nature, pp.371-380, 2002.
DOI : 10.1007/3-540-45712-7_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.1304

H. Ulmer, F. Streicher, and A. Zell, Model-Assisted Steady-State Evolution Strategies, Proc. of Genetic and Evolutionary Computation Conference (GECCO 2003), ser. LNCS, pp.610-621, 2003.
DOI : 10.1007/3-540-45105-6_72

L. Bull, On Model-Based Evolutionary Computation, Soft Computing - A Fusion of Foundations, Methodologies and Applications, vol.3, issue.2, pp.76-82, 1999.
DOI : 10.1007/s005000050055

A. Ratle, Accelerating the convergence of evolutionary algorithms by fitness landscape approximation, Proc. of the 5 th Conference on Parallel Problems Solving from Nature, pp.87-96, 1998.
DOI : 10.1007/BFb0056852

Y. Jin, M. Olhofer, and B. Sendhoff, Managing approximate models in evolutionary aerodynamic design optimization, Proc. of the IEEE Congress on Evolutionary Computation, pp.592-599, 2001.

K. Rasheed, H. Hirsh, and D. W. , Informed operators: Speeding up geneticalgorithm-based design optimization using reduced models, Proc. of the 2000 Genetic and Evolutionary Conference, pp.628-635, 2000.

K. Abboud, X. Merlhiot, and M. Schoenauer, Deterministic function learning within evolutionary algorithms, Workshops of the GECCO 2002, pp.148-151, 2002.

M. Antony and P. Bartlett, Neural network learning : Theoretical Foundations, 1999.
DOI : 10.1017/CBO9780511624216

L. Devroye, L. Györfi, and G. Lugosi, A probabilistic Theory of Pattern Recognition, 1997.
DOI : 10.1007/978-1-4612-0711-5

H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, 1992.
DOI : 10.1137/1.9781611970081

R. H. Byrd, J. Nocedal, and R. B. Schnabel, Representations of quasi-Newton matrices and their use in limited memory methods, Mathematical Programming, pp.129-156, 1994.
DOI : 10.1007/BF01582063

R. H. Byrd, P. Lu, and J. Noceda, A Limited Memory Algorithm for Bound Constrained Optimization, SIAM Journal on Scientific Computing, vol.16, issue.5, pp.1190-1208, 1995.
DOI : 10.1137/0916069

C. Zhu, R. H. Byrd, and J. Nocedal, Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization, ACM Transactions on Mathematical Software, vol.23, issue.4, pp.550-560, 1997.
DOI : 10.1145/279232.279236

J. Platt, Fast training of support vector machines using sequential minimal optimization, Advances in Kernel Methods ? Support Vector Learning, pp.185-208, 1999.

N. Hansen and A. Ostermeier, Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation, Proceedings of IEEE International Conference on Evolutionary Computation, pp.312-317, 1996.
DOI : 10.1109/ICEC.1996.542381

I. Witten and E. Frank, Data mining, ACM SIGMOD Record, vol.31, issue.1, 2005.
DOI : 10.1145/507338.507355

C. Gagné and M. Parizeau, Open BEAGLE, Late breaking papers of the GECCO 2002, pp.161-168, 2002.
DOI : 10.1145/1138470.1138473

P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y. Chen et al., Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization, 2005.

B. Yuan and M. Gallagher, Experimental results for the special session on real-parameter optimization at CEC 2005: A simple, continuous EDA, Proc. of the IEEE Congress on Evolutionary Computation, 2005.

N. Hansen and A. Ostermeier, Completely derandomized selfadaptation in evolution strategies, Evolutionary Computation, vol.11, issue.1, 2003.