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 Beijing University of Technology

Quantum Ant Colony Algorithm for the Multi-task Coalition Problem

Chunnian Liu

Published Jan 1, 2013• 1 citation
OpenAlex

Abstract

With concentration on the defects of ant colony algorithm as not-high precision and much iteration existing in the algorithm of multi-task coalition problem(MTCP),this dissertation utilized the characteristics of quantum computation simultaneously processing substantial quanta in parallel to put forward quantum ant colony algorithm on MTCP.First,it utilized quantum superposition states to give quantum code based on Agent,making each Agent occupy 2 positions in the space;Second,in order for the rotation angle to obtain proper size and direction,it posed the self-adaptive and corrective rotation angle adjusting strategy on the basis of pheromone;Finally,it gave ant algorithm-seeking strategy based on the quantum states by monitoring on the quantum code.Substantial simulation experiments show that,compared with existing algorithms,this one can not only obtain better algorithm,but also improve the convergence speed prominently.

Related papers

Multi-Agent Q-learning based on quantum theory and ant colony algorithm

Wang Sheng-bin

Due to the interactions among the Agents in the cooperative multi-Agent systems,multi-Agent learning problem complexity can rise rapidly with the number of Agents or their behavioral sophistication.In order to converge to desirable equilibrium,Agents generally require sufficient exploration of strategy space and coordinate their policies to achieve optimal equilibrium.A novel cooperative multi-Agent learning method is proposed based on quantum theory,ant algorithm and Q-learning.First,this method not only coordinates Agents'behaviors using quantum entanglement and helps Agents make action selection under quantum superposition,but also adopts Grover's searching algorithm which can probe the action,speed up learn-ing.Second,according to ant algorithm,footmark thought is presented so that Agents can be indirectly enforced to communicate with others.At last,the theory analysis and result of experiment both demonstrate that the improved Q-learning is feasible and increases the learning efficiency.

Computer Engineering and Applications Journal•Jan 1, 2010•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

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

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 Max-min Ant Colony Algorithm For QoS Routing Problem

Yalong Li, Wang Wei, Sun Jing +1 more

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.

Journal of Physics Conference Series•Mar 1, 2021•1 citation

A Novel Quantum Ant Colony Optimizing Algorithm

Yang Jia, Xu Qiang, Jinrong Zhang +1 more

Aiming at the shortcoming of optimization problems in continuous space based on ant colony optimization which is easy to fall into local optimums and has a slow convergence rate,a novel quantum ant colony optimization algorithm is presented.In this algorithm,each ant position is represented by a group of quantum bits;a new quantum rotation gates are designed to update the position of the ant so as to enable the ant to move.Some quantum bits are mutated by quantum non-gate so as to increase the variety of ant positions.It not only proves the convergence of the proposed algorithms through theoretical analysis,but also demonstrates that the algorithm can double searching space,maintain better population diversity,rapider convergence speed and global optimal ability than the classical ant colony algorithm by simulation experiments.

Acta Scientiarum Naturalium Universitatis Sunyatseni•May 25, 2009•3 citations
With concentration on the defects of ant colony algorithm as not-high precision and much iteration existing in the algorithm of multi-task coalition problem(MTCP),this dissertation utilized the characteristics of quantum computation simultaneously processing substantial quanta in parallel to put forward quantum ant colony algorithm on MTCP.First,it utilized quantum superposition states to give quantum code based on Agent,making each Agent occupy 2 positions in the space;Second,in order for the rotation angle to obtain proper size and direction,it posed the self-adaptive and corrective rotation angle adjusting strategy on the basis of pheromone;Finally,it gave ant algorithm-seeking strategy based on the quantum states by monitoring on the quantum code.Substantial simulation experiments show that,compared with existing algorithms,this one can not only obtain better algorithm,but also improve the convergence speed prominently.
Due to the interactions among the Agents in the cooperative multi-Agent systems,multi-Agent learning problem complexity can rise rapidly with the number of Agents or their behavioral sophistication.In order to converge to desirable equilibrium,Agents generally require sufficient exploration of strategy space and coordinate their policies to achieve optimal equilibrium.A novel cooperative multi-Agent learning method is proposed based on quantum theory,ant algorithm and Q-learning.First,this method not only coordinates Agents'behaviors using quantum entanglement and helps Agents make action selection under quantum superposition,but also adopts Grover's searching algorithm which can probe the action,speed up learn-ing.Second,according to ant algorithm,footmark thought is presented so that Agents can be indirectly enforced to communicate with others.At last,the theory analysis and result of experiment both demonstrate that the improved Q-learning is feasible and increases the learning efficiency.
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 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.
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.
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.
Aiming at the shortcoming of optimization problems in continuous space based on ant colony optimization which is easy to fall into local optimums and has a slow convergence rate,a novel quantum ant colony optimization algorithm is presented.In this algorithm,each ant position is represented by a group of quantum bits;a new quantum rotation gates are designed to update the position of the ant so as to enable the ant to move.Some quantum bits are mutated by quantum non-gate so as to increase the variety of ant positions.It not only proves the convergence of the proposed algorithms through theoretical analysis,but also demonstrates that the algorithm can double searching space,maintain better population diversity,rapider convergence speed and global optimal ability than the classical ant colony algorithm by simulation experiments.