Skip to main content
SpringerLink
Log in

Coloration Neighbourhood Search With Forward Checking

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Two contrasting search paradigms for solving combinatorial problems are systematic backtracking and local search. The former is often effective on highly structured problems because of its ability to exploit consistency techniques, while the latter tends to scale better on very large problems. Neither approach is ideal for all problems, and a current trend in artificial intelligence is the hybridisation of search techniques. This paper describes a use of forward checking in local search: pruning coloration neighbourhoods for graph colouring. The approach is evaluated on standard benchmarks and compared with several other algorithms. Good results are obtained; in particular, one variant finds improved colourings on geometric graphs, while another is very effective on equipartite graphs. Its application to other combinatorial problems is discussed.

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. 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.

    Google Scholar 

  2. D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM 22(4) (1979) 251-256.

    Google Scholar 

  3. J.C. Culberson, A. Beacham and D. Papp, Hiding our colors, in: Proceedings of the CP'95 Workshop on Studying and Solving Really Hard Problems, Cassis, France (1995).

  4. J.C. Culberson and F. Luo, Exploring the k-colorable landscape with iterated greedy, in: [11], pp. 245-284.

  5. A.E. Eiben, J.K. van der Hauw and J.I. van Hemert, Graph coloring with adaptive evolutionary algorithms, Journal of Heuristics 4(1) (1998) 25-46.

    Google Scholar 

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

    Google Scholar 

  7. 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, 1994) pp. 226-237.

  8. F. Glover, M. Parker and J. Ryan, Coloring by tabu branch and bound, in: [11], pp. 285-307.

  9. R.M. Haralick and G.L. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence 14 (1980) 268-277.

    Google Scholar 

  10. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning, Operations Research 3 (1991) 378-406.

    Google Scholar 

  11. 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 (American Mathematical Society, 1996).

  12. D.E. Joslin and D.P. Clements, Squeaky wheel optimization, Journal of Artificial Intelligence Research 10 (1999) 353-373.

    Google Scholar 

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

  14. G. Lewandowski and A. Condon, Experiments with parallel graph coloring heuristics and applications of graph coloring, in: [11], pp. 309-334.

  15. A. Mehrotra and M.A. Trick, A column generation approach to graph colouring, INFORMS Journal on Computing 8 (1996) 344-354.

    Google Scholar 

  16. 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) 161-205.

    Google Scholar 

  17. C. Morgenstern, Distributed coloration neighborhood search, in: [11], pp. 335-357.

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

  19. S.D. Prestwich, Using an incomplete version of dynamic backtracking for graph colouring, in: Proceedings of the Workshop on Large Scale Combinatorial Optimization, Electronic Notes in Discrete Mathematics 1 (1998).

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

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

  22. S.D. Prestwich, Trading completeness for scalability: hybrid search for cliques and rulers, in: Proceedings of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Ashford, Kent, England (2001) pp. 159-174.

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

  24. 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, 1997) pp. 1254-1259.

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

  26. 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.

  27. N. Yugami, Y. Ohta and H. Hara, Improving repair-based constraint satisfaction methods by value propagation, in: Proceedings of the Twelfth National Conference on Artificial Intelligence, Vol. 1 (AAAI Press, 1994) pp. 344-349.

  28. 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 / MIT Press, 1996) pp. 369-374.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National University of Ireland at 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. Coloration Neighbourhood Search With Forward Checking. Annals of Mathematics and Artificial Intelligence 34, 327–340 (2002). https://doi.org/10.1023/A:1014496509129

Download citation

  • Issue Date:

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

Search

Navigation