Solving the timetabling problem with three heuristics

WSEAS Transactions on Computers

Volumn 5, Issue 11, 2006, Pages 2849-2855

  Frausto Solís, Juan ^a   Alonso Pecina, Federico ^a   Larre, Monica ^a   Gonzalez Segura, Cinhtia ^b   Gómez Ramos, José Luis ^c  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

^b UNIVERSIDAD AUTÓNOMA DE YUCATÁN   (Mexico)

^c UNIVERSIDAD JUÁREZ AUTÓNOMA DE TABASCO   (Mexico)

Author keywords

Genetic Algorithm; Optimization; Simulated Annealing; Tabu Search; Timetabling

Indexed keywords

EDUCATIONAL TIMETABLING; TABU SEARCH;

BENCHMARKING; GENETIC ALGORITHMS; HEURISTIC METHODS; SIMULATED ANNEALING;

DECISION TABLES;

EID: 33746925204     PISSN: 11092750     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Abramson, D. Constructing School Timetables using Simulated Annealing: Sequential and Parallel Algorithms. Management Science, Vol 37, No 1, Jan 1991, pp 98-113.
2. Burke, E.K.; Kendall, G.; Soubeiga, E. A Tabu-Search Hyperheuristic for Timetabling and Rostering. Journal of Heuristics Vol 9, 2003, pp 451-470.
3. Colorni, A. Dorigo, M. & Maniezzo. A genetic algorithm to solve the timetable problem. Tech. rep. 90-060 revised, Politecnico di Milano, Italy. Submitted to Computational Optimization and Applications, 1992
4. Hertz, A. Tabu search for large scale timetabling problems. European Journal of Operational Research, Vol 54, 1991, pp 39-47.
5. Marte, Michael. Models and Algorithms for School Timetabling - A constraint-Programming Approach., Dissertation thesis, an der Fakult"at f"ur Mathematik, Informatik und Statistik der Ludwig-Maximilians-Universit "atM"unchen 2002.
6. Sara K. Miner, Saleh Elmohamed, Hon W. Yau. Optimizing Timetabling Solutions Using Graph Coloring, Syracuse University, NPAC REU program, 1995.
7. Neufeld GA y Tartar j, Graph coloring conditions for the existence of solutions to the timetable problem. Communications of ACM, Vol 17, Issue 8, pp 450-453, 1974
8. International Timetabling Competition, URL: http://www.idsia.ch/Files/ ttcomp2002/ Consultant date: Wednesday, May 31 of 2006
9. Patat Conferences, URL: http://www.asap.cs.nott.ac.uk/patat/ patat-index.shtml, Consultant date: Wednesday, May 31 of 2006.
10. Schaerf, Andrea. A Survey of Automated Timetabling. Artificial Intelligence Review, Vol. 3 No 2. Springer Netherlands. April, 1999 pp 87-127.
11. Socha, K.; Knowles, J.; Sampels, M. "A MAX-MIN Ant System for the University Timetabling Problem". In Proceedings of the 3rd International Workshop on Ant Algorithms", ANTS 2002, Lecture Notes in Computer Science, Vol. 2463, Springer, 2002, pp. 1-13.
12. Yoshikawa, M., Kaneko, K., Nomura, Y., & Watanabe, M. A constraint-based approach to high-school timetabling problems: a case study. In Proceedings of the twelfth national conference on Artificial intelligence (AAAI-94), Vol 2, 1994 pp 1111-1116.
13. Yu, Enzhe; Sunga, Ki-Seok. A genetic algorithm for a university weekly courses timetabling problem. In International transactions in operational research, Vol 9 Kangnung National University, Korea. 2002. pp 703-717
14. Garey, M. R., & Johnson, D.S. Computers and Intractability - A guide to NP-completeness. W.H. Freeman and Company, San Francisco. 1979
15. Brelaz, D. (1979). New Methods to color the Vertices of a Graph Communications A.C.M. 7, 494-498.
16. Sanvicente-Sanchez, Hector y Frausto, Juan. (2004). Method to Establish the Cooling Scheme in Simulated Annealing Like Algorithms. International Conference, Assis, Italia. ICCSA'2004. LNCS Vol. 3095. 755-763.