An improved quantum genetic algorithm with mutation and its application to 0-1 knapsack problem
An improved quantum genetic algorithm (IQGA) is proposed in this paper, which codes the chromosome with probability amplitudes represented by sine and cosine functions, and uses an adaptive strategy of the rotation angle to update the population. Then the mutation operation is considered in this improved quantum genetic algorithm (IMIQGA). Rapid convergence and good global search capability characterize the performance of MIQGA. While testing, a variance function is introduced to estimate the stability of the algorithm. When solving 0-1 knapsack problem, greedy repair function is used to repair unfeasible solutions. Experimental results show MIQGA has better comprehensive performance than traditional genetic algorithm (GA), standard quantum genetic algorithm (QGA) and IQGA, especially the superiority in terms of optimization quality and population diversity.
improved quantum genetic algorithm with mutation adaptive quantum rotation angle 0-1 knapsack problem greedy repair function
Rui Wang Ning Guo Fenghong Xiang Jianlin Mao
Oxbridge College Kunming University of Science and Technology Kunming, China Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunmi
国际会议
2012 International Conference on Measurement,Information and Control(2012测量、信息与控制国际会议 ICMIC2012)
哈尔滨
英文
484-488
2012-05-18(万方平台首次上网日期,不代表论文的发表时间)