遗传算法中种群维护策略的比较  

A Comparison of Population Maintenance Strategies in Genetic Algorithm

作　　者：谭阳[1] 方颂[1] 

机构地区：[1]湖南网络工程职业学院,湖南长沙410004

出　　处：《湖南广播电视大学学报》2011年第4期49-53,共5页Journal of Hunan Radio and Television University

基　　金：湖南省自然科学基金项目"无线传感器网络容错技术研究"(06JJ50107);湖南省教育厅重点项目"多复变函数空间上算子理论"(10A074)

摘　　要：遗传算法在许多优化问题中都有成功的应用,但其本身也存在一些不足。如何改善遗传算法的搜索能力,使其兼顾收敛速度和搜索范围,能更好地解决实际问题,一直是智能计算领域主要的课题之一。本文就3种常见的种群维护策略进行了比较与讨论,并分析了不同策略的优劣之处。Genetic algorithms are successfully applied in many optimization procedures, but there are also some drawbacks of its own. How to improve the search capabilities of genetic algorithms to take into account the convergence speed and search range, and solve practical problems better, has been one of the main topics of intelligent computing field. In this paper, three common populations maintenance strategy are compared together, with the discussion and analysis of the strengths and weaknesses of different strategies.

关 键 词：遗传算法 选择策略 适应度排序 欧氏距离 海明距离 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]