Analysis of the (1+1) EA for a dynamically changing ONEMAX-variant

Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002

Volumn 1, Issue , 2002, Pages 55-60

  Droste, Stefan ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE;

DEGREE OF CHANGE; EVOLUTIONARY ALGORITHMS (EAS); FITNESS FUNCTIONS; OBJECTIVE FUNCTIONS; RUNTIMES;

EVOLUTIONARY ALGORITHMS;

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

References (23)

1. David E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.
2. Hans-Paul Schwefel, Evolution and Optimum Seeking, John Wiley & Sons, New York, NY, 1995.
3. David B. Fogel, Evolutionary Computation, IEEE Press, Piscataway, NY, 1995
4. John R. Koza, Genetic Programming, MIT Press, Cambridge, MA, 1992.
5. Thomas Bäck, David B. Fogel, and Zbigniew Michalewicz, Eds., Handbook of Evolutionary Computation, Institute of Physics Publishing and Oxford University Press, New York, NY, 1997.
6. John H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
7. Riccardo Poli, "Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover," Genetic Programming and Evolvable Machines, vol. 2, no. 2, pp. 123-163, 2001.
8. Günter Rudolph, Convergence Properties of Evolutionary Algorithms, Verlag Dr. Kovač, Hamburg, 1997.
9. Stefan Droste, Thomas Jansen, and Ingo Wegener, "On the analysis of the (1-t-l) evolutionary algorithm," Theoretical Computer Science, 2001, Accepted for publication.
10. Thomas Jansen and Ingo Wegener, "On the analysis of evolutionary algorithms-a proof that crossover really can help," in Proceedings of the Seventh Annual European Symposium on Algorithms (ESA 1999), Berlin, 1999, pp. 184-193, Springer, Lecture Notes in Computer Science 1643.
11. Thomas Jansen and Ingo Wegener, "Real royal road functions-where crossover is provably essential," in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), San Francisco, CA, 2001, pp. 1034-1041, Morgan Kauf-mann.
12. Arthur E. Bryson, Dynamic Optimization, Addison-Wesley, Reading, MA, 1998.
13. Jürgen Branke, Evolutionary Optimization in Dynamic Environments, Kluwer Academic, Boston, MA, 2001.
14. Jayshree Sarma and Kenneth DeJong, "The behaviour of spatially distributed evolutionary algorithms in non-stationary environments," in Proceedings of the First Genetic and Evolutionary Computation Conference (GECCO 1999), San Francisco, OA, 1999, pp. 572-578, Morgan Kaufmann.
15. Christopher Ronnewinkel and Glaus Wilke, "Dynamic fitness landscapes: Expansions for small mutation rates," Physica, vol. A, no. 290, pp. 475-490, 2001.
16. Karsten Weicker and Nicole Weicker, "On evolution strategy optimization in dynamic environments," in Proceedings of the 1999 Congress on Evolutionary Computation (CEC 1999), Pis, NJ, 1999, pp. 2039-2046, IEEE Press.
17. Stephen A. Stanhope and Jason M. Daida, "(1+ 1) genetic algorithm fitness dynamics in a changing environment," in Proceedings of the 1999 Congress on Evolutionary Computation (CEC 1999), Piscataway, NJ, 1999, pp. 1851-1858, IEEE Press.
18. Ingo Wegener, "Methods for the analysis of evolutionary algorithms on pseudo-boolean functions," in Evolutionary Optimization, R. Sarker, X. Yao, and M. Mohammadian, Eds. Kluwer, 2001, To appear.
19. Heinz Mühlenbein, "How genetic algorithms really work: I. mutation and hillchmbing," in Proceedings of the Second Conference on Parallel Problem Solving from Nature (PPSN 1992), Brussels, 1992, pp. 15-26, Elsevier.
20. Stefan Droste, Thomas Jansen, and Ingo Wegener, "A rigorous complexity analysis of the (1+1) evolutionary algorithm for linear functions with boolean inputs," in Proceedings of the Third IEEE International Conference on Evolutionary Computation (ICEC 1998), Piscataway, NY, 1998, pp. 499-504, IEEE Press.
21. Stefan Droste, Thomas Jansen, and Ingo Wegener, "Dynamic parameter control in simple evolutionary algorithms," in Proceedings of the Sixth Foundations of Genetic Algorithms Workshop (FOGA 2000), Worthy N. Martin and William M. Spears, Eds., San Francisco, CA, 2000, pp. 275-294, Morgan Kaufmann.
22. Torben Hagerup and Christine Rub, "A guided tour of Chernoff bounds," Information Processing Letters, vol. 33, no. 6, pp. 305-308, 1990.
23. Yuval Rabani, Yuri Rabinovich, and Alistair Sinclair, "A computational view of population genetics," in Proceedings of the 27th ACM Symposium on the Theory of Computing (STOC '95), New York, NY, 1995, pp. 83-92, ACM.