Competitive Coevolution with K-Random Opponents for Pareto Multiobjective Optimization

In this paper, our objective is to conduct comprehensive tests for competitive coevolution using an evolutionary multiobjective algorithm for 3 dimensional problems. This competitive coevolution will be implemented with k-random opponents strategy. A new algorithm which integrates competitive coevolution (CE) and the strength Pareto evolutionary algorithm 2 (SPEA2) is proposed to achieve this objective. The resulting algorithm is referred to as the strength Pareto evolutionary algorithm 2 with competitive coevolution (SPEA2-CE). The performance between SPEA2-CE is compared against SPEA2 to solve problems with each having three objectives using DTLZ suite of test problems. In general, the results show that the SPEA2-CE with k- random opponents performed well for the generational distance and coverage but performed less favorably for spacing.

[1]  Simon Künzli,et al.  Efficient design space exploration for embedded systems , 2006 .

[2]  Jason R. Schott.  Fault Tolerant Design Using Single and Multicriteria Genetic Algorithm Optimization. , 1995 .

[3]  Richard K. Belew,et al.  New Methods for Competitive Coevolution , 1997, Evolutionary Computation.

[4]  Kittipong Boonlong,et al.  Compressed-Objective Genetic Algorithm , 2006, PPSN.

[5]  Yeongho Kim,et al.  A Tournament-Based Competitive Coevolutionary Algorithm , 2004, Applied Intelligence.

[6]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[7]  Peter J. Angeline,et al.  Competitive Environments Evolve Better Solutions for Complex Tasks , 1993, ICGA.

[8]  Gary L. Haith,et al.  Comparing a coevolutionary genetic algorithm for multiobjective optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[9]  D.A. Van Veldhuizen,et al.  On measuring multiobjective evolutionary algorithm performance , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[10]  Sean Luke,et al.  A Comparison Of Two Competitive Fitness Functions , 2002, GECCO.

[11]  Robert Axelrod,et al.  The Evolution of Strategies in the Iterated Prisoner's Dilemma , 2001 .

[12]  Ian C. Parmee,et al.  Preliminary airframe design using co-evolutionary multiobjective genetic algorithms , 1999 .

[13]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

[14]  W. Daniel Hillis,et al.  Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .

[15]  Xin Yao,et al.  Performance Scaling of Multi-objective Evolutionary Algorithms , 2003, EMO.

[16]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[17]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .