On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem

被引:12
|
作者
Dantas, Augusto [1 ]
Pozo, Aurora [1 ]
机构
[1] Univ Fed Parana, Dept Comp Sci, Curitiba, Parana, Brazil
关键词
Algorithm selection; Meta-learning; Combinatorial optimization; Fitness landscape analysis; LOCAL SEARCH;
D O I
10.1016/j.tcs.2019.10.033
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Meta-heuristics perform differently depending on the problem instance they are solving, meaning that manually choosing an algorithm is not trivial and an automatic selection is desirable. This task can be addressed using a meta-learning approach, which relates the characteristics of the problem instances to the performance of a set of solving algorithms. Therefore, the success of such approach is based on the quality of the extracted set of features. Some studies have proposed the use of features based on Fitness Landscape Analysis (FLA) to characterize optimization problems. However, extracting measures based on FLA usually requires a high computational effort. In a previous work, we have employed meta-heuristic selection on the Quadratic Assignment Problem (QAP) using some FLA measures. This research extends our study by including additional FLA meta-features, by using a less costly extraction method, and by considering more QAP instances. In total, we built five multi-label datasets, each composed of meta-features that were extracted by different sampling sizes, and then we used them to train Random Forest classifiers. Besides presenting satisfactory classification performance, and a decrease in time consumption in relation to our previous work, this selection approach was able to achieve better solution costs over the set of QAP instances if compared to running the meta-heuristics individually. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:62 / 75
页数:14
相关论文
共 50 条
  • [1] Automatic Algorithm Selection for the Quadratic Assignment Problem Using Fitness Landscape Analysis
    Pitzer, Erik
    Beham, Andreas
    Affenzeller, Michael
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION (EVOCOP 2013), 2013, 7832 : 109 - 120
  • [2] Summary of algorithm selection problem based on meta-learning
    [J]. Zeng, Z.-L. (zzljxnu@163.com), 1600, Northeast University (29):
  • [3] A Meta- Learning Algorithm Selection Approach for the Quadratic Assignment Problem
    Dantas, Augusto Lopez
    Ramirez Pozo, Aurora Trinidad
    [J]. 2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 1284 - 1291
  • [4] Selecting Algorithms for the Quadratic Assignment Problem with a Multi-label Meta-learning Approach
    Dantas, Augusto Lopez
    Ramirez Pozo, Aurora Trinidad
    [J]. 2018 7TH BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS), 2018, : 175 - 180
  • [5] Feature Selection Algorithm Ensembling Based on Meta-Learning
    Tanfilev, Igor
    Filchenkov, Andrey
    Smetannikov, Ivan
    [J]. 2017 10TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, BIOMEDICAL ENGINEERING AND INFORMATICS (CISP-BMEI), 2017,
  • [6] Meta-learning on Flowshop using Fitness Landscape Analysis
    Pavelski, Lucas Marcondes
    Delgado, Myriam Regattieri
    Kessaci, Marie-Eleonore
    [J]. PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 925 - 933
  • [8] Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
    Merz, P
    Freisleben, B
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2000, 4 (04) : 337 - 352
  • [9] A Survey of Personalized Recommendation Algorithm Selection Based on Meta-learning
    Ren, Yi
    Chi, Cuirong
    Zhang Jintao
    [J]. CYBER SECURITY INTELLIGENCE AND ANALYTICS, 2020, 928 : 1383 - 1388
  • [10] Instance-Based Algorithm Selection on Quadratic Assignment Problem Landscapes
    Beham, Andreas
    Affenzeller, Michael
    Wagner, Stefan
    [J]. PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCO'17 COMPANION), 2017, : 1471 - 1478