Tabu search algorithms for timetabling optimization
DOI:
https://doi.org/10.34767/SIMIS.2010.02.08Keywords:
Tabu search, timetablingAbstract
Tabu Search is a metaheuristic that guides a local heuristic search procedures to explore the solution space beyond
local optimum. The process of searching the solutions space is coordinated by strategies based on the memory mechanisms, which are characters of the TS algorithm. This paper describes the method of TS in the timetable optimization process.
References
Aladağ Ç. H,. Hocaoğlu G., A Tabu Search Algorithm to Solve a Course Timetabling Problem, Hacettepe Journal of Mathematics and Statistics, vol. 36(1), 2007, s.53-64
Glover F., Laguna M., Tabu Search, Kluwer Academic Publishers, Norwell, MA, 1997, ISBN:079239965X, s. 53
Glover, F., Tabu Search — Part I, ORSA Journal on Computing, vol. 1,no 3, 1989, s. 190-206
Glover, F., Tabu Search — Part II, ORSA Journal on Computing, vol. 2,no 1, 1990, s. 4-32
