首页> 外文期刊>Neurocomputing >A novel real-coded population-based extremal optimization algorithm with polynomial mutation: A non-parametric statistical study on continuous optimization problems
【24h】

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

机译:基于多项式突变的基于实数编码的种群极值优化算法:一种连续优化问题的非参数统计研究

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:作为受自组织临界的非平衡动力学启发的最新开发的优化方法,极值优化(EO)已成功应用于各种组合优化问题,而在连续优化问题中的应用则相对较少。此外,尽管突变操作在控制优化动力学中起着至关重要的作用,因此影响基于EO的算法的性能,但是关于突变操作对EO算法的影响的研究很少。针对连续优化问题,提出了一种具有多项式突变的基于实数编码的EO算法(RPEO-PLM)。 RPEO-PLM的基本思想是基于种群的迭代优化,包括生成实编码的随机初始种群,评估个体和种群适应度,基于多项式突变产生新种群以及通过接受种群更新种群。新人口无条件。与其他流行的进化算法相比,最吸引人的优势之一是其相对简单,这是因为它需要调整的可调参数更少,并且仅需要选择和突变操作。此外,通过使用非参数统计检验(包括Friedman和Quade检验)对具有不同维度的大量基准函数进行的实验结果表明,所提出的RPEO-PLM算法优于其他流行的基于种群的进化算法,例如,具有自适应定向突变(RCGA-ADM)的编码遗传算法(RCGA),具有多项式突变的RCGA(RCGA-PLM),智能进化算法(IEA),混合粒子群优化和EO算法(PSO-EO),原始种群的EO(PEO),以及改进的具有随机突变的RPEO算法(IRPEO-RM)的准确性。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号