FOGA 2019

From Openresearch
Jump to: navigation, search
FOGA 2019
15th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV)
Event in series FOGA
Dates 2019/08/27 (iCal) - 2019/08/29
Location: Potsdam, Germany
Loading map...

Important dates
Submissions: 2019/04/17
Notification: 2019/06/05
Camera ready due: 2019/06/21
Registration link:
Early bird student: € 250 / {{{Early bird fee reduced}}}
Property "Early bird fee reduced" (as page type) with input value "{{{Early bird fee reduced}}}" contains invalid characters or is incomplete and therefore can cause unexpected results during a query or annotation process.
On site student: € 450 / {{{On site fee reduced}}}
Property "On site fee reduced" (as page type) with input value "{{{On site fee reduced}}}" contains invalid characters or is incomplete and therefore can cause unexpected results during a query or annotation process.
Early bird regular: € 400
On site regular: € 600
Papers: Submitted 36 / Accepted {{{Accepted papers}}}
"{{{Accepted papers}}}" is not a number.
(Expression error: Unrecognized punctuation character "{".
"Expression error: Unrecognized punctuation character "{"." is not a number.
Organizers: Tobias Friedrich
PC chairs: Carola Doerr, Dirk Arnold
Keynote speaker: Rolf H. Möhring
Table of Contents



Enter your description here. Maybe just paste in the call for papers.


The FOGA workshop series aims at advancing our understanding of the working principles behind evolutionary algorithms and related randomized search heuristics, such as local search algorithms, differential evolution, ant colony optimization, particle swarm optimization, artificial immune systems, simulated annealing, and other Monte Carlo methods for search and optimization. Connections to related areas, such as Bayesian optimization and direct search, are of interest as well. FOGA is the premier event to discuss advances on the theoretical foundations of these algorithms, tools needed to analyze them, and different aspects of comparing algorithms’ 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
   Connection 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.

This year FOGA will be co-located with the seventh Configuration and Selection of Algorithms (COSEAL) Workshop, organized by Holger Hoos and Marius Lindauer. COSEAL is a workshop series for discussing the most recent advances in the automated configuration and selection of algorithms.