An explorative and exploitative mutation scheme

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Vafaee, Fatemeh ^a   Nelson, Peter C ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; EXPLORATION AND EXPLOITATION; MUTATION OPERATORS; MUTATION RATES; SEARCH SPACES; SITE-SPECIFIC;

ARTIFICIAL INTELLIGENCE; BIOLOGY; MATHEMATICAL OPERATORS;

EVOLUTIONARY ALGORITHMS;

EID: 79959435179     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5586142     Document Type: Conference Paper

References (30)

1. J. Heitkotter and D. Beasley, "The hitchhiker's guide to evolutionary computation," FAQ for comp.ai.genetic, vol. 3, no. 5, 1997.
2. A. E. Eiben and C. A. Schipper, "On evolutionary exploration and exploitation," Fundamenta Informaticae, vol. 35, pp. 35-50, 1998.
3. H. G. Beyer, "On the "explorative power" of es/eplike algorithms," Proceedings of the 7th Annual Conference on Evolutionary Programming, , Lecture Notes in Computer Science. Springer, Berlin, 1998.
4. J. H. Holland, Adaptation in natural and artificial systems. University of Michigan Press, 1975.
5. D. E. Goldberg, Genetic algorithms in search, optimization and machine learning. Reading, MA: Addison Wesley, 1989.
6. L. Altenberg, "The schema theorem and price's theorem," Found. of Genetic Algorithms, vol. 2, pp. 23-49, 1995.
7. J. J. Grefenstette and J. E. Baker, "How genetic algorithms work: a critical look at implicit parallelism," In Proceedings of the 3rd Int. Conf. on Genetic Algorithms, Morgan Kaufmann, pp. 20-27, 1989.
8. M. D. Vose, "A critical examination of the schema theorem," Technical Report CS-93-212, University of Tennessee, 1993.
9. W. Hordijk and B. Manderick, "The usefulness of recombination," Advances in Artificial Life, 3rd Int. Conf. on Artif. Life, vol. 929, pp. 908-919, 1995.
10. J. Schaffer and L. Eshelman, "On crossover as an evolutionary viable strategy," In Proc. of the 4th Int. Con. on GAs, pp. 61-68, 1991.
11. D. Fogel and J. Atmar, "Comparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systems," Biological Cybernetics, vol. 63, pp. 111-114, 1990.
12. K. A. DeJong and W. M. Spears, "A formal analysis of the role of multipoint crossover in genetic algorithms," Ann.of Math. and Art. Int., vol. 5, pp. 1-26, 1992.
13. S. Tsutsui et al., "A real coded genetic algorithm with an explorer and an exploiter populations," In Proc. of the 73th Int. Con. on GAs, pp. 238-245, 1997.
14. L. Eshelman, R. Caruana, and J. Schaffer, "Biases in the crossover landscape," In Proc. of the 3th Int. Con. on GAs, pp. 10-19, 1989.
15. A. Eiben, R. Hinterding, and Z. Michalewicz, "Parameter control in evolutionary algorithms," IEEE Transactions on Evolutionary Computation, vol. 3, no. 2, pp. 124-141, July 1999.
16. T. Back and M. Schutz, "Intelligent mutation rate control in canonical genetic algorithms," In Foundations of Intelligent Systems, Springer, pp. 158-167, 1996.
17. T. Back, "Self-adaptation in genetic algorithms," In Proceeding of The 1st European Conference on Artificial Life, pp. 263-271, 1991.
18. J. Smith and T. Fogarty, "Self adaptation of mutation rates in a steady state genetic algorithm," In Proceeding of congress on evolutionary computation, pp. 318-323, 1996.
19. F. Vafaee et al., "Adaptively evolving probabilities of genetic operators," In IEEE Proceedings of the 7th Int. Conf. on Machine Learning and Applications, vol. 3, pp. 292-299, 2008.
20. L. Davis, "Adapting operator probabilities in genetic algorithms," In Proceedings of the 3rd Int. Conf. on Genetic Algorithms, pp. 61-69, 2002.
21. T. C. Fogarty, "Varying the probability of mutation in the genetic algorithms," In Proceedings of the the 3rd Int. Conf. on Genetic Algorithms, Morgan Kaufmann, pp. 104-109, 1989.
22. M. Srinivas and L. M. Patnaik, "Adaptive probabilities of crossover and mutation in geneticalgorithms," IEEE Transactions on Systems, Man and Cybernetics, vol. 24, no. 4, pp. 656-667, 1994.
23. F. Vafaee and P. C. Nelson, "A genetic algorithm that incorporates an adaptive mutation based on an evolutionary model," In IEEE Proceedings of the 8th Int. Conf. on Machine Learning and Applications, pp. 101-107, 2009.
24. Z. Yang, "Maximum likelihood estimation of phylogeny from dna sequences when substitution rates differ over sites," J. Mol. Biol. Evol., vol. 10, pp. 1396-1401, 1993.
25. -, "Maximum likelihood phylogenetic estimation from dna sequences with variable rates over sites: Approximatemethods," J. Mol. Biol. Evol., vol. 39, pp. 306-314, 1994.
26. D. L. Swofford et al., Phylogenetic inference. Massachusetts: Sinauer Associates.
27. T. Jones, "Evolutionary algorithms, fitness landscapes, and search," Ph.D. thesis, University of New Mexico, Albuquerque, NM, 1995.
28. W. M. Spears, "Evolutionary algorithms, the role of mutation and recombination," Natural Computing, Springer-Verlag, Berlin, 2000.
29. J. Koljonen and J. T. Alander, "Effects of population size and relative elitism on optimization speed and reliability of genetic algorithms," In Proc. of the 9th Scand. Conf. on Artif. Intel., pp. 25-27, 2006.
30. M. Srinivas and L. M. Patnaik, "Niching methods for genetic algorithms," PH.D. Thesis, Univ. Illinois at Urbana-Champaign, 1995.