首页> 外文会议>Artificial neural nets and genetic algorithms >A Genetic Algorithm with Dynamic Niche Clustering for Multimodal Function Optimisation
【24h】

A Genetic Algorithm with Dynamic Niche Clustering for Multimodal Function Optimisation

机译:具有动态生态位聚类的遗传算法进行多峰函数优化

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

摘要

Genetic algorithm's (GA's) have become a powerful search tool petaining to the identification of global optima within multimodal domains. Many different methodologies and techniques have been developed to aid in this search, and facilitate the efficient location of these optima. What has become known as Goldberg's standard fitness sharing methodology is inefficient and does not explicitly identify or provide any information about the peaks (niches) of a fitness function. In this paper, a mechanism is formulated that will identify the peaks of a multimodal fitness function in a onedimensional parameter space, using a hybrid form of clustering in the framework of a genetic algorithm. It is shown that the proposed Dynamic Niche Clustering scheme not only performs as well as standard nicheing, but works in O(nq) time, rather than O(n~2) time. In addition to this, it explicitly provides statistical information about the peaks themselves. The Dynamic Niche Clustering scheme is also shown to have favourable qualities in revealing multimodal function optima when there is little or no knowledge of the fitness function itself a priori.
机译:遗传算法(GA)已成为一种强大的搜索工具,可用于识别多峰域内的全局最优。已经开发出许多不同的方法和技术来辅助这种搜索,并促进这些最优值的有效定位。众所周知,戈德堡(Goldberg)的标准适应度共享方法效率低下,并且没有明确识别或提供有关适应度函数峰值(小生境)的任何信息。在本文中,提出了一种机制,该机制将在遗传算法的框架中使用聚类的混合形式来识别一维参数空间中的多峰适应度函数的峰值。结果表明,所提出的动态小生境聚类方案不仅性能优于标准小生境,而且可以在O(nq)时间而不是O(n〜2)时间内工作。除此之外,它还明确提供有关峰本身的统计信息。当对适应度函数本身的先验知识很少或根本不了解时,动态小生境聚类方案也被证明在揭示多峰函数最优方面具有良好的品质。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号