摘要
在研究了各种求解CSP问题方法的基础上,提出了一个基于分层技术的混合算法,从理论上分析了该方法能以少的代价来缩小搜索空间,并且能求出全部解的特点.最后用一个经典问题——皇后问题作为例证,求解的结果表明该方法是有效的.
In this paper,a class of mixed algorithms for TSP problems based stratified thinking is presented after studying the various methods.We also analyze characteristics of this class of methods:it can decrease research space with less cost and get all solutions.Finally we use classical Queen problems as an examplification by simulating on computer.The result shows that the new algorithms are effective.
出处
《广西师范大学学报（自然科学版）》
CAS
2003年第A01期95-97,共3页
Journal of Guangxi Normal University:Natural Science Edition
关键词
回溯法
状态空间
皇后问题
Backtracking method
state space
Queen problem
