Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Physics Conference Series

Quantum Max-min Ant Colony Algorithm For QoS Routing Problem

Yalong Li, Wang Wei, Sun Jing, Wan Jie

Published Mar 1, 2021• 1 citation
Publisher

Abstract

Abstract 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.

DOI
10.1088/1742-6596/1827/1/012163

Related papers

A Quantum MMAS Based Algorithm for Multicast Routing Problem

Yalong Li, Wei Wang, Sun Jing +1 more

Abstract For solving the problem of multicast routing, ant colony algorithm (ACO) has insufficient optimization ability. The paper proposes a routing algorithm which combines quantum computing and max min ACO. The algorithm uses quantum bit probability amplitude to encode the link, and dynamically adjusts quantum revolving gate to update the quantum coding on the link, so as to meet the cost optimization under constraint conditions, combined with the maximum and minimum pheromone decision mechanism to find the optimal link path, effectively control the evolution speed and direction, and enhance the convergence performance of the algorithm. The simulation results show that the algorithm can effectively control the evolution speed and direction, and is better than ant colony algorithm in the optimization ability and convergence performance.

Journal of Physics Conference Series•May 1, 2021•0 citations

Novel quantum ant colony algorithm for TSP

Fuxiao Tan

Ant Colony Algorithm(ACA) demonstrates the superiority in solving TSP,and Quantum Evolution Algorithm (QEA) has the performance of high efficiency on combinational optimization problems,so combining the thought of ACA with QEA,a novel quantum ant colony algorithm for TSP is proposed.In this algorithm,the pheromone on each path is encoded by a group of quantum bits,and a new pheromone representation is designed,called quantum pheromone.The quantum rotation gate and the best tour are applied to update the pheromone so as to accelerate its convergence speed.To avoid the search falling into local optimum,the strategy of quantum crossover is designed to improve the information structure of population.Simulation results show that the algorithm has fast convergence speed and global optimal ability,and the algorithm is more effective than ACS.

Computer Engineering and Applications Journal•Jan 1, 2011•1 citation

Hybrid Quantum Ant Colony Algorithm for Traveling Salesman Problem

Jia Rui-y

Aiming at the Traveling Salesman Problem based on ant colony optimization which is easy to fall into local optimums and has a slow convergence rate,a hybrid quantum ant colony optimization algorithm is presented.In this algorithm,the pheromone on each path is encoded by a group of quantum bits,the quantum rotation gate and ant's tour are used to update the pheromone so as to accelerate its convergence speed.To avoid the search falling into local optimum,the new neighborhood exchange strategy is designed to improve solution efficiency.Some cases from the TSP library(TSPLIB)are used to experiment,the results show that the algorithm has rapider convergence speed and higher accuracy than the classical ant colony algorithm.

Computer Engineering and Applications Journal•Jan 1, 2013•0 citations

Quantum ant colony optimization with application

Panchi Li, Kaoping Song, Erlong Yang

Aiming at the shortcoming of ant colony optimization of being only suitable for discrete problems and holding a slow convergence speed, a novel algorithm for continuous optimization problems is presented. In this algorithm, each ant carries a group of qubits which represents the position of its own. First, the destination to which ant want to move is selected according to the select probability based on pheromone information and heuristic information. Then, the ant's own qubits are updated by quantum rotation gates so as to move. Some ants' qubits are mutated by quantum non-gate so as to increase the diversity of positions. Finally, both information of the pheromone and the heuristic are updated according to the new position of each ant. In this algorithm, both probability amplitudes of a qubit are regarded as position information, a double searching efficiency is acquired for ant colony which hold the fixed number of ants. The availability of the proposed algorithm is illustrated by simulation examples of function extremum optimization.

International Conference on Natural Computation (ICNC)•Aug 1, 2010•12 citations

Quantum ant colony algorithm for optimization of logistics distribution route

Shen Pen

The logistics distribution route problem is a NP problem which possesses important practical value. A novel optimization method of logistics distribution route is proposed based on Quantum Ant Colony Algorithm(QACA)to overcome the problems such as long computing time and easy to fall into local best for traditional heuristic optimization algorithm. The optimization problem of logistics distribution routing is analyzed, and the mathematical model is established, and then the quantum ant colony algorithm is used to solve it, and the pheromone on each path is encoded by a group of quantum bits,and a new pheromone representation is designed,called quantum pheromone, and the quantum rotation gate and the best tour are applied to updating the pheromone. The simulation test is carried out to test the performance of QACA. The simulation results show that, QACA has a strong global search ability and convergence speed, and can effectively solve the logistics distribution routing problem.

Computer Engineering and Applications Journal•Jan 1, 2013•1 citation

Phase encoded-based quantum ant colony algorithm with application to continuous optimization

LI Pan-chia

Aiming at the shortcoming of ant colony optimization which was only suitable for the discrete optimization and the problem of slow convergence,this paper proposed a suitable quantum ant colony optimization algorithm for continuous optimization. The locations of ant were directly encoded by the phase of qubits in the proposed algorithm. First,determined the destination to move according to the select probability constructed by the pheromone information and heuristic information,and then updated the qubits of ant by quantum rotation gates to achieve ant moving,and mutated by quantum Pauli-Z gates to increase diversity of ants. Finally,updated the pheromone information and the heuristic information in the new location of ants. As performed the optimization in [0,2π]n ,which had nothing to do with the specific issues,hence,the proposed method had good adaptability for a variety of optimization problems. With applications of function extremum and controller parameters optimization,the simulation results show that the proposed algorithm is superior to the continuous quantum ant colony algorithm and the standard genetic algorithm in both search capability and optimization efficiency.

Jisuanji yingyong yanjiu•Jan 1, 2010•1 citation
Abstract 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.
Abstract For solving the problem of multicast routing, ant colony algorithm (ACO) has insufficient optimization ability. The paper proposes a routing algorithm which combines quantum computing and max min ACO. The algorithm uses quantum bit probability amplitude to encode the link, and dynamically adjusts quantum revolving gate to update the quantum coding on the link, so as to meet the cost optimization under constraint conditions, combined with the maximum and minimum pheromone decision mechanism to find the optimal link path, effectively control the evolution speed and direction, and enhance the convergence performance of the algorithm. The simulation results show that the algorithm can effectively control the evolution speed and direction, and is better than ant colony algorithm in the optimization ability and convergence performance.
Ant Colony Algorithm(ACA) demonstrates the superiority in solving TSP,and Quantum Evolution Algorithm (QEA) has the performance of high efficiency on combinational optimization problems,so combining the thought of ACA with QEA,a novel quantum ant colony algorithm for TSP is proposed.In this algorithm,the pheromone on each path is encoded by a group of quantum bits,and a new pheromone representation is designed,called quantum pheromone.The quantum rotation gate and the best tour are applied to update the pheromone so as to accelerate its convergence speed.To avoid the search falling into local optimum,the strategy of quantum crossover is designed to improve the information structure of population.Simulation results show that the algorithm has fast convergence speed and global optimal ability,and the algorithm is more effective than ACS.
Aiming at the Traveling Salesman Problem based on ant colony optimization which is easy to fall into local optimums and has a slow convergence rate,a hybrid quantum ant colony optimization algorithm is presented.In this algorithm,the pheromone on each path is encoded by a group of quantum bits,the quantum rotation gate and ant's tour are used to update the pheromone so as to accelerate its convergence speed.To avoid the search falling into local optimum,the new neighborhood exchange strategy is designed to improve solution efficiency.Some cases from the TSP library(TSPLIB)are used to experiment,the results show that the algorithm has rapider convergence speed and higher accuracy than the classical ant colony algorithm.
Aiming at the shortcoming of ant colony optimization of being only suitable for discrete problems and holding a slow convergence speed, a novel algorithm for continuous optimization problems is presented. In this algorithm, each ant carries a group of qubits which represents the position of its own. First, the destination to which ant want to move is selected according to the select probability based on pheromone information and heuristic information. Then, the ant's own qubits are updated by quantum rotation gates so as to move. Some ants' qubits are mutated by quantum non-gate so as to increase the diversity of positions. Finally, both information of the pheromone and the heuristic are updated according to the new position of each ant. In this algorithm, both probability amplitudes of a qubit are regarded as position information, a double searching efficiency is acquired for ant colony which hold the fixed number of ants. The availability of the proposed algorithm is illustrated by simulation examples of function extremum optimization.
The logistics distribution route problem is a NP problem which possesses important practical value. A novel optimization method of logistics distribution route is proposed based on Quantum Ant Colony Algorithm(QACA)to overcome the problems such as long computing time and easy to fall into local best for traditional heuristic optimization algorithm. The optimization problem of logistics distribution routing is analyzed, and the mathematical model is established, and then the quantum ant colony algorithm is used to solve it, and the pheromone on each path is encoded by a group of quantum bits,and a new pheromone representation is designed,called quantum pheromone, and the quantum rotation gate and the best tour are applied to updating the pheromone. The simulation test is carried out to test the performance of QACA. The simulation results show that, QACA has a strong global search ability and convergence speed, and can effectively solve the logistics distribution routing problem.
Aiming at the shortcoming of ant colony optimization which was only suitable for the discrete optimization and the problem of slow convergence,this paper proposed a suitable quantum ant colony optimization algorithm for continuous optimization. The locations of ant were directly encoded by the phase of qubits in the proposed algorithm. First,determined the destination to move according to the select probability constructed by the pheromone information and heuristic information,and then updated the qubits of ant by quantum rotation gates to achieve ant moving,and mutated by quantum Pauli-Z gates to increase diversity of ants. Finally,updated the pheromone information and the heuristic information in the new location of ants. As performed the optimization in [0,2π]n ,which had nothing to do with the specific issues,hence,the proposed method had good adaptability for a variety of optimization problems. With applications of function extremum and controller parameters optimization,the simulation results show that the proposed algorithm is superior to the continuous quantum ant colony algorithm and the standard genetic algorithm in both search capability and optimization efficiency.