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.
References
Baker, J.E. (1987) Reducing Bias and Inefficiency in the Selection Algorithm. In Proceedings of the Fourth International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, pp. 14–21
Cavicchio, D.J. (1970) Adaptive search using simulated evolution, Ph.D. Thesis, Univ. of Michigan, Ann Arbor.
Collard, P., Gaspar, A. (1996) Royal-road landscapes for a dual genetic algorithm, in W. Wahlster, editor, ECAI 96: 12th European Conference on Articial Intelligence, Wiley & Son, pp 214–217
Collard, P., Escazut, C. (1996) Fitness Distance Correlation in a Dual Genetic Algorithm, in W. Wahlster, ed., ECAI 96: 12th European Conference on Artificial Intelligence, Wiley & Son, pp. 218–222
De Jong, K.A. (1975) An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Doctoral Thesis, Dept.of Computer and Communication Sciences, Univ. of Michigan, Ann Arbor
De Jong, K.A., Spears, W. (1992) A formal analysis of the role of multi-point crossover in genetic algorithms, Annals of Mathematics and Artificial Intelligence (Switzerland: J C Baltzer A G Scientific Publishing Company), pp. 1–26.
Forrest, S., and M. Mitchell. (1993) Relative building-block fitness and the Building Block Hypothesis, in Whitley, L.D. (Ed.), Foundations of Genetic Algorithms 2, pp. 109–126. San Mateo,CA: Morgan Kaufmann.
Goldberg, D.E. (1985) Optimal Initial Population Size for Binary-Coded Genetic Algorithms,. TCGA Report No. 85001, University of Alabama, Department of Engineering Mechanics.
Goldberg, D.E., Richardson, J.J. (1987) Genetic algorithms with sharing for multimodal function optimization, Genetic Algorithms and Their Applications: Proceedings of the Second ICGA, Lawrence Erlbaum Associates, Hillsdale, NJ, pp 41–49
Goldberg D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA.
Goldberg, D.E., Deb, K. (1991) A comparative analysis of selection schemes used in genetic algorithms, in Rawlins, G. J. E. (Ed.), Foundations of Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, pp. 69–93
Goldberg, D.E., Deb, K., Clark, J.H. (1992) Genetic algorithms, noise,and the sizing of populations. Complex Systems, 6:333–362
Goldberg, D.E., Sastry, K. (2001) A Practical Schema Theorem for Genetic Algorithms Design and Tuning, IlliGAL Report No.2001017, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign
Harik, G., Cantu-Paz, E., Goldberg, D.E., and Miller, B.L: (1999) The gambler’s ruin problem,genetic algorithms,and the sizing of populations, Evolutionary Computation, 7(3):231–253
Holland J.H. (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
Kubalík, J., Lažanský, J. (2000) Partially randomised Crossover Operators, In: Advances in Soft Computing, R. John & R. Birkenhead (Eds.), Heidelberg: Physica-Verlag, pp 93–98.
Kubalík, J., Lažanský, J. (2001) A New Genetic Operator Maintaining Population Diversity, in AIP Conference Proceedings of CASYS’ 2000,Dubois, D. (Ed.), American Institute of Physics, pp. 338–348.
Kubalík, J., Lažanský, J. (2000) A New Genetic Operator with Enhanced Capabilities. In: Quo Vadis Computational Intelligence? Sincák, P. (ed.), Physica-Verlag, Heidelberg, Germany, pp. 305–310.
Kubalík, J., Lažanský, J., Rothkrantz, L.J.M. (2001) On Extending of Search Power of Genetic Algorithms by Means of Permanent Re-initialisation of Parental Common Schema, in Proceeding of Mendel 2001, Brno University of Technology, pp. 1–6.
Mahfoud, S.W. (1992) Crowding and Preselection Revisited, Parallel Problem Solving From Nature, 2, R. Manner and B. Manderick (Eds), Elsevier Science Publishers (North Holland), Amsterdam, pp. 27–36.
Mengshoel, O.J., Goldberg, D.E. (1999) Probabilistic Crowding: Deterministic Crowding with Probabilistic Replacement,in Proceedings of the Genetic and Evolutionary Computation Conference, W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela, R.E. Smith (Eds), Morgan Kaufmann Publishers, California
Michalewicz Z.(1994) Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Berlin Heidelberg, Second edition.
Miller, B., Goldberg, D.E. (1995) Genetic Algorithms, Tournament Selection, and the Effects of Noise. IlliGAL Report No. 95006, Urbana: University of Illinois, Illinois Genetic Algorithms Laboratory.
Oei, C.K., Goldberg, D.E., Chang, S.J. (1991) Tournament selection, niching, and the preservation of diversity, IlliGAL Report No. 91011, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign.
Spears, W.M. (1995) Adapting Crossover in Evolutionary Algorithms, in Proceedings of the Fourth Annual Conference on Evolutionary Programming, J.R. McDonnel, R.G. Reynolds and D.B. Fogel, eds., MIT press, Cambridge, 1995, pp 367–384
Spears, W.M. (1997) Recombination Parameters,in Handbook of Evolutionary Computation, T. Back, D.B. Fogel, and Z. Michalewicz, eds., New York: Oxford Univ.Press and Institute of Physics, pp E1:3:1–11
Srinivas, M., and Patnaik, L.M. (1994) Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms, in IEEE Transaction of Systems, Man and Cybernetics, 24:656–667
Thierens, D., Goldberg, D.E.: (1994) Elitist Recombination: an integrated selection recombination GA. In Proceedings of The First IEEE Conference on Evolutionary Computation, Vol 1, pp 508–512.
Watson, R.A., Hornby, G.S. and Pollack, J.B. (1998) Modeling Building-Block Interdependency. Parallel Problem Solving from Nature, proceedings of Fifth International Conference PPSN V, Springer, pp.97–106.
Whitley D. (1991) Fundamental Principles of Deception in Genetic Search. In: Foundations of Genetic Algorithms, G. Rawlins ed., Morgan Kaufmann, pp.221–241.
Whitley D., Mathias, K., Rana, S., Dzubera, J. (1996) Evaluating Evolutionary Algorithms, Artificial Intelligence, 85:245–276.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag London Limited
About this chapter
Cite this chapter
Kubalík, J., Rothkrantz, L., Lažanský, J. (2005). Genetic Algorithms with Limited Convergence. In: Wu, X., Jain, L., Graña, M., Duro, R.J., d’Anjou, A., Wang, P.P. (eds) Information Processing with Evolutionary Algorithms. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/1-84628-117-2_16
Download citation
DOI: https://doi.org/10.1007/1-84628-117-2_16
Publisher Name: Springer, London
Print ISBN: 978-1-85233-866-4
Online ISBN: 978-1-84628-117-4
eBook Packages: Computer ScienceComputer Science (R0)