Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem.
Timo KötzingFrank NeumannHeiko RöglinCarsten WittPublished in: ANTS Conference (2010)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- ant colony optimization algorithm
- combinatorial optimization problems
- optimization problems
- combinatorial problems
- hamiltonian cycle
- transportation networks
- genetic local search
- valid inequalities
- discrete particle swarm optimization
- crossover operator
- aco algorithm
- swarm intelligence
- discrete optimization problems
- neural network
- ant colony algorithm
- knapsack problem
- constraint satisfaction problems
- simulated annealing
- dynamic programming
- traveling salesman