Memetic Algorithms in Discrete Optimization

  • Jin-Kao Hao
Part of the Studies in Computational Intelligence book series (SCI, volume 379)


Discrete optimization concerns in essence the search for a “best” configuration (optimal solution) among a set of finite candidate configurations according to a particular criterion. There are several ways to describe a discrete optimization problem. In its most general form, it can be defined as a collection of problem instances, each being specified by a pair (S,f) [704], where S is the set of finite candidate configurations, defining the search space; f is the cost or objective function, given by a mapping f: S → R + .


Local Search Candidate Solution Memetic Algorithm Discrete Optimization Local Search Algorithm 
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 2012

Authors and Affiliations

  • Jin-Kao Hao
    • 1
  1. 1.LERIAUniversité dÁngersAngersFrance

Personalised recommendations