Particle swarm optimization with resets: improving the balance between exploration and exploitation

Authors:
Yenny Noa Vargas;Stephen Chen
Affiliations:
Department of Artificial Intelligence and Computational Systems, University of Havana, Havana, Cuba;School of Information Technology, York University, Toronto, ON, Canada
Venue:
MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
Year:
2010

Citing 7
Cited 0

An Introduction to Genetic Algorithms

An Introduction to Genetic Algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search

Tabu Search
Black-box optimization benchmarking for noiseless function testbed using particle swarm optimization

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Locust swarms: a new multi-optima search technique

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A Heterogeneous Particle Swarm

ACAL '09 Proceedings of the 4th Australian Conference on Artificial Life: Borrowing from Biology
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Exploration and exploitation are two important factors to consider in the design of optimization techniques. Two new techniques are introduced for particle swarm optimization: "resets" increase exploitation and "delayed updates" increase exploration. In general, the added exploitation with resets helps more with the lbest topology which is more explorative, and the added exploration with delayed updates helps more with the gbest topology which is more exploitive.