The cooperative coevolutionary (1+1) EA

Evolutionary Computation

Volumn 12, Issue 4, 2004, Pages 405-434

  Jansen, Thomas ^a   Wiegand, R Paul ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b George Mason University   (United States)

Author keywords

Cooperative coevolution; Global optimization; Run time analysis; Separability

Indexed keywords

COOPERATIVE COEVOLUTION; PROBLEM SEPARABILITY; RUN TIME ANALYSIS;

AUTONOMOUS AGENTS; FUNCTIONS; GLOBAL OPTIMIZATION; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

EVOLUTIONARY ALGORITHMS;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; EVOLUTION;

ALGORITHMS; COMPUTATIONAL BIOLOGY; EVOLUTION; MODELS, GENETIC;

EID: 10444261979     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/1063656043138905     Document Type: Article

References (30)

1. Bull, L. (1997). Evolutionary computing in multi-agent environments: Partners. In Bäck, T., editor, Proceedings from the Seventh International Conference on Genetic Algorithms, pages 370-377. Morgan Kaufmann.
2. Bull, L. (2001). On coevolutionary genetic algorithms. Soft Computing, 5:201-207.
3. Cliff, D. and Miller, G. F. (1995). Tracking the red queen: Measurements of adaptive progress in co-evolutionary sumulations. In Moran, A., Merelo, J., and Chacon, P., editors, Proceedings of the Third European Conference on Artificial Life, pages 200-218. Springer.
4. Droste, S., Jansen, T., and Wegener, I. (1998). On the optimization of unimodal functions with the (1+1) evolutionary algorithm. In Eiben, A. E., Bäck, T., Schoenauer, M., and Schwefel, H.-P, editors, Parallel Problem Solving from Nature (PPSN V), pages 47-56. Springer.
5. Droste, S., Jansen, T., and Wegener, I. (2002). On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81.
6. Eriksson, R. and Olsson, B. (1997). Cooperative coevolution in inventory control optimisation. In Smith, G., Steele, N., and Albrecht, R., editors, Proceedings of the Third International Conference on Artificial Neural Networks and Genetic Algorithms. Springer.
7. Ficici, S. and Pollack, J. (1998). Challenges in coevolutionary learning: Arms-race dynamics, open-endedness, and mediocre stable states. In Adami, C., Belew, R., Kitano, H., and Taylor, C., editors, Proceedings of the Sixth International Conference on Artificial Life, pages 238-247. MIT Press.
8. Ficici, S. and Pollack, J. (2000). A game-theoretic approach to the simple coevolutionary algorithm. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J., and Schwefel, H.-P., editors, Proceedings from the Sixth Conference on Parallel Problem Solving from Nature), pages 467-476. Springer.
9. Garnier, J., Kallel, L., and Schoenauer, M. (1999). Rigorous hitting times for binary mutations. Evolutionary Computation, 7(2):173-203.
10. Hancock, G. R. and Klockars, A. J. (1996). The question for alpha; developments in multiple comparison procedures in the quarter century since games (1971). Review of Educational Research, 66:269-306.
11. Horn, J., Goldberg, D. E., and Deb, K. (1994). Long path problems. In Davidor, Y., Schwefel, H.-P., and Männer, R., editors, Parallel Problem Solving From Nature (PPSN III), pages 149-158. Springer.
12. Iorio, A. and Li, X. (2002). Parameter control within a co-operative co-evolutionary genetic algorithm. In Merelo Guervós, J. J., Adamidis, P., Beyer, H.-G., Fernández-Villacañas, J.-L., and Schwefel, H.-P., editors, Proceedings of the Seventh Conference on Parallel Problem Solving From Nature (PPSN VII), pages 247-256. Springer.
13. Jansen, T. and Wegener, I. (2000). On the choice of the mutation probability for the (1+1) EA. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J. J., and Schwefel, H.-P., editors, Proceedings of the Sixth Conference on Parallel Problem Solving From Nature (PPSN VI), pages 89-98. Springer.
14. Jansen, T. and Wiegand, R. P. (2003a). Exploring the explorative advantage of the copoperative coevolutionary (1+1) EA. In Cantu-Paz, E., Foster, J. A., Deb, K., Davis, L. D., Roy, R., O'Reilly, U.-M., Beyer, H.-G., Standish, R., Kendall, G., Wilson, S., Harman, M., Wegener, J., Dasgupta, D., Potter, M. A., Schulz, A. C., Dowsland, K. A., Jonoska, N., and Miller, J., editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2003), pages 310-321. Springer.
15. Jansen, T. and Wiegand, R. P. (2003b). Sequential versus parallel cooperative coevolutionary (1+1) eas. In McKay, B., editor, Proceedings of the 2003 Congress on Evolutionary Computation, pages 30-37. IEEE Press.
16. Leung, K., Wong, T., and King, I. (1998). Probabilistic cooperative-competitive hierarchical modeling for global optimization. In Proceedings of the Fifth International Conference on Soft Computing and Information/Intelligent Systems, pages 748-751. World Scientific.
17. Moriarty, D. and Miikkulainen, R. (1997). Forming neural networks through efficient and adaptive coevolution. Evolutionary Computation, 5(4):373-399.
18. Motwani, R. and Raghavan, P. (1995). Randomized Algorithms. Cambridge University Press, Cambridge.
19. Potter, M. and De Jong, K. (1998). The coevolution of antibodies for concept learning. In Eiben, A. E., Back, T., Schoenauer, M., and Schwefel, H.-P., editors, Proceedings from the Fifth International Conference on Parallel Problem Solving from Nature, pages 530-539. Springer.
20. Potter, M. and De Jong, K. (2000). Cooperative coevolution: An architecture for evolving coadapted subcomponents. Evolutionary Computation, 8(l):l-29.
21. Potter, M., Meeden, L., and Schultz, A. (2001). Heterogeneity in the coevolved behaviors of mobile robots. In Nebel, B., editor, Proceedings of the Seventeenth International Conference on Artificial Intelligence, pages 1337-1343. Morgan Kaufmann.
22. Potter, M. A. and De Jong, K. A. (1994). A cooperative coevolutionary approach to function optimization. In Davidor, Y., Schwefel, H.-P., and Männer, R., editors, Proceedings of the Third Conference on Parallel Problem Solving From Nature (PPSN III), pages 249-257. Springer.
23. Rudolph, G. (1997). Convergence Properties of Evolutionary Algorithms. Dr. Kovač.
24. Stanley, K. O. and Miikkulainen, R. (2002). The dominance tournament method of monitoring progress in coevolution. In Workshop Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) 2002.
25. van Nimwegen, E. and Crutchfield, J. P. (2001). Optimizing epochal evolutionary search: Population-size dependent theory. Machine Learning, 45(1):77-114.
26. Wegener, I. (2002). Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In Sarker, R., Yao, X., and Mohammadian, M., editors, Evolutionary Optimization, pages 349-369. Kluwer.
27. Wiegand, R. P., Liles, W., and De Jong, K. (2001). An empirical analysis of collaboration methods in cooperative coevolutionary algorithms. In Spector, L., Goodman, E., Wu, A., Langdon, W., Voight, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M., and Burke, E., editors, Proceedings of the Genetic and Evolutionary Computation Conference 2001, pages 1235-1242. Morgan Kaufmann.
28. Wiegand, R. P., Liles, W., and De Jong, K. (2002a). The effects of representational bias on collaboration methods in cooperative coevolution. In Merelo Guervós, J. J., Adamidis, P., Beyer, H.-G., Fernández-Villacañas, J.-L., and Schwefel, H.-P., editors, Proceedings of the Seventh Conference on Parallel Problem Solving From Nature (PPSN VII), pages 257-268. Springer.
29. Wiegand, R. P., Liles, W., and De Jong, K. (2002b). Modeling variation in cooperative coevolution using evolutionary game theory. In Poli, R., Rowe, J., and Jong, K. D., editors, Foundations of Genetic Algorithms VII, pages 231-248. Morgan Kaufmann.
30. Witt, C. (2003). Population size vs. runtime of a simple EA. In Sarker, R., Reynolds, R., Abbass, H., Tan, K. C., McKay, B., Essam, D., and Gedeon, T., editors, Proceedings of the Congress on Evolutionary Computation (CEC 2003), pages 1996-2003. IEEE Press.