Sequential versus parallel cooperative coevolutionary (1+1) EAs

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 1, Issue , 2003, Pages 30-37

  Jansen, Thomas ^a   Wiegand, R Paul ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b Krasnow Institute for Advanced Study   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ARCHITECTURES;

CO-EVOLUTIONARY; CO-EVOLUTIONARY ALGORITHM; COMPUTING ENVIRONMENTS; OBJECTIVE FUNCTIONS; PARALLEL-COMPUTING ENVIRONMENT; PERFORMANCE BENEFITS; RUN-TIME ANALYSIS;

EVOLUTIONARY ALGORITHMS;

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

References (11)

1. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1 + 1) evolutionary algorithm. Theoretical. Computer Science, 276:51-81, 2002.
2. R. Eriksson and B. Olsson. Cooperative coevolution in inventory control optimisation. In Proc. of the 3rd Int. Conf. on Artificial Neural Networks and Generic Algorithms. Springer, 1997.
3. J. Garnier, L. Kallel. and M. Schoenauer. Rigorous hitting times for binary mutations. Evolutionary Coni-putation. 7(2):173-203, 1999.
4. A. Iorio and X. Li. Parameter control within a co-operative co-evolutionary genetic algorithm. In J. J. Merelo Guervos, R Adamidis. H.-G. Beyer, J.-L. Fernandez-Villacanas, and H.-R Schwefel, editors, Proc. of the 7th Conf. on Parallel Problem Solving From Nature (PPSN VIIj, pages 247-256, Berlin, Germany, 2002. Springer.
5. T. Jansen and R. R Wiegand. The cooperative coevo-lutionary (1 + 1) EA. Technical Report SFB 531. Cl 145/03, Universitat Dortmund, Dortmund, Germany, 2003.
6. T. Jansen and R. R Wiegand. Exploring the explorative advantage of the copoperative coevolutionary (1 + 1) EA. In E. Cantu-Paz, J. A. Foster. K. Deb, L. D. Davis, R. Roy, U.-M. O'Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Hannan, J. Wegener, D. Dasgupta, M. A. Potter, A. C. Schultz. K. Dowsland. N. Jonoska, and J. Miller, editors, Proc. of the Genetic and Evolutionary' Computation Conf. (CECCO 2003), pages 310-321, Berlin, Germany. 2003. Springer.
7. K. Leung, T. Wong, and I. King., Probabilis-. tic cooperative-competitive hierarchical modeling for global optimization,. In T. Yamakawa and G. Mat' sumoto, editors. Proc. of the 5th Int. Conf. on Soft Computing and Information/Intelligent Systems, pages 748-751. World Scientific, 1998.
8. M. A. Potter and K. A. De Jong. A cooperative coevolutionary approach to function optimization. In Y. Davidor, H.-P. Schwefel, and R. Manner, editors. Proc. of the 3rd'Conf. on Parallel Problem Solving From Nature (PPSN III). pages 249-257. Berlin, Germany, 1994. Springer.
9. G. Rudolph. Convergence Properties of Evolutionary Algorithms. Dr. Kovaĉ. 1997.
10. J. Scharnow, K. Tinnefeld, and I. Wegener. Fitness landscapes based on sorting and shortest paths problems. In J. J. Merelo Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas. and H.-P. Schwe; fel, editors, Proc. of the 7th Conf. on Parallel Problem Solving From Nature (PPSN VII), pages 54-63, Berlin, Germany, 2002. Springer.
11. I. Wegener. Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In R. Sarker, X. Yao, and M. Mohammadian. editors, Evolutionary Optimization. pages 349-369. Kluwer. 2002