Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem.
Vladimir EjovMichael HaythorpeSerguei RossomakhinePublished in: CoRR (2017)
Keyphrases
- hamiltonian cycle
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- phase transition
- graph coloring
- optimization problems
- optimization algorithm
- objective function
- randomly generated
- combinatorial optimization problems
- bin packing
- simulated annealing
- np hard
- search space
- benchmark problems
- valid inequalities
- combinatorial problems
- constraint satisfaction
- vehicle routing problem
- metaheuristic
- particle swarm optimization
- upper bound
- dynamic programming
- multi objective
- computational complexity