An analysis of heterogeneous cooperative algorithms

Most optimization algorithms suffer from a significant deterioration in performance as the dimensionality and complexity of the problem search space increases. Also these algorithms, given certain configurations, typically show markedly improved performance on a particular problem only to exhibit poor performance on another. The first issue could be resolved by using a cooperative algorithm to divide the problem complexity among its participating algorithms, making the problem easier to solve. The second issue could then be resolved with the use of differently configured participating algorithms within the overall cooperative algorithm. This paper investigates the possibility of combining different population-based algorithms within a cooperative algorithm. The aim is to take advantage of different algorithm characteristics regarding parameter settings, explorative/exploitative capacity, convergence speed and other behaviors in finding solutions to various optimization problems.

[1]  Frans van den Bergh,et al.  An analysis of particle swarm optimizers , 2002 .

[2]  R. Salomon Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. , 1996, Bio Systems.

[3]  Larry J. Eshelman,et al.  Crossover's Niche , 1993, ICGA.

[4]  James Kennedy,et al.  Bare bones particle swarms , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[5]  Riccardo Poli,et al.  Markov chain models of bare-bones particle swarm optimizers , 2007, GECCO '07.

[6]  R. Storn,et al.  Differential evolution a simple and efficient adaptive scheme for global optimization over continu , 1997 .

[7]  Andries Petrus Engelbrecht,et al.  Cooperative learning in neural networks using particle swarm optimizers , 2000, South Afr. Comput. J..

[8]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[9]  A. Engelbrecht,et al.  A new locally convergent particle swarm optimiser , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[10]  Shigenobu Kobayashi,et al.  A real-coded genetic algorithm using the unimodal normal distribution crossover , 2003 .

[11]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[12]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[13]  Kenneth A. De Jong,et al.  On Using Genetic Algorithms to Search Program Spaces , 1987, ICGA.

[14]  Andries Petrus Engelbrecht,et al.  Differential evolution in high-dimensional search spaces , 2007, 2007 IEEE Congress on Evolutionary Computation.

[15]  Mitchell A. Potter,et al.  The design and analysis of a computational model of cooperative coevolution , 1997 .

[16]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[17]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[18]  Keith E. Mathias,et al.  Crossover Operator Biases: Exploiting the Population Distribution , 1997, ICGA.

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

[20]  R. Storn,et al.  On the usage of differential evolution for function optimization , 1996, Proceedings of North American Fuzzy Information Processing.

[21]  L. Darrell Whitley,et al.  Evaluating Evolutionary Algorithms , 1996, Artif. Intell..

[22]  John H. Holland,et al.  Outline for a Logical Theory of Adaptive Systems , 1962, JACM.

[23]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[24]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[25]  Andries Petrus Engelbrecht,et al.  Using neighbourhoods with the guaranteed convergence PSO , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).