Results 1 
6 of
6
Algorithm Selection for Combinatorial Search Problems: A Survey
, 2012
"... The Algorithm Selection Problem is concerned with selecting the best algorithm to solve a given problem on a casebycase basis. It has become especially relevant in the last decade, as researchers are increasingly investigating how to identify the most suitable existing algorithm for solving a prob ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
The Algorithm Selection Problem is concerned with selecting the best algorithm to solve a given problem on a casebycase basis. It has become especially relevant in the last decade, as researchers are increasingly investigating how to identify the most suitable existing algorithm for solving a problem instead of developing new algorithms. This survey presents an overview of this work focusing on the contributions made in the area of combinatorial search problems, where Algorithm Selection techniques have achieved significant performance improvements. We unify and organise the vast literature according to criteria that determine Algorithm Selection systems in practice. The comprehensive classification of approaches identifies and analyses the different directions from which Algorithm Selection has been approached. This paper contrasts and compares different methods for solving the problem as well as ways of using these solutions. It closes by identifying directions of current and future research.
New Techniques for Algorithm Portfolio Design
"... We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has largely addressed one of the two aspects in isolation. Building on recent work on the scheduling aspect of the problem, we pr ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has largely addressed one of the two aspects in isolation. Building on recent work on the scheduling aspect of the problem, we present a technique that addresses both aspects simultaneously and has attractive theoretical guarantees. Experimentally, we show that this technique can be used to improve the performance of stateoftheart algorithms for Boolean satisfiability, zeroone integer programming, and A.I. planning. 1
DETC200849211 EVOLUTIONARY MULTIAGENT SYSTEMS: AN ADAPTIVE APPROACH TO OPTIMIZATION IN DYNAMIC ENVIRONMENTS
, 2008
"... ABSTRACT This paper explores the ability of a team of autonomous software agents to be effective in unknown and changing optimization environments by evolving to use the most successful algorithms at the points in the optimization process where they will be the most effective. We present the core f ..."
Abstract
 Add to MetaCart
(Show Context)
ABSTRACT This paper explores the ability of a team of autonomous software agents to be effective in unknown and changing optimization environments by evolving to use the most successful algorithms at the points in the optimization process where they will be the most effective. We present the core framework and methodology which has potential applications in layout, scheduling, manufacturing, and other engineering design areas. The communal agent team organizational structure employed allows cooperation of agents through the products of their work and creates an ever changing set of individual solutions for the agents to work on. In addition, the organizational structure allows the framework to be adaptive to changes in the design space that occur during the optimization process making our approach extremely flexible to the kinds of dynamic environments encountered in engineering design problems. An evolutionary approach is used, but evolution occurs at the strategic, rather than solution level where the strategies of agents in the team (the decisions for picking, altering, and inserting a solution) evolve over time. As an application of this approach, individual solutions are tours in the familiar combinatorial optimization problem of the traveling salesman. With a constantly changing set of these tours, the team, each agent running a different solution strategy, must evolve to apply the solution strategies which are most useful given the set at any point in the process. As a team, the evolutionary agents produce better solutions than any individual algorithm. We discuss the extensions to our preliminary work that will make our framework highly useful to the design and optimization community.
Algorithm Selection for Search: A survey Algorithm Selection for Combinatorial Search Problems: A survey
"... Abstract The Algorithm Selection Problem is concerned with selecting the best algorithm to solve a given problem on a casebycase basis. It has become especially relevant in the last decade, as researchers are increasingly investigating how to identify the most suitable existing algorithm for solv ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract The Algorithm Selection Problem is concerned with selecting the best algorithm to solve a given problem on a casebycase basis. It has become especially relevant in the last decade, as researchers are increasingly investigating how to identify the most suitable existing algorithm for solving a problem instead of developing new algorithms. This survey presents an overview of this work focusing on the contributions made in the area of combinatorial search problems, where Algorithm Selection techniques have achieved significant performance improvements. We unify and organise the vast literature according to criteria that determine Algorithm Selection systems in practice. The comprehensive classification of approaches identifies and analyses the different directions from which Algorithm Selection has been approached. This paper contrasts and compares different methods for solving the problem as well as ways of using these solutions. It closes by identifying directions of current and future research.