Search performance analysis of qubit convergence measure for quantum-inspired evolutionary algorithm introducing on maximum cut problem
by Yoshifumi Moriyama; Ichiro Iimura; Shigeru Nakayama
International Journal of Computational Intelligence Studies (IJCISTUDIES), Vol. 7, No. 3/4, 2018

Abstract: The quantum-inspired evolutionary algorithm (QEA) and QEA with a pair-swap strategy (QEAPS), where each gene is represented by a quantum bit (qubit) and the qubit is updated by a unitary transformation in both algorithms. QEA and QEAPS can automatically shift the evolution from a global search to a local search and have shown superior search performance to the classical genetic algorithm. However, the population gets into a locally optimal solution and the solution search stagnates when the probability amplitudes of qubit excessively converge to |0⟩ or |1⟩. In this study, we have proposed a measure that can confirm convergence state of qubits. From the results of the computational experiment in the maximum cut problem, we have clarified that the proposed measure can estimate the state of the qubit, and the quality of the obtained solution is improved by applying the method for maintenance of diversity.

Online publication date: Tue, 13-Nov-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Intelligence Studies (IJCISTUDIES):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email