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.

关键词： multi-objective optimization clustering algorithm non-dominated set

作者: LI Wenbin GUO Guanqi YAN Tanshan

作者单位: School of Information and Communication Engineering Hu’nan Institute of Science and Technology

会议类型: 国际会议

会议名称: 2012 International Conference on Intelligent System Design and Engineering Applications(2012年智能系统设计与工程应用国际会议 ISDEA 2012)

会议地点: 三亚

会议语种:英文

页码: 41-43

在线出版日期: 2012-01-06（万方平台首次上网日期，不代表论文的发表时间）