Modeling and Convergence Analysis of Distributed Coevolutionary Algorithms

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 34, Issue 2, 2004, Pages 806-822

  Subbu, Raj ^a   Sanderson, Arthur C ^b  

^a GE GLOBAL RESEARCH   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Coevolutionary algorithms; Modeling and convergence analysis; Network behavior; Population distributions; Theoretical foundation

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; DECISION MAKING; PROBLEM SOLVING; VECTORS;

COEVOLUTIONARY ALGORITHMS; MODELING AND CONVERGENCE ANALYSIS; NETWORK BEHAVIOR; POPULATION DISTRIBUTIONS; THEORETICAL FOUNDATION;

EVOLUTIONARY ALGORITHMS;

EID: 1842587930     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2003.817095     Document Type: Article

References (26)

1. R. Subbu and A. C. Sanderson, "Modeling and convergence analysis of distributed coevolutionary algorithms," in Proc. IEEE Congr. Evolutionary Computation, San Diego, CA, 2000, pp. 1276-1283.
2. E. Cantú-Paz, "Designing Efficient and Accurate Parallel Genetic Algorithms," Ph.D. dissertation, Univ. Illinois at Urbana-Champaign, Urbana, IL, 1999.
3. H. Mühlenbein, "Evolution in time and space - the parallel genetic algorithm," in Foundations of Genetic Algorithms, G. J. E. Rawlins, Ed. San Mateo. CA: Morgan Kaufmann, 1991, pp. 316-337.
4. R. Tanese, "Distributed Genetic Algorithms for Function Optimization," Ph.D. dissertation, Univ. Michigan, Ann Arbor, MI, 1989.
5. P. Husbands, M. McIlhagga, and R. Ives, "Experiments with an ecosystems model for integrated production planning," in Handbook of Evolutionary Computation, T. Bäck, D. Fogel, and Z. Michalewicz, Eds. Oxford, U.K.: Oxford Univ. Press. 1997, pp. G9.5:1-G9.5:8.
6. J. Ortega, J. L. Bernier, A. F. Díaz, I. Rojas, M. Salmerón, and A. Prieto, "Parallel combinatorial optimization with evolutionary cooperation between processors," in Proc. IEEE Congr. Evolutionary Computation, Washington DC, 1999, pp. 1051-1058.
7. M. A. Potter, "The Design and Analysis of a Computational Model of Cooperative Coevolution," Ph.D. dissertation, George Mason Univ., Fairfax, VA, 1997.
8. S.A. Kaufmann and S. Johnsen, "Co-evolution to the edge of chaos: coupled fitness landscapes, poised states, and coevolutionary avalanches," J. Theoret. Biol., vol. 149, pp. 467-505, 1991.
9. C. D. Rosin, "Coevolutionary Search Among Adversaries," Ph.D. dissertation, Univ. California at San Diego, La Jolla, CA, 1997.
10. F. Seredynski, "Competitive coevolutionary multi-agent systems: the application to mapping and scheduling problems," J. Parallel. Distrib. Comput., vol. 47, no. 1, pp. 39-57, 1997.
11. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
12. D.G. Luenberger, Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1984.
13. S. G. Ficici, O. Melnick, and J. B. Pollack, "A game-theoretic investigation of selection methods used in evolutionary algorithms," in Proc. IEEE Congr. Evolutionary Computation, San Diego, CA, 2000, pp. 880-887.
14. R. P. Wiegand, W. C. Liles, and K. A. De Jong, "Analyzing cooperative coevolution with evolutionary game theory," in Proc. World Conf. Computational Intelligence, Honolulu, HI, 2002, pp. 1600-1605.
15. A. A. Zhigljavsky, Theory of Global Random Search. Dordretch, Netherlands: Kluwer Academic Publishers, 1991.
16. R. Bürger, "Mutation-selection balance and continuum-of-alleles models," Math. Biosci., vol. 91, pp. 67-83, 1988.
17. S. Karlin, "Models of multifactorial inheritance: I, multivariate formulations and basic convergence results," Theoret. Population Biol., vol. 15, pp. 308-355, 1979.
18. M. Slatkin, "Selection and polygenic characters," Proc. Nat. Acad. Sci., vol. 66, no. 1, pp. 87-93, May 1970.
19. C. C. Peck and A. P. Dhawan, "Genetic algorithms as global random search methods: an alternative perspective," Evol. Comput., vol. 3, no. 1, pp. 39-80, 1995.
20. Y. Gao, "Comments on theoretical analysis of evolutionary algorithms with an infinite population size in continuous space - Part-I: basic properties of selection and mutation," IEEE Trans. Neural Networks, vol. 9, pp. 341-343, Mar. 1998.
21. X. Qi and F. Palmieri, "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space, part-I: basic properties of selection and mutation," IEEE Trans. Neural Networks, vol. 5, pp. 102-119, Jan. 1994.
22. J. M. Ortega, Matrix Theory: A Second Course. New York: Plenum, 1987.
23. R. Subbu and A. C. Sanderson, "Network performance of distributed coevolutionary agents," in Proc. World Conf. Computational Intelligence, Honolulu. HI, 2002, pp. 1414-1419.
24. T. Bäck, Evolutionary Algorithms in Theory and Practice. New York: Oxford Univ. Press, 1996.
25. R. Subbu and A. C.Arthur C. Sanderson, "Network distributed virtual design using coevolutionary agents," in Proc. IEEE Int. Conf. Robotics and Automation, Seoul, Korea, 2001.
26. _, "Network-based distributed planning for design and manufacturing," in Proc. IEEE Int. Symp. Assembly and Task Planning, Fukuoka, Japan, 2001.