The FOGA workshop series aims at advancing the understanding of the working principles behind evolutionary algorithms and related randomized search heuristics. It is the premier event to discuss advances in the theoretical foundations of these algorithms, tools needed to analyze them, and different aspects of comparing algorithm performance.

Topics of interest include, but are not limited to:

  • Run time analysis
  • Mathematical tools suitable for the analysis of search heuristics
  • Fitness landscapes and problem difficulty
  • (On- and offline) configuration and selection of algorithms, heuristics, operators, and parameters
  • Stochastic and dynamic environments, noisy evaluations
  • Constrained optimization
  • Problem representation
  • Complexity theory for search heuristics
  • Multi-objective optimization
  • Benchmarking aspects, including performance measures, the selection of meaningful benchmark problems, and statistical aspects
  • Connections between black-box optimization and machine learning

Submissions covering the entire spectrum of work, ranging from rigorously derived mathematical results to carefully crafted empirical studies, are invited.

Accepted papers will be included in the FOGA proceedings published by ACM.

Sep 6 - Sep 8, 2021
FH Vorarlberg
Submission deadline April 30, 2021
Author rebuttal phaseJune 1 - 7, 2021
Notification of acceptanceJune 20, 2021
Camera-ready submissionJuly 14, 2021
Early-registration deadlineJuly 14, 2021

ed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet.