On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
DOI10.1016/J.TCS.2019.10.033zbMATH Open1436.68324OpenAlexW2981454419WikidataQ126986779 ScholiaQ126986779MaRDI QIDQ2285657FDOQ2285657
Authors: Augusto Dantas, Aurora Pozo 
Publication date: 8 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.10.033
Recommendations
- Summary of algorithm selection problems based on meta-learning
- Measuring instance difficulty for combinatorial optimization problems
- Fitness landscape analysis and metaheuristics efficiency
- Publication:2768573
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- QAPLIB - a quadratic assignment problem library
- Title not available (Why is that?)
- SUNNY: a Lazy Portfolio Approach for Constraint Solving
- Random forests
- Metalearning
- The quadratic assignment problem. Theory and algorithms
- Assignment Problems and the Location of Economic Activities
- MaxSAT by improved instance-specific algorithm configuration
- SATzilla: portfolio-based algorithm selection for SAT
- Comparison of iterative searches for the quadratic assignment problem
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Iterated local search for the quadratic assignment problem
- Breakout local search for the quadratic assignment problem
- Solving large quadratic assignment problems on computational grids
- A new genetic algorithm for the quadratic assignment problem
- The Reactive Tabu Search
- An improved annealing scheme for the QAP
- Title not available (Why is that?)
- Continuous lunches are free plus the design of optimal optimization algorithms
- The online performance estimation framework: heterogeneous ensemble learning for data streams
- The algorithm selection competitions 2015 and 2017
Cited In (4)
- Migration-based algorithm library enrichment for constrained multi-objective optimization and applications in algorithm selection
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- New variable-length data compression scheme for solution representation of meta-heuristics
- A landscape-based analysis of fixed temperature and simulated annealing
Uses Software
This page was built for publication: On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285657)
