PSO and multi-funnel landscapes: how cooperation might limit exploration

Authors:
Andrew M. Sutton;Darrell Whitley;Monte Lunacek;Adele Howe
Affiliations:
Colorado State University, Fort Collins, CO;Colorado State University, Fort Collins, CO;Colorado State University, Fort Collins, CO;Colorado State University, Fort Collins, CO
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 9
Cited 8

The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best

Proceedings of the 3rd International Conference on Genetic Algorithms
Parameter Selection in Particle Swarm Optimization

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Comparison between Genetic Algorithms and Particle Swarm Optimization

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
On the multilevel structure of global optimization problems

Computational Optimization and Applications
Exposing origin-seeking bias in PSO

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Completely Derandomized Self-Adaptation in Evolution Strategies

Evolutionary Computation
Global Optimization of Morse Clusters by Potential Energy Transformations

INFORMS Journal on Computing
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation
The fully informed particle swarm: simpler, maybe better

IEEE Transactions on Evolutionary Computation

Convergence behavior of the fully informed particle swarm optimization algorithm

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Problem difficulty analysis for particle swarm optimization: deception and modality

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Optimal contraction theorem for exploration-exploitation tradeoff in search and optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Particle swarm CMA evolution strategy for the optimization of multi-funnel landscapes

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Why six informants is optimal in PSO

Proceedings of the 14th annual conference on Genetic and evolutionary computation
An experimental study of the combination of meta-learning with particle swarm algorithms for SVM parameter selection

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Swarm capability of finding eigenvalues

AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
A survey of techniques for characterising fitness landscapes and some possible ways forward

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Particle Swarm Optimization (PSO) is a population-based optimization method in which search points employ a cooperative strategy to move toward one another. In this paper we show that PSO appears to work well on "single-funnel" optimization functions. On more complex optimization problems, PSO tends to converge too quickly and then fail to make further progress. We contend that most benchmarks for PSO have classically been demonstrated on single-funnel functions. However, in practice, optimization tasks are more complex and possess higher problem dimensionality. We present empirical results that support our conjecture that PSO performs well on single-funnel functions but tends to stagnate on more complicated landscapes.