Adaptive Tabu Search for course timetabling
نویسندگان
چکیده
منابع مشابه
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general framework composed of three phases: initialization, intensification and diversification. The initialization phase constructs a feasible initial timetable using a fast greedy heuristic. Then an adaptively combined intensific...
متن کاملTabu Search Techniques for Examination Timetabling
The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairly spreading the exams for the students, and satisfying room capacity constraints. We present a family of solution algorithms for a set of variants of the Examination Timetabling problem. The algorithms are based on tabu search...
متن کاملImproving Exam Timetabling Solution Using TABU Search
A feasible exam timetable is generated using a method based on constraint satisfaction and heuristics. We investigate the usage of tabu search to further improve the quality of the exam timetable. Different length of short term tabu list and the long term tabu list is examined. Short term tabu list without long term tabu list and vice versa is also tested. Different search iteration based on ma...
متن کاملA hybrid genetic algorithm and tabu search approach for post enrolment course timetabling
The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student enrolment data. The PECTP is an NP-hard combinatorial optimization problem and hence is very difficult to solve to optimality. This paper proposes a hybrid approach to solve ...
متن کاملMulti-Neighbourhood Local Search for Course Timetabling
One of the most critical features for applying local search to timetabling problems is the definition of the neighbourhood structure. In fact, for most common timetabling problems, there is more than one neighbourhood structure that is sufficiently natural and intuitive to deserve investigation. The reason for considering combination of diverse neighbourhood is related to the diversification of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2010
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2008.12.007