Advertisement

Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art

  • Krzysztof Socha
  • Michael Sampels
  • Max Manfrin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2611)

Abstract

Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented - Ant Colony System and MAX-MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine (or neighborhood definition), and a reference random restart local search algorithm. Further, both ant algorithms are compared on an additional set of instances. Conclusions are drawn about the performance of ant algorithms on timetabling problems in comparison to other metaheuristics. Also the design, implementation, and parameters of ant algorithms solving the university course timetabling problem are discussed. It is shown that the particular implementation of an ant algorithm has significant influence on the observed algorithm performance.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gaspero, L.D., Schaerf, A.: Tabu search techniques for examination timetabling. In: Proceedings of the 3rd International Conference on Practice and Theory of Automated Timetabling (PATAT 2000), LNCS 2079, Springer-Verlag (2001) 104–117Google Scholar
  2. 2.
    ten Eikelder, H.M.M., Willemen, R.J.: Some complexity aspects of secondary school timetabling problems. In: Proceedings of the 3rd International Conference on Practice and Theory of Automated Timetabling (PATAT 2000), LNCS 2079, Springer-Verlag (2001) 18–29Google Scholar
  3. 3.
    Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Proceedings of the 3rd International Conference on Practice and Theory of Automated Timetabling (PATAT 2000), LNCS 2079, Springer-Verlag (2001) 176–190Google Scholar
  4. 4.
    Cooper, T.B., Kingston, J.H.: The complexity of timetable construction problems. In: Proceedings of the 1st International Conference on Practice and Theory of Automated Timetabling (PATAT 1995), LNCS 1153, Springer-Verlag (1996) 283–295Google Scholar
  5. 5.
    de Werra, D.: The combinatorics of timetabling. European Journal of Operational Research 96 (1997) 504–513zbMATHCrossRefGoogle Scholar
  6. 6.
    Rossi-Doria, O., Sampels, M., Chiarandini, M., Knowles, J., Manfrin, M., Mastrolilli, M., Paquete, L., Paechter, B.: A comparison of the performance of different metaheuristics on the timetabling problem. In: Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling (PATAT 2002) (to appear). (2002)Google Scholar
  7. 7.
    Stützle, T., Hoos, H.H.: MAX-MINAnt System. Future Generation Computer Systems 16 (2000) 889–914CrossRefGoogle Scholar
  8. 8.
    Socha, K., Knowles, J., Sampels, M.:A MAX-MIN Ant System for the University Timetabling Problem. In Dorigo, M., Di Caro, G., Sampels, M., eds.: Proceedings of ANTS 2002-Third International Workshop on Ant Algorithms. Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany (2002)Google Scholar
  9. 9.
    Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics 26 (1996) 29–41CrossRefGoogle Scholar
  10. 10.
    Bonabeau, E., Dorigo, M., Theraulaz, G. Oxford University Press (1999)Google Scholar
  11. 11.
    Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the travelling salesman problem. IEEE Transactions On Evolutionary Computation (1997) 53–66Google Scholar
  12. 12.
    Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life 5 (1999) 137–172CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Krzysztof Socha
    • 1
  • Michael Sampels
    • 1
  • Max Manfrin
    • 1
  1. 1.IRIDIAUniversité Libre de Bruxelles, CP 194/6BruxellesBelgium

Personalised recommendations