Monte Carlo hyper-heuristics for examination timetabling

نویسندگان

  • Edmund K. Burke
  • Graham Kendall
  • Mustafa Misir
  • Ender Özcan
چکیده

Automating the neighbourhood selection process in an iterative approach that uses multiple heuristics is not a trivial task. Hyper-heuristics are search methodologies that not only aim to provide a general framework for solving problem instances at different difficulty levels in a given domain, but a key goal is also to extend the level of generality so that different problems from different domains can also be solved. Indeed, a major challenge is to explore how the heuristic design process might be automated. Almost all existing iterative selection hyper-heuristics performing single point search contain two successive stages; heuristic selection and move acceptance. Different operators can be used in either of the stages. Recent studies explore ways of introducing learning mechanisms into the search process for improving the performance of hyper-heuristics. In this study, a broad empirical analysis is performed comparing Monte Carlo based hyper-heuristics for solving capacitated examination timetabling problems. One of these hyper-heuristics is an approach that overlaps two stages and presents them in a single algorithmic body. A learning heuristic selection method (L) operates in harmony with a simulated annealing move acceptance method using reheating (SA) based on some shared variables. Yet, the heuristic selection and move acceptance methods can be separated as the proposed approach respects the common selection hyper-heuristic framework. The experimental results show that simulated annealing with reheating as a hyper-heuristic move acceptance method has significant potential. On the other hand, the learning hyper-heuristic using simulated annealing with reheating move E.K. Burke · G. Kendall · E. Özcan ( ) Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK e-mail: [email protected] E.K. Burke e-mail: [email protected] G. Kendall e-mail: [email protected] M. Mısır Department of Computer Engineering, Yeditepe University, Inonu Mahallesi, Kayisdagi Caddesi, Kadikoy, Istanbul 34755, Turkey e-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolving Hyper-Heuristics for a Highly Constrained Examination Timetabling Problem

A lot of research has been conducted on hyper-heuristics for examination timetabling. However, most of this work has been focused on an uncapacitated version of the problem. This study reports on evolving hyper-heuristics for a highly constrained version of the problem, namely, the set of problems from the second International Timetabling Competition (ITC ’07). Previous work has shown that usin...

متن کامل

An Investigation of a Tabu Search Based Hyper-heuristic for Examination Timetabling

This paper investigates a tabu search based hyper-heuristic for solving examination timetabling problems. The hyper-heuristic framework uses a tabu list to monitor the performance of a collection of low-level heuristics and then make tabu heuristics that have been applied too many times, thus allowing other heuristics to be applied. Experiments carried out on examination timetabling datasets fr...

متن کامل

A Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem

Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second takes an indirect approach to the problem and examines the generation of heuristics or combinations of heuristics, i.e. hyper-heuristics, to be used in the construction of examination timetables. The study presented in t...

متن کامل

A Monte Carlo Hyper-Heuristic To Optimise Component Placement Sequencing For Multi Head Placement Machine

In this paper we introduce a Monte Carlo based hyper-heuristic. The Monte Carlo hyper-heuristic manages a set of low level heuristics (in this case just simple 2-opt swaps but they could be any other heuristics). Each of the low level heuristics is responsible for creating a unique neighbour that may be impossible to create by the other low level heuristics. On each iteration, the Monte Carlo h...

متن کامل

Case Based Heuristic Selection for Examination Timetabling

The work presented in this paper could be thought of as a case based hyper-heuristic approach for examination timetabling problems. A hyper-heuristic can be taken to be an automated approach to choose heuristics. Heuristics and meta-heuristics are employed in this capacity in [1] and [2]. In this paper the case-based paradigm is explored as a heuristic selector for examination timetabling probl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Annals OR

دوره 196  شماره 

صفحات  -

تاریخ انتشار 2012