Towards the Design and Implementation of Optimization Networks in HeuristicLab

被引:3
作者
Karder, Johannes [1 ,2 ]
Wagner, Stefan [1 ]
Beham, Andreas [1 ,2 ]
Kommenda, Michael [1 ,2 ]
Affenzeller, Michael [1 ,2 ]
机构
[1] Univ Appl Sci Upper Austria, Heurist & Evolutionary Algorithms Lab, Softwarepk 11, A-4232 Hagenberg, Austria
[2] Johannes Kepler Univ Linz, Inst Formal Models & Verificat, Altenberger Str 69, A-4040 Linz, Austria
来源
PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCO'17 COMPANION) | 2017年
关键词
optimization; network; architecture; design; implementation; metaheuristic algorithm; HeuristicLab;
D O I
10.1145/3067695.3082475
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:1209 / 1214
页数:6
相关论文
共 12 条
  • [1] Offspring selection: A new self-adaptive selection scheme for genetic algorithms
    Affenzeller, M
    Wagner, S
    [J]. ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, 2005, : 218 - 221
  • [2] [Anonymous], 1996, APPL LINEAR STAT MOD
  • [3] [Anonymous], 1995, DESIGN PATTERNS ELEM
  • [4] Applegate D.L., 2011, TRAVELING SALESMAN P
  • [5] Optimization Strategies for Integrated Knapsack and Traveling Salesman Problems
    Beham, Andreas
    Fechter, Judith
    Kommenda, Michael
    Wagner, Stefan
    Winkler, Stephan M.
    Affenzeller, Michael
    [J]. COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2015, 2015, 9520 : 359 - 366
  • [6] Bonyadi MR, 2013, 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P1037
  • [7] Breiman L., 2001, Machine Learning, V45, P5
  • [8] Parameter-less Population Pyramid
    Goldman, Brian W.
    Punch, William F.
    [J]. GECCO'14: PROCEEDINGS OF THE 2014 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2014, : 785 - 792
  • [9] Guyon I., 2003, Journal of Machine Learning Research, V3, P1157, DOI 10.1162/153244303322753616
  • [10] Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES)
    Hansen, N
    Muller, SD
    Koumoutsakos, P
    [J]. EVOLUTIONARY COMPUTATION, 2003, 11 (01) : 1 - 18