Adaptive memetic particle swarm optimization with variable local search pool size

Authors:
Costas Voglis;Panagiotis E. Hadjidoukas;Konstantinos E. Parsopoulos;Dimitrios G. Papageorgiou;Isaac E. Lagaris
Affiliations:
University of Ioannina, Ioannina, Greece;ETH Zurich, Zurich, Switzerland;University of Ioannina, Ioannina, Greece;University of Ioannina, Ioannina, Greece;University of Ioannina, Ioannina, Greece
Venue:
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Year:
2013

Citing 11
Cited 0

Adaptive global optimization with local search

Adaptive global optimization with local search
Swarm intelligence

Swarm intelligence
Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
A Hyperheuristic Approach to Scheduling a Sales Summit

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
The particle swarm optimization algorithm: convergence analysis and parameter selection

Information Processing Letters
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation
Meta-Lamarckian learning in memetic algorithms

IEEE Transactions on Evolutionary Computation
Classification of adaptive memetic algorithms: a comparative study

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Parameter selection and adaptation in Unified Particle Swarm Optimization

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an adaptive Memetic Particle Swarm Optimization algorithm where local search is selected from a pool of different algorithms. The choice of local search is based on a probabilistic strategy that uses a simple metric to score the efficiency of local search. Our study investigates whether the pool size affects the memetic algorithm's performance, as well as the possible benefit of using the adaptive strategy against a baseline static one. For this purpose, we employed the memetic algorithms framework provided in the recent MEMPSODE optimization software, and tested the proposed algorithms on the Benchmarking Black Box Optimization (BBOB 2012) test suite. The obtained results lead to a series of useful conclusions.