信息与控制2011，Vol.40Issue(1)：34-38,5.DOI:10.3724/SP.J.1219.2011.00034
求解可满足性问题全部解的改进多种群克隆免疫算法
Improved Clonal Immune Algorithm for All Solutions of SAT Based on Multi-population
摘要
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.关键词
可满足性问题/多种群/克隆免疫算法/位爬山算法/小生境分类
信息技术与安全科学引用本文复制引用
张英杰,范朝冬..求解可满足性问题全部解的改进多种群克隆免疫算法[J].信息与控制,2011,40(1):34-38,5.基金项目
国家自然科学基金资助项目(60634020) （60634020）
湖南省科技计划重点资助项目(2010GK2022). （2010GK2022）
