Direkt zum InhaltDirekt zur Navigation

A Binary Encoding Supporting Both Mutation and Recombination

Karsten Weicker
In: Parallel Problem Solving fropm Nature - PPSN XI, Hrsg: Robert Schaefer, Carlos Cotta, Joanna Kolodziej, Günter Rudolph, Berlin: Springer, pp. 134-143, 2010.

 

Abstract

There has been a long debate on the "most important" operator when applying genetic algorithms. This is very closely related to the favorite binary encoding, namely standard binary or Gray. Rather than confronting both approaches, this article is motivated by the search for an encoding that supports both mutation and recombination. For this purpose an encoding scheme is proposed and evaluated both using metrics and experiments.

 

Nachrichten RSS
  • 22.02.2017
    Kompilation von Constraint-Programmen: Erfolgreicher Abschluß eines kooperativen Promotionsverfahrens
    Herr Diplom-Informatiker (FH) Alexander Bau, Absolvent unserer ...
    Weiterlesen
Termine
JUG Saxony Camp 2017 an der HTWK 31.03.2017 09:00 - 18:00 — NIEPER-Bau der HTWK Leipzig
SKILL 2017 / Call for Papers 30.04.2017 - 30.09.2017
Verteidigungen
Masterverteidigung Anne Schüßler Raum: Z 417
Beginn: 10.03.17 - 10:00
Masterverteidigung Jonny Rillich Raum: Z 417
Beginn: 10.03.17 - 11:30
Masterverteidigung Nico Wohlfarth Raum: Z 417
Beginn: 10.03.17 - 13:30
Masterverteidigung Gregor Schuldt Raum: Raum A3 01 (Sophus-Lie-Seminarraum), Max-Planck-Institut für Mathematik in den Naturwissenschaften, Inselstraße 22, 04103 Leipzig
Beginn: 22.03.17 - 14:00