结合look-ahead值排序的自适应分支求解算法

Novel adaptive branching constraint solving algorithm with look-ahead strategy

基于新近提出的自适应分支约束求解框架,结合look-ahead值启发式,提出一种新的约束求解算法AdaptBranchLVO。为验证算法效率,在标准测试库上进行了充分对比实验。结果表明,新提出算法在效率上明显优于已有的自适应分支求解算法。

Based on the state-of-the-art scheme of adaptive branching constraint solving, a novel algorithm named AdaptBranchLv~ was proposed, combined with the look-ahead value ordering heuristics. To demonstrate the efficiency of AdaptBranchLVO, sufficient experiments on the wide range of the problem instances in Benchmark were carried out, and the experiment results show that AdaptBranchLVO outperforms the existing adaptive branching constraint algorithm by a large margin.