Evolutionary algorithm with 2-crossovers

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

Abstract

Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the principles of evaluation of living organisms in nature. QEA has strong robustness and easy to combine with other methods in optimization, but it has the shortcomings of stagnation that limits the wide application to the various areas. In this paper, a hybrid QEA with 2-crossovers was proposed to overcome the above-mentioned limitations. Considering the importance of randomization, 2-crossovers were applied to improve the convergence quality in the basic QEA model. In this way, the new-born individual after each updating can to help the population jump out of premature convergence. The proposed algorithm is tested with the Benchmark optimization problem, and the experimental results demonstrate that the proposed QEA is a feasible and effective in solving complex optimization problems. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Xing, Z., Duan, H., & Xu, C. (2009). Evolutionary algorithm with 2-crossovers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5551 LNCS, pp. 735–744). https://doi.org/10.1007/978-3-642-01507-6_83

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