An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem.
Computers & Operations Research(2019)
摘要
•Propose a new Path-Breaking strategy from an elite solution to the inverse solution.•Add Early-Break strategy to avoid inefficient search along the trajectory.•Incorporate weak and strong mutations with restarts to increase the diversity.•Combine stochastic path generating to avoid premature local optimum solutions.
更多查看译文
关键词
Combinatorial optimization,Maximum satisfiability,Local search,Path-Breaking,Mutation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络