arrow
返回

A novel real-coded population-based extremal optimization algorithm with polynomial mutation: A non-parametric statistical study on continuous optimization problems

delete2016-01-01
delete73
PRE
AI
L
Limin Li
K
Kang‐Di Lu
G
Guo‐Qiang Zeng *
L
Lie Wu
M
Min-Rong Chen
DOI:10.1016/j.neucom.2015.09.075delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
As a recently developed optimization method inspired by far-from-equilibrium dynamics of self-organized criticality, extremal optimization (EO) has been successfully applied to a variety of combinatorial optimization problems while its applications in continuous optimization problems are relatively rare. Additionally, there are only few studies concerning the effects of mutation operation on EO algorithms although mutation operation plays a crucial role in controlling the optimization dynamics and consequently affecting the performance of EO-based algorithms. This paper proposes a novel real-coded population-based EO algorithm with polynomial mutation (RPEO-PLM) for continuous optimization problems. The basic idea behind RPEO-PLM is the population-based iterated optimization consisting of generation of a real-coded random initial population, evaluation of individual and population fitness, generation of a new population based on polynomial mutation, and updating the population by accepting the new population unconditionally. One of the most attractive advantages is its relative simplicity compared with other popular evolutionary algorithms due to its fewer adjustable parameters needing to be tuned and only selection and mutation operations. Furthermore, the experimental results on a large number of benchmark functions with the different dimensions by using non-parametric statistical tests including Friedman and Quade tests have shown that the proposed RPEO-PLM algorithm outperforms other popular population-based evolutionary algorithms, e.g., real-coded genetic algorithm (RCGA) with adaptive directed mutation (RCGA-ADM), RCGA with polynomial mutation (RCGA-PLM), intelligent evolutionary algorithm (IEA), a hybrid particle swarm optimization and EO algorithm (PSO-EO), the original population-based EO (PEO), and an improved RPEO algorithm with random mutation (IRPEO-RM) in terms of accuracy. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Extremal optimization
Evolutionary algorithms
Mutation
Continuous optimization problems
Non-parametric statistical tests
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

S
south china normal university
学者数:
2.0W
论文数: 1.3W
被引数: 13
W
Wenzhou University
学者数:
8.8K
论文数: 6.5K
被引数: 1.5W
引用论文

引用论文

err分享
err收藏
H∞ filtering for singular systems with communication delays
err2010-04-01
err102
PREAI
errLu, Renquan; Xu, Yong; Xue, Anke
err分享
err收藏
Adaptive directed mutation for real-coded genetic algorithms
err2013-01-01
err98
PREAI
errTang, Ping-Hung; Tseng, Ming-Hseng
err分享
err收藏
学者 查看更多内容