Home
Hasso-Plattner-Institut
Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

schließen

schließen

schließen

schließen

schließen

schließen

schließen

schließen
  1. gecco

02.05.2023

Five Papers accepted at GECCO

We are proud to announce that five papers by our group members have been accepted at The Genetic and Evolutionary Computation Conference (GECCO) in Lisbon, Portugal on 15-19 July. The first three of them were accepted as full papers: In the paper Analysis of (1+1) EA on LeadingOnes with Constraints (Theory Track), the authors study how evolutionary algorithms optimize constrained versions of the classical LeadingOnes problem. They first provide a run time analysis for the classical (1+1)~EA on the LeadingOnes problem with a deterministic cardinality constraint, giving \(\Theta(n (n-B)\log(B) + n^2)\) as the tight bound. Theur results show that the behaviour of the algorithm is highly dependent on the constraint bound of the uniform constraint. Afterwards, they consider the problem in the context of stochastic constraints and provide insights using experimental studies on how the (\(\mu+1\))~EA is able to deal with these constraints in a sampling-based setting.

In the next paper titled Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem (Theory Track), the authors consider the W-separator problem, which is a natural generalization of the vertex cover problem. They combine the field of parameterized complexity with evolutionary algorithms and show that evolutionary algorithms with different objectives guide the search and admit fixed parameterized runtimes to solve or approximate (even arbitrarily close) the W-separator problem.

The final full paper Evolutionary Diversity Optimisation in Constructing Satisfying Assignments (Genetic Algorithms Track) studies the Boolean Satisfiability Problem (SAT) in the context of evolutionary diversity optimization (EDO), i.e. the authors try to find a diverse set of solutions to a SAT problem. Their approach uses evolutionary algorithms and minisat to try and maximize the entropy of the bit assignments in the space of solutions found. This might provide insight into the size and shape of the solution space and finding many diverse solutions might be beneficial for modeling and design problems.

Additionally, the two short papers ELEA – Build your own Evolutionary Algorithm in your Browser and Experimental Analyzes of Crossover and Diversity on Jump were accepted as posters for the tracks General Evolutionary Computation and Hybrids and Theory respectively.

  • ELEA – Build your own E... - Download
    Wagner, Markus; Kohlros, Erik; Quantmeyer, Gerome; Kotzing, Timo ELEA – Build your own Evolutionary Algorithm in your BrowserGenetic and Evolutionary Computation Conference (GECCO ’23) 2023
    [ Abstract ] [ BibTeX ] [ Download ]
     
  • Evolutionary Diversity Op... - Download
    Nikfarjam, Adel; Rothenberger, Ralf; Neumann, Frank; Friedrich, Tobias Evolutionary Diversity Optimisation in Constructing Satisfying AssignmentsGenetic and Evolutionary Computation Conference (GECCO) 2023
    [ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
     
  • Experimental Analyses of ... - Download
    Li, Xiaoyue; Kötzing, Timo Experimental Analyses of Crossover on JumpGenetic and Evolutionary Computation Conference (GECCO) 2023
    [ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
     
  • Analysis of the (1+1) EA ... - Download
    Friedrich, Tobias; Kötzing, Timo; Neumann, Aneta; Neumann, Frank; Radhakrishnan, Aishwarya Analysis of the (1+1) EA on LeadingOnes with ConstraintsGenetic and Evolutionary Computation Conference (GECCO ’23) 2023
    [ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
     
  • Fixed Parameter Multi-Obj... - Download
    Baguley, Samuel; Friedrich, Tobias; Neumann, Aneta; Neumann, Frank; Pappik, Marcus; Zeif, Ziena Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator ProblemGenetic and Evolutionary Computation Conference (GECCO) 2023
    [ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]