Population Sizing for the RedundantTrivial Voting Mapping
Year of publication: |
2003
|
---|---|
Authors: | Rothlauf, Franz |
Institutions: | Betriebswirtschaftliches Institut <Mannheim> ; Universität <Mainz> / Lehrstuhl für Wirtschaftsinformatik und BWL |
Subject: | Genetischer Algorithmus | genetic algorithm | Voting <Programmierung> | voting |
- 1 Introduction
- 2 Redundant Representations
- 2.1 Characteristics of Redundant Representations
- 2.2 Influence of Redundant Representations on GA Performance
- 3 The Trivial Voting Mapping
- 4 Experiments and Empirical Results
- 4.1 One-Max Problem
- 4.2 Concatenated Deceptive Trap Problem
- 5 Summary and Conclusions
- References
-
Skid scheduling algorithm for a shipbuilding company
Yoon, Hoonyong, (2012)
-
Mousavi, S. M., (2012)
-
Bi-criteria scheduling of surgical services for an outpatient procedure center
Gul, Serhat, (2011)
- More ...
-
Behaviour of the UMDAc algorithm with truncationselection on monotone functions
Grahl, Jörn, (2005)
-
Rothlauf, Franz, (2004)
-
The Edge-Set Encoding Revisited: On the Bias of a DirectRepresentation for Trees
Tzoppe, Carsten, (2004)
- More ...