摘要
多数遗传算法在搜索解时没有充分利用其问题域的知识 .提出了一类新的改进的适应度函数的遗传算法 .它考虑了函数在搜索点的函数值及其变化率 ,并将该信息加入适应度函数 ,使得按概率选择的染色体不但具有较小的函数值 (对极小化问题而言 ) ,而且具有较大的函数值变化率 .实验结果表明 。
Most genetic algorithms do not use the knowledge in the related problem fields completely when searching the approximate solutions. A new kind of genetic algorithm with modified fitness functions is presented. In this algorithm, both the function value at the searching point and the function change rate at the point are combined into fitness functions. It makes the chromosome code chosen by probability be able to have both smaller function value (for minimum problem) and higher function change rate. The experimental results show that the new algorithm is convergent much faster than the standard genetic algorithm is.
出处
《软件学报》
EI
CSCD
北大核心
2001年第7期981-985,共5页
Journal of Software
