Abstract
This paper describes the relevant steps when modelling a given problem in order to be attacked by a Genetic Algorithm (GA). As an example for the whole modelling process the cryptanalysis of a generic 3-rotor machine is used. Thereby the authors want to especially highlight the various traps and dangers that might lead to a complete failure of a GA-based approach. Finally a theoretical analysis is given that shows why problems like the used example cannot be solved by Genetic Algorithms sufficiently.
| Original language | English |
|---|---|
| Title of host publication | Cybernetics and Systems 2004 |
| Publisher | Austrian Society for Cybernetic Studies |
| Pages | 79-84 |
| Publication status | Published - 2004 |
| Event | European Meeting on Cybernetics and Systems Research 2004 - Wien, Austria Duration: 13 Apr 2004 → 16 Apr 2004 |
Conference
| Conference | European Meeting on Cybernetics and Systems Research 2004 |
|---|---|
| Country/Territory | Austria |
| City | Wien |
| Period | 13.04.2004 → 16.04.2004 |
Keywords
- Genetic Algorithms
- Heuristic Optimization
- Modeling
- Solution Representation