A multi-start very large neighbourhood search approach with local search methods for examination timetabling

Salwani Abdullah, Edmund K. Burke

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling
Pages334-337
Number of pages4
Volume2006
Publication statusPublished - 2006
Externally publishedYes
EventICAPS 2006 - 16th International Conference on Automated Planning and Scheduling - Cumbria
Duration: 6 Jun 200610 Jun 2006

Other

OtherICAPS 2006 - 16th International Conference on Automated Planning and Scheduling
CityCumbria
Period6/6/0610/6/06

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Abdullah, S., & Burke, E. K. (2006). A multi-start very large neighbourhood search approach with local search methods for examination timetabling. In ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling (Vol. 2006, pp. 334-337)

A multi-start very large neighbourhood search approach with local search methods for examination timetabling. / Abdullah, Salwani; Burke, Edmund K.

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling. Vol. 2006 2006. p. 334-337.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abdullah, S & Burke, EK 2006, A multi-start very large neighbourhood search approach with local search methods for examination timetabling. in ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling. vol. 2006, pp. 334-337, ICAPS 2006 - 16th International Conference on Automated Planning and Scheduling, Cumbria, 6/6/06.
Abdullah S, Burke EK. A multi-start very large neighbourhood search approach with local search methods for examination timetabling. In ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling. Vol. 2006. 2006. p. 334-337
Abdullah, Salwani ; Burke, Edmund K. / A multi-start very large neighbourhood search approach with local search methods for examination timetabling. ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling. Vol. 2006 2006. pp. 334-337
@inproceedings{4ba25d95c5304d21b395ed3463e73073,
title = "A multi-start very large neighbourhood search approach with local search methods for examination timetabling",
abstract = "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.",
author = "Salwani Abdullah and Burke, {Edmund K.}",
year = "2006",
language = "English",
volume = "2006",
pages = "334--337",
booktitle = "ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling",

}

TY - GEN

T1 - A multi-start very large neighbourhood search approach with local search methods for examination timetabling

AU - Abdullah, Salwani

AU - Burke, Edmund K.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746036833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746036833&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33746036833

VL - 2006

SP - 334

EP - 337

BT - ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

ER -