Cross-disciplinary perspectives on meta-learning for algorithm selection

KA Smith-Miles - ACM Computing Surveys (CSUR), 2009 - dl.acm.org
The algorithm selection problem [Rice 1976] seeks to answer the question: Which algorithm
is likely to perform best for my problem? Recognizing the problem as a learning task in the …

A comprehensive survey on fitness landscape analysis

E Pitzer, M Affenzeller - Recent advances in intelligent engineering …, 2012 - Springer
In the past, the notion of fitness landscapes has found widespread adoption. Many different
methods have been developed that provide a general and abstract framework applicable to …

Major advances in particle swarm optimization: theory, analysis, and application

EH Houssein, AG Gad, K Hussain… - Swarm and Evolutionary …, 2021 - Elsevier
Over the ages, nature has constantly been a rich source of inspiration for science, with much
still to discover about and learn from. Swarm Intelligence (SI), a major branch of artificial …

Automated algorithm selection: Survey and perspectives

P Kerschke, HH Hoos, F Neumann… - Evolutionary …, 2019 - ieeexplore.ieee.org
It has long been observed that for practically any computational problem that has been
intensely studied, different instances are best solved using different algorithms. This is …

Abandoning objectives: Evolution through the search for novelty alone

J Lehman, KO Stanley - Evolutionary computation, 2011 - ieeexplore.ieee.org
In evolutionary computation, the fitness function normally measures progress toward an
objective in the search space, effectively acting as an objective function. Through deception …

[HTML][HTML] Algorithm runtime prediction: Methods & evaluation

F Hutter, L Xu, HH Hoos, K Leyton-Brown - Artificial Intelligence, 2014 - Elsevier
Perhaps surprisingly, it is possible to predict how long an algorithm will take to run on a
previously unseen input, using machine learning techniques to build a model of the …

MAX–MIN ant system

T Stützle, HH Hoos - Future generation computer systems, 2000 - Elsevier
Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for
attacking hard combinatorial optimization problems. Yet, its performance, when compared to …

Ant colony optimization theory: A survey

M Dorigo, C Blum - Theoretical computer science, 2005 - Elsevier
Research on a new metaheuristic for optimization is often initially focused on proof-of-
concept applications. It is only after experimental work has shown the practical interest of the …

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis

T Vidal, TG Crainic, M Gendreau, C Prins - European Journal of …, 2013 - Elsevier
The attributes of vehicle routing problems are additional characteristics or constraints that
aim to better take into account the specificities of real applications. The variants thus formed …

Perspective: complex adaptations and the evolution of evolvability

GP Wagner, L Altenberg - Evolution, 1996 - academic.oup.com
The problem of complex adaptations is studied in two largely disconnected research
traditions: evolutionary biology and evolutionary computer science. This paper summarizes …