MPCA-ARDA for solving course timetabling problems

Anmar Abuhamdah, Masri Ayob

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

4 Citations (Scopus)

Abstract

This work presents a hybridization between Multi-Neighborhood Particle Collision Algorithm (MPCA) and Adaptive Randomized Descent Algorithm (ARDA) acceptance criterion to solve university course timetabling problems. The aim of this work is to produce an effective algorithm for assigning a set of courses, lecturers and students to a specific number of rooms and timeslots, subject to a set of constraints. The structure of the MPCA-ARDA resembles a Hybrid Particle Collision Algorithm (HPCA) structure. The basic difference is that MPCA-ARDA hybridize MPCA and ARDA acceptance criterion, whilst HPCA, hybridize MPCA and great deluge acceptance criterion. In other words, MPCA-ARDA employ adaptive acceptance criterion, whilst HPCA, employ deterministic acceptance criterion. Therefore, MPCA-ARDA has better capability of escaping from local optima compared to HPCA and MPCA. MPCA-ARDA attempts to enhance the trial solution by exploring different neighborhood structures to overcome the limitation in HPCA and MPCA. Results tested on Socha benchmark datasets show that, MPCA-ARDA is able to produce significantly good quality solutions within a reasonable time and outperformed some other approaches in some instances.

Original languageEnglish
Title of host publicationConference on Data Mining and Optimization
Pages171-177
Number of pages7
DOIs
Publication statusPublished - 2011
Event2011 3rd Conference on Data Mining and Optimization, DMO 2011 - Putrajaya
Duration: 28 Jun 201129 Jun 2011

Other

Other2011 3rd Conference on Data Mining and Optimization, DMO 2011
CityPutrajaya
Period28/6/1129/6/11

Fingerprint

Adaptive algorithms

Keywords

  • Adaptive Randomized Descent Algorithm
  • Course Timetabling Problem
  • Particle Collision Algorithm

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Abuhamdah, A., & Ayob, M. (2011). MPCA-ARDA for solving course timetabling problems. In Conference on Data Mining and Optimization (pp. 171-177). [5976523] https://doi.org/10.1109/DMO.2011.5976523

MPCA-ARDA for solving course timetabling problems. / Abuhamdah, Anmar; Ayob, Masri.

Conference on Data Mining and Optimization. 2011. p. 171-177 5976523.

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

Abuhamdah, A & Ayob, M 2011, MPCA-ARDA for solving course timetabling problems. in Conference on Data Mining and Optimization., 5976523, pp. 171-177, 2011 3rd Conference on Data Mining and Optimization, DMO 2011, Putrajaya, 28/6/11. https://doi.org/10.1109/DMO.2011.5976523
Abuhamdah A, Ayob M. MPCA-ARDA for solving course timetabling problems. In Conference on Data Mining and Optimization. 2011. p. 171-177. 5976523 https://doi.org/10.1109/DMO.2011.5976523
Abuhamdah, Anmar ; Ayob, Masri. / MPCA-ARDA for solving course timetabling problems. Conference on Data Mining and Optimization. 2011. pp. 171-177
@inproceedings{83210ebaa4c347309d582b2bf9c4db0b,
title = "MPCA-ARDA for solving course timetabling problems",
abstract = "This work presents a hybridization between Multi-Neighborhood Particle Collision Algorithm (MPCA) and Adaptive Randomized Descent Algorithm (ARDA) acceptance criterion to solve university course timetabling problems. The aim of this work is to produce an effective algorithm for assigning a set of courses, lecturers and students to a specific number of rooms and timeslots, subject to a set of constraints. The structure of the MPCA-ARDA resembles a Hybrid Particle Collision Algorithm (HPCA) structure. The basic difference is that MPCA-ARDA hybridize MPCA and ARDA acceptance criterion, whilst HPCA, hybridize MPCA and great deluge acceptance criterion. In other words, MPCA-ARDA employ adaptive acceptance criterion, whilst HPCA, employ deterministic acceptance criterion. Therefore, MPCA-ARDA has better capability of escaping from local optima compared to HPCA and MPCA. MPCA-ARDA attempts to enhance the trial solution by exploring different neighborhood structures to overcome the limitation in HPCA and MPCA. Results tested on Socha benchmark datasets show that, MPCA-ARDA is able to produce significantly good quality solutions within a reasonable time and outperformed some other approaches in some instances.",
keywords = "Adaptive Randomized Descent Algorithm, Course Timetabling Problem, Particle Collision Algorithm",
author = "Anmar Abuhamdah and Masri Ayob",
year = "2011",
doi = "10.1109/DMO.2011.5976523",
language = "English",
isbn = "9781612842127",
pages = "171--177",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - MPCA-ARDA for solving course timetabling problems

AU - Abuhamdah, Anmar

AU - Ayob, Masri

PY - 2011

Y1 - 2011

N2 - This work presents a hybridization between Multi-Neighborhood Particle Collision Algorithm (MPCA) and Adaptive Randomized Descent Algorithm (ARDA) acceptance criterion to solve university course timetabling problems. The aim of this work is to produce an effective algorithm for assigning a set of courses, lecturers and students to a specific number of rooms and timeslots, subject to a set of constraints. The structure of the MPCA-ARDA resembles a Hybrid Particle Collision Algorithm (HPCA) structure. The basic difference is that MPCA-ARDA hybridize MPCA and ARDA acceptance criterion, whilst HPCA, hybridize MPCA and great deluge acceptance criterion. In other words, MPCA-ARDA employ adaptive acceptance criterion, whilst HPCA, employ deterministic acceptance criterion. Therefore, MPCA-ARDA has better capability of escaping from local optima compared to HPCA and MPCA. MPCA-ARDA attempts to enhance the trial solution by exploring different neighborhood structures to overcome the limitation in HPCA and MPCA. Results tested on Socha benchmark datasets show that, MPCA-ARDA is able to produce significantly good quality solutions within a reasonable time and outperformed some other approaches in some instances.

AB - This work presents a hybridization between Multi-Neighborhood Particle Collision Algorithm (MPCA) and Adaptive Randomized Descent Algorithm (ARDA) acceptance criterion to solve university course timetabling problems. The aim of this work is to produce an effective algorithm for assigning a set of courses, lecturers and students to a specific number of rooms and timeslots, subject to a set of constraints. The structure of the MPCA-ARDA resembles a Hybrid Particle Collision Algorithm (HPCA) structure. The basic difference is that MPCA-ARDA hybridize MPCA and ARDA acceptance criterion, whilst HPCA, hybridize MPCA and great deluge acceptance criterion. In other words, MPCA-ARDA employ adaptive acceptance criterion, whilst HPCA, employ deterministic acceptance criterion. Therefore, MPCA-ARDA has better capability of escaping from local optima compared to HPCA and MPCA. MPCA-ARDA attempts to enhance the trial solution by exploring different neighborhood structures to overcome the limitation in HPCA and MPCA. Results tested on Socha benchmark datasets show that, MPCA-ARDA is able to produce significantly good quality solutions within a reasonable time and outperformed some other approaches in some instances.

KW - Adaptive Randomized Descent Algorithm

KW - Course Timetabling Problem

KW - Particle Collision Algorithm

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

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

U2 - 10.1109/DMO.2011.5976523

DO - 10.1109/DMO.2011.5976523

M3 - Conference contribution

AN - SCOPUS:80055035230

SN - 9781612842127

SP - 171

EP - 177

BT - Conference on Data Mining and Optimization

ER -