Franz Rothlauf

Franz Rothlauf

Auto-generated profile, based on publicly available information

Franz Rothlauf

Johannes Gutenberg University Mainz, Mainz, Germany

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 September 2015 in Journal of International Business Studies
Verified
Journal Article
Closed access
KBKeith D Brouthers
Keith D Brouthers
KGKim Dung Geisser
Kim Dung Geisser
FRFranz Rothlauf
Franz Rothlauf

1 July 2007 in Journal of Air Transport Management
Verified
Journal Article
Closed access
TGTobias Grosche
Tobias Grosche
FRFranz Rothlauf
Franz Rothlauf
AHArmin Heinzl
Armin Heinzl


1 December 2003 in Evolutionary Computation
Verified
Journal Article
Closed access
FRFranz Rothlauf
Franz Rothlauf
DGDavid E. Goldberg
David E. Goldberg
This paper discusses how the use of redundant representations influences the performance of genetic and evolutionary algorithms. Representations are redundant if the number of genotypes exceeds the number of phenotypes. A distinction is made between synonymously and non-synonymously redundant representations. Representations are synonymously redundant if the genotypes that represent the same phenotype are very similar to each other. Non-synonymously redundant representations do not allow genetic operators to work properly and result in a lower performance of evolutionary search. When using synonymously redundant representations, the performance of selectorecombinative genetic algorithms (GAs) depends on the modification of the initial supply. We have developed theoretical models for synonymously redundant representations that show the necessary population size to solve a problem and the number of generations goes with O(2kr/r), where kr is the order of redundancy and r is the number of genotypic building blocks (BB) that represent the optimal phenotypic BB. As a result, uniformly redundant representations do not change the behavior of GAs. Only by increasing r, which means overrepresenting the optimal solution, does GA performance increase. Therefore, non-uniformly redundant representations can only be used advantageously if a-priori information exists regarding the optimal solution. The validity of the proposed theoretical concepts is illustrated for the binary trivial voting mapping and the real-valued link-biased encoding. Our empirical investigations show that the developed population sizing and time to convergence models allow an accurate prediction of the empirical results.

1 January 2011
Verified
Book
Closed access
FRFranz Rothlauf
Franz Rothlauf

11 February 2010 in OR Spectrum
Verified
Journal Article
Closed access
PDF file
UDUlrich Derigs
Ulrich Derigs
JGJens Gottlieb
Jens Gottlieb
JKJochen Kalkoff
Jochen Kalkoff
MPMichael Piesche
Michael Piesche
FRFranz Rothlauf
Franz Rothlauf
UVUlrich Vogel
Ulrich Vogel