Genetic algorithm based-on the quantum probability representation

27Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A genetic algorithm based on the quantum probability representation (GAQPR) is proposed, in which each individual evolves independently; a new crossover operator is designed to integrate searching processes of multiple individuals into a more efficient global searching process; a new mutation operator is also proposed and analyzed. Optimization capability of GAQPR is studied via experiments on function optimization, results of experiments show that, for multi-peak optimization problem, GAQPR is more efficient than GQA[4].

Cite

CITATION STYLE

APA

Li, B., & Zhuang, Z. Q. (2002). Genetic algorithm based-on the quantum probability representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2412, pp. 500–505). Springer Verlag. https://doi.org/10.1007/3-540-45675-9_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free