摘要
根据组合优化问题的特点,提出了一种求解组合优化问题的改进型量子进化算法。借鉴小生境协同进化思想初始化种群,增加了个体多样性;采用动态策略调整量子门旋转角,加快了收敛速度;采用"优体交叉"策略实施染色体交叉操作,增强了局部搜索能力。利用典型组合优化问题——2个多维0/1背包问题实例对算法性能进行验证,结果表明了该算法的可行性和有效性。
According to the characteristics of combinatorial optimization problems,a novel improved quantum evolutionary algorithm for combinatorial optimization problems（NIQEA） is proposed.The NIQEA initializes population based on the idea of niche cooperative evolutionary,increasing the diversity of individuals,and adopts the dynamic adjustment strategy to adjust the quantum rotation corner,speeding up convergence rate,and uses the cross strategy of excellent individuals to get crossover operation,enhancing local search ability.To validate its performance,the NIQEA is applied to solve the typical combinatorial optimization problems： two examples of multidimensional 0/1 knapsack problem,and the results show that the NIQEA is feasible and effective.
出处
《计算机工程与设计》
CSCD
北大核心
2010年第17期3891-3894,共4页
Computer Engineering and Design
基金
浙江省教育厅科研基金项目(Y200909706)
关键词
量子进化算法
改进型量子遗传算法
改进型量子进化算法
组合优化问题
多维0/1背包问题
quantum evolutionary algorithm
novel improved quantum genetic algorithm
novel improved quantum evolutionary algorithm
combinatorial optimization problem
multidimensional 0/1 knapsack problem
