A tabu-based memetic approach for examination timetabling problems

Salwani Abdullah, Hamza Turabieh, Barry McCollum, Paul McMullan

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

11 Citations (Scopus)

Abstract

Constructing examination timetable for higher educational institutions is a very complex task due to the complexity of the issues involved. The objective of examination timetabling problem is to satisfy the hard constraints and minimize the violations of soft constraints. In this work, a tabu-based memetic approach has been applied and evaluated against the latest methodologies in the literature on standard benchmark problems. The approach hybridizes the concepts of tabu search and memetic algorithms. A tabu list is used to penalise neighbourhood structures that are unable to generate better solutions after the crossover and mutation operators have been applied to the selected solutions from the population pool. We demonstrate that our approach is able to enhance the quality of the solutions by carefully selecting the effective neighbourhood structures. Hence, some best known results have been obtained.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages574-581
Number of pages8
Volume6401 LNAI
DOIs
Publication statusPublished - 2010
Event5th International Conference on Rough Set and Knowledge Technology, RSKT 2010 - Beijing
Duration: 15 Oct 201017 Oct 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6401 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Conference on Rough Set and Knowledge Technology, RSKT 2010
CityBeijing
Period15/10/1017/10/10

Fingerprint

Timetabling
Soft Constraints
Tabu Search Algorithm
Memetic Algorithm
Crossover
Mutation
Tabu search
Benchmark
Minimise
Methodology
Operator
Demonstrate
Education
Standards
Concepts

Keywords

  • Examination Timetabling
  • Memetic Algorithm
  • Tabu List

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Abdullah, S., Turabieh, H., McCollum, B., & McMullan, P. (2010). A tabu-based memetic approach for examination timetabling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6401 LNAI, pp. 574-581). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6401 LNAI). https://doi.org/10.1007/978-3-642-16248-0_78

A tabu-based memetic approach for examination timetabling problems. / Abdullah, Salwani; Turabieh, Hamza; McCollum, Barry; McMullan, Paul.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6401 LNAI 2010. p. 574-581 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6401 LNAI).

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

Abdullah, S, Turabieh, H, McCollum, B & McMullan, P 2010, A tabu-based memetic approach for examination timetabling problems. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6401 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6401 LNAI, pp. 574-581, 5th International Conference on Rough Set and Knowledge Technology, RSKT 2010, Beijing, 15/10/10. https://doi.org/10.1007/978-3-642-16248-0_78
Abdullah S, Turabieh H, McCollum B, McMullan P. A tabu-based memetic approach for examination timetabling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6401 LNAI. 2010. p. 574-581. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-16248-0_78
Abdullah, Salwani ; Turabieh, Hamza ; McCollum, Barry ; McMullan, Paul. / A tabu-based memetic approach for examination timetabling problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6401 LNAI 2010. pp. 574-581 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e55bcf4c26ae4a42879b7a3af46eb492,
title = "A tabu-based memetic approach for examination timetabling problems",
abstract = "Constructing examination timetable for higher educational institutions is a very complex task due to the complexity of the issues involved. The objective of examination timetabling problem is to satisfy the hard constraints and minimize the violations of soft constraints. In this work, a tabu-based memetic approach has been applied and evaluated against the latest methodologies in the literature on standard benchmark problems. The approach hybridizes the concepts of tabu search and memetic algorithms. A tabu list is used to penalise neighbourhood structures that are unable to generate better solutions after the crossover and mutation operators have been applied to the selected solutions from the population pool. We demonstrate that our approach is able to enhance the quality of the solutions by carefully selecting the effective neighbourhood structures. Hence, some best known results have been obtained.",
keywords = "Examination Timetabling, Memetic Algorithm, Tabu List",
author = "Salwani Abdullah and Hamza Turabieh and Barry McCollum and Paul McMullan",
year = "2010",
doi = "10.1007/978-3-642-16248-0_78",
language = "English",
isbn = "3642162479",
volume = "6401 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "574--581",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A tabu-based memetic approach for examination timetabling problems

AU - Abdullah, Salwani

AU - Turabieh, Hamza

AU - McCollum, Barry

AU - McMullan, Paul

PY - 2010

Y1 - 2010

N2 - Constructing examination timetable for higher educational institutions is a very complex task due to the complexity of the issues involved. The objective of examination timetabling problem is to satisfy the hard constraints and minimize the violations of soft constraints. In this work, a tabu-based memetic approach has been applied and evaluated against the latest methodologies in the literature on standard benchmark problems. The approach hybridizes the concepts of tabu search and memetic algorithms. A tabu list is used to penalise neighbourhood structures that are unable to generate better solutions after the crossover and mutation operators have been applied to the selected solutions from the population pool. We demonstrate that our approach is able to enhance the quality of the solutions by carefully selecting the effective neighbourhood structures. Hence, some best known results have been obtained.

AB - Constructing examination timetable for higher educational institutions is a very complex task due to the complexity of the issues involved. The objective of examination timetabling problem is to satisfy the hard constraints and minimize the violations of soft constraints. In this work, a tabu-based memetic approach has been applied and evaluated against the latest methodologies in the literature on standard benchmark problems. The approach hybridizes the concepts of tabu search and memetic algorithms. A tabu list is used to penalise neighbourhood structures that are unable to generate better solutions after the crossover and mutation operators have been applied to the selected solutions from the population pool. We demonstrate that our approach is able to enhance the quality of the solutions by carefully selecting the effective neighbourhood structures. Hence, some best known results have been obtained.

KW - Examination Timetabling

KW - Memetic Algorithm

KW - Tabu List

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

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

U2 - 10.1007/978-3-642-16248-0_78

DO - 10.1007/978-3-642-16248-0_78

M3 - Conference contribution

AN - SCOPUS:78349264587

SN - 3642162479

SN - 9783642162473

VL - 6401 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 574

EP - 581

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -