Hybrid variable neighbourhood approaches to university exam timetabling
نویسندگان
چکیده
In this paper we propose a variable neighbourhood search (VNS) meta-heuristic [25] for the university examination timetabling problem. In addition to a basic VNS method, we introduce a variety of variants which further improve the quality of the results produced by the technique. We also aim to demonstrate that the proposed technique is capable of producing high quality solutions across a wide range of benchmark problems. This high level of generality is one of the key features of the VNS technique. In particular, its combination with a genetic algorithm which intelligently selects which neighbourhoods to use for a given problem is shown to
منابع مشابه
Hybrid Variable Neighborhood Approaches to Exam Timetabling
A very important factor for the success of a local search is the neighborhood employed during the search. Variable Neighborhood Search (VNS) algorithms [5] employ more than one neighborhood and change the employment of these neighborhoods during the search. It provides a very effective way of escaping from local optima and is both versatile and successful compared to other local search techniqu...
متن کاملAn Investigation of Multistage Approaches to Examination Timetabling
Many successful approaches to examination timetabling consist of multiple stages, in which a constructive approach is used for finding a good initial solution, and then one or more improvement approaches are employed successively to further enhance the quality of the solution obtained during the previous stage. Moreover, there is a growing number of studies describing the success of approaches ...
متن کاملInvestigation of Multistage Approaches to Examination Timetabling
Many successful approaches to examination timetabling consist of multiple stages, in which a constructive approach is used for finding a good initial solution, and then one or more improvement approaches are employed successively to further enhance the quality of the solution obtained during the previous stage. Moreover, there is a growing number of studies describing the success of approaches ...
متن کاملAn Investigation of Variable Neighbourhood Search for University Course Timetabling
The university course timetabling problem consists, in essence, of assigning lectures to a specific timeslot and room. The goal is to satisfy as many soft constraints as possible while constructing a feasible schedule. In this paper, we present a variable neighbourhood search approach with an exponential monte carlo acceptance criteria. This heuristic search approach is based on random-descent ...
متن کاملHybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems
Exam timetabling is one of the most important administrative activities in universities (e.g. [4], [8], and [19]). Such problems have been the subject of significant research effort across Artificial Intelligence research and Operational Research since the 1960s. A general exam timetabling problem consists of assigning a set of exams into a limited number of timeslots while satisfying a set of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 206 شماره
صفحات -
تاریخ انتشار 2010