4.5 Article

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

期刊

JOURNAL OF SUPERCOMPUTING
卷 76, 期 12, 页码 9404-9429

出版社

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

关键词

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

资金

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

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Chemistry, Physical

Mechanism studies concerning carbon deposition effect of CO methanation on Ni-based catalyst through DFT and TPSR methods

Xiaoxia Han, Jinzhou Yang, Hailong Guo, Zhifeng Qin, Shuyan Zhao, Yanxue Lu, Zhong Li, Jun Ren

INTERNATIONAL JOURNAL OF HYDROGEN ENERGY (2016)

Article Chemistry, Physical

Using data mining technology in screening potential additives to Ni/Al2O3 catalysts for methanation

Xiaoxia Han, Chaofan Zhao, Haixia Li, Shusen Liu, Yahong Han, Zhilei Zhang, Jun Ren

CATALYSIS SCIENCE & TECHNOLOGY (2017)

Article Chemistry, Physical

Synthesis of dimethyl carbonate on single Cu atom embedded in N-doped graphene: Effect of nitrogen species

Xiaoxia Han, Wei Sun, Chaofan Zhao, Ruina Shi, Xuhui Wang, Shusen Liu, Zhong Li, Jun Ren

MOLECULAR CATALYSIS (2017)

Article Materials Science, Multidisciplinary

A density functional theory study of CO methanation mechanism on Ni4/SiC catalyst

Xiaoxia Han, Chaofan Zhao, Wei Sun, Bingying Han, Yahong Han, Jun Ren

COMPUTATIONAL MATERIALS SCIENCE (2018)

Article Chemistry, Physical

Screening of Additives to Ni-Based Methanation Catalyst for Enhanced Anti-Sintering Performance

Yuting Li, Xiaoxia Han, Chaofan Zhao, Lin Yue, Jinxian Zhao, Jun Ren

CATALYSTS (2019)

Article Computer Science, Artificial Intelligence

State-transition simulated annealing algorithm for constrained and unconstrained multi-objective optimization problems

Xiaoxia Han, Yingchao Dong, Lin Yue, Quanxi Xu, Gang Xie, Xinying Xu

Summary: In this article, a novel multi-objective optimization algorithm MOSTASA is proposed, which combines state-transition operators and the concept of Pareto dominance to generate and store Pareto optimal solutions, achieving a uniform distribution of solutions. Simulation experiments show that MOSTASA outperforms other algorithms in terms of efficiency and reliability.

APPLIED INTELLIGENCE (2021)

Article Computer Science, Hardware & Architecture

A novel state transition simulated annealing algorithm for the multiple traveling salesmen problem

Yan Zhang, Xiaoxia Han, Yingchao Dong, Jun Xie, Gang Xie, Xinying Xu

Summary: This study introduces an intelligent algorithm for solving the multiple traveling salesman problem using metropolitan criteria and basic matrix operations to generate the solution space, while enhancing the ability to capture the global optimal solution by introducing the 2opt neighborhood search structure. Experimental results demonstrate the superior performance of this method in MTSP.

JOURNAL OF SUPERCOMPUTING (2021)

Article Computer Science, Artificial Intelligence

Density Peaks Clustering Based on Jaccard Similarity and Label Propagation

Xiaowei Qin, Xiaoxia Han, Junwen Chu, Yan Zhang, Xinying Xu, Jun Xie, Gang Xie

Summary: Cognitive computing involves discovering hidden rules and patterns in massive volumes of data. Density peaks clustering (DPC) is a powerful data mining tool that can efficiently detect clusters of arbitrary shapes. By utilizing the Jaccard coefficient to measure point similarity and implementing a two-step allocation strategy, accurate identification of density peaks can be achieved.

COGNITIVE COMPUTATION (2021)

Article Computer Science, Information Systems

State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems

Xiaoxia Han, Yingchao Dong, Lin Yue, Quanxi Xu

IEEE ACCESS (2019)

暂无数据