摘要
借鉴蚁群算法的进化思想,提出一种求解连续空间优化问题的量子蚂蚁算法。该算法主要包括全局搜索、局部搜索和信息素强度更新规则。在全局搜索过程中,利用信息素强度和启发式函数确定蚂蚁移动方向。在局部搜索过程中,提出了基于Delta势阱的量子搜索,以改善寻优性能,加快收敛速率。通过实例验证表明了该算法的有效性。
This paper proposes a novel algorithm-Quantum-inspired ant algorithm (QAA) for function optimization. It is based on the basic ant algorithm. It contents the global search, local search and the pheromone update. During global search, ants change their search routes by pheromone and the heuristic function. And it will search the best solution by quantum walk which is based on the Delta potential well, during the local search. It will improve the search capability of the algorithm for the best solution and make the convergence quickly. Simulation results show the convergence performance and validity of QAA.
出处
《系统管理学报》
北大核心
2009年第1期96-99,共4页
Journal of Systems & Management
基金
国家自然科学基金资助项目(70871081)
上海市重点学科建设资助项目(S30504)
上海市研究生创新基金资助项目(JWCXSL0802)
关键词
量子蚂蚁算法
蚂蚁算法
量子信息
函数优化
quantum-inspired ant algorithm (OAA)
ant algorithm
quantum information
function optimization