Quantum particle swarm optimization based on Bloch coordinates of qubits
To improve the efficiency of particle swarm optimization, a quantum particle swarm optimization algorithm is proposed on the basis of analyzing the search process of particle swarm optimization algorithm. In the proposed algorithm, particles are endoded by qubits described on the Bloch sphere, each particle occupy three locations of the search space, and each location represents a optimization solution. By employing the search method of general PSO to adjust the two parameters of qubit, the qubits rotation are performed on the Bloch sphere, which can simultaneously update three locations occupied by a qubit and quickly approach the global optimal solution. The experimental results of standard test function extreme optimization and fuzzy controller parameters optimization show that the proposed algorithm is superior to other similar algorithm in optimization ability and optimization efficiency.