Simulated Binary Crossover for Continuous Search Space

  • Deb K
  • Agrawal R
  • 288


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


The success of binary-coded genetic algorithms (GAs) in problems having discrete search space largely depends on the coding used to represent the problem variables and on the crossover operator that propagates building-blocks from parent strings to children strings. In solving optimization problems having continuous search space, binary-coded GAs discretize the search space by using a coding of the problem variables in binary strings. However, the coding of real-valued variables in...

Author-supplied keywords

  • croisement
  • genetique
  • multiobjectifs
  • optimisation

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Kalyanmoy Deb

  • Ram Bhushan Agrawal

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free