Effects of Diversity on Optimality in GA

1. Holland, J.H.: Adaption in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, Cambridge (1992)

   Google Scholar 

2. Chakraborty, G., Hoshi, K.: Rank Based Crossover – A new technique to improve the speed and quality of convergence in GA. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, vol. 2, p. 1602 (1999)

   Google Scholar 

3. GoldBerg, D.E.: Genetic Algorithms in search, optimization and machine learning. Addison-Wesley Publishing Company, Reading (1989)

   MATH  Google Scholar 

4. Dumitrescu, D., Lazzerini, B., Jain, L.C., Dumitrescu, A.: Evolutionary Computation. CRC Press, Boca Raton (2000)

   MATH  Google Scholar 

5. Radcliff, N.J.: Forma Analysis and Random Respectful Recombination. In: Proceedings of the fourth International Conference on Genetic Algorithms (1991)

   Google Scholar 

6. Watson, R.A., Pollack, J.B.: Recombination Without Respect: Schema Combination and Disruption in Genetic Algorithm Crossover. In: Proceedings of the 2000 Genetic and Evolutionary Computation Conference (2000)

   Google Scholar 

7. De Jong, K.A.: Analysis of the Behaviour of a class of Genetic Adaptive Systems. Technical Report, The University of Michigan (1975)

   Google Scholar 

8. Hoffmann, J.P.: Simultaneous Inductive and Deductive Modeling of Ecological Systems via Evolutionary Computation and Information Theory. Simulation 82(7), 429–450 (2006)

   Article  Google Scholar 

9. Fogarty, T.C.: Varying the Probability of mutation in the Genetic Algorithm. In: The Proceedings of the Third International Conference on Genetic Algorithms 1989, pp. 104–109 (1989)

   Google Scholar 

10. Hesser, J., Manner, R.: Towards an optimal mutation probability for Genetic Algorithms. In: Schwefel, H.-P., Männer, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 23–32. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

11. Back, T.: Optimal Mutation Rates in Genetic Search. In: Proceedings of the Fifth International Conference on Genetic Algorithms, June 1993, pp. 2–8 (1993)

    Google Scholar 

12. Davis, L.: Adapting Operator Probabilities in Genetic Algorithms. In: Proceedings of the Third International Conference on Genetic Algorithms, pp. 61–69 (1989)

    Google Scholar 

13. Ursem, R.K.: Diversity-Guided Evolutionary Algorithms. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 462–471. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

14. Janikow, C.Z., Michalewicz, Z.: An experimental comparison of binary and floating point representations in genetic algorithms. In: Belew, R.K., Booker, J.B. (eds.) Proceedings of the Fourth International Conference Genetic Algorithms, pp. 31–36. Morgan Kaufmann, San Mateo (1991)

    Google Scholar 

15. Gasieniec, L., Jansson, J., Lingas, A.: Efficient Approximation Algorithms for the Hamming Centre Problem. Journal of Discrete Algorithms 2(2), 289–301 (2004)

    Article  MATH  MathSciNet  Google Scholar 

16. Kwok, N.M., Ha, Q., Liu, D.K., Fang, G., Tan, K.C.: Efficient Particle Swarm Optimization: A Termination Condition Based on the Decision-making Approach. In: 2007 IEEE Congress on Evolutionary Computation, Singapore (2007)

    Google Scholar 

Download references