Summary
In the course of researching timetabling problems for complex distributed systems this article applies the multi-agent paradigm of computations and presents a correspondent mathematical model for university’s timetabling problem solution. The model takes into account dynamic nature of this problem and individual preferences of different remote users for time and location of classes. In the framework of that model authors propose an original problem-oriented algorithm of multi-agent communication. Developed algorithm is used as a foundation for the distributed software system AgentTime. Based on multi-agent JADE platform AgentTime provides friendly graphical interface for online design of time tables for universities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Simon, H.A.: Administrative Behavior. Free Press, New York (1976)
Haken, H.: Synergetics, an Introduction: Nonequilibrium Phase Transitions and Self-Organization in Physics, Chemistry, and Biology. Springer, New York (1983)
Cheng, J.Q., Wellman, M.P.: The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes. Journal of Computational Economics 12, 1–23 (1998)
Sandhu, K.S.: Automating Class Schedule Generation in the Context of a University Time-tabling Information System. PhD Thesis (2001)
Petrovic, S., Burke, E.: University Timetabling. University of Nottingham (2003)
Akkoyunly, E.A.: A Linear Algorithm for Computing the Optimum University Timetable. The Computer Journal 16(4), 347–350 (1973)
Shaerf, A.: Local Search Techniques for Large High School Timetabling Problems. IEEE Transactions on Systems, Man And Cybernetics 29(4), 368–377 (1999)
De Werra, D.: An Introduction to Timetabling. European Journal of Operational Research 19, 151–162 (1985)
Taha, T.R.: Numerical schemes for nonlinear evolution equations. The College Journal of Science and Technology 2, 105–116 (1987)
Dimopoulou, M., Miliotis, P.: Implementation of a university course and examination time-tabling system. European Journal of Operational Research 130(1), 202–213 (2001)
Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153. Springer, Heidelberg (1996)
Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079. Springer, Heidelberg (2001)
Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740. Springer, Heidelberg (2003)
Back, T.: Evolutionary Algorithms in theory and practice. Oxford University Press, New-York (1995)
Sharma, D., Chandra, N.: An evolutionary approach to constraint-based timetabling. In: Kowalczyk, R., Loke, S.W., Reed, N.E., Graham, G. (eds.) PRICAI-WS 2000. LNCS, vol. 2112, pp. 80–92. Springer, Heidelberg (2001)
Sanchez, E., Shibata, T., Zadeh, L.: Genetic Algorithms and Fuzzy Logic Systems. In: Soft Computing Perspectives. World Scientific, Singapore (1997)
Buckles, B.P., Petry, F.E.: Genetic Algorithms. IEEE Computer Society Press, Los Alamitos (1992)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Maxfield, C.: Genetic algorithms: programs that boggle the mind. EDN (1997)
Srinivas, M., Patnik, L.M.: Genetic Algorithms: A Survey. IEEE Computer 27(6), 17–26 (1994)
Abramson, D.: Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms. Management-Science (1991)
Wellman, M.P., Walsh, W.E., Wurman, P.R., MacKie-Mason, J.K.: Auction Protocols for De-centralized Scheduling. Games and Economic Behavior 35, 271–303 (2001)
Walsh, W.E., Yokoo, M., Hirayama, K., Wellman, M.P.: On Market-Inspired Approaches to Propositional Satisfiability. In: Proceedings of Int. Conf. IJCAI 2000, pp. 1152–1160 (2001)
Yokoo, M., Hirayama, K.: Distributed Constraint Satisfaction Algorithm for Complex Local Problems. In: Proceedings of the Int. Conf. ICMAS 1998, pp. 372–379 (1998)
Yokoo, M., Hirayama, K.: Algorithms for Distributed Constraints Satisfaction: A Review. In: Proceedings of Int. Conf. AAMAS 2002, vol. 3(2), pp. 185–207 (2000)
Garrido, L., Sycara, K.: Multi-Agent Meeting Scheduling: Preliminary Experimental Results. In: Proceedings of the Int. Conf. ICMAS 1996 (1996)
Franzin, M.S., Freuder, E.C., Rossi, F., Wallace, R.: Multiagent Meeting Scheduling with Preferences: Efficiency, Privacy Loss, and Solution Quality. In: Proceedings of Intrl. Conf. AAAI 2002 (workshop on preference in AI and CP) (2002)
BenHassine, A., Ito, T., Ho, T.B.: A New Distributed Approach to Solve Meeting Scheduling Problems. In: Proceedings of IEEE/WIC Int. Conf. IAT, pp. 588–591 (2003)
BenHassine, A., Defago, X., Ho, T.B.: Agent-Based Approach to Dynamic Meeting Scheduling Problems. In: Proceedings of Int. Conf. AAMAS 2004, vol. 3, pp. 1132–1139 (2004)
Al–Maqtari, S., Abdulrab, H., Nosary, A.: Constraint Programming and Multi-Agent System mixing approach for agricultural Decision Support System. In: Proceedings of In. Conf. ECCS 2005, pp. 199–213 (2005)
Bellifemine, F.L., Caire, G., Greenwood, D.: Developing Multi-Agent Systems with JADE. Wiley, Chichester (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Babkin, E., Abdulrab, H., Babkina, T. (2009). AgentTime: A Distributed Multi-agent Software System for University’s Timetabling. In: Aziz-Alaoui, M.A., Bertelle, C. (eds) From System Complexity to Emergent Properties. Understanding Complex Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02199-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-02199-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02198-5
Online ISBN: 978-3-642-02199-2
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)