Improving performance via population growth and local search: the case of the artificial bee colony algorithm

Authors:
Doğan Aydın;Tianjun Liao;Marco A. Montes de Oca;Thomas Stützle
Affiliations:
Dept. of Computer Engineering, Dumlupınar University, Kütahya, Turkey;IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium;Dept. of Mathematical Sciences, University of Delaware, Newark, DE;IRIDIA, CoDE, Université Libre de Bruxelles, Brussels, Belgium
Venue:
EA'11 Proceedings of the 10th international conference on Artificial Evolution
Year:
2011

Citing 9
Cited 1

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm

Journal of Global Optimization
Particle swarm optimization with adaptive population size and its application

Applied Soft Computing
Efficient population utilization strategy for particle swarm optimizer

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Improvement strategies for the F-Race algorithm: sampling design and iterative refinement

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
An incremental ant colony algorithm with local search for continuous optimization

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Editorial scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems

Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems
An incremental particle swarm for large-scale continuous optimization problems: an example of tuning-in-the-loop (re)design of optimization algorithms

Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems
Incremental Social Learning in Particle Swarms

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Solution to non-convex economic dispatch problem with valve point effects by incremental artificial bee colony with local search

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We modify an artificial bee colony algorithm as follows: we make the population size grow over time and apply local search on strategically selected solutions. The modified algorithm obtains very good results on a set of large-scale continuous optimization benchmark problems. This is not the first time we see that the two aforementioned modifications make an initially non-competitive algorithm obtain state-of-the-art results. In previous work, we have shown that the same modifications substantially improve the performance of particle swarm optimization and ant colony optimization algorithms. Altogether, these results suggest that population growth coupled with local search help obtain high-quality results.