Research Interests:
Theoretical aspects of randomized search heuristics, in particular evolutionary algorithms
and ant colony optimization
Publications
Frank Neumann, Dirk Sudholt and Carsten Witt (2009):
Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus Swarm Intelligence (to appear)
Conference version:
Comparing
Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Proc. of Engineering Stochastic Local Search Algorithms - SLS 2007, LNCS 4638, Springer, pp. 61-75
Preliminary Version:
Technical Report, Reihe CI, No. CI-230/07, SFB 531, Universität Dortmund, Germany
Download: CI Report 230/07 (PDF)
Carsten Witt (2009):
Why Standard Particle Swarm Optimizers Elude a Theoretical Runtime
Analysis
In: Proc. of FOGA 2009 (to appear)
Pietro S. Oliveto and Carsten Witt (2008):
Simplified Drift Analysis for Proving Lower Bounds in
Evolutionary Computation
In: Proc. of Parallel Problem Solving from Nature - PPSN X, LNCS 5199, pp. 82-91, Springer
Preliminary Version: Technical Report, Reihe CI, No. CI-247/08,
SFB 531, Technische Universität Dortmund, Germany
Download: CI Report 247/08 (PDF)
Frank Neumann, Dirk Sudholt and Carsten Witt (2008):
Rigorous Analyses for the Combination of Ant Colony Optimization and
Local Search
In: Proc. of Ant Colony Optimization and Swarm Intelligence - ANTS 2008, LNCS 5217, pp. 132-143, Springer
Preliminary Version: Technical Report, Reihe CI, No. CI-243/08,
SFB 531, Technische Universität Dortmund, Germany
Download: CI Report 243/08 (PDF)
Carsten Witt (2008):
Population Size versus Runtime of a Simple Evolutionary Algorithm Theoretical Computer Science, 403(1), pp. 104-120
Conference version: Population Size vs. Runtime of a Simple EA
In: Sarker et al. (Eds.): Proc. of the Congress on Evolutionary Computation - CEC 2003, volume 3, IEEE Press, pp. 1996-2003
Dirk Sudholt and Carsten Witt (2008):
Runtime Analysis of Binary PSO
In: Proc. of Genetic and Evolutionary Computation Conference - GECCO 2008, ACM Press, pp. 135-142
Preliminary Version:
Technical Report, Reihe CI, No. CI-241/08, SFB 531, Technische Universität Dortmund, Germany
Download: CI Report 241/08 (PDF)
Tobias Friedrich, Pietro Oliveto, Dirk Sudholt and Carsten Witt (2008):
Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proc. of Genetic and Evolutionary Computation Conference - GECCO 2008, ACM Press, pp. 945-952 Best Paper Award
Preliminary Version:
Technical Report, Reihe CI, No. CI-237/08, SFB 531, Technische Universität Dortmund, Germany
Download: CI Report 237/08 (PDF)
Frank Neumann and Carsten Witt (2008):
Ant Colony Optimization and the Minimum Spanning Tree Problem
In: Proc. of Learning and Intelligent Optimization - LION 2, LNCS 5313, Springer, pp. 153-166
Preliminary version:
Electronic Colloquium on Computational Complexity (ECCC), Report No. 143.
Download: ECCC Report TR06-143
Jun He, Colin Reeves, Carsten Witt and Xin Yao (2007):
A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Existence and Predictability Evolutionary Computation, 15(4), pp. 435-444
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann and Carsten Witt (2007): On Improving Approximate Solutions by Evolutionary Algorithms
In: Proc. of the Congress on Evolutionary Computation - CEC 2007, IEEE Press, pp. 2614-2621
Preliminary Version:
Technical Report, Reihe CI, No. CI-231/07, SFB 531, Universität Dortmund, Germany
Download: CI Report 231/07 (PDF)
Extended version to appear in Evolutionary Computation under the title "Analyses of Simple Hybrid Evolutionary
Algorithms for the Vertex Cover Problem"
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann and Carsten Witt (2007):
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Proc. of Genetic and Evolutionary Computation Conference - GECCO 2007, ACM Press, pp. 797-804
Preliminary Version:
Technical Report, Reihe CI, No. CI-224/07, SFB 531, Universität Dortmund, Germany
Download: CI Report 224/07 (PDF)
Benjamin Doerr, Frank Neumann, Dirk Sudholt and Carsten Witt (2007):
On the Runtime Analysis of the 1-ANT ACO Algorithm
In: Proc. of Genetic and Evolutionary Computation Conference - GECCO 2007, ACM Press, pp. 33-40 Best Paper Award
Preliminary Version:
Technical Report, Reihe CI, No. CI-223/07, SFB 531, Universität Dortmund, Germany
Download: CI Report 223/07 (PDF)
Jörn Mehnen, Thomas Michelitsch and Carsten Witt (2007):
Collaborative Research Centre 531: Computational Intelligence - Theory and Practice it - Information Technology, 49(1), Oldenbourg, pp. 49-57
Frank Neumann and Carsten Witt (2006):
Runtime Analysis of a Simple Ant Colony Optimization Algorithm (Extended Abstract)
In: Proc. of ISAAC 2006, LNCS 4288, pp. 618-627, Springer
Full version: Electronic Colloquium on Computational Complexity (ECCC), Report No. 84.
Download: ECCC Report TR06-084 Extended version to appear in Algorithmica
Carsten Witt (2006):
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions Evolutionary Computation, 14(1), pp. 65-86
Conference version: An Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions
In: Genetic and Evolutionary Computation Conference - GECCO 2004, LNCS 3102, Springer, pp. 761-773
Best paper award
Download: Preprint (PDF)
Carsten Witt (2005):
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
In: Proc. of the 22nd Annual Symposium on Theoretical
Aspects of Computer Science - STACS 2005, LNCS 3404, Springer, pp. 44-56
Download: Revised preprint (PDF)
Carsten Witt (2005): Über die Analyse randomisierter Suchheuristiken und den
Entwurf spezialisierter Algorithmen im Bereich der kombinatorischen Optimierung
In: Wagner et al. (Eds.): Ausgezeichnete Informatikdissertationen 2004, Gesellschaft für Informatik, Bonn, Germany, pp. 203-212
Ingo Wegener and Carsten Witt (2005):
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics Combinatorics, Probability & Computing, 14, pp. 225-247
Conference version:
On the Optimization of Monotone Polynomials by the (1+1) EA and
Randomized Local Search.
In: Proc. of Genetic and Evolutionary Computation Conference - GECCO 2003, LNCS 2723, Springer, pp. 622-633
Best paper award
Download: Preprint (PDF)
Ingo Wegener and Carsten Witt (2005):
On the Analysis of a Simple Evolutionary Algorithm on Quadratic Pseudo-Boolean Functions Journal of Discrete Algorithms, 3(1), pp. 61-78
Preliminary versions of most of my papers are available as
technical reports in "Reihe CI" (CI series) on the web server of the
Collaborative Research Center "Computational Intelligence"
(SFB 531): List
of "Reihe CI" technical reports (co)authored by me.
Theses
Carsten Witt (2004): Über die Analyse randomisierter Suchheuristiken und den Entwurf spezialisierter Algorithmen
im Bereich der kombinatorischen Optimierung
PhD Thesis, University of Dortmund
