Iterative Improvement Techniques for Solving Tight Constraint Satisfaction Problems

@inproceedings{Zou2003IterativeIT,
  title={Iterative Improvement Techniques for Solving Tight Constraint Satisfaction Problems},
  author={Hui Zou},
  year={2003}
}
In this thesis, we explore two iterative improvement techniques: a heuristic hill-climbing strategy (denoted LS) and a multi-agent based search (denoted ERA). We focus our investigations on one small but challenging real-world application, which is the assignment of Graduate Teaching Assistants (GTA) to academic tasks. We design and implement the LS and ERA mechanisms to solve this application. We propose and test various heuristic improvements. Finally, we compare the performance of these… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-5 of 5 references

On-Line Guide to Constraint Programming

  • R. Barták
  • kti.ms.mff.cuni.cz/̃ bartak/constraints
  • 1998
Highly Influential
8 Excerpts

Constraint solvi

  • Bistarelliet al, 1995 S. Bistarelli, U. Montanari, F. Rossi
  • 1995

Similar Papers

Loading similar papers…