Discovering the suitability of optimisation algorithms by learning from evolved instances
- 1 February 2011
- journal article
- Published by Springer Science and Business Media LLC in Annals of Mathematics and Artificial Intelligence
- Vol. 61 (2), 87-104
- https://doi.org/10.1007/s10472-011-9230-5
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Optimisation and Generalisation: Footprints in Instance SpacePublished by Springer Science and Business Media LLC ,2010
- How efficient are genetic algorithms to solve high epistasis deceptive problems?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Exploiting empirical knowledge for bi-dimensional knapsack problem heuristicsInternational Journal of Industrial and Systems Engineering, 2008
- Performance Prediction and Preselection for Optimization and Heuristic Solution ProceduresOperations Research, 2007
- Evolving Combinatorial Problem Instances That Are Difficult to SolveEvolutionary Computation, 2006
- Hyper-Heuristics: An Emerging Direction in Modern Search TechnologyPublished by Springer Science and Business Media LLC ,2006
- Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through EvolutionLecture Notes in Computer Science, 2005
- Chained Lin-Kernighan for Large Traveling Salesman ProblemsINFORMS Journal on Computing, 2003
- The TSP phase transitionArtificial Intelligence, 1996
- Using mutual information for selecting features in supervised neural net learningIEEE Transactions on Neural Networks, 1994