An object-oriented implementation of the firefly algorithm for continuous unconstrained optimization problems

Authors:
Milos Subotic;Ivan Misic;Milan Tuba
Affiliations:
Faculty of Computer Science, Megatrend University of Belgrade, N. Belgrade, Serbia;Faculty of Computer Science, Megatrend University of Belgrade, N. Belgrade, Serbia;Faculty of Computer Science, Megatrend University of Belgrade, N. Belgrade, Serbia
Venue:
AMERICAN-MATH'12/CEA'12 Proceedings of the 6th WSEAS international conference on Computer Engineering and Applications, and Proceedings of the 2012 American conference on Applied Mathematics
Year:
2012

Citing 7
Cited 0

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Ant Colony Optimization

Ant Colony Optimization
On the performance of artificial bee colony (ABC) algorithm

Applied Soft Computing
Solving large scale optimization problems by opposition-based differential evolution (ODE)

WSEAS Transactions on Computers
Nature-Inspired Metaheuristic Algorithms

Nature-Inspired Metaheuristic Algorithms
Firefly Algorithm for Continuous Constrained Optimization Tasks

ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Particle swarm optimization models applied to neural networks using the R language

WSEAS TRANSACTIONS on SYSTEMS

Quantified Score

Hi-index	0.00

Visualization

Abstract

Firefly algorithm is one of the latest additions to the family of swarm intelligence metaheuristics for hard optimization problems. It is based on the mating and social behavior of fireflies. It is not well researched yet and its potentials are undetermined. This paper describes an object-oriented implementation of the firefly algorithm for continuous unconstrained optimization problems. It was tested on nine standard benchmark function and results are promising compared to other swarm intelligence algorithm. This software framework will allow for easy modifications and further testing with the possibility that this algorithm will outperform older algorithms.