改进的乘幂适应度函数在遗传算法中的应用  

Improved exponentiation scale transformation in application of genetic algorithm

作　　者：杨水清[1] 杨加明[1] 孙超[1] 

机构地区：[1]南昌航空大学飞行器工程学院,南昌330063

出　　处：《计算机工程与应用》2014年第17期40-43,154,共5页Computer Engineering and Applications

基　　金：航空科学基金(No.2012ZA56001);江西省自然科学基金(No.20114BAB202010)

摘　　要：在遗传算法优化过程中,引导搜索的主要依据是适应度函数。通过评估常见的几种适应度函数,兼顾保持种群的多样性和算法的收敛性,由乘幂尺度变换,提出了一种改进的乘幂适应度函数。以三个典型的测试函数为例,在相同遗传操作和参数情况下,分别采用常见的与改进的适应度函数进行优化比较。结果表明,所改进的乘幂适应度函数能明显提高算法的收敛精度、收敛速度和收敛稳定性,对提高遗传算法的整体性能有重要的意义。It is the main factors for fitness functions to guide the search of the genetic algorithm optimization process. The exponential fitness functions are improved by exponentiation scale transformation. They are used to evaluate several common fitness functions to keep their diversity of population and convergence of the algorithms. The optimal computa-tion is compared for the usual and the improved fitness functions under the same conditions of genetic manipulation and their parameters in using three typical test functions. Numerical results show that it is significant for the new fitness func-tions of a power optimal algorithm to improve the overall performance including the accuracy, convergence speed, and convergence stability of the ameliorated genetic algorithms.

关 键 词：遗传算法 适应度函数 测试函数 优化计算 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]