Participating in timetabling competition ITC2007

with a general purpose CSP solver

T. Ibaraki, M. Atsuta and K. Nonobe

Abstract

We report our experience of participating in ITC2007

with a general purpose CSP (constraint satisfaction problem)

solver which we have developed in these years by using tabu

search idea. In particular, we describe how complicated hard

and soft constraints of timetabling problems are formulated

and handled.