arrow
Return

An Improved Moth-Flame Optimization algorithm with hybrid search phase

delete2020-03-01
delete83
PRE
AI
D
Danilo Pelusi *
R
Raffaele Mascella
L
Luca G. Tallini
J
Janmenjoy Nayak
B
Bighnaraj Naik
Y
Yong Deng
DOI:10.1016/j.knosys.2019.105277delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In order to solve real-life problems, several metaheuristic optimization algorithms have been developed. The Moth-Flame Optimization (MFO) algorithm is a search algorithm based on a mechanism called transverse orientation. In this mechanism, the moths tend to maintain a fixed angle with respect to the moon. MFO suffers from the degeneration of the global search capability and convergence speed. To overcome these imperfections, an Improved Moth-Flame Optimization (IMFO) algorithm is proposed. The main novelty of the proposed approach is the definition of a hybrid phase between exploration and exploitation. This phase is characterized by a fitness depended weight factor for updating the moths positions. IMFO is tested on selected benchmark functions, CEC2014 test functions and 6 design problems, and compared with recent well-known optimization algorithms. The results show that IMFO achieves the best results with respect to the comparison algorithms in terms of search capability and convergence performances. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Evolutionary algorithms
Moth flame optimization
Constrained optimization
Nature-inspired algorithms
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

K
Knowledge-Based Systems
IF:
7.6
Papers:
1.2W
Citations:
4.5W

Organization

V
Veer Surendra Sai University of Technology
Scholars:
674
Papers: 642
Citations: 594
U
University of Teramo
Scholars:
1.9K
Papers: 1.5K
Citations: 1.8K