Improving firefly algorithm using hybrid strategies (Q2224271)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improving firefly algorithm using hybrid strategies |
scientific article; zbMATH DE number 7305531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving firefly algorithm using hybrid strategies |
scientific article; zbMATH DE number 7305531 |
Statements
Improving firefly algorithm using hybrid strategies (English)
0 references
3 February 2021
0 references
Summary: In this paper, we present a new firefly algorithm (FA) by using hybrid strategies to obtain a good optimisation performance. The proposed approach, namely HFA, employs three strategies. First, an adaptive parameter method is utilised to dynamically changing the step factor. Second, HFA uses a modified search strategy and eliminates the concept of attractiveness. So, HFA does not include two parameters, absorption coefficient and initial attractiveness. Third, a probabilistic attraction model is used to replace the original full attraction model. Experiments on some benchmark problems show that HFA is superior to mimetic FA (MFA) and probabilistic attraction-based FA (PAFA).
0 references
firefly algorithm
0 references
adaptive parameter
0 references
probabilistic attraction
0 references
optimisation
0 references
0.8450697064399719
0 references
0.8277531862258911
0 references
0.7932138442993164
0 references
0.7845993638038635
0 references
0.7841600179672241
0 references