DocumentCode
2688612
Title
A versatile quantum-inspired evolutionary algorithm
Author
Platel, Michaël Defoin ; Schliebs, Stefan ; Kasabov, Nikola
Author_Institution
Auckland Univ. of Technol. (AUT), Auckland
fYear
2007
fDate
25-28 Sept. 2007
Firstpage
423
Lastpage
430
Abstract
This study points out some weaknesses of existing quantum-inspired evolutionary algorithms (QEA) and explains in particular how hitchhiking phenomena can slow down the discovery of optimal solutions and encourage premature convergence. A new algorithm, called versatile quantum- inspired evolutionary algorithm (vQEA), is proposed. With vQEA, the attractors moving the population through the search space are replaced at every generation without considering their fitness. The new algorithm is much more reactive. It always adapts the search toward the last promising solution found thus leading to a smoother and more efficient exploration. In this paper, vQEA is tested and compared to a classical genetic algorithm CGA and to a QEA on several benchmark problems. Experiments have shown that vQEA performs better than both CGA and QEA in terms of speed and accuracy. It is a highly scalable algorithm as well. Finally, the properties of the vQEA are discussed and compared to estimation of distribution algorithms (EDA).
Keywords
evolutionary computation; search problems; hitchhiking phenomenon; optimal solutions; premature convergence; search space; versatile quantum-inspired evolutionary algorithm; Analog computers; Benchmark testing; Electronic design automation and methodology; Evolutionary computation; Face detection; Genetic algorithms; Image registration; Optimization methods; Quantum computing; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location
Singapore
Print_ISBN
978-1-4244-1339-3
Electronic_ISBN
978-1-4244-1340-9
Type
conf
DOI
10.1109/CEC.2007.4424502
Filename
4424502
Link To Document