Competitive coevolution with k-random opponents for pareto multiobjective optimization

Tse , Guan Tan and Teo, Jason Tze Wi and Keng, Keng Lau (2007) Competitive coevolution with k-random opponents for pareto multiobjective optimization. In: 3rd International Conference on Natural Computation (ICNC 2007), 24-27 August 2007, Haikou, Hainan, China.

Full text not available from this repository.


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 KRandom Opponents performed well for the generational distance and coverage but performed less favorably for spacing. © 2007 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Uncontrolled Keywords: Pareto principle, Problem solving, Random processes, Three dimensional Competitive coevolution, Comprehensive tests, K-Random Opponents, Pareto multiobjective optimization Evolutionary algorithms
Subjects: ?? QA101-(145) ??
Divisions: SCHOOL > School of Engineering and Information Technology
Depositing User: Unnamed user with email
Date Deposited: 30 Jun 2011 07:10
Last Modified: 30 Dec 2014 06:55

Actions (login required)

View Item View Item

Browse Repository
   UMS News
Quick Search

   Latest Repository

Link to other Malaysia University Institutional Repository

Malaysia University Institutional Repository