Towards the design and implementation of optimization networks in HeuristicLab
Lists
Only you see this
Abstract
Combining multiple algorithms to cooperate in solving different optimization problems or process other workflows can be done in various problem domains, e.g. combinatorial optimization and data analysis. Optimization networks allow us to create such cooperative approaches by connecting multiple algorithms and letting them work together. In this paper, we propose an optimization network architecture for HeuristicLab. Networks are built using nodes that perform arbitrary tasks. We introduce the concepts of messages and ports, which can be used to exchange data between nodes. The application of such optimization networks is shown for two different applications. One is to solve the Traveling Thief Problem, where we substitute parts of the original problem with subproblems that are optimized interdependently. In another scenario, feature selection is combined with linear regression to find the best combination of features in order to achieve the best linear regression model.
BibTeX
@inproceedings{karder2017towards,
author = {Johannes Karder and Stefan Wagner and Andreas Beham and Michael Kommenda and Michael Affenzeller},
title = {{Towards the design and implementation of optimization networks in HeuristicLab}},
booktitle = {GECCO (Companion)},
year = {2017},
doi = {10.1145/3067695.3082475},
}Loading related content...