计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (20): 36-40.DOI: 10.3778/j.issn.1002-8331.2008.20.011

• 理论研究 • 上一篇    下一篇

一种基于极坐标的分布度保持策略

曾映兰,邝 达,郑金华   

  1. 湘潭大学 信息工程学院,湖南 湘潭 411105
  • 收稿日期:2007-12-27 修回日期:2008-03-06 出版日期:2008-07-11 发布日期:2008-07-11
  • 通讯作者: 曾映兰

Method based on polar coordinates for diversity maintenance in multi-objective genetic algorithm

ZENG Ying-lan,KUANG Da,ZHENG Jin-hua   

  1. Institute of Information Engineering,Xiangtan University,Xiangtan,Hunan 411105,China
  • Received:2007-12-27 Revised:2008-03-06 Online:2008-07-11 Published:2008-07-11
  • Contact: ZENG Ying-lan

摘要: 将极坐标的思想引入多目标遗传算法来保持解的多样性,由此提出了一种新的多目标遗传算法:PCGA2(Polar Coordinates Genetic AlgorithmsⅡ);分析了基于极坐标的分布度保持策略的时间复杂度,并通过实验将PCGA2同当前流行的两种多目标遗传算法(NSGA2和SPEA2)进行了比较。实验数据表明该算法不仅在时间耗费上比较低,而且所得到的解具有非常好的分布度。

关键词: 多目标遗传算法, 多样性, 时间复杂度, 分布度

Abstract: A new multi-objective genetic algorithm called PCGA2(Polar Coordinates Genetic AlgorithmsⅡ) is proposed in this paper.A strategy based on polar coordinates to keep diversity is introduced into PCGA2.We analyze the time complexity of this strategy.In our experiments,PCGA2 is compared with NSGA2 and SPEA2.The experimental results show that PCGA2 can obtain a good distribution of solutions in short time.

Key words: multi-objective genetic algorithm, diversity, time complexity, distribution