The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem

Expert Systems with Applications

Volumn 36, Issue 10, 2009, Pages 12349-12356

  Aladag, Cagdas Hakan ^a   Hocaoglu, Gulsum ^a   Basaran, Murat Alper ^b  

^a HACETTEPE UNIVERSITY   (Turkey)

^b NIGDE UNIVERSITY   (Turkey)

Author keywords

ANOVA; Combinatorial optimization; Course timetabling problem; Neighborhood structure; Tabu search; Type of move

Indexed keywords

ANOVA; CONTEXT DEPENDENT; COURSE TIMETABLING PROBLEM; HEURISTIC APPROACH; NEIGHBORHOOD STRUCTURE; SOLUTION METHODS; TABU SEARCH ALGORITHMS; TIMETABLING PROBLEM; TYPE OF MOVE;

ANALYSIS OF VARIANCE (ANOVA); COMBINATORIAL OPTIMIZATION; LEARNING ALGORITHMS;

TABU SEARCH;

EID: 69249232202     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.04.051     Document Type: Article

References (24)

1. Aladag, C. H. (2004). Solving a course timetabling problem by using tabu search algorithm. Master's thesis, Hacettepe University, Graduate School.
2. Aladag C.H., and Hocaoglu G. A tabu search algorithm to solve course timetabling problem. Hacettepe Journal of Mathematics and Statistics 36 1 (2007) 53-64
3. Aladag, C. H., Hocaoglu, G. (2007b). The effect of neighborhood structure and of move types in the problem of course timetabling with the tabu search algorithm. In Proceedings of the fifth statistics conference (pp. 14-19).
4. Alvarez 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
5. Alvarez R., Martin G., and Tarmarit J.M. Constructing good solutions for the Spanish school timetabling. European Journal of Operational Research 47 (1996) 1203-1205
6. Al-Yakoob S., and Sherali H. Mathematical programming models and algorithms for a class-faculty assignment problem. European Journal of Operational Research 173 2 (2006) 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. Beligiannis G.N., Moschopoulos C.N., Kaperonis G.P., and Likothanassis S.D. Applying evolutionary computation to the school timetabling problem: The Greek case. Computers and Operations Research 35 4 (2008) 1265-1280
9. Boland N., Hughes B.D., Merlot L.T.G., and Stuckey P.J. New integer linear programming approaches for course timetabling. Computers and Operations Research 35 (2008) 2209-2233
10. Burke E., Newall J.P., and Weare R.F. A memetic algorithm for university exam timetabling. Practice and theory of automated timetabling. Lecture notes in computer science (1996), Springer, Berlin (pp. 241-250, Vol. 1153)
11. Burke E.K., Petrovic S., and Qu R. Case based heuristic selection for timetabling problems. Journal of Scheduling 9 2 (2006) 115-132
12. Causmaecker D.P., Demeester P., and Berghe G.V. A decomposed metaheuristic approach for a real-world university timetabling problem. European Journal of Operational Research 195 1 (2009) 307-318
13. Chiarandini M., Birattari M., Socha K., and Rossi-Doria O. An effective hybrid algorithm for university course timetabling. Journal of Scheduling 9 5 (2006) 403-432
14. Corne D., and Ross P. Peckish initialization strategies for evolutionary timetabling. Practice and theory of automated timetabling. Lecture notes in computer science Vol. 1153 (1996), Springer, Berlin (pp. 227-240)
15. Dowsland K.A. A timetabling problem in which clashes are inevitable. The Journal of Operational Research Society 41 (1990) 907-918
16. Elmohamed M.A.S., Coddington P., and Fox G. A comparison of annealing techniques for academic course scheduling. Practice and theory of automated timetabling II. Lecture notes in computer science Vol. 1408 (1997), Springer, Berlin (pp. 92-112)
17. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Dordrecht
18. Gueret C., Jussien N., Boizumault P., and Prins C. Building university timetables using constraint logic programming. Practice and theory of automated timetabling. Lecture notes in computer science Vol. 1153 (1995), Springer, Berlin (pp. 130-145)
19. Head C., and Shaban S. A heuristic approach to simultaneous course/student timetabling. Computers and Operations Research 34 4 (2007) 919-933
20. Hertz A. Finding a feasible course schedule using tabu search. Discrete Applied Mathematics 35 (1992) 255-270
21. Hertz A. Tabu search for large scale timetabling problems. European Journal of Operational Research 54 (1991) 39-47
22. MirHassani S.A. A computational approach to enhancing course timetabling with integer programming. Applied Mathematics and Computation 175 1 (2006) 814-822
23. Paechter B., Cumming A., Norman M.G., and Luchian H. Extensions to a memetic timetabling system. Practice and theory of automated timetabling. Lecture notes in computer science Vol. 1153 (1996), Springer, Berlin (pp. 251-265)
24. Pongcharoen P., Promtet W., Yenradee P., and Hicks C. Stochastic optimisation timetabling tool for university course scheduling. International Journal of Production Economics 112 (2008) 903-918