Improved quantum ant colony algorithm for solving TSP problem

摘要

For the low efficiency and poor performance of the ant colony algorithm in solving TSP problems, a new quantum ant colony algorithm proposed. The models of probability selection and pheromone are redefined, integrated with the quantum information intensity factor; The factor updated by quantum rotating gate according to iteration process; Some important parameters are self-adapted controlled at the same time; And 3-opt is used to further local optimization. Stimulation shows the performance is greatly improved.