Quantum-inspired evolutionary algorithms with a new termination criterion, Hε gate, and two-phase scheme

被引:337
作者
Han, KH [1 ]
Kim, JH
机构
[1] Samsung Elect Co Ltd, Digital Media R&D Ctr, Suwon 443742, South Korea
[2] Korea Adv Inst Sci & Technol, Dept Elect Engn & Comp Sci, Taejon 305701, South Korea
关键词
initial condition; numerical and combinatorial optimization; Q-bit representation; Q-gate; quantum-inspired evolutionary algorithm (QEA); termination criterion;
D O I
10.1109/TEVC.2004.823467
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
From recent research on combinatorial optimization of the knapsack problem, quantum-inspired evolutionary algorithm (QEA) was proved to be better than conventional genetic algorithms. To improve the performance of the QEA, this paper proposes research issues on QEA such as a termination criterion, a Q-gate, and a two-phase scheme, for a class of numerical and combinatorial optimization problems. A new termination criterion is proposed which gives a clearer meaning on the convergence of Q-bit individuals. A novel variation operator HE gate, which is a modified version of the rotation gate, is proposed along with a two-phase QEA scheme based on the analysis of the effect of changing the initial conditions of Q-bits of the Q-bit individual in the first phase. To demonstrate the effectiveness and applicability of the updated QEA; several experiments are carried out on a class of numerical and combinatorial optimization problems. The results show that the updated QEA. makes' QEA more powerful than the previous QEA in terms of convergence speed, fitness, and robustness.
引用
收藏
页码:156 / 169
页数:14
相关论文
共 30 条
[1]  
[Anonymous], 1998, DOCUMENTA MATH
[2]  
Back T., 1996, Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms
[3]   THE COMPUTER AS A PHYSICAL SYSTEM - A MICROSCOPIC QUANTUM-MECHANICAL HAMILTONIAN MODEL OF COMPUTERS AS REPRESENTED BY TURING-MACHINES [J].
BENIOFF, P .
JOURNAL OF STATISTICAL PHYSICS, 1980, 22 (05) :563-591
[4]   RAPID SOLUTION OF PROBLEMS BY QUANTUM COMPUTATION [J].
DEUTSCH, D ;
JOZSA, R .
PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1992, 439 (1907) :553-558
[5]   QUANTUM COMPUTATIONAL NETWORKS [J].
DEUTSCH, D .
PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1989, 425 (1868) :73-90
[6]   QUANTUM-THEORY, THE CHURCH-TURING PRINCIPLE AND THE UNIVERSAL QUANTUM COMPUTER [J].
DEUTSCH, D .
PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1985, 400 (1818) :97-117
[7]   SIMULATING PHYSICS WITH COMPUTERS [J].
FEYNMAN, RP .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1982, 21 (6-7) :467-488
[8]  
Fogel D., 2000, EVOLUTIONARY COMPUTA
[9]  
Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness
[10]  
Greenwood GW, 2001, IEEE C EVOL COMPUTAT, P815, DOI 10.1109/CEC.2001.934274