【24h】

A Multi-objective Genetic Algorithm based on Clustering

机译:基于聚类的多目标遗传算法

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

摘要

In order to further ease the disaster of computing costs in multi-objective optimization problem, we’ve put forward a kind of multi-objective genetic algorithm based on clustering. The algorithm uses the fuzzy c-means clustering control the similar individuals gathered in a class and for each class construct non-dominated set with arena’s principle,so that we can use faster speed to choose the non-dominated individuals,then according to the distribution of each class, sampling structure new evolution sample and effectively ensure the diversity of population. Theoretical analysis and numerical experiment results show that the proposed algorithm has higher search performance,and the distribution and convergence are more ideal.
机译:为了进一步缓解多目标优化问题中的计算成本灾难,我们提出了一种基于聚类的多目标遗传算法。该算法利用模糊c均值聚类控制类中聚集的相似个体,并根据竞技场原理为每个类构造非主导集,从而可以更快地选择非主导个体,然后根据分布情况进行选择。在每个类别的样本中,抽样构成新的进化样本,并有效地确保了种群的多样性。理论分析和数值实验结果表明,该算法具有较高的搜索性能,且分布和收敛性较为理想。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号