A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems

European Journal of Operational Research

Volumn 203, Issue 3, 2010, Pages 550-558

  Zhang, Defu ^a   Liu, Yongkai ^a   M'Hallah, Rym ^b   Leung, Stephen C H ^c  

^a XIAMEN UNIVERSITY   (China)

^b KUWAIT UNIVERSITY   (Kuwait)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Extended neighborhood; Simulated annealing; Timetabling

Indexed keywords

COMPUTATIONAL RESULTS; EXTENDED NEIGHBORHOOD; HIGH SCHOOL; NEIGHBORHOOD STRUCTURE; TIME SLOTS; TIMETABLING;

ANNEALING; HEURISTIC METHODS;

SIMULATED ANNEALING;

EID: 70449522276     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.09.014     Document Type: Article

References (43)

1. Abdullah S., Ahmadi S., Burke E.K., Dror M., and McCollum B. A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem. Journal of the Operational Research Society 58 11 (2007) 1494-1502
2. Abramson D. Constructing school timetables using simulated annealing: Sequential and parallel algorithms. Management Science 37 1 (1991) 98-113
3. Abramson D., and Dang H. School timetables: A case study in simulated annealing. In: Vidal V. (Ed). Applied simulated annealing. Lecture Notes in Economics and Mathematics Systems (1993), Springer, Berlin 103-124 (Chapter 5)
4. Abramson D., Krishnamoorthy M., and Dang H. Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research 16 (1999) 1-22
5. Abramson D., and Randall M. A simulated annealing code for general integer linear programs. Annals of Operations Research 86 (1999) 3-21
6. Al-Yakoob S.M., and Sherali H.D. Mathematical programming models and algorithms for a class-faculty assignment problem. European Journal of Operational Research 173 2 (2005) 488-507
7. Al-Yakoob S.M., and Sherali H.D. A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations. European Journal of Operational Research 180 3 (2007) 1028-1044
8. Alvarez-Valdes R., Crespo E., and Tamarit J.M. Design and implementation of a course scheduling system using tabu search. European Journal of Operational Research 137 (2002) 512-523
9. Asratian A.S., and de Werra D. A generalized class-teacher model for some timetabling problems. European Journal of Operational Research 143 (2002) 531-542
10. Avella P., D'Auria B., Salerno S., and Vasil'ev I. A computational study of local search algorithms for Italian high-school timetabling. Journal of Heuristics 13 (2007) 543-556
11. Azimi Z.N. Hybrid heuristics for examination timetabling problems. Applied Mathematics and Computation 163 2 (2005) 705-733
12. Beligiannis G.N., Moschopoulos C.N., Kaperonis G.P., and Likothanassia S.D. Applying evolutionary computation to the school timetabling problem: The Greek case. Computers and Operations Research 35 4 (2008) 1265-1280
13. Birbas T., Daskalaki S., and Housos E. Timetabling for Greek high schools. Journal of the Operational Research Society 48 (1997) 1191-1200
14. Bullnheimer B. An Examination scheduling model to maximize students' study time. In: Burke E., and Carter M. (Eds). Practice and Theory of Automated Timetabling II (LNCS 1408) (1998), Springer-Verlag, Berlin 8-91
15. Burke E.K., and Petrovic S. Recent research directions in automated timetabling. European Journal of Operational Research 140 (2002) 266-280
16. Burke E.K., and Newall J.P. Solving examination timetabling problems through adaption of heuristic orderings. Annals of Operations Research 129 (2004) 107-134
17. Burke E.K., McCollum B., Meisels A., Petrovic S., and Qu R. A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research 176 (2007) 177-192
18. E.K. Burke, A. Eckersley, B. McCollum, S. Petrovic, R. Qu, Hybrid variable neighbourhood approaches to university exam timetabling, European Journal of Operational Research, submitted for publication.
19. Carrasco M.P., and Pato M.V. A Potts neural network heuristic for the class/teacher timetabling problem. Applied Optimization Metaheuristics: Computer Decision-making Book (2004), Kluwer Academic Publishers pp. 173-186
20. Carrasco M.P., and Pato M.V. A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. European Journal of Operational Research 153 (2004) 65-79
21. De Causmaecker P., Demeester P., and Berghe G.V. A decomposed metaheuristic approach for a real-world university timetabling problem. European Journal of Operational Research (2008) 10.1016/j.ejor.2008.01.043
22. McCollum B. A perspective on bridging the gap between research and practice in university timetabling. In: Burke E., and Rudova H. (Eds). Practice and Theory of Automated Timetabling VI, (LNCS 3867) (2007), Springer-Verlag, Berlin 3-23
23. B. McCollum, P. McMullan, B. Paechter, R. Lewis, A. Schaerf, L. Di Gaspero, A.J. Parkes, R. Qu, E. Burke, Setting the research agenda in automated timetabling: The second international timetabling competition, INFORMS Journal of Computing (2009), doi:10.1287/ijoc.1090.0320.
24. Daskalaki S., Birbas T., and Housos E. An integer programming formulation for a case study in university timetabling. European Journal of Operational Research 153 (2004) 117-135
25. Daskalaki S., and Birbas T. Efficient solutions for a university timetabling problem through integer programming. European Journal of Operational Research 160 (2005) 106-120
26. E. Eley, Ant algorithms for the exam timetabling problem, in: Burke, E.K., Rudova, H. (Eds.), Practice and Theory of Automated Timetabling VI: Selected Papers from the 6th International Conference, (LNCS 3867), 2007, pp. 364-382.
27. Gonzalez-del-Campo R., and Saenz-Perez F. Programmed search in a timetabling problem over finite domains. Electronic Notes in Theoretical Computer Science 177 (2007) 253-267
28. Johnson D. Timetabling university examinations. Journal of the Operational Research Society 41 (1990) 39-47
29. Lee H.Y., and Lin Y.C. A decision support model for scheduling exhibition projects in art museums. Expert Systems with Applications (2009) 10.1016/j.eswa.2009.03.003
30. Lewis R. A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30 (2007) 167-190
31. Mirrazavi S.K., Mardle S.J., and Tamiz M. A two-phase multiple objective approach to university timetabling utilizing optimisation and evolutionary solution methodologies. Journal of the Operational Research Society 54 (2003) 1155-1166
32. Papoutsis K., Valouxis C., and Housos E. A column generation approach for the timetabling problem of Greek high schools. Journal of the Operational Research Society 54 (2003) 230-238
33. Petrovic S., and Burke E.K. University timetabling. Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), CRC Press, Boca Raton, FL (Chapter 45)
34. Qu R., Burke E.K., McCollum B., Merlok L.T., and Lee S.Y. A survey of search methodologies and automated approaches for examination timetabling. Journal of Scheduling 12 1 (2009) 55-89
35. Randall M., Abramson D., and Wild C. A general meta-heuristic based solver for combinatorial optimisation problems. Computational Optimization and Applications 20 2 (2001) 185-210
36. K. Socha, M. Sampels, M. Manfrin, Ant algorithms for the university course timetabling problem with regard to the state-of-the-art, in: Proceedings of EvoCOP 2003, 3rd European Workshop on Evolutionary Computation in Combinatorial Optimization (LNCS 2611), 2003, pp. 334-345.
37. Smith K.A., Abramson D., and Duke D. Hopfield neural networks for timetabling: formulations, methods, and comparative results. Computers and Industrial Engineering 44 2 (2003) 283-305
38. Thompson J., and Dowsland K.A. A robust simulated annealing based examination timetabling system. Computers and Operations Research 25 (1998) 637-648
39. Thompson J., and Dowsland K.A. General cooling schedules for a simulated annealing based timetabling system. In: Burke E., and Ross P. (Eds). Practice and Theory of Automated Timetabling I, (LNCS 1153) (1996), Springer-Verlag, Berlin 345-363
40. Ueda H., Ouchi D., Takahashi K., and Miyahara T. Comparisons of genetic algorithms for timetabling problems. Systems and Computers in Japan 35 7 (2004) 691-701
41. Valouxis C., and Housos E. Constraint programming approach for school timetabling. Computers and Operations Research 30 (2003) 1555-1572
42. de Werra D., Asratian A.S., and Durand S. Complexity of some special types of timetabling problems. Journal of Scheduling 5 (2002) 171-183
43. Wood J., and Whitaker D. Student centred school timetabling. Journal of the Operational Research Society 49 (1998) 1146-1152