Abstract

Genetic algorithms display inherent difficulties in performing local search for numerical applications. Holland suggested [142] that the genetic algorithm should be used as a preprocessor to perform the initial search, before turning the search process over to a system that can employ domain knowledge to guide the local search. As observed in [129]:

“Like natural genetic systems, GAs progress by virtue of changing the distribution of high performance substructures in the overall population; individual structures are not the focus of attention. Once the high performance regions of the search space are identified by a GA, it may be useful to invoke a local search routine to optimize the members of the final population.”

Keywords

Lution 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Zbigniew Michalewicz
    • 1
  1. 1.Department of Computer ScienceUniversity of North CarolinaCharlotteUSA

Personalised recommendations