Abstract
The quantum-inspired evolutionary algorithm (QEA) is a probabilistic algorithm based on the principles of quantum computing such as concepts of qubits and superposition of states. QEA with the qubit representation has better convergence and global search capability than the conventional evolutionary algorithm. However, the operations in QEA lack the capability of meeting an actual situation, so that some torpidity appears when solving problems. This paper introduces immune concepts and methods into QEA, and presents a novel algorithm - the immune quantum evolutionary algorithm (IQEA) - which constructs an immune operator accomplished by vaccination and immune selection. In addition to preserving QEA's advantages, IQEA also utilizes some characteristics and knowledge in the pending problems for restraining the repeat and ineffective operations during evolution, so as to improve the algorithm efficiency. The experimental results of the knapsack problem show that the performance of IQEA is superior to the conventional evolutionary algorithm, the immune evolutionary algorithm and QEA.
Original language | English |
---|---|
Pages (from-to) | 543-547 |
Number of pages | 5 |
Journal | Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University |
Volume | 23 |
Issue number | 4 |
State | Published - Aug 2005 |
Keywords
- Evolutionary algorithm
- Immune operator
- Knapsack problem
- Quantum-inspired evolutionary algorithm