首页> 外文期刊>Engineering Applications of Artificial Intelligence >A hybrid optimization algorithm based on cuckoo search and differential evolution for solving constrained engineering problems
【24h】

A hybrid optimization algorithm based on cuckoo search and differential evolution for solving constrained engineering problems

机译:基于杜鹃搜索和差分进化的混合优化算法,用于解决约束工程问题

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

摘要

Based on Cuckoo Search (CS) and Differential Evolution (DE), a novel hybrid optimization algorithm, called CSDE, is proposed in this paper to solve constrained engineering problems. CS has strong ability on global search and less control parameters, but easy to suffer from premature convergence and lower the density of population. DE specializes in local search and good robustness, however, its convergence rate is too late to find the satisfied solution. Furthermore, these two algorithms are both proved to be especially suitable for engineering problems. This work divides population into two subgroups and adopts CS and DE for these two subgroups independently. By division, these two subgroups can exchange useful information and these two algorithms can utilize each other's advantages to complement their shortcoming, thus avoid premature convergence, balance the quality of solution and the computation consumption, and find satisfactory global optima. Due to the tremendous design variables and constrained conditions of engineering problems, single optimizer failed to meet the requirement of precision, so hybrid optimization algorithms (such like CSDE) is the most promising mean to complete this job. Simulation results reveal that CSDE has more ability to find promising results than other 12 algorithms (including traditional algorithms and state-of-the-art algorithm) on 30 unconstrained benchmark functions, 10 constrained benchmark functions and 6 constrained engineering problems.
机译:基于杜鹃搜索(CS)和差分进化(DE),提出了一种新颖的混合优化算法CSDE,以解决工程约束问题。 CS具有强大的全局搜索能力和较少的控制参数,但易于过早收敛并降低了人口密度。 DE专门从事本地搜索和良好的鲁棒性,但是,其收敛速度为时已晚,无法找到满意的解决方案。此外,这两种算法都被证明特别适合工程问题。这项工作将人口分为两个子组,并且对这两个子组分别采用CS和DE。通过划分,这两个子组可以交换有用的信息,并且这两个算法可以利用彼此的优势来弥补其缺点,从而避免过早收敛,平衡解决方案的质量和计算量,并找到令人满意的全局最优值。由于巨大的设计变量和工程问题的限制条件,单个优化器无法满足精度要求,因此混合优化算法(如CSDE)是完成这项工作的最有希望的手段。仿真结果表明,与其他12种算法(包括传统算法和最新算法)相比,CSDE在30个无约束的基准函数,10个受约束的基准函数和6个受约束的工程问题上具有更大的发现前景的能力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号