Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chakraborty, U.K., Janikow, C.Z.: An analysis of Gray versus binary encoding in genetic search. Information Sciences 156, 253–269 (2003)
Droste, S.: Analysis of the (1+1) EA for a dynamically changing objective function, Tech. Report No. C1-113/01, Univ. of Dortmund (2001)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakraborty, U.K. (2004). Gray and Binary Encoding in the (1+1)-EA. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds) Neural Information Processing. ICONIP 2004. Lecture Notes in Computer Science, vol 3316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30499-9_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-30499-9_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23931-4
Online ISBN: 978-3-540-30499-9
eBook Packages: Springer Book Archive