检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:戴晓明[1] 陈治纲[1] 冯瑞[1] 茅雪飞[1] 邵惠鹤[1]
出 处:《上海交通大学学报》2002年第8期1158-1160,共3页Journal of Shanghai Jiaotong University
基 金:国家重点基础研究发展规划 (973 )项目 (G19980 3 0 4)
摘 要:在经典遗传算法的基础上 ,提出了一种基于改进模式提取 ( Algorithm of pattern extrac-tion,Alopex)的变异算子 ,种群个体的连续进化方向作为当前代个体的变异方向 ,并利用自适应来调整变异步长 ,通过控制参数来控制变异方向的概率从而跳过局部最优值 .对几种典型函数的测试结果表明 ,基于该变异算子的遗传算法能较好地避免收敛到局部最优 。This paper presented an Algorithm of pattern extraction (Alopex) approach to the mutation mechanism for Genetic Algorithm (GA). The direction of the mutation of individual is guided by two consecutive evolve directions of the individual. The self adaptive step is adjusted by the two consecutive improved directions. The probability of overcoming the local minimum is determined by certain control parameters. Several benchmark problems were tested for the new approach's efficiency and convergence property. The plaguing problem of premature convergence problem can be greatly levied by this approach. It shows great advantage to the canonical genetic algorithm.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147