4.7 Article

Dynamic Gaussian bare-bones fruit fly optimizers with abandonment mechanism: method and analysis

Journal

ENGINEERING WITH COMPUTERS
Volume 38, Issue SUPPL 1, Pages 743-771

Publisher

SPRINGER
DOI: 10.1007/s00366-020-01174-w

Keywords

Swarm intelligence; Fruit fly optimization algorithm; Gaussian bare-bones; Dynamic step length; Engineering design problems

Funding

  1. National Natural Science Foundation of China [U19A2061, U1809209]
  2. Science and Technology Development Project of Jilin Province [20190301024NY]
  3. Jilin Provincial Industrial Innovation Special Fund Project [2018C0393]
  4. Medical and Health Technology Projects of Zhejiang province [2019RC207]

Ask authors/readers for more resources

The Fruit Fly Optimization Algorithm (FOA) is a recently developed algorithm inspired by the foraging behavior of fruit fly populations. In order to improve its global search capability and solution quality, a dynamic step length mechanism, abandonment mechanism, and Gaussian bare-bones mechanism are introduced into FOA, resulting in BareFOA. Experimental results demonstrate that BareFOA outperforms other competitors in benchmark problems and engineering optimization design problems.
The Fruit Fly Optimization Algorithm (FOA) is a recent algorithm inspired by the foraging behavior of fruit fly populations. However, the original FOA easily falls into the local optimum in the process of solving practical problems, and has a high probability of escaping from the optimal solution. In order to improve the global search capability and the quality of solutions, a dynamic step length mechanism, abandonment mechanism and Gaussian bare-bones mechanism are introduced into FOA, termed as BareFOA. Firstly, the random and ambiguous behavior of fruit flies during the olfactory phase is described using the abandonment mechanism. The search range of fruit fly populations is automatically adjusted using an update strategy with dynamic step length. As a result, the convergence speed and convergence accuracy of FOA have been greatly improved. Secondly, the Gaussian bare-bones mechanism that overcomes local optimal constraints is introduced, which greatly improves the global search capability of the FOA. Finally, 30 benchmark functions for CEC2017 and seven engineering optimization problems are experimented with and compared to the best-known solutions reported in the literature. The computational results show that the BareFOA not only significantly achieved the superior results on the benchmark problems than other competitive counterparts, but also can offer better results on the engineering optimization design problems.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available