Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem

Ariff Md. Ab Malik, Masri Ayob, Abdul Razak Hamdan

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

5 Citations (Scopus)

Abstract

In this research, we introduce a set of multi-neighbourhood strategies of iterated two-stage tabu search, ITMTS, to solve examination timetabling problems. This work is based on the standard tabu search with some modifications that are derived from the neighbourhood structure. The neighbourhood structure has divided the neighbourhood search mechanism into two stages, vertical neighbourhood search and horizontal neighbourhood search. These search mechanisms will work alternately with different neighbourhood concentration and candidate evaluation. We test and evaluate ITMTS with the uncapacitated Carter benchmark datasets and standard Carter's proximity cost. Our results are comparable with other approaches that have been reported in the literature with regards to the Carter's benchmark dataset and have shown as a promising technique to be further enhanced.

Original languageEnglish
Title of host publication2009 2nd Conference on Data Mining and Optimization, DMO 2009
Pages141-148
Number of pages8
DOIs
Publication statusPublished - 2009
Event2009 2nd Conference on Data Mining and Optimization, DMO 2009 - Bangi, Selangor
Duration: 27 Oct 200928 Oct 2009

Other

Other2009 2nd Conference on Data Mining and Optimization, DMO 2009
CityBangi, Selangor
Period27/10/0928/10/09

Fingerprint

Tabu search
Costs

Keywords

  • Iterated two-stage tabu search
  • Longer-term tabu list
  • Meta-heuristic
  • Multi-neighbourhood structures
  • Short-term tabu list

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Md. Ab Malik, A., Ayob, M., & Hamdan, A. R. (2009). Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009 (pp. 141-148). [5341897] https://doi.org/10.1109/DMO.2009.5341897

Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem. / Md. Ab Malik, Ariff; Ayob, Masri; Hamdan, Abdul Razak.

2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 141-148 5341897.

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

Md. Ab Malik, A, Ayob, M & Hamdan, AR 2009, Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem. in 2009 2nd Conference on Data Mining and Optimization, DMO 2009., 5341897, pp. 141-148, 2009 2nd Conference on Data Mining and Optimization, DMO 2009, Bangi, Selangor, 27/10/09. https://doi.org/10.1109/DMO.2009.5341897
Md. Ab Malik A, Ayob M, Hamdan AR. Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 141-148. 5341897 https://doi.org/10.1109/DMO.2009.5341897
Md. Ab Malik, Ariff ; Ayob, Masri ; Hamdan, Abdul Razak. / Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem. 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. pp. 141-148
@inproceedings{344c3c08b2cf49ab99132651377795a0,
title = "Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem",
abstract = "In this research, we introduce a set of multi-neighbourhood strategies of iterated two-stage tabu search, ITMTS, to solve examination timetabling problems. This work is based on the standard tabu search with some modifications that are derived from the neighbourhood structure. The neighbourhood structure has divided the neighbourhood search mechanism into two stages, vertical neighbourhood search and horizontal neighbourhood search. These search mechanisms will work alternately with different neighbourhood concentration and candidate evaluation. We test and evaluate ITMTS with the uncapacitated Carter benchmark datasets and standard Carter's proximity cost. Our results are comparable with other approaches that have been reported in the literature with regards to the Carter's benchmark dataset and have shown as a promising technique to be further enhanced.",
keywords = "Iterated two-stage tabu search, Longer-term tabu list, Meta-heuristic, Multi-neighbourhood structures, Short-term tabu list",
author = "{Md. Ab Malik}, Ariff and Masri Ayob and Hamdan, {Abdul Razak}",
year = "2009",
doi = "10.1109/DMO.2009.5341897",
language = "English",
isbn = "9781424449446",
pages = "141--148",
booktitle = "2009 2nd Conference on Data Mining and Optimization, DMO 2009",

}

TY - GEN

T1 - Iterated two-stage multi-neighbourhood tabu search approach for examination timetabling problem

AU - Md. Ab Malik, Ariff

AU - Ayob, Masri

AU - Hamdan, Abdul Razak

PY - 2009

Y1 - 2009

N2 - In this research, we introduce a set of multi-neighbourhood strategies of iterated two-stage tabu search, ITMTS, to solve examination timetabling problems. This work is based on the standard tabu search with some modifications that are derived from the neighbourhood structure. The neighbourhood structure has divided the neighbourhood search mechanism into two stages, vertical neighbourhood search and horizontal neighbourhood search. These search mechanisms will work alternately with different neighbourhood concentration and candidate evaluation. We test and evaluate ITMTS with the uncapacitated Carter benchmark datasets and standard Carter's proximity cost. Our results are comparable with other approaches that have been reported in the literature with regards to the Carter's benchmark dataset and have shown as a promising technique to be further enhanced.

AB - In this research, we introduce a set of multi-neighbourhood strategies of iterated two-stage tabu search, ITMTS, to solve examination timetabling problems. This work is based on the standard tabu search with some modifications that are derived from the neighbourhood structure. The neighbourhood structure has divided the neighbourhood search mechanism into two stages, vertical neighbourhood search and horizontal neighbourhood search. These search mechanisms will work alternately with different neighbourhood concentration and candidate evaluation. We test and evaluate ITMTS with the uncapacitated Carter benchmark datasets and standard Carter's proximity cost. Our results are comparable with other approaches that have been reported in the literature with regards to the Carter's benchmark dataset and have shown as a promising technique to be further enhanced.

KW - Iterated two-stage tabu search

KW - Longer-term tabu list

KW - Meta-heuristic

KW - Multi-neighbourhood structures

KW - Short-term tabu list

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

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

U2 - 10.1109/DMO.2009.5341897

DO - 10.1109/DMO.2009.5341897

M3 - Conference contribution

AN - SCOPUS:72449190090

SN - 9781424449446

SP - 141

EP - 148

BT - 2009 2nd Conference on Data Mining and Optimization, DMO 2009

ER -