检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]兰州理工大学计算机与通信学院,甘肃兰州730050
出 处:《计算机应用》2005年第10期2392-2394,共3页journal of Computer Applications
基 金:国家科技攻关计划项目(2001BA201A32);国家863计划项目(2002AA415270)
摘 要:通过对传统遗传算法和模拟退火算法各自优缺点的分析,提出了一种新型遗传算法。算法以最优保留策略的遗传算法作为主体流程,在主体流程过程中融入改进的模拟退火技术,即设置双阈值和保留中间最优解来减少计算量,加快算法的收敛速度,从而为求得全局最优解提供了保障。通过对F6函数仿真试验,新型遗传算法的收敛速度和跳出局部最优的能力有很大提高。Based on the analysis of the advantages and disadvantages of the Genetic Algorithm and Simulated Annealing Algorithm, a new Genetic Algorithm was proposed. The genetic algorithm with optimum reservation strategy was served as the main flow of the new algorithm which syncretized the mechanism of improved simulated annealing. In order to get the global optimum solution, the improved simulated annealing took the double threshold value and kept the middle optimum solution to reduce the computing capacity and enhanced the convergence speed. Through the simulation test of function, the result indicates that the new algorithm can improve the convergence speed and the ability of jumping out the local optimum solution greatly.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.224.72.117