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

M. Bercachi, P. Collard, M. Clergue, and S. Verel, Evolving dynamic change and exchange of genotype encoding in genetic algorithms for difficult optimization problems, 2007 IEEE Congress on Evolutionary Computation, 2007.
DOI : 10.1109/CEC.2007.4425063
URL : https://hal.archives-ouvertes.fr/hal-00164788

M. Mitchell, An introduction to genetic algorithms " . Complex Adaptive Systems Series, 1996.

D. Whitley and S. Rana, Representation, search and genetic algorithm, Proceedings of the Fourteenth National Conference on Artificial Intelligence, 1997.

F. Rothlauf and D. E. Goldberg, Representations for genetic and evolutionary algorithms, 2002.
DOI : 10.1007/978-3-642-88094-0

G. Liepins and M. Vose, Representations issues in genetic algorithms, Experimental and Theoretical Artificial Intelligence Journal, 1990.

F. Rothlauf and D. E. Goldberg, Redundant Representations in Evolutionary Computation, Evolutionary Computation, vol.18, issue.4, 2003.
DOI : 10.1007/BF00202749

M. Toussaint, Compact representations as a search strategy: Compression EDAs, Theoretical Computer Science, vol.361, issue.1, 2006.
DOI : 10.1016/j.tcs.2006.04.005

F. Rothlauf, D. E. Goldberg, and A. Heinzl, Network Random Keys???A Tree Representation Scheme for Genetic and Evolutionary Algorithms, Evolutionary Computation, vol.27, issue.1, 2002.
DOI : 10.1162/evco.1993.1.1.25

S. Verel, States based evolutionary algorithm, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00518206

J. E. Rowe, Population fixed-points for functions of unitation, Foundations of Genetic Algorithms

A. H. Wright, J. E. Rowe, and N. J. , Analysis of the simple genetic algorithm on the single-peak and double-peak landscapes, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), 1999.
DOI : 10.1109/CEC.2002.1006236

J. N. Richter, J. Paxton, and W. A. , EA models and population fixed-points versus mutation rates for functions of unitation, Proceedings of the 2005 conference on Genetic and evolutionary computation , GECCO '05, 2005.
DOI : 10.1145/1068009.1068211

D. Thierens, Adaptive mutation rate control schemes in genetic algorithms, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), 2002.
DOI : 10.1109/CEC.2002.1007058

P. Collard and M. Clergue, Misleading functions designed from alternation, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512), 2000.
DOI : 10.1109/CEC.2000.870764
URL : https://hal.archives-ouvertes.fr/hal-00166374

S. Verel, P. Collard, and M. Clergue, Where are bottlenecks in NK fitness landscapes?, The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2003.
DOI : 10.1109/CEC.2003.1299585
URL : https://hal.archives-ouvertes.fr/hal-00159994

R. Caruana, J. Schaffer, and . David, Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms, Proceedings of the Fifth International Conference on Machine Learning. M.K. Publishers, 1988.
DOI : 10.1016/B978-0-934613-64-4.50021-9

E. Mathias and D. Whitley, Transforming the search space with Gray coding, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, 1994.
DOI : 10.1109/ICEC.1994.349897

D. Whitley, A free lunch proof for gray versus binary encodings, Proceedings of the Genetic and Evolutionary Computation Conference, 1999.

D. Whitley, S. Rana, and R. B. Heckendorn, Representation issues in neighborhood search and evolutionary algorithms, Genetic Algorithms in Engineering and Computer Science, 1997.

L. Barbulescu, J. Watson, and D. Whitley, Dynamic representations and escaping local optima: Improving genetic algorithms and local search, 2000.