Empirical studies of heuristic local search for constraint solving

  • Jin-Kao Hao
  • Raphaël Dorne
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1118)


The goal of this paper is twofold. First, we introduce a class of local search procedures for solving optimization and constraint problems. These procedures are based on various heuristics for choosing variables and values in order to examine a general neighborhood. Second, four combinations of heuristics are empirically evaluated by using the graph-coloring problem and a real world application — the frequency assignment problem. The results are also compared with those obtained with other approaches including simulated annealing, Tabu search, constraint programming and heuristic graph coloring algorithms. Empirical evidence shows the benefits of this class of local search procedures for solving large and hard instances.


Local search constraint solving combinatorial optimization graph coloring frequency assignment 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D.H. Ackley, A connectionist machine for genetic hillclimbing. Kluwer Academic Publishers, 1987.Google Scholar
  2. 2.
    R. Dorne and J.K. Hao, “Constraint handling in evolutionary search: a case study about the frequency assignment”, Submitted to the 4th Intl. Conf. on Parallel Problem Solving from Nature (PPSN'96), Berlin, Germany, Sept. 1996.Google Scholar
  3. 3.
    C. Fleurent and J.A. Ferland, “Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability”, in D.S. Johnson and M.A. Trick (eds.) “2nd DIMACS Implementation Challenge” (to appear).Google Scholar
  4. 4.
    C. Fleurent and J.A. Ferland, “Genetic and hybrid algorithms for graph coloring”, to appear in G. Laporte, I. H. Osman, and P. L. Hammer (eds.), Special Issue Annals of Operations Research on Meta-heuristics in Combinatorial Optimization.Google Scholar
  5. 5.
    E.C. Freuder and R.J. Wallace, “Partial constraint satisfaction”, Artificial Intelligence, Vol.58(1–3), pp21–70, 1992.Google Scholar
  6. 6.
    F. Glover and M. Laguna, “Tabu Search”, in C. R. Reeves (eds.) Modern Heuristics for Combinatorial Problems, Blackwell Scientific Publishing, Oxford, Great Britain.Google Scholar
  7. 7.
    P. Hensen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing Vol.44, pp279–303, 1990.Google Scholar
  8. 8.
    A. Hertz and D. de Werra, “Using Tabu search techniques for graph coloring”. Computing Vol.39, pp345–351, 1987.Google Scholar
  9. 9.
    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, Vol.39(3), 378–406, 1991.Google Scholar
  10. 10.
    B.W. Kernighan and S. Lin, “An efficient heuristic for partitioning graphs”, Bell System Technology Journal, Vol.49, 1970.Google Scholar
  11. 11.
    S. Kirkpatrick, C.D. Gelatt Jr. and M.P. Vecchi, “Optimization by simulated annealing”, Science No.220, 671–680, 1983.Google Scholar
  12. 12.
    S. Lin and B.W. Kernighan, “An efficient heuristic for the traveling-salesman problem”, Operations Research, Vol.21, pp498–516, 1973.Google Scholar
  13. 13.
    S. Minton, M.D. Johnston and P. Laird, “Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems”, Artificial Intelligence, Vol.58(1–3), pp161–206, 1992.Google Scholar
  14. 14.
    C.H. Papadimitriou and K. Steiglitz, “Combinatorial optimization — algorithms and complexity”. Prentice Hall, 1982.Google Scholar
  15. 15.
    A. Ortega, J.M. Raibaud, M.Karray, M.Marzoug, and A.Caminada, “Algorithmes de coloration des graphes et d'affectation des fréquences”. TR CNET, N-T/PAB/SRM/RRM/4353, August 1995.Google Scholar
  16. 16.
    B. Selman, H.J. Levesque and M. Mitchell, “A new method for solving hard satisfiability problems”. Proc. of AAAI-92, San Jose, CA, pp.440–446, 1992.Google Scholar
  17. 17.
    B. Selman and H.Kautz, “Domain-independent extensions to GSAT: solving large structured satisfiability problems”. Proc. of IJCAI-93, Chambery, France, 1993.Google Scholar
  18. 18.
    E. Tsang, “Foundations of constraint satisfaction”, Academic Press, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jin-Kao Hao
    • 1
  • Raphaël Dorne
    • 1
  1. 1.Parc Scientifique Georges BesseLGI2P EMA-EERIENîmesFrance

Personalised recommendations