A cooperative coevolutionary algorithm for multiobjective particle swarm optimization

Coevolutionary architectures have been shown to be effective ways to improve the performance of multiobjective (MO) optimization problems. This paper presents a cooperative coevolutionary algorithm for multiobjective particle swarm optimization (COMOPSO), which applies the divide-and-conquer approach to decompose decision vectors into smaller components and evolves multiple solutions in the form of cooperative subswarms. Representatives from each evolving subswarm are combined to form the solution to the whole system. The fitness of each individual is related to its ability to collaborate with individuals from other species, thereby encouraging the development of cooperative strategies. An adaptive niche sharing algorithm is introduced to handle the selection of the niche radius in a dynamic manner. Coupled with the adaptive niche sharing algorithm COMOPSO demonstrates its effectiveness and efficiency in evolving highly competitive solution sets against various MO algorithms on benchmark problems characterized by different difficulties with consistent results.

[1]  M. N. Vrahatis,et al.  Particle swarm optimization method in multiobjective problems , 2002, SAC '02.

[2]  Kay Chen Tan,et al.  A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Tong Heng Lee,et al.  Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization , 2001, IEEE Trans. Evol. Comput..

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

[5]  Kay Chen Tan,et al.  A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[6]  E. F. Khor,et al.  An Evolutionary Algorithm with Advanced Goal and Priority Specification for Multi-objective Optimization , 2011, J. Artif. Intell. Res..

[7]  Tong Heng Lee,et al.  A Study on Distribution Preservation Mechanism in Evolutionary Multi-Objective Optimization , 2005, Artificial Intelligence Review.

[8]  Kenneth A. De Jong,et al.  Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents , 2000, Evolutionary Computation.

[9]  Jürgen Teich,et al.  Strategies for finding good local guides in multi-objective particle swarm optimization (MOPSO) , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[10]  Kay Chen Tan,et al.  A distributed Cooperative coevolutionary algorithm for multiobjective optimization , 2006, IEEE Transactions on Evolutionary Computation.

[11]  Peter J. Fleming,et al.  Assessing the performance of multiobjective genetic algorithms for optimization of a batch process scheduling problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[13]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[14]  Kalyanmoy Deb,et al.  Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems , 1999, Evolutionary Computation.

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

[16]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[17]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[18]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[19]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.