Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.
Jakob BossekPascal KerschkeHeike TrautmannPublished in: CoRR (2020)
Keyphrases
- search space
- optimization algorithm
- selection algorithm
- preprocessing
- computational cost
- experimental evaluation
- cost function
- learning algorithm
- detection algorithm
- np hard
- k means
- optimal solution
- dynamic programming
- worst case
- computationally efficient
- objective function
- genetic algorithm
- highly optimized
- randomly generated
- recognition algorithm
- combinatorial optimization
- numerically stable
- matching algorithm
- classification algorithm
- ant colony optimization
- linear programming
- simulated annealing
- high accuracy
- probabilistic model
- computational complexity
- times faster
- segmentation algorithm
- convergence rate
- improved algorithm