Skip to main content
SpringerLink
Log in

Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Systematic backtracking is used in many constraint solvers and combinatorial optimisation algorithms. It is complete and can be combined with powerful search pruning techniques such as branch-and-bound, constraint propagation and dynamic variable ordering. However, it often scales poorly to large problems. Local search is incomplete, and has the additional drawback that it cannot exploit pruning techniques, making it uncompetitive on some problems. Nevertheless its scalability makes it superior for many large applications. This paper describes a hybrid approach called Incomplete Dynamic Backtracking, a very flexible form of backtracking that sacrifices completeness to achieve the scalability of local search. It is combined with forward checking and dynamic variable ordering, and evaluated on three combinatorial problems: on the n-queens problem it out-performs the best local search algorithms; it finds large optimal Golomb rulers much more quickly than a constraint-based backtracker, and better rulers than a genetic algorithm; and on benchmark graphs it finds larger cliques than almost all other tested algorithms. We argue that this form of backtracking is actually local search in a space of consistent partial assignments, offering a generic way of combining standard pruning techniques with local search.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M.D. Atkinson, N. Santoro and J. Urrutia, Integer sets with distinct sums and differences and carrier frequency assignments for nonlinear repeaters, IEEE Transactions on Communications 34 (1986) 614-617.

    Google Scholar 

  2. W.C. Babcock, Intermodulation interference in radio systems, Bell Systems Technical Journal (January 1953) 63-73.

  3. A.B. Baker, The hazards of fancy backtracking, in: Proceedings of the Twelfth National Conference on Artificial Intelligence, Vol. 1 (AAAI Press, 1994) pp. 288-293.

  4. E. Balas and W. Niehaus, Finding large cliques in arbitrary graphs by bipartite matching, in: [25, pp. 29-52].

  5. E. Balas, S. Ceria, G. Cornuejols and G. Pataki, Polyhedral methods for the Maximum Clique Problem, in: [25, pp 11-28].

  6. R. Battiti and M. Protasi, Reactive local search for theMaximum Clique Problem, Algorithmica 29(4) (2001) 610-637.

    Google Scholar 

  7. I.M. Bomze, M. Budinich, P.M. Pardalos and M. Pelillo, The Maximum Clique Problem, in: Handbook of Combinatorial Optimization, Vol. 4, eds. D.-Z. Du and P.M. Pardalos (Kluwer Academic, Boston, MA, 1999).

    Google Scholar 

  8. J.-M. Bourjolly, P. Gill, G. Laporte and H. Mercure, An exact quadratic 0-1 algorithm for the stable set problem, in: [25, pp. 53-74].

  9. J.M. Crawford, Solving satisfiability problems using a combination of systematic and local search, in: Second DIMACS Challenge: Cliques, Coloring, and Satisfiability, Rutgers University, NJ (October 1993).

    Google Scholar 

  10. J.M. Crawford and A.B. Baker, Experimental results on the application of satisfiability algorithms to scheduling problems, in: Proceedings of the Twelfth National Conference on Artificial Intelligence, Vol. 2 (AAAI Press, 1994) pp. 1092-1097.

  11. B. De Backer, V. Furnon, P. Kilby, P. Prosser and P. Shaw, Local search in constraint programming: Application to the Vehicle Routing Problem, in: Constraint Programming 97, Proceedings of Workshop on Industrial Constraint-Directed Scheduling (1997).

  12. C. Fleurent and J.A. Ferland, Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique and Satisfiability, in: [25, pp. 619-652].

  13. E.C. Freuder, R. Dechter, M.L. Ginsberg, B. Selman and E. Tsang, Systematic versus stochastic constraint satisfaction, in: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (Morgan Kaufmann, San Mateo, CA, 1995) pp. 2027-2032.

    Google Scholar 

  14. L.E. Gibbons, D.W. Hearn and P.M. Pardalos, A continuous based heuristic for the Maximum Clique Problem, in: [25, pp. 103-124].

  15. M.L. Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research 1 (1993) 25-46.

    Google Scholar 

  16. M.L. Ginsberg and D.A. McAllester, GSAT and dynamic backtracking, in: Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (Morgan Kaufmann, San Mateo, CA, 1994) pp. 226-237.

    Google Scholar 

  17. M.K. Goldberg and R.D. Rivenburgh, Constructing cliques using restricted backtracking, in: [25, pp. 89-102].

  18. C. Gomes, B. Selman and H. Kautz, Boosting combinatorial search through randomization, in: Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference (AAAI Press/The MIT Press, 1998) pp. 431-437.

  19. T. Grossman, Applying the INN model to the Maximum Clique Problem, in: [25, pp. 125-146].

  20. J. Gu, Efficient local search for very large-scale satisfiability problems, SIGART Bulletin 3(1) (1992) 8-12.

    Google Scholar 

  21. W.D. Harvey, Nonsystematic backtracking search, Ph.D. Thesis, Stanford University (1995).

  22. W.D. Harvey and M.L. Ginsberg, Limited discrepancy search, in: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (Morgan Kaufmann, San Mateo, CA, 1995) pp. 607-615.

    Google Scholar 

  23. S. Homer and M. Peinado, Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs, in: [25, pp. 147-168].

  24. A. Jagota, L. Sanchis and R. Ganesan, Approximately solving Maximum Clique using neural network and related heuristics, in [25, pp. 169-204].

  25. D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26 (Amer. Math. Soc., Providence, RI, 1996).

    Google Scholar 

  26. A.K. Jonsson and M.L. Ginsberg, Experimenting with new systematic and nonsystematic search techniques, in: Proceedings of the AAAI Spring Symposium on AI and NP-Hard Problems, Stanford, CA (1993).

  27. N. Jussienc and O. Lhomme, The path-repair algorithm, in: Proceedings of the Workshop on Large Scale Combinatorial Optimization and Constraints, Electronic Notes in Discrete Mathematics, Vol. 4 (1999).

  28. P. Langley, Systematic and nonsystematic search strategies, in: Artificial Intelligence Planning Systems: Proceedings of the First International Conference (1992).

  29. E. Marchiori, A simple heuristic based genetic algorithm for the Maximum Clique Problem, in: Proceedings of the ACM Symposium on Applied Computing (1998) pp. 366-373.

  30. S. Minton, M.D. Johnston, A.B. Philips and P. Laird, Minimizing conflicts: A heuristic repair method for Constraint Satisfaction and Scheduling Problems, Artificial Intelligence 58(1-3) (1992) 160-205.

    Google Scholar 

  31. R. Mohr and T.C. Henderson, Arc and path consistency revisited, Artificial Intelligence 28 (1986) 225-233.

    Google Scholar 

  32. P. Morris, The breakout method for escaping from local minima, in: Proceedings of the 11th National Conference on Artificial Intelligence (AAAI Press, 1993) pp. 40-45.

  33. G. Pesant and M. Gendreau, A view of local search in constraint programming, in: Principles and Practice of Constraint Programming, Proceedings of the Second International Conference, Lecture Notes in Computer Science, Vol. 1118 (Springer, Berlin, 1996) pp. 353-366.

    Google Scholar 

  34. D.G. Pothos and E.B. Richards, An empirical study of min-conflict hill climbing and weak commitment search, in: Proceedings of the CP-95 Workshop on Studying and Solving Really Hard Problems (Cassis, 1995) pp. 140-146.

  35. S.D. Prestwich, Coloration neighbourhood search with forward checking, Annals of Mathematics and Artificial Intelligence 34(4) (2002) 327-340.

    Google Scholar 

  36. S.D. Prestwich, First-solution search with symmetry breaking and implied constraints, in: Proceedings of the CP-2001 Workshop on Modelling and Problem Formulation (2001). (Available at http://www.dcs.gla.ac.uk/pat/cp2001/papers/.)

  37. S.D. Prestwich, A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences, in: Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, Vol. 1894 (Springer, Berlin, 2000) pp. 337-352.

    Google Scholar 

  38. S.D. Prestwich, Stochastic local search in constrained spaces, in: Proceedings of Practical Applications of Constraint Technology and Logic Programming (2000) pp. 27-39.

  39. W.T. Rankin, Optimal Golomb rulers: An exhaustive parallel search implementation, Master's Thesis, Duke University (1993).

  40. E.T. Richards and B. Richards, Non-systematic search and learning: An empirical study, in: Principles and Practice of Constraint Programming, Proceedings of the Fourth International Conference, Lecture Notes in Computer Science, Vol. 1520 (Springer, Berlin, 1998) pp. 370-384.

    Google Scholar 

  41. D. Sabin and G. Freuder, Understanding and improving the MAC algorithm, in: Principles and Practice of Constraint Programming, Proceedings of the Third International Conference, Lecture Notes in Computer Science, Vol. 1330 (Springer, Berlin, 1999) pp. 167-181.

    Google Scholar 

  42. A. Schaerf, Combining local search and look-ahead for Scheduling and Constraint Satisfaction problems, in: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (Morgan Kaufmann, San Mateo, CA, 1997) pp. 1254-1259.

    Google Scholar 

  43. B. Selman, H. Levesque and D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of the 10th National Conference on Artificial Intelligence (MIT Press, 1992) pp. 440-446.

  44. P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, in: Principles and Practice of Constraint Programming, Proceedings of the Fourth International Conference, Lecture Notes in Computer Science, Vol. 1520 (Springer, Berlin, 1998) pp. 417-431.

    Google Scholar 

  45. S.W. Soliday, A. Homaifar and G.L. Libby, Genetic algorithm approach to the search for Golomb rulers, in: Proceedings of the Sixth International Conference on Genetic Algorithms, Vol. 1 (Morgan Kaufmann, San Mateo, CA, 1995) pp. 528-535.

    Google Scholar 

  46. P. Soriano and M. Gendreau, Tabu search algorithms for the Maximum Clique Problem, in: [25, pp. 221-244].

  47. B. Smith, K. Stergiou and T.Walsh, Modelling the Golomb Ruler problem, Research Report 1999.12, University of Leeds, England (June 1999). Presented at the IJCAI'99 Workshop on Non-Binary Constraints.

    Google Scholar 

  48. G. Verfaillie and T. Schiex, Solution reuse in dynamic constraint satisfaction problems, in: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI Press, 1994) pp. 307-312.

  49. M. Yokoo, Weak-commitment search for solving constraint satisfaction problems, in: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI Press, 1994) pp. 313-318.

  50. H. Zhang and M.E. Stickel, Implementing the Davis-Putnam method, Journal of Automated Reasoning 24(1-2) (2000) 77-296.

    Google Scholar 

  51. J. Zhang and H. Zhang, Combining local search and backtracking techniques for constraint satisfaction, in: Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Conference on Innovative Applications of Artificial Intelligence (AAAI Press/The MIT Press, 1996) pp. 369-374.

Download references

Author information

Authors and Affiliations

  1. Cork Constraint Computation Centre, Department of Computer Science, University College, Cork, Ireland

    Steven Prestwich

Authors
  1. Steven Prestwich
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prestwich, S. Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search. Annals of Operations Research 115, 51–72 (2002). https://doi.org/10.1023/A:1021140902684

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021140902684

Search

Navigation