An improved Differential Evolution Algorithm for Binary CSPs

摘要：

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.

关键词： differential evolution Improved CSPs

作者: Qiangsheng Ye

作者单位: College of computer science and technology Jilin bussiness and technology college

会议类型: 国际会议

会议名称: The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

会议地点: 太原

会议语种:英文

页码: 630-634

在线出版日期: 2010-10-22（万方平台首次上网日期，不代表论文的发表时间）