On the use of quality diversity algorithms for the traveling thief problem.
Adel NikfarjamAneta NeumannFrank NeumannPublished in: GECCO (2022)
Keyphrases
- learning algorithm
- high quality
- computationally efficient
- quality measures
- computational complexity
- significant improvement
- data sets
- computational cost
- information systems
- orders of magnitude
- recently developed
- dynamic programming
- anytime algorithms
- low quality
- combinatorial optimization
- computational efficiency
- bayesian networks
- clustering algorithm
- machine learning