Novel improved quantum evolutionary algorithm for combinatorial optimization problems
Zhang Zong-fei · Jisuanji gongcheng yu sheji · 2010
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.