首页> 外文会议>International Conference on Natural Computation >A self-adaptive differential evolution algorithm for binary CSPs
【24h】

A self-adaptive differential evolution algorithm for binary CSPs

机译:二元CSP的自适应差分演化算法

获取原文
获取外文期刊封面目录资料

摘要

A novel self-adaptive differential evolution (SADE) algorithm is proposed in this paper. SADE adjusts the mutation rate F and the crossover rate CR adaptively, taking account of the different distribution of population. In order to balance of an individual's exploration and exploitation capability for different evolving phase, F and CR equal to two different self-adjusted nonlinear functions. F and CR vary dynamically with each generation evolution. SADE maintains the diversity of population and improves the global convergence ability. It also improves the efficiency and success rate and avoids the premature convergence. Simulation and comparisons based on test-sets of CSPs demonstrate the effectiveness, efficiency and robustness of the proposed algorithm.
机译:本文提出了一种新颖的自适应差分演化(SADE)算法。 SAID适当地调整突变率F和交叉速率CR,考虑到不同人口分布。为了平衡个人的探索和利用,针对不同的演化阶段,F和CR等于两个不同的自调整非线性功能。 F和CR随着每个一代演变而动态变化。 SADE保持人口的多样性,提高了全球收敛能力。它还提高了效率和成功率,避免了过早收敛。基于CSP的测试组的仿真和比较证明了所提出的算法的有效性,效率和鲁棒性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号