首页> 外文会议>International Conference on Natural Computation >A bi-directional chaos optimization algorithm
【24h】

A bi-directional chaos optimization algorithm

机译:双向混沌优化算法

获取原文
获取外文期刊封面目录资料

摘要

Chaos optimization algorithm (COA) as a novel method of global optimization has attracted much attention. In order to address the COA's deficiencies in dealing with the large space and high-dimension optimization problems, a bi-directional chaos optimization algorithm (BCOA) is proposed. The main idea of BCOA is to adjust the approach of second carrier wave and to realize the bi-directional search in the sub-optimal solutions rather than the unidirectional search. Moreover, the parameter of second carrier wave is analyzed. The experiments on benchmark functions show that BCOA is capable of improving the search performance significantly no matter in convergent speed or precision. It is considerably better and more efficient to tackle the large space and high-dimension multimodal optimization problems.
机译:混沌优化算法(COA)作为一种新颖的全球优化方法引起了很多关注。为了解决COA在处理大型空间和高维优化问题方面的缺陷,提出了一种双向混沌优化算法(BCOA)。 BCOA的主要思想是调整第二载波的方法,并在子最优解决方案中实现双向搜索,而不是单向搜索。此外,分析了第二载波波的参数。基准函数的实验表明,BCOA能够在收敛速度或精度中显着提高搜索性能。解决大型空间和高维多式化优化问题是相当更好,更有效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号