Advertisement

Dynamic constraint weighting for over-constrained problems

  • John Thornton
  • Abdul Sattar
Search (Constraint Satisfaction, Heuristic Search)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1531)

Abstract

Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of Constraint Satisfaction Problems. However, little work has been done in applying such algorithms to over-constrained problems with mandatory or hard constraints. The difficulty has been finding a weighting scheme that can weight unsatisfied constraints and still maintain the distinction between mandatory and non-mandatory constraints. This paper presents a new weighting strategy that simulates the transformation of an over-constrained problem with mandatory constraints into an equivalent problem where all constraints have equal importance, but the hard constraints have been repeated. In addition, two dynamic constraint weighting schemes are introduced that alter the number of simulated hard constraint repetitions according to feedback received during the search. The results show the dynamic strategies outperform two fixed repetition approaches on a test bed of over-constrained timetabling and nurse rostering problems.

Keywords

Local Search Weighting Strategy Constraint Satisfaction Problem Soft Constraint Hard Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cha, B., Iwama, K.: Adding new clauses for faster local search. In: Proc. of AAAI’96, (1996) 332–337Google Scholar
  2. 2.
    Cha, B., Iwama, K., Kambayashi, Y., Miyazaki S.: Local search algorithms for partial MAXSAT. In: Proc. of AAAI’97, (1997) 332–337Google Scholar
  3. 3.
    Frank, J.: Learning short-term weights for GSAT. In: Proc. of AAAI’97, (1997) 384–389Google Scholar
  4. 4.
    Glover, F.: Tabu search-part 1. ORSA Journal on Computing, 1(3) (1989) 190–206zbMATHGoogle Scholar
  5. 5.
    Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artif. Intell. 58 (1992) 161–205zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Morris, P.: The breakout method for escaping local from minima. In: Proc. of AAAI’93, (1993) 40–45Google Scholar
  7. 7.
    Selman, B., Kautz, H.: Domain independent extensions to GSAT: Solving large structured satisfiability problems. In: Proc. of IJCAI’93, (1993) 290–295Google Scholar
  8. 8.
    Thornton, J., Sattar, A.: Applied partial constraint satisfaction using weighted iterative repair. In: Sattar, A. (ed.): Advanced Topics in Artificial Intelligence. LNAI Vol. 1342. Springer-Verlag (1997) 57–66Google Scholar
  9. 9.
    Thornton, J., Sattar, A.: Using arc weights to improve iterative repair. In: Proc. of AAAI ’98, (1998) 367–372Google Scholar
  10. 10.
    Wallace, J., Freuder, E.: Heuristic methods for over-constrained constraint satisfaction problems. In: Jampel, M., Freuder, E., Maher, M. (eds.): Over-Constrained Systems. LNCS Vol. 1106. Springer-Verlag (1996) 207–216Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • John Thornton
    • 1
  • Abdul Sattar
    • 2
  1. 1.School of Information TechnologyGriffith University Gold CoastSouthportAustralia
  2. 2.School of Computing and Information TechnologyGriffith UniversityNathanAustralia

Personalised recommendations