Quantum-inspired evolutionary algorithm: a multimodel EDA

  • Authors:

  • Michaël Defoin Platel;Stefan Schliebs;Nikola Kasabov

  • Affiliations:

  • Knowledge Engineering and Research Institute, Auckland University of Technology, Auckland, New Zealand;Knowledge Engineering and Research Institute, Auckland University of Technology, Auckland, New Zealand;Knowledge Engineering and Research Institute, Auckland University of Technology, Auckland, New Zealand

  • Venue:
  • IEEE Transactions on Evolutionary Computation - Special issue on evolutionary algorithms based on probabilistic models
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The quantum-inspired evolutionary algorithm (QEA) applies several quantum computing principles to solve optimization problems. In QEA, a population of probabilistic models of promising solutions is used to guide further exploration of the search space. This paper clearly establishes that QEA is an original algorithm that belongs to the class of estimation of distribution algorithms (EDAs), while the common points and specifics of QEA compared to other EDAs are highlighted. The behavior of a versatile QEA relatively to three classical EDAs is extensively studied and comparatively good results are reported in terms of loss of diversity, scalability, solution quality, and robustness to fitness noise. To better understand QEA, two main advantages of the multimodel approach are analyzed in details. First, it is shown that QEA can dynamically adapt the learning speed leading to a smooth and robust convergence behavior. Second, we demonstrate that QEA manipulates more complex distributions of solutions than with a single model approach leading to more efficient optimization of problems with interacting variables.