Abstract
We present analysis of performance of an elitist Evolutionary algorithm using a recombination operator 1-Bit-Swap on the Royal Roads test function. We derive complete, approximate and asymptotic convergence rates. Both complete and approximate models show the benefit of the size of the population and recombination pool when they are small and leveling out of this effect when limit conditions are applied. Numerical results confirm our findings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mitchell, M., Forrest, S., Holland, J.H.: The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance. In: European Conference on Artificial Life, vol. 1, pp. 245–254 (1992)
Mitchell, M.: Introduction to Genetic Algorithms. Kluwer Academic Publishers (1996)
Watson, R.A., Jansen, T.: A Building Block Royal Road Where Crossover is Provably Essential. In: Genetic and Evolutionary Computing Conference (GECCO), pp. 1452–1459 (2007)
Storch, T., Wegener, I.: Real Royal Road Function for Constant Population Size. 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. 2724, pp. 1406–1417. Springer, Heidelberg (2003)
Doerr, B., Fouz, M., Witt, C.: Sharp Bounds by Probability-Generating Functions and Variable Drift. In: Genetic and Evolutionary Computing Conference (GECCO), pp. 2083–2090 (2011)
Doerr, B., Happ, E., Klein, C.: Crossover Can Provably be Useful in Evolutionary Computation (in press, 2011)
Kótzing, T., Sudholt, D., Theile, M.: How Crossover Helps in Pseudo-Boolean Optimization. In: Genetic and Evolutionary Computing Conference (GECCO), pp. 705–712 (2011)
He, J., Yao, X.: From an Individual to a Population: An Analysis of the First Hitting Time of Population-Based Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 6(5), 495–511 (2002)
Chen, T., Tang, K., Chen, G., Yao, X.: A large population size can be unhelpful in evolutionary algorithms (in press, 2011)
Ter-Sarkisov, A., Marsland, S., Holland, B.: The k-Bit-Swap: A New Genetic Algorithm Operator. In: Genetic and Evolutionary Computing Conference (GECCO), pp. 815–816 (2010)
Chen, T., He, J., Sun, G., Chen, G., Yao, X.: A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems. IEEE Transactions on Systems, Man, and Cybernetics B 39(5), 1092–1106 (2009)
Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions. United States Government Printing Office (1965)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Publishing Company (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ter-Sarkisov, A., Marsland, S. (2011). Convergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function. In: Wang, D., Reynolds, M. (eds) AI 2011: Advances in Artificial Intelligence. AI 2011. Lecture Notes in Computer Science(), vol 7106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25832-9_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-25832-9_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25831-2
Online ISBN: 978-3-642-25832-9
eBook Packages: Computer ScienceComputer Science (R0)