Skip to main content

2003 | OriginalPaper | Buchkapitel

A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms

verfasst von : William A. Greene

Erschienen in: Genetic and Evolutionary Computation — GECCO 2003

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heuristic provides very quick solutions to several problems which have been touted in the literature as especially hard ones for genetic algorithms, such as hierarchical deceptive problems. We suggest why the heuristic works well.

Metadaten
Titel
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
verfasst von
William A. Greene
Copyright-Jahr
2003
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-45110-2_35

Neuer Inhalt