An algorithm Based on Tabu Search for Satisfiability Problem

在线阅读 下载PDF 导出详情
摘要 Inthispaper,acomputationallyeffectivealgorithmbasedontabusearchforsolvingthesatisfiabilityproblem(TSSAT)isproposed.Somenovelandefficientheuristicstrategiesforgeneratingcandidateneighborhoodofthecurredassignmentandselectingvaribablestobeflippedarepresented.Especially,theaspirationcriterionandtabulisttructureofTSSATaredifferentfromthoseoftraditionaltabusearch.Computationalexperimentsonaclassofprobleminsteancesshowthat,TSSAT,inareasonableamountofcomputertime,yieldsbetterresultsthanNoveltywhichiscurrentlyamongthefastestknown.ThereforeTSSATisfeasibleandeffective.
机构地区 不详
出版日期 2002年03月13日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献