摘要
为解决遗传算法的早熟和局部收敛现象,提出的一种改进的遗传算法,该算法引入海明距离构造初始种群,在选择、交叉、变异过程中采用最优保存策略。实验表明改进的遗传算法增强了种群的多样性,并在一定程度上避免早熟现象发生,同时又能较快找到全局最优解。
In this paper,an improved genetic algorithm is proposed to solve the problems of prematurity and local convergence.The Hamming distance is employed to generate the original population,and the elitist preserved strategy is used in the process of the selection,crossover,and mutation.Experiments show that the improved genetic algorithm is efficient.
出处
《丽水学院学报》
2010年第5期38-41,共4页
Journal of Lishui University
基金
闽江学院科技育苗基金项目(YKY08004B)
关键词
遗传算法
多样性
最优保存策略
背包问题
genetic algorithm
diversity
elitist preserved strategy
knapsack problem
