%0 Journal Article
%T 基于博弈论的量子蚁群算法<br>Quantum ant colony algorithm based on the game theory
%A 王启明
%A 李战国
%A 樊爱宛&lt
%A br&gt
%A WANG Qiming
%A LI Zhanguo
%A FAN Aiwan
%J 山东大学学报（工学版）
%D 2015
%R 10.6040/j.issn.1672-3961.2.2014.045
%X 摘要： 针对量子蚁群算法求解组合优化问题时易陷入局部最优和收敛速度慢的问题,提出一种基于博弈论的量子蚁群算法(quantum ant colony algorithm based on the game theory, GQACA)。算法采用重复博弈模型,在重复博弈中产生一个博弈序列,使得每次博弈都能够产生最大效益,并得到相应博弈过程的纳什均衡。利用典型的5个标准测试函数对GQACA算法寻优性能进行试验测试。试验结果表明: GQACA算法的收敛精度和稳定性均要优于量子蚁群算法(quantum ant colony algorithm, QACA)和蚁群算法(ant colony algorithm, ACA)。<br>Abstract: Local optimum and low convergence rate were the main problems when used Quantum ant colony algorithm to solve combinatorial optimization, a quantum ant colony algorithm based on game theory (GQACA) was put forward. The algorithm generated a game sequence by the repeated game model, which made every game produce maximum benefit and get Nash equilibrium of the corresponding game process. Five typical test functions were used to make experiment test on the optimal performance of the GQACA algorithm.The experiments showed that the convergence precision and stability of the GQACA algorithm were superior to QACA algorithm and ACA algorithm
%K 函数优化
%K 量子蚁群算法
%K 纳什均衡
%K 博弈论
%K 组合优化
%K &lt
%K br&gt
%K the game theory
%K nash equilibrium
%K function optimization
%K combinatorial optimization
%K quantum ant colony algorithm
%U http://gxbwk.njournal.sdu.edu.cn/CN/10.6040/j.issn.1672-3961.2.2014.045