Anzeige
Erschienen in:
2002 | OriginalPaper | Buchkapitel
Development of the Ordering Messy Genetic Algorithm
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This chapter develops the ordering messy GA (OmeGA), a fast messy GA (fmGA) specialized for permutation problems. It represents the solutions by vectors of real numbers—the so-calledrandom keysintroduced by Bean (1994). In a number of experiments it is shown that the OmeGA significantly outperforms the simple GA in solving ordering deceptive problems, which are hard sequencing problems defined elsewhere (Kargupta et al., 1992).