Open AccessQuantum Max-min Ant Colony Algorithm For QoS Routing Problem
Author(s) -
Yalong Li,
Wei Wang,
Jizhong Sun,
Jie Wan
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1827/1/012163
Subject(s) - ant colony optimization algorithms , computer science , algorithm , path (computing) , mathematical optimization , convergence (economics) , quantum , coding (social sciences) , mathematics , computer network , statistics , physics , quantum mechanics , economics , economic growth
Aiming at the ant colony algorithm is weak to solve the problem of QoS routing, this paper proposes a routing algorithm that combines quantum computing with the max-min ant colony algorithm. The algorithm introduces a quantum selection strategy, uses qubit probability amplitude to encode the path, and dynamically adjusts the quantum rotation gate to update the path quantum coding on the basis of the minimum cost to meet the constraints and other optimal conditions, combined with the maximum and minimum pheromone determination mechanism to find the optimal path, effectively control the evolution speed and direction, and accelerate the algorithm convergence. Experimental results show that the algorithm is effective in controlling the speed and direction of evolution, and has better optimization ability and convergence performance than ant colony algorithm.