Distributed model for university course timetabling problem

We are interested, in this paper, to solve the university course timetabling problem. We present a multi-agent model named M.A.T.P (Multi-Agent model for university Timetabling Problem). Our model is based on cooperative agents enabling highly parallel and distributed processing of the problem and incorporating new constraints that have not been taken into account by previous works. The goal of our model is to provide a best solution satisfying hard and soft constraints while reducing temporal complexity. To evaluate the performance of our model, we choose to address a real case (instances of the Higher Business School of Tunis) where we realize a test scenario by analyzing the variation of the number of messages in terms of the assignment priority score and its effect on the execution time.