Loading…
A modified firefly algorithm for global minimum optimization
•A modified firefly algorithm has been proposed with a new point of view Tidal Force for better exploitation.•In The new strategy absorption coefficient is not used any more.•The new strategy is flexible performance and efficiency in less and more dimension of optimization problems. The Firefly algo...
Saved in:
Published in: | Applied soft computing 2018-01, Vol.62, p.29-44 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | •A modified firefly algorithm has been proposed with a new point of view Tidal Force for better exploitation.•In The new strategy absorption coefficient is not used any more.•The new strategy is flexible performance and efficiency in less and more dimension of optimization problems.
The Firefly algorithm is a population-based optimization algorithm. It has become popular in the field of optimization and has been applied to engineering practices. Recent works have failed to address how to find the global minimum because their algorithm was trapped in the local minimum. Also, they were not able to provide a balance between exploration and exploitation. In this paper, the Tidal Force formula has been applied to modify the Firefly algorithm, which describes the effect of a massive body that gravitationally affects another massive body. The proposed algorithm brings a new strategy into the optimization field. It is applied by using exploitation (Tidal Force) and keeping a balance between the exploration and exploitation on function suitability. Plate shaped, Steep Ridges, Unimodal and Multimodal benchmark functions were used to compare experimental results. The study findings indicate that the Tidal Force Firefly algorithm outperforms the other existing modified Firefly algorithms. |
---|---|
ISSN: | 1568-4946 1872-9681 |
DOI: | 10.1016/j.asoc.2017.10.032 |