Automatic Design of Heuristic Algorithms for Binary Optimization Problems
Automatic Design of Heuristic Algorithms for Binary Optimization Problems
Marcelo de Souza
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence
Doctoral Consortium. Pages 4881-4882.
https://doi.org/10.24963/ijcai.2021/672
In this work we present AutoBQP, a heuristic solver for binary optimization problems. It applies automatic algorithm design techniques to search for the best heuristics for a given optimization problem. Experiments show that the solver can find algorithms which perform better than or comparable to state-of-the-art methods, and can even find new best solutions for some instances of standard benchmark sets.
Keywords:
Heuristic Search and Game Playing: Combinatorial Search and Optimisation
Heuristic Search and Game Playing: Meta-Reasoning and Meta-Heuristics
Heuristic Search and Game Playing: Heuristic Search
Multidisciplinary Topics and Applications: Autonomic Computing