摘要
基于差分演化算法提出了一种求解最大可满足问题(MAX-k-SAT)的改进算法,记为IBDE,并通过对一系列随机大规模MAX-k-SAT实例的求解进行验证.实验结果表明:IBDE是一种求解MAX-k-SAT问题非常有效的新方法.
An improved binary differential evolution algorithm （denoted as IBDE） to solving the maximum satisfiability problem （MAX-k-SAT） was put forward,and the improved algorithm was verified by solving a series of random mass MAX-k-SAT instances in this paper.The computational results of IBDE through practicing series of random large-scale instances of MAX-k-SAT showed that IBDE was a new effective algorithm for MAX-k-SAT.
出处
《河南科技学院学报（自然科学版）》
2014年第2期45-48,共4页
Journal of Henan Institute of Science and Technology(Natural Science Edition)
基金
河北省教育厅高等学校科技研究项目(Z2013110)
河北省科技厅科研项目(13210128)
关键词
二进制差分演化
组合优化
MAX-SAT问题
binary differential evolution
combinational optimization problems
MAX-SAT problem
