Hybridization Multi-Neighbourhood Particle Collision Algorithm and Great Deluge for solving course timetabling problems

Anmar Abuhamdah, Masri Ayob

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

11 Citations (Scopus)

Abstract

This work presents a Particle Collision Algorithm (PCA) to solve university course timetabling problems. The aim 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 PCA resembles a simulated annealing structure. The basic difference is that PCA does not have cooling schedule and it does not rely on user-defined parameters. PCA differs from Simulated Annealing and other meta-heuristic approaches where, before accepting the trial solution (although we obtain good-quality solution). Therefore, PCA is capable of escaping from local optima. The Hybrid Multi-Neighbourhood Particle Collision Algorithm with Great Deluge using Composite Neighbourhood Structure (HPCA), which it is hybridize the Great Deluge acceptance criterion with PCA and enhances a PCA approach that was originally introduced by Sacco for policy optimization. HPCA differs from basic PCA in terms of applying multi-neighbourhood composite structures, which is divided into two stages, one in the solution construction phase and the other in the improvement phase. HPCA also differs from basic PCA in terms of accepting the worst solution in the scattering phase, which is hybrid the Great Deluge acceptance criterion with PCA. HPCA attempts to further enhance the trial solution by exploring different neighbourhood structures. Results tested on Socha benchmark datasets show that HPCA 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 publication2009 2nd Conference on Data Mining and Optimization, DMO 2009
Pages108-114
Number of pages7
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

Composite structures
Simulated annealing
Scattering
Students
Cooling

Keywords

  • Course timetabling problem
  • Great Deluge
  • Particle Collision Algorithm

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Abuhamdah, A., & Ayob, M. (2009). Hybridization Multi-Neighbourhood Particle Collision Algorithm and Great Deluge for solving course timetabling problems. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009 (pp. 108-114). [5341900] https://doi.org/10.1109/DMO.2009.5341900

Hybridization Multi-Neighbourhood Particle Collision Algorithm and Great Deluge for solving course timetabling problems. / Abuhamdah, Anmar; Ayob, Masri.

2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 108-114 5341900.

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

Abuhamdah, A & Ayob, M 2009, Hybridization Multi-Neighbourhood Particle Collision Algorithm and Great Deluge for solving course timetabling problems. in 2009 2nd Conference on Data Mining and Optimization, DMO 2009., 5341900, pp. 108-114, 2009 2nd Conference on Data Mining and Optimization, DMO 2009, Bangi, Selangor, 27/10/09. https://doi.org/10.1109/DMO.2009.5341900
Abuhamdah, Anmar ; Ayob, Masri. / Hybridization Multi-Neighbourhood Particle Collision Algorithm and Great Deluge for solving course timetabling problems. 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. pp. 108-114
@inproceedings{2f84120a224a4a87b42102cf70b51bd0,
title = "Hybridization Multi-Neighbourhood Particle Collision Algorithm and Great Deluge for solving course timetabling problems",
abstract = "This work presents a Particle Collision Algorithm (PCA) to solve university course timetabling problems. The aim 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 PCA resembles a simulated annealing structure. The basic difference is that PCA does not have cooling schedule and it does not rely on user-defined parameters. PCA differs from Simulated Annealing and other meta-heuristic approaches where, before accepting the trial solution (although we obtain good-quality solution). Therefore, PCA is capable of escaping from local optima. The Hybrid Multi-Neighbourhood Particle Collision Algorithm with Great Deluge using Composite Neighbourhood Structure (HPCA), which it is hybridize the Great Deluge acceptance criterion with PCA and enhances a PCA approach that was originally introduced by Sacco for policy optimization. HPCA differs from basic PCA in terms of applying multi-neighbourhood composite structures, which is divided into two stages, one in the solution construction phase and the other in the improvement phase. HPCA also differs from basic PCA in terms of accepting the worst solution in the scattering phase, which is hybrid the Great Deluge acceptance criterion with PCA. HPCA attempts to further enhance the trial solution by exploring different neighbourhood structures. Results tested on Socha benchmark datasets show that HPCA is able to produce significantly good quality solutions within a reasonable time and outperformed some other approaches in some instances.",
keywords = "Course timetabling problem, Great Deluge, Particle Collision Algorithm",
author = "Anmar Abuhamdah and Masri Ayob",
year = "2009",
doi = "10.1109/DMO.2009.5341900",
language = "English",
isbn = "9781424449446",
pages = "108--114",
booktitle = "2009 2nd Conference on Data Mining and Optimization, DMO 2009",

}

TY - GEN

T1 - Hybridization Multi-Neighbourhood Particle Collision Algorithm and Great Deluge for solving course timetabling problems

AU - Abuhamdah, Anmar

AU - Ayob, Masri

PY - 2009

Y1 - 2009

N2 - This work presents a Particle Collision Algorithm (PCA) to solve university course timetabling problems. The aim 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 PCA resembles a simulated annealing structure. The basic difference is that PCA does not have cooling schedule and it does not rely on user-defined parameters. PCA differs from Simulated Annealing and other meta-heuristic approaches where, before accepting the trial solution (although we obtain good-quality solution). Therefore, PCA is capable of escaping from local optima. The Hybrid Multi-Neighbourhood Particle Collision Algorithm with Great Deluge using Composite Neighbourhood Structure (HPCA), which it is hybridize the Great Deluge acceptance criterion with PCA and enhances a PCA approach that was originally introduced by Sacco for policy optimization. HPCA differs from basic PCA in terms of applying multi-neighbourhood composite structures, which is divided into two stages, one in the solution construction phase and the other in the improvement phase. HPCA also differs from basic PCA in terms of accepting the worst solution in the scattering phase, which is hybrid the Great Deluge acceptance criterion with PCA. HPCA attempts to further enhance the trial solution by exploring different neighbourhood structures. Results tested on Socha benchmark datasets show that HPCA 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 Particle Collision Algorithm (PCA) to solve university course timetabling problems. The aim 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 PCA resembles a simulated annealing structure. The basic difference is that PCA does not have cooling schedule and it does not rely on user-defined parameters. PCA differs from Simulated Annealing and other meta-heuristic approaches where, before accepting the trial solution (although we obtain good-quality solution). Therefore, PCA is capable of escaping from local optima. The Hybrid Multi-Neighbourhood Particle Collision Algorithm with Great Deluge using Composite Neighbourhood Structure (HPCA), which it is hybridize the Great Deluge acceptance criterion with PCA and enhances a PCA approach that was originally introduced by Sacco for policy optimization. HPCA differs from basic PCA in terms of applying multi-neighbourhood composite structures, which is divided into two stages, one in the solution construction phase and the other in the improvement phase. HPCA also differs from basic PCA in terms of accepting the worst solution in the scattering phase, which is hybrid the Great Deluge acceptance criterion with PCA. HPCA attempts to further enhance the trial solution by exploring different neighbourhood structures. Results tested on Socha benchmark datasets show that HPCA is able to produce significantly good quality solutions within a reasonable time and outperformed some other approaches in some instances.

KW - Course timetabling problem

KW - Great Deluge

KW - Particle Collision Algorithm

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

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

U2 - 10.1109/DMO.2009.5341900

DO - 10.1109/DMO.2009.5341900

M3 - Conference contribution

SN - 9781424449446

SP - 108

EP - 114

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

ER -