Discovering the suitability of optimisation algorithms by learning from evolved instances
DOI10.1007/S10472-011-9230-5zbMATH Open1236.49008OpenAlexW2054706389WikidataQ62033379 ScholiaQ62033379MaRDI QIDQ408979FDOQ408979
Jano I. van Hemert, Kate A. Smith-Miles
Publication date: 12 April 2012
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-011-9230-5
Recommendations
- 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
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)
Cites Work
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Principles and Practice of Constraint Programming – CP 2004
- The TSP phase transition
- Measuring instance difficulty for combinatorial optimization problems
- Title not available (Why is that?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A review of metrics on permutations for search landscape analysis
- Chained Lin-Kernighan for large traveling salesman problems
- Title not available (Why is that?)
- Landscapes, operators and heuristic search
- What makes an optimization problem hard?.
- Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
- Empirical hardness models
- Determining Whether a Problem Characteristic Affects Heuristic Performance
- Evolutionary Computation in Combinatorial Optimization
- Title not available (Why is that?)
- The landscape of the traveling salesman problem
- Objective function features providing barriers to rapid global optimization
Cited In (15)
- On the summary measures for the resource-constrained project scheduling problem
- Evolving test instances of the Hamiltonian completion problem
- Algorithm runtime prediction: methods \& evaluation
- Online over time processing of combinatorial problems
- Towards objective measures of algorithm performance across instance space
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Auto-selection mechanism of differential evolution algorithm variants and its application
- Exploring the role of graph spectra in graph coloring algorithm performance
- New summary measures and datasets for the multi-project scheduling problem
- Measuring instance difficulty for combinatorial optimization problems
- Generating new test instances by evolving in instance space
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem
- Instance spaces for machine learning classification
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
Uses Software
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)
