A novel quantum genetic algorithm based on particle swarm optimization method and its application

Tien Tzu Hsueh Pao/Acta Electronica Sinica

Volumn 34, Issue 5, 2006, Pages 897-901

  Zhou, Shu ^a   Pan, Wei ^a   Luo, Bin ^a   Zhang, Wei Li ^a   Ding, Ying ^a  

^a SOUTHWEST JIAOTONG UNIVERSITY   (China)

Author keywords

0 1 knapsack problem; Particle swarm optimization; Quantum computation; Quantum genetic algorithm; Sparse decomposition

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DECOMPOSITION; FUNCTIONS; IMAGE SEGMENTATION; OPTIMIZATION; QUANTUM THEORY; STABILITY;

0/1 KNAPSACK PROBLEMS; CONTINUOUS FUNCTIONS; IMAGE SPARSE DECOMPOSITION; PARTICLE SWARM OPTIMIZATION; QUANTUM BITS; QUANTUM COMPUTATION; QUANTUM GATES; QUANTUM GENETIC ALGORITHMS; VARIANCE FUNCTIONS;

GENETIC ALGORITHMS;

EID: 33746530650     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Narayanan A. An introductory tutorial to quantum computing [A]. Proceedings of IEE Colloquium on Quantum Computing: Theory, Applications and Implications [C]. London: IEE Press, 1997. 1/1-1/3.
2. Narayanan A, Moore M. Quantum inspired genetic algorithm [A]. Proceedings of the 1996 IEEE International Conference on Evolutionary Computation [C]. USA: IEEE Press, 1996. 61-66.
3. Guo Guangcan. Introduction to quantum information research [J]. Physics China, 2001, 30 (5): 1873-1878.
4. Michael A Nielsen, Isaac L Chuang. Quantum Computation and Quantum Information
5. Gexiang Zhang, Weidong Jin, Laizhao Hu. A novel parallel quantum genetic algorithm [A]. Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies [C]. Chengdu: IEEE Press, 2003. 693-697.
6. Han K H, Park K H, et al. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization [J]. IEEE Transactions on Evolutionary Computation, 2002, 6 (6): 580-593.
7. Xiong Yan, Chen Huan-huan, MIAO Fu-you, WANG Xing-fu. A quantum genetic algorithm to solve combinatorial optimization problem [J]. Acta Electronica Sinica, 2004, 32 (11): 1855-1858. (in Chinese)
8. Yang Jun-an, Zhuan Zhen-quan, SHI Liang. Multi-universe parallel quantum genetic algorithm [J]. Acta Electronica Sinica, 2004, 32 (6): 923-928. (in Chinese)
9. Jun-an Yang, Bin Li, Zhenquan Zhuang. Multiuniverse parallel quantum genetic algorithm its application to blind-source separation [A]. Proceedings of the 2003 International Conference on Neural Networks and Signal Processing [C]. Nanjing: IEEE Press, 2003. 393-398.
10. Han K H, Kim J H. Quantum-inspired evolutionary algorithms with a new termination criterion, gate, and two-phase scheme [J]. IEEE Transactions on Evolutionary Computation. 2004, 8 (2): 156-169.
11. Chen Hui, Zhang Jiashu, Zhang Chao, et al. Chaos updating roated gates quantum-inspired genetic algorithm [A]. 2004 International Conference on Communications, Circuits and Systems [C]. Chengdu: IEEE Press, 2004. 1108-1112.
12. Mallat S, Zhang Z. Matching pursuits with time-frequency dictionaries [J]. IEEE Transactions on Signal Processing, 1993, 12 (41): 3397-3415.
13. Bergeau F, Mallat S. Matching pursuit of images [A]. Proceedings of IEEE-SP [C], USA: Piladephia, 1994. 330-333.
14. Fykuyama Y. Fundamentals of particle swarm techniques [A]. Modern Heuristic Optimization Techniques with Application to Power Systems [C]. IEEE Power Engineering Society, 2002: 45-51.
15. Eberhart R, Kennedy J. A new optimizer using particle swarm theory [A]. Proceedings of the Sixth International Symposium on Micro Machine and Human Science [C]. Nagoya: IEEE Press, 1995. 39-43.
16. Shi Y, Eberhart R. A modified particle swarm optimizer [A]. IEEE World Congress on Computational Intelligence [C]. Alaska: IEEE Press, 1998. 69-73.
17. Vandergheynst P, Frossard P. Efficient image representation by anisotropic refinement in matching pursuit [A]. 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing [C]. Salt Lake City, USA, 2001. (3): 1757-1760.