Construction and Repair: A Hybrid Approach to Search in CSPs

  • Konstantinos Chatzikokolakis
  • George Boukeas
  • Panagiotis Stamatopoulos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3025)


In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables are instantiated. If the current partial assignment is proved to be inconsistent, it is then necessary to backtrack and perform alternative instantiations. On the other hand, reparative methods iteratively repair an inconsistent complete assignment until it becomes consistent. In this research, we investigate an approach which allows for the combination of constructive and reparative methods, in the hope of exploiting their intrinsic advantages and circumventing their shortcomings. Initially, we discuss a general hybrid method called cr and then proceed to specify its parameters in order to provide a fully operational search method called cnr. The reparative stage therein is of particular interest: we employ techniques borrowed from local search and propose a general cost function for evaluating partial assignments. In addition, we present experimental results on the open-shop scheduling problem. The new method is compared against specialized algorithms and exhibits outstanding performance, yielding solutions of high quality and even improving the best known solution to a number of instances.


constraint satisfaction search heuristics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Nareyek, A., Smith, S.F., Ohler, C.M.: Integrating local-search advice into refinement search (or not). In: Proceedings of the CP 2003 Third International Workshop on Cooperative Solvers in Constraint Programming, pp. 29–43 (2003)Google Scholar
  2. 2.
    Zhang, J., Zhang, H.: Combining local search and backtracking techniques for constraint satisfaction. In: AAAI 1996, pp. 369–374 (1996)Google Scholar
  3. 3.
    Schaerf, A.: Combining local search and look-ahead for scheduling and constraint satisfaction problems. In: IJCAI 1997, pp. 1254–1259 (1997)Google Scholar
  4. 4.
    Roos, N., Ran, Y., van den Herik, H.J.: Combining local search and constraint propagation to find a minimal change solution for a dynamic csp. In: Cerri, S.A., Dochev, D. (eds.) AIMSA 2000. LNCS (LNAI), vol. 1904, pp. 272–282. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Prestwich, S.: Combining the scalability of local search with the pruning techniques of systematic search. Annals of Operations Research 115, 51–72 (2002)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Jussien, N., Lhomme, O.: Local search with constraint propagation and conflictbased heuristics. Artificial Intelligence 139, 21–45 (2002)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58, 161–205 (1992)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of the ACM 23, 665–679 (1976)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)MATHCrossRefGoogle Scholar
  10. 10.
    Brucker, P., Hurink, J., Jurich, B., Wostmann, B.: A branch-and-bound algorithm for the open-shop problem. Discrete Applied Mathematics 76, 43–59 (1997)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Guéret, C., Prins, C.: A new lower bound for the open-shop problem. Annals of Operations Research 92, 165–183 (1999)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Prins, C.: Competitive genetic algorithms for the open shop scheduling problem. Mathematical Methods of Operations Research 52, 389–411 (2000)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Alcaide, D., Sicilia, J., Vigo, D.: A tabu search algorithm for the open shop problem. Trobajos de Investigación Operativa 5, 283–297 (1997)MATHMathSciNetGoogle Scholar
  14. 14.
    Liaw, C.F.: A tabu search algorithm for the open shop scheduling problem. Computers and Operations Research 26, 109–126 (1999)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Guéret, C., Jussien, N., Prins, C.: Using intelligent backtracking to improve branchand- bound methods: An application to open-shop problems. European Journal of Operational Research 127, 344–354 (2000)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Konstantinos Chatzikokolakis
    • 1
  • George Boukeas
    • 1
  • Panagiotis Stamatopoulos
    • 1
  1. 1.Department of Informatics and TelecommunicationsUniversity of AthensPanepistimiopolis, AthensGreece

Personalised recommendations