Quantum cooperative immune algorithm for SAT problems
Licheng Jiao · Systems engineering and electronics · 2009
A quantum cooperative immune algorithm for SAT problems is proposed,which is based on the synergism strategy and the principles of quantum-inspired immune computing.Based on converting the SAT problems into global problems,many subpopulations are adopted.Individuals in a population are represented by quantum bits(qubits).In the individual's updating,the quantum rotation gate strategy and adjusting rotation angle mechanism are applied to accelerate convergence.By using the cooperative strategy,information among the subpopulation is exchanged and the diversity of population is improved.In experiments,3 700 different benchmark SAT problems in SATLIB are used to test the performance of the quantum cooperative immune algorithm,moreover,the performance of QCIA is compared with the standard immune clonal selection algorithm(ICSA),quantum genetic algorithm and quantum glonal selection algorithm.All experimental results show that the success ratio of QCIA is the highest and that the run time and number of function evaluations are the least among the three algorithms.