| 一种求解MAX-k-SAT问题的新方法 |
| |
| 引用本文： | 宋建民,弓小影.一种求解MAX-k-SAT问题的新方法[J].河南职业技术师范学院学报,2014(2):45-48. |
| |
| 作者姓名： | 宋建民 弓小影 |
| |
| 作者单位： | 石家庄经济学院数理学院,河北石家庄050031 |
| |
| 基金项目： | 河北省教育厅高等学校科技研究项目（Z2013110）;河北省科技厅科研项目（13210128） |
| |
| 摘 要： | 基于差分演化算法提出了一种求解最大可满足问题（MAX-k-SAT）的改进算法,记为IBDE,并通过对一系列随机大规模MAX-k-SAT实例的求解进行验证。实验结果表明：IBDE是一种求解MAX-k-SAT问题非常有效的新方法。
|
| 关 键 词： | 二进制差分演化 组合优化 MAX-SAT问题 |
Solving MAX-k-SAT problems by improved differential evolution algorithm |
| |
| Song Jianmin,Gong Xiaoying.Solving MAX-k-SAT problems by improved differential evolution algorithm[J].Journal of Henan Vocation-Technical Teachers College,2014(2):45-48. |
| |
| Authors: | Song Jianmin Gong Xiaoying |
| |
| Institution: | Song Jianmin, Gong Xiaoying |
| |
| Abstract: | 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. |
| |
| Keywords: | binary differential evolution combinational optimization problems MAX-SAT problem |
| 本文献已被 维普 等数据库收录！ |
