Traps and Dangers when Modelling Problems for Genetic Algorithms

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

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 languageEnglish
Title of host publicationCybernetics and Systems 2004
PublisherAustrian Society for Cybernetic Studies
Pages79-84
Publication statusPublished - 2004
EventEuropean Meeting on Cybernetics and Systems Research 2004 - Wien, Austria
Duration: 13 Apr 200416 Apr 2004

Conference

ConferenceEuropean Meeting on Cybernetics and Systems Research 2004
CountryAustria
CityWien
Period13.04.200416.04.2004

Keywords

  • Genetic Algorithms
  • Heuristic Optimization
  • Modeling
  • Solution Representation

Fingerprint Dive into the research topics of 'Traps and Dangers when Modelling Problems for Genetic Algorithms'. Together they form a unique fingerprint.

Cite this