Discovering the suitability of optimisation algorithms by learning from evolved instances
algorithm selectioncombinatorial optimizationhardness predictioninstance difficultyphase transitiontravelling salesman problem
Software, source code, etc. for problems pertaining to calculus of variations and optimal control (49-04) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90B99) Combinatorial optimization (90C27)
- 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
- 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
- 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?)
- 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 landscape of the traveling salesman problem
- The TSP phase transition
- What makes an optimization problem hard?.
- Online over time processing of combinatorial problems
- Auto-selection mechanism of differential evolution algorithm variants and its application
- Instance spaces for machine learning classification
- Measuring instance difficulty for combinatorial optimization problems
- Evolving test instances of the Hamiltonian completion problem
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- New summary measures and datasets for the multi-project scheduling problem
- Towards objective measures of algorithm performance across instance space
- Generating new test instances by evolving in instance space
- Exploring the role of graph spectra in graph coloring algorithm performance
- Algorithm runtime prediction: methods \& evaluation
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
- On the summary measures for the resource-constrained project scheduling problem
- Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications
- Machine scheduling instance generation by reverse engineering from instance space analysis
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)
