Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem

2009 ◽  
Author(s):  
Ariff Md Ab Malik ◽  
Masri Ayob ◽  
Abdul Razak Hamdan
Keyword(s):  
Tabu Search ◽  
Two Stage ◽  
Examination Timetabling ◽  
Timetabling Problem ◽  
Search Approach

scholarly journals Application of Heuristic Combinations in Hyper-Heuristic Framework for Exam Scheduling Problems

2020 ◽  
Vol 4 (4) ◽  
pp. 664-671
Author(s):  
Gabriella Icasia ◽  
Raras Tyasnurita ◽  
Etria Sepwardhani Purba
Keyword(s):  
Tabu Search ◽  
Large Scale ◽  
Search Algorithm ◽  
Heuristic Method ◽  
Combinatorial Problems ◽  
Hill Climbing ◽  
Tabu Search Algorithm ◽  
Scheduling Problems ◽  
Examination Timetabling ◽  
Timetabling Problem

Examination Timetabling Problem is one of the optimization and combinatorial problems. It is proved to be a non-deterministic polynomial (NP)-hard problem. On a large scale of data, the examination timetabling problem becomes a complex problem and takes time if it solved manually. Therefore, heuristics exist to provide reasonable enough solutions and meet the constraints of the problem. In this study, a real-world dataset of Examination Timetabling (Toronto dataset) is solved using a Hill-Climbing and Tabu Search algorithm. Different from the approach in the literature, Tabu Search is a meta-heuristic method, but we implemented a Tabu Search within the hyper-heuristic framework. The main objective of this study is to provide a better understanding of the application of Hill-Climbing and Tabu Search in hyper-heuristics to solve timetabling problems. The results of the experiments show that Hill-Climbing and Tabu Search succeeded in automating the timetabling process by reducing the penalty 18-65% from the initial solution. Besides, we tested the algorithms within 10,000-100,000 iterations, and the results were compared with a previous study. Most of the solutions generated from this experiment are better compared to the previous study that also used Tabu Search algorithm.

scholarly journals Formulation space search approach for the teacher/class timetabling problem

2008 ◽  
Vol 18 (1) ◽  
pp. 1-11 ◽  
Author(s):  
Yuri Kochetov ◽  
Polina Kononova ◽  
Mikhail Paschenko
Keyword(s):  
Tabu Search ◽  
Variable Neighborhood Search ◽  
High Efficiency ◽  
Neighborhood Search ◽  
Timetabling Problem ◽  
Search Heuristics ◽  
Time Periods ◽  
Solution Representation ◽  
Search Approach ◽  
Formulation Space Search

We consider the well known NP-hard teacher/class timetabling problem. Variable neighborhood search and tabu search heuristics are developed based on idea of the Formulation Space Search approach. Two types of solution representation are used in the heuristics. For each representation we consider two families of neighborhoods. The first family uses swapping of time periods for teacher (class) timetable. The second family bases on the idea of large Kernighan-Lin neighborhoods. Computation results for difficult random test instances show high efficiency of the proposed approach. .

scholarly journals Hybrid Intelligent Water Drops Algorithm for Examination Timetabling Problem

2021 ◽  
Author(s):  
Bashar A. Aldeeb ◽  
Mohammed Azmi Al-Betar ◽  
Norita Md Norwawi ◽  
Khalid A. Alissa ◽  
Mutasem K. Alsmadi ◽  
...  
Keyword(s):  
Examination Timetabling ◽  
Timetabling Problem ◽  
Intelligent Water Drops Algorithm ◽  
Water Drops ◽  
Intelligent Water Drops
Sign in / Sign up

Export Citation Format

Share Document