Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem.
Thomas WeiseRaymond ChiongJörg LässigKe TangShigeyoshi TsutsuiWenxiang ChenZbigniew MichalewiczXin YaoPublished in: IEEE Comput. Intell. Mag. (2014)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- optimization problems
- combinatorial optimization problems
- combinatorial problems
- metaheuristic
- evolutionary algorithm
- discrete optimization
- simulated annealing
- ant colony optimization
- minimum spanning tree
- optimization methods
- genetic local search
- multi objective
- vehicle routing problem
- column generation
- benchmark problems
- hill climbing
- branch and bound
- constraint programming
- ant colony optimization algorithm
- hamiltonian cycle
- traveling salesman
- objective function