A case study of algorithm selection for the traveling thief problem.
Markus WagnerMarius LindauerMustafa MisirSamadhi NallaperumaFrank HutterPublished in: J. Heuristics (2018)
Keyphrases
- selection algorithm
- computational complexity
- experimental evaluation
- learning algorithm
- preprocessing
- k means
- high accuracy
- np hard
- dynamic programming
- computational cost
- case study
- optimization algorithm
- computationally efficient
- particle swarm optimization
- worst case
- significant improvement
- objective function
- detection algorithm
- experimental study
- ant colony optimization
- memory requirements
- improved algorithm
- single pass
- probabilistic model
- search space
- theoretical analysis
- similarity measure
- matching algorithm
- path planning
- face recognition
- estimation algorithm