求解可满足性问题全部解的改进多种群克隆免疫算法

Improved Clonal Immune Algorithm for All Solutions of SAT Based on Multi-population

  • 摘要: 对于可满足性问题全部解(ALLSAT问题)的求解而言,随着问题规模增大,现有算法逐渐变得不适用.针对不能有效求解ALLSAT问题的现状,提出了一种多种群克隆免疫算法,该算法采用小生境方法和位爬山算法进行优化,维持种群多样性,提高算法收敛速度进行了算法收敛性分析.ALLSAT问题的求解结果表明,该算法是非常有效的.

     

    Abstract: For the solutions of ALLSAT(all solutions of satisfiability) problem,the existing algorithms are gradually becoming not applicable with the increase of the problem size.Therefor,a clonal immune algorithm based on multi-population is presented,and it is optimized by niche and bit climbing hill methods.Herein,population diversity is maintained and algorithm convergence speed is improved.Further,the convergence of the algorithm is analyzed.All results of application to ALLSAT show that the algorithm is very effective.

     

/

返回文章
返回