Abstract
An improved quantum genetic algorithm (IQGA) is proposed in this paper. In IQGA, the strategies of updating quantum gate by using the best solution and introducing population catastrope are used. The typical function tests show convergent speed of IQGA is faster than that of quantum genetic algorithm(QGA) and other several GAs, and IQGA can also make up for prematureness of QGA. The simulations of FIR filter design demonstrate IQGA is superior to QGA, the methods in reference [5] and traditional method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tony Hey, Quantum Computing: an introduction[J], Computing & Control Engineering Journal, June 1999, pp105–112
A. Narayanan & M. Moore, Quantum-inspired genetic algorithm, Proceedings of IEEE International Conference on Evolutionary Computation, 1999, 61–66
K. H. Han, K. H. Park, C. H. Lee & J. H. Kim, Parallel quantum-inspired genetic algorithm for combinatorial optimization problems, Proceedings of IEEE International Conference on Evolutionary Computation, 2001, 1442–1429
Tu Chengyuan, Tu Chengyu, A new genetic algorithm converging to the globally-optimal solution [J], Information and Control, 2001, 30(2): pp116–138
Cheng **, Yu Shenglin, FIR filter design: frequency sampling technique based on genetic algorithm [J], Journal of Nan**g University of Aeronautics & Astronautics, 2000, 32(3): pp276–281
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, G., **, W., Li, N. (2003). An Improved Quantum Genetic Algorithm and Its Application. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2003. Lecture Notes in Computer Science(), vol 2639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39205-X_75
Download citation
DOI: https://doi.org/10.1007/3-540-39205-X_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-14040-5
Online ISBN: 978-3-540-39205-7
eBook Packages: Springer Book Archive