Polynomial Time Solvable Subclass of the Generalized Traveling Salesman Problem on Grid Clusters.
Michael Yu. KhachayKatherine NeznakhinaPublished in: AIST (2017)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- clustering algorithm
- combinatorial problems
- ant colony optimization
- ant colony optimization algorithm
- combinatorial optimization problems
- discrete particle swarm optimization
- transportation networks
- optimization problems
- hamiltonian cycle
- discrete optimization problems
- neural network
- np complete
- traveling salesman
- simulated annealing
- subtour elimination
- genetic local search
- metaheuristic