Discovering the suitability of optimisation algorithms by learning from evolved instances
combinatorial optimizationphase transitionalgorithm selectiontravelling salesman problemhardness predictioninstance difficulty
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorial optimization (90C27) Operations research and management science (90B99) Software, source code, etc. for problems pertaining to calculus of variations and optimal control (49-04)
- Measuring instance difficulty for combinatorial optimization problems
- Towards objective measures of algorithm performance across instance space
- Generating new test instances by evolving in instance space
- Instance-specific algorithm selection via multi-output learning
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 2243360 (Why is no real title available?)
- A review of metrics on permutations for search landscape analysis
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Chained Lin-Kernighan for large traveling salesman problems
- Determining Whether a Problem Characteristic Affects Heuristic Performance
- Empirical hardness models, methodology and a case study on combinatorial auctions
- Evolutionary Computation in Combinatorial Optimization
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Landscapes, operators and heuristic search
- Measuring instance difficulty for combinatorial optimization problems
- Objective function features providing barriers to rapid global optimization
- Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
- Principles and Practice of Constraint Programming – CP 2004
- The TSP phase transition
- The landscape of the traveling salesman problem
- What makes an optimization problem hard?.
- New summary measures and datasets for the multi-project scheduling problem
- On the summary measures for the resource-constrained project scheduling problem
- Generating new test instances by evolving in instance space
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Exploring the role of graph spectra in graph coloring algorithm performance
- Online over time processing of combinatorial problems
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- Evolving test instances of the Hamiltonian completion problem
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- Measuring instance difficulty for combinatorial optimization problems
- A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
- Instance spaces for machine learning classification
- Towards objective measures of algorithm performance across instance space
- Algorithm runtime prediction: methods \& evaluation
- Auto-selection mechanism of differential evolution algorithm variants and its application
This page was built for publication: Discovering the suitability of optimisation algorithms by learning from evolved instances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408979)
