Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem (2009)
Friedrich, Tobias, He, Jun, Hebbinghaus, Nils, Neumann, Frank, Witt, Carsten
Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast, the theoretical understanding of the interplay of different optimization methods is rare. In this...
Jun He, Colin Reeves, Carsten Witt, Xin Yao
Various ways have been defined to measure the hardness of a fitness function for evolutionary algorithms and other black-box heuristics. Examples include fitness landscape analyses, epistasis,...
∗ Algorithms and Complexity Group (2008)
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different optimization methods...
Simplified drift analysis for proving lower bounds in evolutionary computation (2008)
Oliveto, Pietro S., Witt, Carsten
Drift analysis is a powerful tool used to bound the optimization time of evolutionary algorithms (EAs). Various previous works apply a drift theorem going back to Hajek in order to show exponential...
Rigorous analyses for the combination of ant colony optimization and local search (2008)
Neumann, Frank, Sudholt, Dirk, Witt, Carsten
Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications use a combination of ACO and...
ABSTRACT Rigorous Runtime Analysis of a (µ+1) ES for the Sphere Function (2008)
Evolutionary algorithms (EAs) are general, randomized search heuristics applied successfully to optimization problems both in discrete and in continuous search spaces. In recent years, substantial...
Runtime analysis of binary PSO (2008)
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and a swarm of...
Theoretical analysis of diversity mechanisms for global exploration (2008)
Friedrich, Tobias, Oliveto, Pietro S., Sudholt, Dirk, Witt, Carsten
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to find dissimilar...
Theoretical Analysis of Diversity Mechanisms for Global Exploration (2008)
Friedrich, Tobias, Oliveto, Pietro, Sudholt, Dirk, Witt, Carsten
Runtime Analysis of Binary PSO (2008)
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and a swarm of...
08051 Executive Summary -- Theory of Evolutionary Algorithms (2008)
Arnold, Dirk V., Auger, Anne, Rowe, Jonathan E., Witt, Carsten
The 2008 Dagstuhl Seminar "Theory of Evolutionary Algorithms" was the fifth in a firmly established series of biannual events. In the week from Jan. 27, 2008 to Feb. 1, 2008, 47 researchers from nine...
08051 Abstracts Collection -- Theory of Evolutionary Algorithms (2008)
Arnold, Dirk V., Auger, Anne, Witt, Carsten, Rowe, Jonathan E.
From Jan. 27, 2008 to Feb. 1, 2008, the Dagstuhl Seminar 08051 ``Theory of Evolutionary Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the...
Population Size vs. Runtime of a Simple Evolutionary Algorithm (2007)
Evolutionary algorithms (EAs) find numerous applications, and practical knowledge on EAs is immense. In practice, sophisticated population-based EAs employing selection, mutation and crossover are...
An Analysis of the (µ+1) EA on Pseudo-Boolean Functions (2007)
Evolutionary Algorithms (EAs) are successfully applied for optimization in discrete search spaces, but theory is still weak in particular for population-based EAs. Here, a first rigorous analysis of...
by Simple Randomized Search Heuristics (2007)
Re I He, Computat I Onal, I Ntell, I Gence, Ingo Wegener, Ingo Wegener, ...
This work is a product of the Collaborative Research Center 531, "Computational
Algorithm on Quadratic Pseudo-Boolean Functions # (2007)
Re I He, Computat I Onal, I Ntell, I Gence, Ingo Wegener, Ingo Wegener, ...
This work is a product of the Collaborative Research Center 531, "Computational
An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions (Extended Abstract) (2007)
Carsten Witt FB Informatik, LS 2 Univ. Dortmund 44221 Dortmund, Germany carsten.witt@cs.uni-dortmund.de Abstract. Evolutionary Algorithms (EAs) are successfully applied for optimization in discrete...
On improving approximate solutions by evolutionary algorithms (2007)
Friedrich, Tobias, He, Jun, Hebbinghaus, Nils, Neumann, Frank, Witt, Carsten
Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different optimization methods is rare. The...
Comparing variants of MMAS ACO algorithms on pseudo-boolean functions (2007)
Neumann, Frank, Sudholt, Dirk, Witt, Carsten
Recently, the first rigorous runtime analyses of ACO algorithms have been presented. These results concentrate on variants of the MAX-MIN ant system by St¨utzle and Hoos and consider their runtime...
Approximating covering problems by randomized search heuristics using multi-objective models (2007)
Friedrich, Tobias, He, Jun, Hebbinghaus, Nils, Neumann, Frank, Witt, Carsten
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, there are only a few...
On the influence of pheromone updates in ACO algorithms (2007)
Doerr, Benjamin, Neumann, Frank, Sudholt, Dirk, Witt, Carsten
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply particularly to...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt, Benjamin Doerr, Dirk Sudholt, ...
This work is a product of the Collaborative Research Center 531, “Computational
Approximating Covering Problems by Randomized Search Heuristics Using Multi-objective Models (2007)
Tobias Friedrich, Tobias Friedrich, Jun He, Jun He, Nils Hebbinghaus, Nils Hebbinghaus, ...
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, there are only a few...
On Improving Approximate Solutions by Evolutionary Algorithms (2007)
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt, Tobias Friedrich, ...
the Deutsche Forschungsgemeinschaft.
Approximating Covering Problems by Randomized Search Heuristics Using Multi-objective Models (2007)
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, there are only a few...
On Improving Approximate Solutions by Evolutionary Algorithms (2007)
Friedrich, Tobias, He, Jun, Hebbinghaus, Nils, Neumann, Frank, Witt, Carsten
On the runtime analysis of the 1-ANT ACO algorithm (2007)
Doerr, Benjamin, Neumann, Frank, Sudholt, Dirk, Witt, Carsten
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models (2007)
Friedrich, Tobias, He, Jun, Hebbinghaus, Nils, Neumann, Frank, Witt, Carsten
Ant colony optimization and the minimum spanning tree problem (2006)
Ant Colony Optimization (ACO) is a kind of randomized search heuristic that has become very popular for solving problems from combinatorial optimization. Solutions for a given problem are constructed...
Population Size vs. Runtime of a Simple Evolutionary Algorithm ∗ (2006)
Evolutionary algorithms (EAs) find numerous applications, and practical knowledge on EAs is immense. In practice, sophisticated population-based EAs employing selection, mutation and crossover are...
Runtime analysis of a simple Ant Colony Optimization algorithm (2006)
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic is rather weak....
Runtime Analysis of a Simple Ant Colony Optimization Algorithm (2006)
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic is rather weak....
Worst-case and Average-case Approximations by Simple Randomized Search Heuristics (2005)
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact deterministic...
Der Entwurf und die Analyse von Algorithmen für die kombinatorische Optimierung zählen zu den zentralen Aufgaben der Informatik. In dieser Dissertation werden in der Praxis erfolgreiche...
Dortmund, Universiẗat, Diss., 2004.
An analysis of the (µ+1) EA on simple pseudo-boolean functions (2004)
Although Evolutionary Algorithms (EAs) have been successfully applied to optimization in discrete search spaces, theoretical developments remain weak, in particular for population-based EAs. This...
Randomized search heuristics like evolutionary algorithms and simulated annealing find many applications, especially in situations where no full information on the problem instance is available. In...
On the Optimization of Monotone Polynomials (2003)
Simple Randomized Search, Ingo Wegener, Carsten Witt
Randomized search heuristics like evolutionary algorithms and simulated annealing find many applications, especially in situations where no full information on the problem instance is available. In...
Population Size vs. Runtime of a Simple Evolutionary Algorithm (2003)
Evolutionary algorithms (EAs) find numerous applications,and practical knowledge on EAs is immense. In practice,sophisticated population-based EAs employing selection, mutation and crossover are...
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions (2002)
Evolutionary algorithms are randomized search heuristics, which are often used as function optimizers. In this paper the well-known (1+1) Evolutionary Algorithm ((1+1) EA) and its multistart variants...
Evolutionary algorithms are randomized search heuristics, which are often used as function optimizers. In this paper the well-known (1+1) Evolutionary Algorithm ((1+1) EA) and its multistart variants...
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics (2002)
Randomized search heuristics like evolutionary algorithms and simulated annealing find many applications, especially in situations where no full information on the problem instance is available. In...
On the Behavior of the (1+1) Evolutionary Algorithm on Quadratic Pseudo-Boolean Functions (2000)
Evolutionary algorithms are randomized search heuristics, which are often used as function optimizers. In this paper the well-known (1+1) Evolutionary Algorithm ((1+1) EA) and its multistart variants...
On the Behavior of the (1+1) Evolutionary Algorithm on Quadratic Pseudo-Boolean Functions (2000)
Evolutionary algorithms are randomized search heuristics, which are often used as function optimizers. In this paper the well-known (1+1)Evolutionary Algorithm ((1+1)EA)and its multistart variants...
Minimizing stall time in single and parallel disk systems (1998)
Abstract. We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching and...
Interpretational Abstraction, in (1991)
Frank Neumann, Frank Neumann, Dirk Sudholt, Dirk Sudholt, Carsten Witt, Carsten Witt
the Deutsche Forschungsgemeinschaft.