• DocumentCode
    532364
  • Title

    An improved differential evolution algorithm for binary CSPs

  • Author

    Ye, Qiangsheng

  • Author_Institution
    Coll. of Comput. Sci. & Technol., Jilin Bus. & Technol. Coll., Jilin, China
  • Volume
    7
  • fYear
    2010
  • fDate
    22-24 Oct. 2010
  • Abstract
    An improved differential evolution (IDE) algorithm is presented in this paper to solve binary constraint satisfaction problems (CSPs). To improve the performance IDE adjust the mutation rate F and the crossover rate CR dynamically with taking account of the different distribution of population. We use IDE to maintain the diversity of population and improve the global convergence ability. The experimental results show that our improved differential evolution algorithm is effective and efficient to solve binary CSPs.
  • Keywords
    operations research; optimisation; binary constraint satisfaction problems; improved differential evolution algorithm; Boolean functions; Computers; Data structures; CSPs; Improved; differential evolution;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Application and System Modeling (ICCASM), 2010 International Conference on
  • Conference_Location
    Taiyuan
  • Print_ISBN
    978-1-4244-7235-2
  • Electronic_ISBN
    978-1-4244-7237-6
  • Type

    conf

  • DOI
    10.1109/ICCASM.2010.5620418
  • Filename
    5620418
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=532364