约束可满足问题求解策略的改进和实验结果

Experiments and Modification of Solving Strategies for Constraint Satisfiability Problems

通过对那些属于NP－Complete的约束可满足问题（如图着色、规划、SAT问题等）的求解实验，指出了局部搜索算法的局限性，由此给出改进的搜索策略．实验结果表明，应用改进的搜索策略使算法效率明显提高．

We used local search combined with some useful strategies to solve some NP-complete con-straint satisfiability problems (CSP) and found the limitatlon of local searching. The algorithm effect has been raised when the modified searching strategies were used.