A Multi-start Very Large Neighbourhood Search Approach with Local Search Methods for Examination Timetabling

Salwani Abdullah, Edmund K. Burke

This paper investigates a hybridisation of the very large neighbourhood search approach with local search methods to address examination timetabling problems. In this paper, we describe a 2 phase approach. The first phase employs “multi start” to carry out search upon a very large neighbourhood of solutions using graph theoretical algorithms implemented on an improvement graph. The second phase makes further improvements by utilising a local search method. We present experimental results which show that this combined approach compares favourably with other algorithms on the standard benchmark problems.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.