Title :
A new mutative scale chaos optimization Quantum Genetic Algorithm
Author :
Teng, Hao ; Yang, Bingru ; Zhao, Baohua
Author_Institution :
Sch. of Inf. Eng., Univ. of Sci. & Technol. Beijing, Beijing
Abstract :
Aiming at the trouble of easy getting into local minimum existed in quantum genetic algorithm, this paper presents a new chaos quantum genetic algorithm. This algorithm executes global search using the chaos movementpsilas ergodicity and randomness, and searches the local space of current optimal solutions using the prior knowledge in the process of search and combining the idea of gradient descent, thereby can improve the convergence speed. Adopting the ameliorated mutative scale chaos optimization method, chaotic search for the optimization is implemented to the population that is processed one time with the quantum genetic algorithm, which can lead to the rapid evolution of the population. The test of typical function shows that the performance of this method is better than quantum genetic algorithm and genetic algorithm.
Keywords :
chaos; genetic algorithms; gradient methods; quantum computing; search problems; ameliorated mutative scale chaos optimization; chaos quantum genetic algorithm; chaotic search; global search; gradient descent idea; mutative scale chaos optimization quantum genetic algorithm; optimal solutions; Chaos; Genetic algorithms; Testing; Chaos Optimization; Gradient Descent; Mutative Scale; Quantum Genetic Algorithm;
Conference_Titel :
Control and Decision Conference, 2008. CCDC 2008. Chinese
Conference_Location :
Yantai, Shandong
Print_ISBN :
978-1-4244-1733-9
Electronic_ISBN :
978-1-4244-1734-6
DOI :
10.1109/CCDC.2008.4597577