Hybrid Quantum Computing - Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem.
Eneko OsabaEsther Villar-RodriguezIzaskun OregiAitor Moreno-Fernandez-de-LecetaPublished in: CoRR (2020)
Keyphrases
- traveling salesman problem
- preliminary study
- neighborhood search
- optimization problems
- combinatorial optimization
- tabu search algorithm
- combinatorial problems
- ant colony optimization
- path relinking
- combinatorial optimization problems
- ant colony optimization algorithm
- test problems
- traveling salesman
- evolutionary algorithm
- tabu search
- simulated annealing
- quantum computing
- graph model
- test instances
- vehicle routing problem
- solution quality
- benchmark problems
- dynamic programming