杨淑云, 徐云霞, 李盼池. 基于Bloch球面搜索的量子鱼群算法[J]. 信息与控制, 2014, 43(6): 647-653. DOI: 10.13976/j.cnki.xk.2014.0647
引用本文: 杨淑云, 徐云霞, 李盼池. 基于Bloch球面搜索的量子鱼群算法[J]. 信息与控制, 2014, 43(6): 647-653. DOI: 10.13976/j.cnki.xk.2014.0647
YANG Shuyun, XU Yunxia, LI Panchi. Quantum-inspired Artificial Fish Swarm Algorithm Based on the Bloch Sphere Search Algorithm[J]. INFORMATION AND CONTROL, 2014, 43(6): 647-653. DOI: 10.13976/j.cnki.xk.2014.0647
Citation: YANG Shuyun, XU Yunxia, LI Panchi. Quantum-inspired Artificial Fish Swarm Algorithm Based on the Bloch Sphere Search Algorithm[J]. INFORMATION AND CONTROL, 2014, 43(6): 647-653. DOI: 10.13976/j.cnki.xk.2014.0647

基于Bloch球面搜索的量子鱼群算法

Quantum-inspired Artificial Fish Swarm Algorithm Based on the Bloch Sphere Search Algorithm

  • 摘要: 为提高智能优化算法的优化能力,提出一种在Bloch球面上建立搜索机制的新模型,将该模型与鱼群优化相融合,设计了一种量子衍生鱼群算法.在该算法中,鱼群采用基于Bloch球面描述的量子比特编码;采用向量积理论建立旋转轴,采用泡利矩阵建立旋转矩阵,采用量子比特在Bloch球面上的绕轴旋转实现鱼群的移动、跟踪、捕获、聚集;采用泡利矩阵实现量子比特测量,以获得量子比特的Bloch坐标;通过解空间变换可以获得优化问题的实际解.该方法的突出优点是能够同时调整量子比特的两个参数,并自动实现两个调整量的最佳匹配,从而可加速优化进程.实现结果表明,该方法的优化能力比普通鱼群算法具有明显提高.

     

    Abstract: To enhance the performance of the intelligent optimization algorithm, we propose a new model for performing asearch on a Bloch sphere. Then, by integrating this model into the artificial fish swarm optimization, we present a quantum-inspired artificial fish swarm optimization algorithm. In the proposed method, the fishes are encoded with qubits described on the Bloch sphere. Vector product theory is adopted to establish the rotation axis, and the Pauli matrices are used to construct the rotation matrices. The four fish behaviors, moving, tracking, capturing and aggregating, are achieved by rotating the current qubit about the rotation axis towards the target qubit on the Bloch sphere. The Bloch coordinates of the qubit can be obtained by measurment with the Pauli matrices, and the optimization solutions can be presented through the solution space transformation. The highlight advantages of this method are the ability to simultaneously adjust two parameters of a qubit and automatically achieve the best match between two adjustment quantities, which may accelerate the optimization process. The experiment results show that the proposed method obviously outperforms the classical one in convergence speed, and achieves better levels for some benchmark functions.

     

/

返回文章
返回