Fine Local Tuning

  • Zbigniew Michalewicz
Part of the Artificial Intelligence book series (AI)


Genetic algorithms display inherent difficulties in performing local search for numerical applications. Holland suggested [89] 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 [81]:

“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.”


Genetic Algorithm Local Search Evolution Program Test Problem Optimal Control Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

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

Personalised recommendations