Quantum ant colony algorithm based on Bloch coordinates

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

Abstract

Given classic Ant Colony Algorithm only resolves the optimization problem of discrete system, this paper proposed a Quantum Ant Colony Algorithm (QACA) based on the Bloch spherical coordinate by combining Quantum Evolutionary Algorithm and Ant Colony Algorithm. This algorithm applies Bloch spherical coordinate of Qubits to represent the current position information of ants; a new quantum revolving door is designed for updating the position to achieve to watch ants' movement. Quantum doors help to realize the variation of ants' positions, increase the diversity. For different optimization problems, various solution space transformational models and fitness functions are planned, so as to optimally solve the target. Furthermore, simulations of function extreme value and TSP problems were conducted, which indicted that the algorithm is feasible and effective. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Chen, X., Xia, X., & Yu, R. (2012). Quantum ant colony algorithm based on Bloch coordinates. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7473 LNCS, pp. 405–412). https://doi.org/10.1007/978-3-642-34062-8_53

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