The problem with a self-adaptative mutation in some environments: A case study using the shaky ladder hyperplane-defined functions

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1493-1500

  Rand, William ^a   Riolo, R ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b NONE

Author keywords

Dynamic Environments; Genetic Algorithms; Hyperplane Defined functions; Self Adaptation

Indexed keywords

ADAPTIVE ALGORITHMS; DYNAMIC PROGRAMMING; GENETIC ALGORITHMS; RANDOM PROCESSES;

DYNAMIC ENVIRONMENTS; HYPERPLANE-DEFINED FUNCTIONS; SELF-ADAPTATION;

PROBLEM SOLVING;

EID: 32444438299     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068245     Document Type: Conference Paper

References (25)

1. ANGELINE, P. J., FOGEL, D. B., AND FOGEL, L. J. A comparison of self-adaptation methods for finite state machines in dynamic environments. In Proceedings of the Fifth Annual Conference on Evolutionary Programming (1996), L. J. F. et al, Ed., pp. 441-449.
2. BÄCK, T. Self-adaptation in genetic algorithms. In Proceedings of the 1st European Conference on Artificial Life (Cambridge, MA, 1992), F. Varela and P. Bourgine, Eds., MIT Press, pp. 263-71.
3. BÄCK, T. On the behavior of evolutionary algorithms in dynamic environments. In 1998 IEEE International Conference on Evolutionary Computation proceedings (New York, 1998), IEEE, pp. 446-51.
4. BEDAU, M. A., AND PACKARD, N. H. Evolution of evolvability via adaptation of mutation rates. Biosystems 69 (2003), 143-62.
5. BRANKE, J. Evolutionary algorithms for dynamic optimization problems: A survey. Tech. Rep. 387, Institute AIFB, University of Karlsruhe, February 1999.
6. BRANKE, J. Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, 2001.
7. COBB, H. G. An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Tech. Rep. AIC-90-001, Naval Research Laboratory, Washington, D.C., 1990.
8. DAVIS, L. Bit-climbing, representational bias, and test suite design. In Proc. 4th Int. Conference on Genetic Algorithms (ICGA) (1991), L. Booker and R. Belew, Eds., pp. 18-23.
9. GOLDBERG, D. E., AND SMITH, R. E. Nonstationary function optimization using genetic algorithms with dominance and diploidy. In Proceedings of the Second International Conference on Genetic Algorithms (1987), J. J. Grefenstette, Ed., pp. 59-68.
10. GREFENSTETTE, J. J. Genetic algorithms for changing environments. In Parallel Problem Solving from Nature 2 (Proc. 2nd Int. Conf. on Parallel Problem Solving from Nature, Brussels 1992) (Amsterdam, 1992), R. Männer and B. Manderick, Eds., Elsevier, pp. 137-144.
11. HOLLAND, J. Adpatation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975.
12. HOLLAND, J. H. Building blocks, cohort genetic algorithms, and hyperplane-defined functions. Evolutionary Computation 8, 4 (2000), 373-391.
13. JONG, K. D. An Analysis of the Behaviour of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, 1975.
14. Diss. Abstr. Int. 36(10), 5140B, University Microfilms No. 76-9381.
15. KIMURA, M. On the evolutionary adjustment of spontaneous mutation rates. Genetical Research 57 (1967), 21-34.
16. MITCHELL, M. An Introduction To Genetic Algorithms. MIT Press, Cambridge, Massachusetts, 1997, ch. 1.
17. MITCHELL, M., FORREST, S., AND HOLLAND, J. H. The royal road for genetic algorithms: Fitness landscapes and GA performance. In Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, 1991 (Paris, 11-13 1992), F. J. Varela and P. Bourgine, Eds., A Bradford book, The MIT Press, pp. 245-254.
18. RAND, W., AND RIOLO, R. Shaky ladders, hyperplane-defined functions and genetic algorithms: Systematic controlled observation in dynamic environments. In Evo Workshops 2005 Proceedings (2005), R. et al., Ed., Lecture Notes In Computer Science, Springer. In Press.
19. SCHWEFEL, H.-P. Evolutionary learning optimum-seeking on parallel computer architectures. In Proceedings of the International Symposium on Systems Analysis and Simulation 1988, I: Theory and Foundations (1988), A. Sydow, S. G. Tzafestas, and R. Vichnevetsky, Eds., pp. 217-25.
20. SMITH, J. E. Self Adaptation In Evolutionary Algorithms. PhD thesis, University of West England, Bristol, July 1998.
21. STANHOPE, S. A., AND DAIDA, J. M. Optimal mutation and crossover rates for a genetic algorithm operatin in a dynamic environment. In Evolutionary Programming VII (1998), no. 1447 in LNCS, Springer, pp. 693-702.
22. TÖRN, A., AND ZILINSKAS, A. Global optimization. In Lecture Notes In Computer Science, vol. 350. Springer, 1989.
23. VAVAK, F., JUKES, K. A., AND FOGARTY, T. C. Performance of a genetic algorithm with variable local search range relative to frequency of the environmental changes. In Genetic Programming 1998: Proceedings of the Third Annual Conference. (University of Wisconsin, Madison, Wisconsin, USA, 22-25 1998), J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. Riolo, Eds., Morgan Kaufmann, pp. 602-608.
24. WHITLEY, D., RANA, S. B., DZUBERA, J., AND MATHIAS, K. E. Evaluating evolutionary algorithms. Artificial Intelligence 85, 1-2 (1996), 245-276.
25. WILLIAMS, G. C. Adaptation and Natural Selection. Princeton University Press, Princeton, NJ, 1966.