A novel quantum algorithm for ant colony optimisation
Ant colony optimisation (ACO) is a commonly used meta-heuristic to solve complex combinatorial optimisation problems like the travelling salesman problem (TSP), vehicle routing problem (VRP) etc. However, classical ACO algorithms provide better optimal solutions but do not reduce computation time ov...
Main Authors: | Chakrabarti, A. (Author), Dey, N. (Author), Ghosh, M. (Author), Mitra, D. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
John Wiley and Sons Inc
2022
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
Similar Items
-
New methods for Quantum Compiling
by: Kliuchnikov, Vadym
Published: (2014) -
Toward Quantum Gate-Model Heuristics for Real-World Planning Problems
by: Tobias Stollenwerk, et al.
Published: (2020-01-01) -
Quantum Walk-Based Vehicle Routing Optimisation
by: Bennett, T., et al.
Published: (2021) -
Algorithms for the Optimization of Quantum Circuits
by: Amy, Matthew
Published: (2013) -
Algorithms for the Optimization of Quantum Circuits
by: Amy, Matthew
Published: (2013)