Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling

Salwani Abdullah, Samad Ahmadi, Edmund K. Burke, Moshe Dror

Research output: Contribution to journalArticle

66 Citations (Scopus)

Abstract

Since the 1960s, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of "adjacent" (neighbourhood) solutions. This solution search methodology, originally developed by Ahuja and Orlin, has been applied successfully in the past to a number of difficult combinatorial optimisation problems. It is based on an improvement graph representation of solution adjacency and identifies improvement moves by finding cycle exchange operations using a modified shortest path label-correcting algorithm. We have drawn upon Ahuja-Orlin's basic methodology to develop an effective automated exam timetabling technique. We have evaluated our approach against the latest methodologies in the literature on standard benchmark problems. We demonstrate that our approach produces some of the best known results on these problems.

Original languageEnglish
Pages (from-to)351-372
Number of pages22
JournalOR Spectrum
Volume29
Issue number2
DOIs
Publication statusPublished - Apr 2007
Externally publishedYes

Fingerprint

Timetabling
Methodology
Shortest path
Optimization problem
Combinatorial optimization
Graph
Benchmark

Keywords

  • Examination timetabling
  • Improvement graph
  • Large neighbourhood

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling. / Abdullah, Salwani; Ahmadi, Samad; Burke, Edmund K.; Dror, Moshe.

In: OR Spectrum, Vol. 29, No. 2, 04.2007, p. 351-372.

Research output: Contribution to journalArticle

Abdullah, Salwani ; Ahmadi, Samad ; Burke, Edmund K. ; Dror, Moshe. / Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling. In: OR Spectrum. 2007 ; Vol. 29, No. 2. pp. 351-372.
@article{12fb4da156e741afa552124559574fe2,
title = "Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling",
abstract = "Since the 1960s, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of {"}adjacent{"} (neighbourhood) solutions. This solution search methodology, originally developed by Ahuja and Orlin, has been applied successfully in the past to a number of difficult combinatorial optimisation problems. It is based on an improvement graph representation of solution adjacency and identifies improvement moves by finding cycle exchange operations using a modified shortest path label-correcting algorithm. We have drawn upon Ahuja-Orlin's basic methodology to develop an effective automated exam timetabling technique. We have evaluated our approach against the latest methodologies in the literature on standard benchmark problems. We demonstrate that our approach produces some of the best known results on these problems.",
keywords = "Examination timetabling, Improvement graph, Large neighbourhood",
author = "Salwani Abdullah and Samad Ahmadi and Burke, {Edmund K.} and Moshe Dror",
year = "2007",
month = "4",
doi = "10.1007/s00291-006-0034-7",
language = "English",
volume = "29",
pages = "351--372",
journal = "Operations-Research-Spektrum",
issn = "0171-6468",
publisher = "Springer Verlag",
number = "2",

}

TY - JOUR

T1 - Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling

AU - Abdullah, Salwani

AU - Ahmadi, Samad

AU - Burke, Edmund K.

AU - Dror, Moshe

PY - 2007/4

Y1 - 2007/4

N2 - Since the 1960s, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of "adjacent" (neighbourhood) solutions. This solution search methodology, originally developed by Ahuja and Orlin, has been applied successfully in the past to a number of difficult combinatorial optimisation problems. It is based on an improvement graph representation of solution adjacency and identifies improvement moves by finding cycle exchange operations using a modified shortest path label-correcting algorithm. We have drawn upon Ahuja-Orlin's basic methodology to develop an effective automated exam timetabling technique. We have evaluated our approach against the latest methodologies in the literature on standard benchmark problems. We demonstrate that our approach produces some of the best known results on these problems.

AB - Since the 1960s, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of "adjacent" (neighbourhood) solutions. This solution search methodology, originally developed by Ahuja and Orlin, has been applied successfully in the past to a number of difficult combinatorial optimisation problems. It is based on an improvement graph representation of solution adjacency and identifies improvement moves by finding cycle exchange operations using a modified shortest path label-correcting algorithm. We have drawn upon Ahuja-Orlin's basic methodology to develop an effective automated exam timetabling technique. We have evaluated our approach against the latest methodologies in the literature on standard benchmark problems. We demonstrate that our approach produces some of the best known results on these problems.

KW - Examination timetabling

KW - Improvement graph

KW - Large neighbourhood

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

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

U2 - 10.1007/s00291-006-0034-7

DO - 10.1007/s00291-006-0034-7

M3 - Article

AN - SCOPUS:33846865758

VL - 29

SP - 351

EP - 372

JO - Operations-Research-Spektrum

JF - Operations-Research-Spektrum

SN - 0171-6468

IS - 2

ER -