Out of the 31 full paper submissions we received, we accepted 15 papers. This results in an acceptance rate of 48 %. The Best Paper Award went to the paper “Generalized Drift Analysis in Continuous Domain: Linear Convergence of (1+1)-ES on Strongly Convex Functions with Lipschitz Continuous Gradients” by Daiki Morinaga and Youhei Akimoto. The papers that have been nominated for the Best Paper Award are marked with (*). All papers are available free of charge here. You can view the proceedings material here.

  • (*) Generalized Drift Analysis in Continuous Domain: Linear Convergence of (1+1)-ES on Strongly Convex Functions with Lipschitz Continuous Gradients
    Authors: Daiki Morinaga and Youhei Akimoto

  • (*) Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools
    Authors: Hsien-Kuei Hwang and Carsten Witt

  • (*) An Exponential Lower Bound for the Runtime of the Compact Genetic Algorithm on Jump Functions
    Author: Benjamin Doerr

  • (*) Exponential Slowdown for Larger Populations: The (μ+1)-EA on Monotone Functions
    Authors: Johannes Lengler and Xun Zou

  • (*) Consistent Population Control: Generate Plenty of Points, but with a Bit of Resampling
    Authors: Vasil Khalidov, Maxime Oquab, Jeremy Rapin and Olivier Teytaud

  • The Benefits and Limitations of Voting Mechanisms in Evolutionary Optimisation
    Authors: Jonathan Rowe and Aishwaryaprajna

  • Steady State Analysis of a Multi-Recombinative Meta-ES on a Conically Constrained Problem with Comparison to σSA and CSA
    Authors: Patrick Spettel, Hans-Georg Beyer and Michael Hellwig

  • Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators
    Authors: Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann and Heike Trautmann

  • New Features for Continuous Exploratory Landscape Analysis based on the SOO Tree
    Authors: Bilel Derbel, Arnaud Liefooghe, Sébastien Verel, Hernán Aguirre and Kiyoshi Tanaka

  • Time Complexity Analysis of RLS and (1+1) EA for the Edge Coloring Problem
    Authors: Jakob Bossek and Dirk Sudholt

  • Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem
    Authors: Vahid Roostapour, Mojgan Pourhassan and Frank Neumann

  • Runtime Analysis of Evolutionary Algorithms for the Depth Restricted (1,2)-Minimum Spanning Tree Problem
    Authors: Feng Shi, Frank Neumann and Jianxin Wang

  • Runtime Analysis of (1+1) Evolutionary Algorithm for the Chance-Constrained Knapsack Problem
    Authors: Frank Neumann and Andrew Sutton

  • On the Limitations of the Univariate Marginal Distribution Algorithm to Deception and Where Bivariate EDAs might help
    Authors: Per Kristian Lehre and Phan Trung Hai Nguyen

  • A Tight Runtime Analysis for the (1 + (λ, λ)) GA on LeadingOnes
    Authors: Denis Antipov, Benjamin Doerr and Vitalii Karavaev