Average late acceptance randomized descent algorithm for solving course timetabling problems

Anmar Abuhamdah, Masri Ayob

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

4 Citations (Scopus)

Abstract

This work proposes an average late acceptance randomized descent algorithm (ALARD) to solve university course timetabling problems. The aim of this work is to produce an effective algorithm for assigning a set of courses (events) and students to a specific number of rooms and timeslots, subject to a set of constraints. The idea is based on the late acceptance strategy in hill climbing (LAHC). Both LAHC and ALARD use a list to store penalty values of some recently accepted solutions. However, ALARD differs from the basic LAHC as it uses an average quality of accepted solutions in the list as the acceptance criterion, whilst LAHC used the selected solution quality in the acceptance list as the acceptance criterion. Therefore, the performance of ALARD does not rely on the length of list (because the acceptance criterion is based on the threshold value), whilst LAHC is very much depending on the length of the list. Results tested on the Socha's benchmark datasets showed that, ALARD produces significantly good quality solutions compared to LAHC and comparable to other approaches tested on this dataset.

Original languageEnglish
Title of host publicationProceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10
Pages748-753
Number of pages6
Volume2
DOIs
Publication statusPublished - 2010
Event2010 International Symposium on Information Technology, ITSim'10 - Kuala Lumpur
Duration: 15 Jun 201017 Jun 2010

Other

Other2010 International Symposium on Information Technology, ITSim'10
CityKuala Lumpur
Period15/6/1017/6/10

Fingerprint

Students

Keywords

  • Course timetabling problem
  • Late Acceptance Strategy in Hill Climbing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Abuhamdah, A., & Ayob, M. (2010). Average late acceptance randomized descent algorithm for solving course timetabling problems. In Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10 (Vol. 2, pp. 748-753). [5561545] https://doi.org/10.1109/ITSIM.2010.5561545

Average late acceptance randomized descent algorithm for solving course timetabling problems. / Abuhamdah, Anmar; Ayob, Masri.

Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10. Vol. 2 2010. p. 748-753 5561545.

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

Abuhamdah, A & Ayob, M 2010, Average late acceptance randomized descent algorithm for solving course timetabling problems. in Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10. vol. 2, 5561545, pp. 748-753, 2010 International Symposium on Information Technology, ITSim'10, Kuala Lumpur, 15/6/10. https://doi.org/10.1109/ITSIM.2010.5561545
Abuhamdah A, Ayob M. Average late acceptance randomized descent algorithm for solving course timetabling problems. In Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10. Vol. 2. 2010. p. 748-753. 5561545 https://doi.org/10.1109/ITSIM.2010.5561545
Abuhamdah, Anmar ; Ayob, Masri. / Average late acceptance randomized descent algorithm for solving course timetabling problems. Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10. Vol. 2 2010. pp. 748-753
@inproceedings{32b2d741f13e4192a13b1d4d14afdce8,
title = "Average late acceptance randomized descent algorithm for solving course timetabling problems",
abstract = "This work proposes an average late acceptance randomized descent algorithm (ALARD) to solve university course timetabling problems. The aim of this work is to produce an effective algorithm for assigning a set of courses (events) and students to a specific number of rooms and timeslots, subject to a set of constraints. The idea is based on the late acceptance strategy in hill climbing (LAHC). Both LAHC and ALARD use a list to store penalty values of some recently accepted solutions. However, ALARD differs from the basic LAHC as it uses an average quality of accepted solutions in the list as the acceptance criterion, whilst LAHC used the selected solution quality in the acceptance list as the acceptance criterion. Therefore, the performance of ALARD does not rely on the length of list (because the acceptance criterion is based on the threshold value), whilst LAHC is very much depending on the length of the list. Results tested on the Socha's benchmark datasets showed that, ALARD produces significantly good quality solutions compared to LAHC and comparable to other approaches tested on this dataset.",
keywords = "Course timetabling problem, Late Acceptance Strategy in Hill Climbing",
author = "Anmar Abuhamdah and Masri Ayob",
year = "2010",
doi = "10.1109/ITSIM.2010.5561545",
language = "English",
isbn = "9781424467181",
volume = "2",
pages = "748--753",
booktitle = "Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10",

}

TY - GEN

T1 - Average late acceptance randomized descent algorithm for solving course timetabling problems

AU - Abuhamdah, Anmar

AU - Ayob, Masri

PY - 2010

Y1 - 2010

N2 - This work proposes an average late acceptance randomized descent algorithm (ALARD) to solve university course timetabling problems. The aim of this work is to produce an effective algorithm for assigning a set of courses (events) and students to a specific number of rooms and timeslots, subject to a set of constraints. The idea is based on the late acceptance strategy in hill climbing (LAHC). Both LAHC and ALARD use a list to store penalty values of some recently accepted solutions. However, ALARD differs from the basic LAHC as it uses an average quality of accepted solutions in the list as the acceptance criterion, whilst LAHC used the selected solution quality in the acceptance list as the acceptance criterion. Therefore, the performance of ALARD does not rely on the length of list (because the acceptance criterion is based on the threshold value), whilst LAHC is very much depending on the length of the list. Results tested on the Socha's benchmark datasets showed that, ALARD produces significantly good quality solutions compared to LAHC and comparable to other approaches tested on this dataset.

AB - This work proposes an average late acceptance randomized descent algorithm (ALARD) to solve university course timetabling problems. The aim of this work is to produce an effective algorithm for assigning a set of courses (events) and students to a specific number of rooms and timeslots, subject to a set of constraints. The idea is based on the late acceptance strategy in hill climbing (LAHC). Both LAHC and ALARD use a list to store penalty values of some recently accepted solutions. However, ALARD differs from the basic LAHC as it uses an average quality of accepted solutions in the list as the acceptance criterion, whilst LAHC used the selected solution quality in the acceptance list as the acceptance criterion. Therefore, the performance of ALARD does not rely on the length of list (because the acceptance criterion is based on the threshold value), whilst LAHC is very much depending on the length of the list. Results tested on the Socha's benchmark datasets showed that, ALARD produces significantly good quality solutions compared to LAHC and comparable to other approaches tested on this dataset.

KW - Course timetabling problem

KW - Late Acceptance Strategy in Hill Climbing

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

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

U2 - 10.1109/ITSIM.2010.5561545

DO - 10.1109/ITSIM.2010.5561545

M3 - Conference contribution

AN - SCOPUS:78049363158

SN - 9781424467181

VL - 2

SP - 748

EP - 753

BT - Proceedings 2010 International Symposium on Information Technology - Engineering Technology, ITSim'10

ER -