Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection.
Lars KotthoffPascal KerschkeHolger H. HoosHeike TrautmannPublished in: LION (2015)
Keyphrases
- combinatorial optimization
- learning algorithm
- np hard
- particle swarm optimization
- experimental evaluation
- optimal solution
- linear programming
- selection algorithm
- cost function
- detection algorithm
- objective function
- search space
- computational complexity
- improved algorithm
- similarity measure
- neural network
- markov random field
- input data
- randomly generated
- recognition algorithm
- high accuracy
- quadratic programming
- gradient projection
- matching algorithm
- simulated annealing
- worst case
- probabilistic model
- dynamic programming
- significant improvement
- genetic algorithm