Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.
Jakob BossekPascal KerschkeHeike TrautmannPublished in: CEC (2020)
Keyphrases
- np hard
- ant colony optimization
- improved algorithm
- cost function
- dynamic programming
- times faster
- optimal solution
- worst case
- detection algorithm
- optimization algorithm
- computationally efficient
- expectation maximization
- linear programming
- high accuracy
- experimental evaluation
- objective function
- search strategy
- selection algorithm
- preprocessing
- learning algorithm
- classification algorithm
- neural network
- randomly generated
- theoretical analysis
- simulated annealing
- computational cost
- reinforcement learning
- image sequences
- image segmentation
- genetic algorithm