.png){kind=icon}
返回
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2002.804320.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes it novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and super-position of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, the evaluation function, and the population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Q-bit, defined as the smallest unit of information, for the probabilistic representation and a Q-bit individual as a string of Q-bits. A Q-gate is introduced as a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, experiments are carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm.
Keyword:
evolutionary algorithm
knapsack problem
probabilistic representation
quantum computing
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
暂无机构信息
引用论文
分享收藏New eddy-current sensor setup for high-resolution lithium-ion cell dilation measurements用于高分辨率锂离子电池膨胀测量的新型涡流传感器设置.png)
OAAI
IF0
OAAI分享收藏Synthesis and structural characterisation of the dimeric tetraimido complex [Mo(N-o-toly)(η2-S2CNEt2)(μ-N-o-tolyl)]2Polyhedron
PolyhedronIF0
PREAI
分享收藏
查看更多内容