Exploring the explorative advantage of the cooperative coevolutionary (1+1) EA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2723, Issue , 2003, Pages 310-321

  Jansen, Thomas ^a   Wiegand, R Paul ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b GEORGE MASON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS;

CO-EVOLUTIONARY; CO-EVOLUTIONARY ALGORITHM; CO-EVOLUTIONARY APPROACH; EVOLUTIONARY APPROACH; EXPECTED OPTIMIZATION TIME; FUNCTION OPTIMIZATION; OBJECTIVE FUNCTIONS; STRUCTURED EXAMPLE;

EVOLUTIONARY ALGORITHMS;

EID: 35248851317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45105-6_37     Document Type: Article

References (10)

1. S. Droste, T. Jansen, G. Rudolph, H.-P. Schwefel, K. Tinnefeld, and I. Wegener (2003). Theory of evolutionary algorithms and genetic programming. In H.-P. Schwefel, I. Wegener, and K. Weinert (Eds.), Advances in Computational Intelligence, Berlin, Germany, 107-144. Springer.
2. S. Droste, T. Jansen, and I. Wegener (2002). On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276, 51-81.
3. J. Garnier, L. Kallel, and M. Schoenauer (1999). Rigorous hitting times for binary mutations. Evolutionary Computation 7(2), 173-203.
4. A. Iorio and X. Li (2002). Parameter control within a co-operative co-evolutionary genetic algorithm. In J. J. Merelo Guervós, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacañas, and H.-P. Schwefel (Eds.), Proceedings of the Seventh Conference on Parallel Problem Solving From Nature (PPSN VII), Berlin, Germany, 247-256. Springer.
5. R. Motwani and P. Raghavan (1995). Randomized Algorithms. Cambridge: Cambridge University Press.
6. H. Mühlenbein (1992). How genetic algorithms really work. Mutation and hillclimbing. In R. Männer and R. Manderick (Eds.), Proceedings of the Second Conference on Parallel Problem Solving from Nature (PPSN II), Amsterdam, The Netherlands, 15-25. North-Holland.
7. M. A. Potter and K. A. De Jong (1994). A cooperative coevolutionary approach to function optimization. In Y. Davidor, H.-P. Schwefel, and R. Männer (Eds.), Proceedings of the Third Conference on Parallel Problem Solving From Nature (PPSN III), Berlin, Germany, 249-257. Springer.
8. M. A. Potter and K. A. De Jong (2002). Cooperative coevolution: An architecture for evolving coadapted subcomponents. Evolutionary Computation 8(1), 1-29.
9. G. Rudolph (1997). Convergence Properties of Evolutionary Algorithms. Hamburg, Germany: Dr. Kovač.
10. E. van Nimwegen and J. P. Crutchfield (2001). Optimizing epochal evolutionary search: Population-size dependent theory. Machine Learning 45(1), 77-114.