ETTO: Emergent Timetabling by Cooperative Self-organization

  • Gauthier Picard
  • Carole Bernon
  • Marie-Pierre Gleizes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3910)


Cooperation is a means for multi-agent systems to function more efficiently and more adaptively. Cooperation can be viewed as a local criterion for agents to self-organize and then to perform a more adequate collective function. This paper mainly aims at showing that with only local rules based on cooperative attitude and without any global knowledge, a solution is provided by the system and local changes lead to global reorganization. This paper shows an application of cooperative behaviors to a dynamic distributed timetabling problem, ETTO, in which the constraint satisfaction is distributed among cooperative agents. This application has been prototyped and shows positive results on adaptation, robustness and efficiency of this approach.


Time Slot Multiagent System Representative Agent Current Reservation Timetabling Problem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ali, S., Zimmer, R., Elstob, C.: The question concerning emergence: Implication for Artificiality. In: Dubois, D.M. (ed.) 1st CASYS 1997 Conference (1997)Google Scholar
  2. 2.
    Bistarelli, S., Fargier, H., Mantanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based constraints CSPs and valued CSPs: frameworks, properties, and comparison. Constraints: an International Journal 4(3), 199–240 (1999)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bonabeau, E., Theraulaz, G., Deneubourg, J.-L., Aron, S., Camazine, S.: Self-Organization in Social Insects. Trends in Ecology and Evolution 12, 188–193 (1997)CrossRefGoogle Scholar
  4. 4.
    Cambazard, H., Demazeau, F., Jussien, N., David, P.: Interactively solving school timetabling problems using extensions of constraint programming. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 190–207. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Capera, D., JP, G., Gleizes, M.P., Glize, P.: The AMAS theory for complex problem solving based on self-organizing cooperative agents. In: 1st International TAPOCS Workshop at IEEE 12th WETICE, pp. 383–388. IEEE, Los Alamitos (2003)Google Scholar
  6. 6.
    Dechter, Meiri, Pearl: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    George, J.-P., Edmonds, B., Glize, P.: Making Self-Organising Adaptive Multiagent Systems Work. In: Methodologies and Software Engineering for Agent Systems, ch.16, pp. 321–340. Kluwer, Dordrecht (2004)CrossRefGoogle Scholar
  8. 8.
    Goldstein, J.: Emergence as a Construct: History and Issues. Journal of Complexity Issues in Organizations and Management 1(1) (1999)Google Scholar
  9. 9.
    Kohonen, T.: Self-Organising Maps. Springer, Heidelberg (2001)CrossRefMATHGoogle Scholar
  10. 10.
    Jelasity, M., Babaoglu, O.: T-Man: Gossip-based Overlay Topology Management. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS (LNAI), vol. 3910, pp. 1–15. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Minton, S., Johnston, M.P.A., Laird, P.: Minimizing Conflicts: a Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence 58, 160–205 (1992)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Modi, P.J., Shen, W., Tambe, M., Yokoo, M.: An Asynchronous Complete Method for Distributed Constraint Optimization. In: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2003), pp. 161–168 (2003)Google Scholar
  13. 13.
    Müller, T., Rudova, H.: Minimal Perturbation Problem in Course Timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 126–146. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  14. 14.
    Picard, G., Glize, P.: Model and Experiments of Local Decision Based on Cooperative Self-Organization. In: 2nd International Indian Conference on Artificial Intelligence (IICAI 2005), Pune, India, 20-22 December (2005)Google Scholar
  15. 15.
    Socha, K., Knowles, J., Sampels, M.: A MAX-MIN Ant System for the University Timetabling Problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 1–13. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  16. 16.
    Yokoo, M., Durfee, E., Ishida, Y., Kubawara, K.: The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Transactions on Knowledge and Data Engineering 10, 673–685 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Gauthier Picard
    • 1
  • Carole Bernon
    • 1
  • Marie-Pierre Gleizes
    • 1
  1. 1.IRITUniversité Paul SabatierToulouseFrance

Personalised recommendations