Name
Abstract | ||
|---|---|---|
A quantum-inspired evolutionary algorithm (QEA) is proposed as a stochastic algorithm to perform combinatorial optimization
problems. The QEA is evolutionary computation that uses quantum bits and superposition states in quantum computation. Although
the QEA is a coarse-grained parallel algorithm, it involves many parameters that must be adjusted manually. This paper proposes
a new method, named pair swap, which exchanges each best solution information between two individuals instead of migration
in the QEA. Experimental results show that our proposed method is a simpler algorithm and can find a high quality solution
in the 0-1 knapsack problem. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10015-007-0457-5 | Artificial Life and Robotics |
Keywords | DocType | Volume |
evolutionary computation · quantum comput- ing · quantum bit · pair swap · knapsack problem,knapsack problem,parallel algorithm,evolutionary computing,quantum computer | Journal | 12 |
Issue | ISSN | Citations |
1 | 1614-7456 | 3 |
PageRank | References | Authors |
0.38 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takahiro Imabeppu | 1 | 3 | 0.72 |
| Shigeru Nakayama | 2 | 75 | 16.14 |
| Satoshi Ono | 3 | 219 | 39.83 |