4.7 Article

Comparison of nature-inspired population-based algorithms on continuous optimisation problems

期刊

SWARM AND EVOLUTIONARY COMPUTATION
卷 50, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.swevo.2019.01.006

关键词

Single objective optimisation; Nature-inspired algorithms; Differential evolution; Real-world problems; Experimental comparison

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

Eleven swarm-intelligence-based (SI) and bio-inspired (BI) algorithms are compared with four advanced adaptive differential evolution (DE) variants, the classic DE and the blind random search on two benchmark sets. One of the benchmark sets is the CEC 2011 collection of 22 real-world optimisation problems, the latter is the suite of 30 artificial optimisation problems defined for the competition of the algorithms within CEC 2014. The results of the experiments demonstrate the superiority of the adaptive DE variants both on realworld problems and the artificial CEC 2014 test suite at all the levels of dimension (10, 30, and 50). Some of the SI and BI algorithms perform even worse than the blind random search. The efficiency of the classic DE is comparable with the better performing SI and BI methods. The results entitle to form a recommendation for practitioners: Do not propose a pseudo-new algorithm but select from the optimisation algorithms supported by thorough research and good ranking at international competitions of optimisation algorithms.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
Article Computer Science, Artificial Intelligence

Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility

Guiliang Gong, Jiuqiang Tang, Dan Huang, Qiang Luo, Kaikai Zhu, Ningtao Peng

Summary: This paper proposes a flexible job shop scheduling problem with discrete operation sequence flexibility and designs an improved memetic algorithm to solve it. Experimental results show that the algorithm outperforms other algorithms in terms of performance. The proposed model and algorithm can help production managers obtain optimal scheduling schemes considering operations with or without sequence constraints.

SWARM AND EVOLUTIONARY COMPUTATION (2024)

Article Computer Science, Artificial Intelligence

A differential evolution algorithm for solving mixed-integer nonlinear programming problems

Daniel Molina-Perez, Efren Mezura-Montes, Edgar Alfredo Portilla-Flores, Eduardo Vega-Alvarado, Barbara Calva-Yanez

Summary: This paper presents a new proposal based on two fundamental strategies to improve the performance of the differential evolution algorithm when solving MINLP problems. The proposal considers a set of good fitness-infeasible solutions to explore promising regions and introduces a composite trial vector generation method to enhance combinatorial exploration and convergence capacity.

SWARM AND EVOLUTIONARY COMPUTATION (2024)