• DocumentCode
    2316747
  • Title

    Novel binary Differential Evolution without scale factor F

  • Author

    Deng, Changshou ; Zhao, Bingyan ; Yang, Yanling ; Deng, Anyuan

  • Author_Institution
    Sch. of Inf. Sci. & Technol., Jiujiang Univ., Jiujiang, China
  • fYear
    2010
  • fDate
    25-27 Aug. 2010
  • Firstpage
    250
  • Lastpage
    253
  • Abstract
    Differential Evolution is a competitive optimization technique over continuous space. The operation in the original Differential Evolution is simple, however, the mechanism, in the Differential Evolution makes it practically impossible to effectively use the original Differential Evolution to the binary space. A novel binary mutation operation was defined to enable the Differential Evolution to operate within the binary space. The new binary mutation works well in the binary space without the original scale factor F. Initial experimental results of three different sizes of knapsack problems and the One-Max problem indicate the effectiveness and validity of the binary Differential Evolution operating in binary space.
  • Keywords
    evolutionary computation; knapsack problems; binary differential evolution; binary mutation operation; binary space; competitive optimization technique; knapsack problem; one max problem; scale factor F; Chromium; Convergence; Educational institutions; Encoding; Flowcharts; Information science; Optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advanced Computational Intelligence (IWACI), 2010 Third International Workshop on
  • Conference_Location
    Suzhou, Jiangsu
  • Print_ISBN
    978-1-4244-6334-3
  • Type

    conf

  • DOI
    10.1109/IWACI.2010.5585113
  • Filename
    5585113