A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
From MaRDI portal
Publication:2248551
DOI10.1007/s10472-013-9341-2zbMath1291.90327arXiv1208.2318OpenAlexW2083515646MaRDI QIDQ2248551
Heike Trautmann, Jakob Bossek, Frank Neumann, Bernd Bischl, Markus Wagner, Olaf Mersmann
Publication date: 26 June 2014
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.2318
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem, Unified encoding for hyper-heuristics with application to bioinformatics, A study on the effects of normalized TSP features for automated algorithm selection, Advancing Shannon entropy for measuring diversity in systems, Algorithm runtime prediction: methods \& evaluation, Decomposition-based multi-objective landscape features and automated algorithm selection, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Runtime analysis of a simple ant colony optimization algorithm
- Wrappers for feature subset selection
- Multivariate adaptive regression splines
- On the analysis of the \((1+1)\) evolutionary algorithm
- Measuring instance difficulty for combinatorial optimization problems
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Solution of a Min-Max Vehicle Routing Problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
- A Method for Solving Traveling-Salesman Problems
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Automata, Languages and Programming
- Introduction to evolutionary computing
- Random forests
- The landscape of the traveling salesman problem
