Abstract | ||
---|---|---|
Quantum-Inspired Evolutionary Algorithm (QEA), a type of stochastic algorithm for solving combinatorial optimization problems, is evolutionary computation using quantum bits and superposition states in quantum computation. Although coarse-grained parallel, QEA has many parameters that must be adjusted manually. The simpler algorithm, Quantum-inspired Evolutionary Computation with Pair Swap operator (QEAPS), the authors propose involves just one population and a simple genetic operation exchanging best solution information between two individuals chosen randomly, instead of the migration operation used in QEA, and thereby fewer parameters to be adjusted. The authors found in experiments that QEAPS finds highly qualified solutions, is more robust against constraint handling, and has a higher search performance of thanks to diversified best solution information. |
Year | DOI | Venue |
---|---|---|
2009 | 10.20965/jaciii.2009.p0097 | JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS |
Keywords | Field | DocType |
quantum-inspired evolutionary algorithm, pair swap, migration, 0-1 knapsack problem | Quantum,Evolutionary algorithm,Computer science,Artificial intelligence,Evolutionary programming,Swap (finance),Machine learning | Journal |
Volume | Issue | ISSN |
13 | 2 | 1343-0130 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Takahiro Imabeppu | 1 | 3 | 0.72 |
Shigeru Nakayama | 2 | 75 | 16.14 |
Satoshi Ono | 3 | 219 | 39.83 |