Abstract
Here we introduce DePathos, a graphical tool for a time-tabling constraint engine (Pathos). Since the core of Pathos is text-based and provides little user-interaction, finding an appropriate solution for large problems (1000-2000 variables) can be a very time consuming process requiring the constant supervision of a constraint programming expert. DePathos uses an incremental solution strategy. Such strategy subdivides the problem and checks the consistency of the resulting subdivisions before incrementally unifying them. This has shown to be useful in finding inconsistencies and discovering over-constrained situations. Our incremental solution is based on hierarchical groupings defined at the problem domain level. This allows users to direct the timetabling engine in finding partial solutions that are meaningful in practice. We discuss the lessons learned from using Pathos in real settings, as well as the experiences of coupling DePathos to the timetabling engine.
This work was partially supported by the Colombian Institute for Science and Technology Development (Colciencias) under the CRISOL project (Contract No.298-2002).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Boufflet, J.P., Nègre, S.: Three methods used to solve an examination timetable problem. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153. Springer, Heidelberg (1996)
Elmohamed, M.A.S., Coddington, P., Fox, G.: A comparison of annealing techniques for academic course scheduling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, p. 92. Springer, Heidelberg (1998)
Fruhwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2002)
Geller, S.: Timetabling at the University of Sheffield, UK - an incremental approach to timetable development. Practice and Theory of Automated Timetabling (2002)
Henz, M., Wurtz, J.: Using oz for college timetabling. In: International Conference on the Practice and Theory of Automated Timetabling (1995)
Kaneko, K., Yoshikawa, M., Nakakuki, Y.: Improving a heuristic repair method for large-scale school timetabling problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 275–288. Springer, Heidelberg (1999)
Legierski, W.: Using Mozart for Timetabling Problems. In: Proceedings of the CPDC 2001 Workshop on Constraint Programming for Decision and Control (2001)
Marte, M.: Models and Algorithms for School Timetabling - A Constraint-Programming Approach. Dissertation/Ph.D. thesis, Institute of Computer Science, LMU, Munich (2003)
Pabón, G., Rodriguez, C.: Reingeniería de PATHOS (In Spanish). B.Sc. Thesis - Universidad Javeriana, Cali (2003), Available at http://correo.puj.edu.co/japerezp/Crisol/
Rich, D.C.: A Smart Genetic Algorithm for University Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 181–197. Springer, Heidelberg (1996)
Rueda, C., Díaz, J.F., Quesada, L.O., García, C., Cetina, S.: Pathos: Object-oriented concurrent constraint timetabling for real world cases. In: Proceedings, XXVIII Latin-American Conference on Informatics, Uruguay (2002)
Wasacz, D.: Timetabling with CHIP. In: Proceedings of the CPDC 1999 Workshop on Constraint Programming for Decision and Control (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delgado, A., Pérez, J.A., Pabón, G., Jordan, R., Díaz, J.F., Rueda, C. (2005). An Interactive Tool for the Controlled Execution of an Automated Timetabling Constraint Engine. In: Van Roy, P. (eds) Multiparadigm Programming in Mozart/Oz. MOZ 2004. Lecture Notes in Computer Science, vol 3389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31845-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-31845-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25079-1
Online ISBN: 978-3-540-31845-3
eBook Packages: Computer ScienceComputer Science (R0)