Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts

A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, augmented by a coarse-grained local search algorithm that learns favorable value heuristics over the course of several restarts. Numerical results show that this method can speed-up complete search by orders of magnitude.

[1]  Pierre Hansen,et al.  A Tutorial on Variable Neighborhood Search , 2003 .

[2]  Wheeler Ruml,et al.  Complete Local Search for Propositional Satisfiability , 2004, AAAI.

[3]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[4]  Eric Horvitz,et al.  Dynamic restart policies , 2002, AAAI/IAAI.

[5]  Paul Shaw,et al.  A new local search algorithm providing high quality solutions to vehicle routing problems , 1997 .

[6]  Bart Selman,et al.  Heavy-Tailed Distributions in Combinatorial Search , 1997, CP.

[7]  Djamal Habet,et al.  A Hybrid Approach for SAT , 2002, CP.

[8]  Meinolf Sellmann,et al.  Streamlined Constraint Reasoning , 2004, CP.

[9]  Hantao Zhang,et al.  Another Complete Local Search Method for SAT , 2005, LPAR.

[10]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[11]  Andrew W. Shogan,et al.  Semi-greedy heuristics: An empirical study , 1987 .

[12]  Andrea Lodi,et al.  Local Search and Constraint Programming , 2003, Handbook of Metaheuristics.

[13]  John N. Hooker,et al.  A Search-Infer-and-Relax Framework for Integrating Solution Methods , 2005, CPAIOR.

[14]  Kenneth N. Brown,et al.  Robust Constraint Solving Using Multiple Heuristics , 2005, CP.

[15]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[16]  Susan L. Epstein,et al.  The Adaptive Constraint Engine , 2002, CP.

[17]  David Zuckerman,et al.  Optimal Speedup of Las Vegas Algorithms , 1993, Inf. Process. Lett..

[18]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

[19]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[20]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[21]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[22]  Steven Prestwich,et al.  Randomised Backtracking for Linear Pseudo-Boolean Constraint Problems , 2002 .

[23]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[24]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[25]  Bart Selman,et al.  Balance and Filtering in Structured Satisfiable Problems , 2001, IJCAI.