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.
Originalsprache | Englisch |
---|---|
Titel | Cybernetics and Systems 2004 |
Herausgeber (Verlag) | Austrian Society for Cybernetic Studies |
Seiten | 79-84 |
Publikationsstatus | Veröffentlicht - 2004 |
Veranstaltung | European Meeting on Cybernetics and Systems Research 2004 - Wien, Österreich Dauer: 13 Apr. 2004 → 16 Apr. 2004 |
Konferenz
Konferenz | European Meeting on Cybernetics and Systems Research 2004 |
---|---|
Land/Gebiet | Österreich |
Ort | Wien |
Zeitraum | 13.04.2004 → 16.04.2004 |
Schlagwörter
- Genetic Algorithms
- Heuristic Optimization
- Modeling
- Solution Representation