Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters.
Michael Yu. KhachayKatherine NeznakhinaPublished in: LION (2018)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- optimization problems
- combinatorial problems
- transportation networks
- ant colony optimization algorithm
- traveling salesman
- clustering algorithm
- discrete optimization problems
- discrete particle swarm optimization
- vehicle routing problem
- combinatorial optimization problems
- hamiltonian cycle
- crossover operator
- data points
- valid inequalities
- genetic algorithm
- euclidean distance
- metaheuristic
- genetic local search