A parallel 2-opt algorithm for the Traveling Salesman Problem.
M. G. A. VerhoevenEmile H. L. AartsP. C. J. SwinkelsPublished in: Future Gener. Comput. Syst. (1995)
Keyphrases
- traveling salesman problem
- ant colony optimization
- hamiltonian cycle
- dynamic programming
- combinatorial optimization
- minimum spanning tree
- discrete particle swarm optimization
- np hard
- ant colony optimization algorithm
- optimal solution
- search space
- optimization problems
- genetic local search
- similarity measure
- traveling salesman
- combinatorial problems
- optimization algorithm
- np complete
- expectation maximization
- cost function
- computational complexity