Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Natural computing series

Quantum Inspired Evolutionary Algorithms

Anthony Brabazon, Michael O’Neill, Seán McGarraghy

Published Jan 1, 2015• 0 citations
Publisher
DOI
10.1007/978-3-662-43631-8_24

Related papers

Quantum-inspired evolutionary algorithms: a survey and empirical study

Gexiang Zhang

Journal of Heuristics•Jun 28, 2010•297 citations

A Comprehensive Learning Quantum-Inspired Evolutionary Algorithm

Yanhui Qin, Gexiang Zhang, Yuquan Li +1 more

Communications in computer and information science•Jan 1, 2012•8 citations

Quantum-Inspired Evolutionary Algorithms and Its Application to Numerical Optimization Problems

André Vargas Abs da Cruz, Carlos Roberto Hall Barbosa, Marco Aurélio C. Pacheco +1 more

Lecture notes in computer science•Jan 1, 2004•26 citations

A Quantum-Inspired Evolutionary Algorithm for Optimization Numerical Problems

Maurizio Fiasché

Lecture notes in computer science•Jan 1, 2012•21 citations

Effect of Population Structures on Quantum-Inspired Evolutionary Algorithm

Nija Mani, G.P. Srivastava, A. K. Sinha +1 more

Quantum-inspired evolutionary algorithm (QEA) has been designed by integrating some quantum mechanical principles in the framework of evolutionary algorithms. They have been successfully employed as a computational technique in solving difficult optimization problems. It is well known that QEAs provide better balance between exploration and exploitation as compared to the conventional evolutionary algorithms. The population in QEA is evolved by variation operators, which move the Q-bit towards an attractor. A modification for improving the performance of QEA was proposed by changing the selection of attractors, namely, versatile QEA. The improvement attained by versatile QEA over QEA indicates the impact of population structure on the performance of QEA and motivates further investigation into employing fine-grained model. The QEA with fine-grained population model (FQEA) is similar to QEA with the exception that every individual is located in a unique position on a two-dimensional toroidal grid and has four neighbors amongst which it selects its attractor. Further, FQEA does not use migrations, which is employed by QEAs. This paper empirically investigates the effect of the three different population structures on the performance of QEA by solving well-known discrete benchmark optimization problems.

Applied Computational Intelligence and Soft Computing•Jan 1, 2014•6 citations

Towards the right amount of randomness in quantum-inspired evolutionary algorithms

C. Patvardhan, Sulabh Bansal, Anand Srivastav

Soft Computing•Oct 1, 2015•1 citation
Quantum-inspired evolutionary algorithm (QEA) has been designed by integrating some quantum mechanical principles in the framework of evolutionary algorithms. They have been successfully employed as a computational technique in solving difficult optimization problems. It is well known that QEAs provide better balance between exploration and exploitation as compared to the conventional evolutionary algorithms. The population in QEA is evolved by variation operators, which move the Q-bit towards an attractor. A modification for improving the performance of QEA was proposed by changing the selection of attractors, namely, versatile QEA. The improvement attained by versatile QEA over QEA indicates the impact of population structure on the performance of QEA and motivates further investigation into employing fine-grained model. The QEA with fine-grained population model (FQEA) is similar to QEA with the exception that every individual is located in a unique position on a two-dimensional toroidal grid and has four neighbors amongst which it selects its attractor. Further, FQEA does not use migrations, which is employed by QEAs. This paper empirically investigates the effect of the three different population structures on the performance of QEA by solving well-known discrete benchmark optimization problems.