Gray and Binary Encoding in the (1+1)-EA

  • Uday K. Chakraborty
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3316)


The expected first passage time to optimality is used to analyze the relative performance of Gray and binary encoding for five variants of the (1+1)-EA.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chakraborty, U.K., Janikow, C.Z.: An analysis of Gray versus binary encoding in genetic search. Information Sciences 156, 253–269 (2003)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Droste, S.: Analysis of the (1+1) EA for a dynamically changing objective function, Tech. Report No. C1-113/01, Univ. of Dortmund (2001)Google Scholar
  3. 3.
    He, J., Yao, X.: From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Trans. Evol. Comput. 6(5), 495–511 (2002)CrossRefGoogle Scholar
  4. 4.
    Wegener, I., Witt, C.: On the optimization ofmonotone polynomials by the (1+1) EA and randomized local search. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 622–633. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Uday K. Chakraborty
    • 1
  1. 1.University of MissouriSt. LouisUSA

Personalised recommendations