| 基于演化算法的SAT问题求解 |
| |
| 引用本文： | 陈昊. 基于演化算法的SAT问题求解[J]. 湖北大学学报(自然科学版), 2007, 29(2): 138-140 |
| |
| 作者姓名： | 陈昊 |
| |
| 作者单位： | 湖北大学,数学与计算机科学学院,湖北,武汉,430062 |
| |
| 摘 要： | 演化计算方法是近年来迅速发展起来的一种全新随机搜索和优化方法.首先介绍了演化算法的基本原理,然后给出了基于演化思想求解著名逻辑学问题——布尔可满足问题(SAT)的过程,最后分析了该方法的主要特点.
|
| 关 键 词： | 演化计算 NP难 交叉 变异 |
| 文章编号： | 1000-2375（2007）02-0138-03 |
| 收稿时间： | 2006-01-04 |
| 修稿时间： | 2006-01-04 |
Solving the SAT problem based on evolutionary algorithm |
| |
| CHEN Hao. Solving the SAT problem based on evolutionary algorithm[J]. Journal of Hubei University(Natural Science Edition), 2007, 29(2): 138-140 |
| |
| Authors: | CHEN Hao |
| |
| Affiliation: | School of Mathematics and Computer Science, Hubei University, Wuhan 430062,China |
| |
| Abstract: | Evolutionary algorithm is a novel random search and optimization method in recent years.Firstly the basic principle of evolutionary algorithm is introduced,then the processes of solving the famous logic problem SAT based on evolutionary thought are mainly discussed.Conclusions are made with the investigation of several essential features of evolutionary algorithm. |
| |
| Keywords: | evolutionary algorithm NP hard crossover mutation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
