4.5 Article

Efficient hybrid algorithm based on moth search and fireworks algorithm for solving numerical and constrained engineering optimization problems

Journal

JOURNAL OF SUPERCOMPUTING
Volume 76, Issue 12, Pages 9404-9429

Publisher

SPRINGER
DOI: 10.1007/s11227-020-03212-2

Keywords

Constrained engineering optimization problem; Moth search-fireworks algorithm; Exploitation; Exploration; Explosion and mutation operators

Funding

  1. National Natural Science Foundation of China [21606159]
  2. Key Research and Development Program of Shanxi Province [201803D121039]

Ask authors/readers for more resources

The moth search algorithm (MS) is a novel intelligent optimization algorithm based on moth population behavior, which can solve many problems in different fields. However, the algorithm is easy to fall into local optimization when solving complex optimization problems. This study develops a new hybrid moth search-fireworks algorithm (MSFWA) to solve numerical and constrained engineering optimization problems. The explosion and mutation operators from the fireworks algorithm are introduced into the MS, which not only preserves the advantages of fast convergence and strong exploitation capability of the algorithm, but also significantly enhances the exploration capability. The performance of the MSFWA is tested using 23 benchmark functions. The hybrid algorithm is superior to other highly advanced metaheuristic algorithms for most benchmark functions, demonstrating the characteristics of fast convergence and high stability. Finally, the ability of the MSFWA to solve practical constrained problems is evaluated on six well-known engineering application problems. Compared with other optimization algorithms, the MSFWA is very competitive in its solution of these complex and constrained practical 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.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available