Say Leng Goh
Improved local search approaches to solve the post enrolment course timetabling problem
Goh, Say Leng; Kendall, G.; Sabar, Nasser R.
G. Kendall firstname.lastname@example.org
Nasser R. Sabar
In this work, we are addressing the post enrollment course timetabling (PE-CTT) problem. We combine different local search algorithms into an iterative two stage procedure. In the first stage, Tabu Search with Sampling and Perturbation (TSSP) is used to generate feasible solutions. In the second stage, we propose an improved variant of Simulated Annealing (SA), which we call Simulated Annealing with Reheating (SAR), to improve the solution quality of feasible solutions. SAR has three features: a novel neighborhood examination scheme, a new way of estimating local optima and a reheating scheme. SAR eliminates the need for extensive tuning as is often required in conventional SA. The proposed methodologies are tested on the three most studied datasets from the scientific literature. Our algorithms perform well and our results are competitive, if not better, compared to the benchmarks set by the state of the art methods. New best known results are provided for many instances.
|Journal Article Type||Article|
|Publication Date||Aug 16, 2017|
|Journal||European Journal of Operational Research|
|Peer Reviewed||Peer Reviewed|
|APA6 Citation||Goh, S. L., Kendall, G., & Sabar, N. R. (2017). Improved local search approaches to solve the post enrolment course timetabling problem. European Journal of Operational Research, 261(1),|
|Keywords||Timetabling, Combinatorial optimization, Local search, Tabu Search with Sampling and Perturbation (TSSP), Simulated Annealing with Reheating (SAR)|
|Copyright Statement||Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by-nc-nd/4.0|
Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by-nc-nd/4.0
You might also like
Is Evolutionary Computation evolving fast enough?
An iterated local search algorithm for the team orienteering problem with variable profits