Distributed University Timetabling with Multiply Sectioned Constraint Networks

Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed timetabling problems (DisTTPs) was studied as distributed constraint satisfaction problems (DisCSPs). We present an alternative method for solving DisTTPs based on multiply sectioned constraint networks (MSCNs). The proposed solution has several distinguishing features: Unlike the existing algorithms for DisCSPs whose worst-case time complexities are exponential, the algorithm suite based on MSCNs is efficient when the network topology is sparse. Unlike the existing DisTTP algorithm where a central agent is needed, there is no need for a central agent in the proposed solution. Unlike the existing DisTTP algorithm where partial timetables of other agents must be disclosed to the central agent, the proposed method keeps partial timetables of all agents private. We report our preliminary experimental result on distributed university timetabling problems (DisUTTPs).

[1]  Amnon Meisels,et al.  Asynchronous Forward-checking for DisCSPs , 2007, Constraints.

[2]  Yang Xiang,et al.  Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks , 2007, Canadian Conference on AI.

[3]  Boi Faltings,et al.  Asynchronous aggregation and consistency in distributed constraint satisfaction , 2005, Artif. Intell..

[4]  Christian Bessiere,et al.  Asynchronous backtracking without adding links: a new member in the ABT family , 2005, Artif. Intell..

[5]  Ben Paechter,et al.  A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem , 2002, PATAT.

[6]  Amnon Meisels,et al.  Scheduling Agents - Distributed Timetabling Problems(DisTTP) , 2002, PATAT.

[7]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[8]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[9]  Barry McCollum.  A Perspective on Bridging the Gap in University Timetabling , 2007 .

[10]  Makoto Yokoo,et al.  The distributed breakout algorithms , 2005, Artif. Intell..

[11]  Yang Xiang,et al.  PROBABILISTIC REASONING IN MULTIAGENT SYSTEMS: A GRAPHICAL MODELS APPROACH, by Yang Xiang, Cambridge University Press, Cambridge, 2002, xii + 294 pp., ISBN 0-521-81308-5 (Hardback, £45.00). , 2002, Robotica.

[12]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[13]  M. Yokoo,et al.  Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems , 1996 .

[14]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.