A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One.
J. H. HaltonRouto TeradaPublished in: SIAM J. Comput. (1982)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- optimization problems
- genetic local search
- traveling salesman
- optimal solution
- hamiltonian cycle
- combinatorial problems
- crossover operator
- vehicle routing problem
- combinatorial optimization problems
- ant colony optimization algorithm
- valid inequalities
- transportation networks
- discrete optimization problems
- knapsack problem
- probability distribution
- discrete particle swarm optimization
- neural network