Adaptive Tabu Search for course timetabling

European Journal of Operational Research

Volumn 200, Issue 1, 2010, Pages 235-244

  Lü, Zhipeng ^a,b   Hao, Jin Kao ^a  

^a UNIVERSITÉ D'ANGERS   (France)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Heuristic; ITC 2007; Iterated Local Search; Perturbation operator; Tabu Search; Timetabling

Indexed keywords

HEURISTIC; ITC-2007; ITERATED LOCAL SEARCH; PERTURBATION OPERATOR; TIMETABLING;

ADAPTIVE ALGORITHMS; CURRICULA; HEURISTIC METHODS; LEARNING ALGORITHMS; MATHEMATICAL OPERATORS;

TABU SEARCH;

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

References (31)

1. Second International Timetabling Competition (ITC-2007), Track 3: Curriculum-Based Course Timetabling. .
2. .
3. Al-Yakoob S.M., and Sherali H.D. Mathematical programming models and algorithms for a classfaculty assignment problem. European Journal of Operational Research 173 2 (2006) 488-507
4. Brélaz D. New methods to color the vertices of a graph. Communications of the ACM 22 4 (1979) 251-256
5. Burke E.K., MacCarthy B.L., Petrovic S., and Qu R. Multiple-retrieval case-based reasoning for course timetabling problems. Journal of Operations Research Society 57 2 (2006) 148-162
6. Burke E.K., McCollum B., Meisels A., Petrovic S., and Qu R. A graph-based hyper heuristic for timetabling problems. European Journal of Operational Research 176 (2007) 177-192
7. E.K. Burke, J. Marecek, A.J. Parkes, H. Rudová, A branch-and-cut procedure for the udine course timetabling problem, in: Proceedings of the Seventh PATAT Conference, 2008. .
8. Chiarandini M., Birattari M., Socha K., and Rossi-Doria O. An effective hybrid algorithm for university course timetabling. Journal of Scheduling 9 (2006) 403-432
9. M. Clark, M. Henz, B. Love, QuikFix: A repair-based timetable solver, in: Proceedings of the Seventh PATAT Conference, 2008. .
10. De Causmaecker P., Demeester P., and Vanden Berghe G. A decomposed metaheuristic approach for a real-world university timetabling problem. European Journal of Operational Research 195 (2009) 307-318
11. F. De Cesco, L. Di Gaspero, A. Schaerf, Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results, in: Proceedings of the Seventh PATAT Conference, 2008. .
12. Di Gaspero L., and Schaerf A. Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms 5 1 (2006) 65-89
13. L. Di Gaspero, B. McCollum, A. Schaerf, The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3), Technical Report, 2007. .
14. M.J. Geiger, An application of the threshold accepting metaheuristic for curriculum based course timetabling, in: Proceedings of the Seventh PATAT Conference, 2008. .
15. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic, Boston
16. G. Lach, M.E. Lübbecke, Curriculum based course timetabling: Optimal solutions to the udine benchmark instances, in: Proceedings of the Seventh PATAT Conference, 2008. .
17. R. Lewis, B. Paechter, New crossover operators for timetabling with evolutionary algorithms, in: A. Lofti, (Ed.), The Fifth International Conference on Recent Advances in Soft Computing RASC2004, Nottingham, England, 2004, pp. 189-194.
18. Lewis R. A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30 1 (2008) 167-190
19. Z. Lü, J.K. Hao, F. Glover, Neighborhood analysis: A case study on curriculum-based course timetabling, Technical Report, LERIA, University of Angers, France, 2009.
20. Lourenco H.R., Martin O., and Stützle T. Iterated local search. In: Glover F., and Kochenberger G. (Eds). Handbook of Meta-heuristics (2003), Springer-Verlag 321-353
21. B. McCollum, A perspective on bridging the gap between theory and practice in university timetabling, in: E.K. Burke, H. Rudová (Eds.), Proceedings of the Sixth PATAT Conference, LNCS, vol. 3867, 2007, pp. 3-23.
22. C. Morgenstern, H. Shapiro, Coloration neighborhood structures for general graph coloring, in: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1990, pp. 226-235.
23. T. Müller, ITC2007 solver description: A hybrid approach, in: Proceedings of the Seventh PATAT Conference, 2008. .
24. Papadimitriou C.H., and Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall Inc.
25. Rasmussen R.V., and Trick M.A. Round robin scheduling - a survey. European Journal of Operational Research 188 3 (2008) 617-636
26. Rodrigues M.M., de Souza C.C., and Moura A.V. Vehicle and crew scheduling for urban bus lines. European Journal of Operational Research 170 3 (2006) 844-862
27. Santiago-Mozos R., Salcedo-Sanz S., DePrado-Cumplido M., and Bousono-Calzon C. A two-phase heuristic evolutionary algorithm for personalizing course timetables: A case study in a spanish university. Computers and Operations Research 32 (2005) 1761-1776
28. J.C. Setubal, Sequential and Parallel Experimental Results with Bipartite Matching Algorithms, Technical Report EC-96-09, Institute of Computing, University of Campinas, Brasil, 1996.
29. Thompson J., and Dowsland K. A robust simulated annealing based examination timetabling system. Computer and Operations Research 25 (1998) 637-648
30. Vasquez M., and Hao J.K. A "logic-constrained" knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. Computational Optimization and Applications 20 2 (2001) 137-157
31. White G.M., Xie B.S., and Zonjic S. Using tabu search with longer-term memory and relaxation to create examination timetables. European Journal of Operational Research 153 16 (2004) 80-91