An algorithm based on tabu search for satisfiability problem

Authors:
Huang Wenqi;Zhang Defu;Wang Houxiang
Affiliations:
School of Computer, Huazhong University of Science and Technology, Wuhan 430074, P.R. China;School of Computer, Huazhong University of Science and Technology, Wuhan 430074, P.R. China;School of Computer, Huazhong University of Science and Technology, Wuhan 430074, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2002

Citing 7
Cited 5

Efficient local search for very large-scale satisfiability problems

ACM SIGART Bulletin
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT

Artificial Intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Tabu Search

Tabu Search
Tabu search for SAT

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Computers and Operations Research
Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems

Applied Soft Computing
Improving GASAT by replacing tabu search by DLM and enhancing the best members

Artificial Intelligence Review
Random walk with continuously smoothed variable weights

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A survey of the satisfiability-problems solving algorithms

International Journal of Advanced Intelligence Paradigms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a computationally effective algorithm based on tabu search for solving the satisfiability problem (TSSAT) is proposed. Some novel and efficient heuristic strategies for generating candidate neighborhood of the current assignment and selecting variables to be flipped are presented. Especially, the aspiration criterion and tabu list structure of TSSAT are different from those of traditional tabu search. Computational experiments on a class of problem instances show that, TSSAT, in a reasonable amount of computer time, yields better results than Novelty which is currently among the fastest known. Therefore, TSSAT is feasible and effective.