The Impact of Automated Algorithm Configuration on the Scaling Behaviour of State-of-the-Art Inexact TSP Solvers.
Zongxu MuHolger H. HoosThomas StützlePublished in: LION (2016)
Keyphrases
- computational complexity
- np hard
- optimization algorithm
- optimal solution
- detection algorithm
- learning algorithm
- computationally efficient
- theoretical analysis
- k means
- significant improvement
- times faster
- experimental evaluation
- computational cost
- traveling salesman problem
- preprocessing
- convergence rate
- similarity measure
- simulated annealing
- high accuracy
- dynamic programming
- objective function
- worst case
- ant colony optimization
- matching algorithm
- search space
- search strategy
- knapsack problem
- selection algorithm
- scaling factors