在分析量子算法的基本概念的基础上,提出了一种新的算法——量子蚂蚁算法。量子蚂蚁算法结合了量子计算中量子旋转门的量子信息和蚂蚁寻优的特点,为解决实际问题提供的一种新的优化方法。本文将量子蚂蚁算法应用于TSP问题的研究,通过选取国际通用的TSP实例库中多个实例进行测试,表明了新算法具有很好的精确度和鲁棒性,即使对于大规模问题,也能以很小的种群和不长的时间求得相对误差较小的满意解。
Quantum-inspired ant algorithm is a novel optimization method for solving real problems by using both the quantum information rules and the characteristics of ant colony optimization. This paper solves the classical TSP by quantum-inspired ant algorithm through series of typical instances. The computational results show the ef- fectiveness and robustness of the algorithm in numerical simulation. It can find the satisfactory solutions with small size population and tiny relative error, even for medium or larger problem instances.