Abstract

In this paper, an advanced quantum-inspired evolutionary optimization algorithm (A-QEOA) is proposed. This algorithm is based on the principle of quantum computing such as quantum bit representation and superposition of states. Like other evolutionary algorithms, the quantum-inspired evolutionary algorithm has characteristics of exploration and exploitation. The quantum-inspired evolutionary algorithm achieves exploration using observation process and exploitation using quantum rotation gate. Exploration helps to find the search space for a parameter that needs to be optimized. However, the observation process needs a random number which may sometimes increase the number of iterations to converge the algorithm or may lead to premature convergence. In this paper, we propose an algorithm with an updated observation process that helps to converge the algorithm optimally and helps to get results faster in comparison to the existing quantum inspired evolutionary algorithm (QEA).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call