Performance Analysis of Quantum-Inspired Evolutionary Algorithm | Zendy

Tomohisa Takata | Zendy; Teijiro Isokawa | Zendy; Nobuyuki Matsui | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Performance Analysis of Quantum-Inspired Evolutionary Algorithm

Author(s) -

Tomohisa Takata,

Teijiro Isokawa,

Nobuyuki Matsui

Publication year - 2011

Publication title -

journal of advanced computational intelligence and intelligent informatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.172

H-Index - 20

eISSN - 1343-0130

pISSN - 1883-8014

DOI - 10.20965/jaciii.2011.p1095

Subject(s) - evolutionary algorithm , knapsack problem , computer science , qubit , robustness (evolution) , algorithm , quantum , quantum computer , benchmark (surveying) , population , mathematical optimization , mathematics , artificial intelligence , physics , quantum mechanics , biochemistry , chemistry , demography , geodesy , sociology , gene , geography

Quantum-Inspired Evolutionary Algorithm (QEA) is an extension of evolutionary algorithm in which quantum mechanics and its representations are introduced. A chromosome in QEA is represented as a series of qubits (quantum bits), and phase-rotation gates are embedded into the selection process over generations. This algorithm has been shown to have better performances than the classical ones in small benchmark problems, but this has not yet been applied to larger scale problems. We show the performances of this QEA by solving the Knapsack problem, maximum search problem, and construction of image filter. We also investigate the diversity of individuals in a population in order to estimate the robustness against environmental changes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research