A Multiobjective Optimisation Technique for Exam Timetabling Problems Based on the Defined Trajectory
نویسندگان
چکیده
University examination timetabling problems comprise arranging exams in the given number of timeslots through the examination sessions. The primary objective of this process is avoiding of students' clashes (i.e. no one student should take two exams simultaneously). This requirement is generally considered as a hard constraint and should be obligatory satisfied in a feasible timetable. However, the number of other restrictions and regulations, which depend on a particular institution, should be also taken into account while solving examination timetabling problems. Some of them are also considered as hard constraints, while other constraints are soft, i.e. they cannot be completely satisfied, and therefore their violations should be minimised. The soft constraints usually have different importance for the timetable officer (decision maker). They are generally incompatible and often conflicting with each other.
منابع مشابه
A Multiobjective Optimisation Technique for Exam Timetabling Based on Trajectories
The most common approach to multiobjective examination timetabling is the weighted sum aggregation of all criteria into one cost function and application of some single-objective metaheuristic. However, the translation of user preferences into the weights of criteria is a sophisticated task, which requires experience on the part of the user, especially for problems with a high number of criteri...
متن کاملAn Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling
In many real-world scheduling problems (eg. machine scheduling, educational timetabling, personnel scheduling, etc.) several criteria must be considered simultaneously when evaluating the quality of the solution or schedule. Among these criteria there are: length of the schedule, utilisation of resources, satisfaction of people’s preferences and compliance with regulations. Traditionally, these...
متن کاملA hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice
Many researchers studying examination timetabling problems focus on either benchmark problems or problems from practice encountered in their institutions. Hyperheuristics are proposed as generic optimisation methods which explore the search space of heuristics rather than direct solutions. In the present study, the performance of tournament-based hyperheuristics for the exam timetabling problem...
متن کاملAnalysing the High Level Heuristics within a Graph Based Hyper-heuristic
This paper presents our work on analysing high level heuristics within a graph based hyper-heuristic framework. Local search based methods (Tabu Search and steepest descent method) are compared as the high level heuristics within the graph based hyper-heuristic framework and the analysis of their neighborhood structures and performance on the high level landscape is carried out. An iterated ste...
متن کاملUsing fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کامل