On the role of modularity in evolutionary dynamic optimisation

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

Volumn , Issue , 2010, Pages

  Rohlfshagen, Philipp ^a   Yao, Xin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSE PROXIMITY; COMPUTATIONAL SAVINGS; EVOLUTIONARY DYNAMICS; GLOBAL OPTIMUM; OPTIMISATIONS; PROBLEM INSTANCES; RANDOM RESTART; SIGNIFICANT IMPACTS;

ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

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

References (20)

1. L. Altenberg. NK fitness landscapes. In T. Bäck, D. B. Fogel, and Z. Michalewicz, editors, The Handbook of Evolutionary Computation, pages B2.7:2-B2.7:10. Oxford University Press, 1997.
2. Y. Borenstein and R. Poli. Information landscapes. In GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation, pages 1515-1522, New York, NY, USA, 2005. ACM.
3. P. A. N. Bosman. Learning, anticipation and time-deception in evolutionary online dynamic optimization. In Proceedings of the 2005 workshops on Genetic and Evolutionary Computation, pages 39-47, 2005.
4. J. Branke. Evolutionary approaches to dynamic environments - updated survey. In GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, pages 27-30, 2001.
5. J. Branke. Evolutionary Optimization in Dynamic Environments. Kluwer, 2002.
6. S. Droste. Analysis of the (1+1) ea for a dynamically changing objective function. Technical report, Universitt Dortmund, 2001.
7. S. Droste, T. Jansen, and I. Wegener. Optimization with randomized search heuristics - the (a)nfl theorem, realistic scenarios, and difficult functions. THEORETICAL COMPUTER SCIENCE, 287, 2002.
8. Y. Jin and J. Branke. Evolutionary optimization in uncertain environment - a survey. IEEE Transactions on Evolutionary Computation, 9(3):303-317, 2005. (Pubitemid 40871134)
9. T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Proceedings of the Sixth International Conference on Genetic Algorithms, pages 184-192, 1995.
10. N. Kashtan and U. Alon. From the cover: Spontaneous evolution of modularity and network motifs. Proc Natl Acad Sci USA, 102(39):13773-13779, 2005.
11. N. Kashtan, E. Noor, and U. Alon. Varying environments can speed up evolution. PNAS, 104(34):13711-13716, 2007. (Pubitemid 350003385)
12. S. A. Kauffman. The Origins of Order. Oxford University Press, 1993.
13. R. W. Morrison. Designing Evolutionary Algorithms for Dynamic Environments. Springer, Berlin, 2004.
14. P. Rohlfshagen and X. Yao. Attributes of dynamic combinatorial optimisation. In Lecture Notes in Computer Science, volume 5361/2008, pages 442-451. Springer, 2008.
15. R. Thompson and A. Wright. Additively decomposable fitness functions. Technical report, University of Montana, Computer Science Department, 1996.
16. I. Wegener. Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. Evolutionary optimization, pages 349-369, 2002.
17. K. Weicker. Evolutionary Algorithms and Dynamic Optimization Problems. Der Andere Verlag, 2003.
18. D. H. Wolpert and W. G. MacReady. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82, April 1997.
19. S. Yang. Non-stationary problem optimization using the primal-dual genetic algorithms. In R. Sarker, R. Reynolds, H. Abbass, K.-C. Tan, R. McKay, D. Essam, and T. Gedeon, editors, Proceedings of the 2003 IEEE Congress on Evolutionary Computation, volume 3, pages 2246-2253, 2003.
20. S. Yang. Memory-based immigrants for genetic algorithms in dynamic environments. In Proceedings of the 2005 Genetic and Evolutionary Computation Conference, volume 2, pages 1115-1122. ACM Press, 2005.