Hybrid Ant Colony Systems for course timetabling problems

Masri Ayob, Ghaith Jaradat

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

28 Citations (Scopus)

Abstract

The University Course Timetabling is a complex optimization Problem which is difficult to solve for optimality. It involves assigning lectures to a fixed number of timeslots and rooms; while satisfying some constraints. The goal is to construct a feasible timetable and satisfy soft constraints as much as possible. In this study, we apply two hybrids Ant Colony Systems, namely the Simulated Annealing with Ant Colony System (ACS-SA), and Tabu Search with Ant Colony System (ACS-TS) to solve the university course timetabling, a number of ants in the ACS construct a complete assignment of courses to timeslots. Based on a pre-ordered list of courses, the ants probabilistically choose the timeslot for the given course, guided by heuristic information and stigmergic information. We test both ACS algorithms over the Socha's benchmark course timetabling problem. We also compare our results with those obtained by other methodologies recent literature has illustrated. Experimental results showed that both ACS-SA and ACS-TS produces good quality solutions and outperforms previously applied Ant algorithms; they also outperform other methodologies tested on Socha's benchmark test instances, and approaches on some benchmark instances. We believe that these hybrid ACS algorithms are also valid for other types of combinational optimization problems.

Original languageEnglish
Title of host publication2009 2nd Conference on Data Mining and Optimization, DMO 2009
Pages120-126
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

Tabu search
Simulated annealing

Keywords

  • Ant Colony System
  • Course timetabling problem
  • Simulated annealing
  • Tabu search

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Ayob, M., & Jaradat, G. (2009). Hybrid Ant Colony Systems for course timetabling problems. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009 (pp. 120-126). [5341898] https://doi.org/10.1109/DMO.2009.5341898

Hybrid Ant Colony Systems for course timetabling problems. / Ayob, Masri; Jaradat, Ghaith.

2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 120-126 5341898.

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

Ayob, M & Jaradat, G 2009, Hybrid Ant Colony Systems for course timetabling problems. in 2009 2nd Conference on Data Mining and Optimization, DMO 2009., 5341898, pp. 120-126, 2009 2nd Conference on Data Mining and Optimization, DMO 2009, Bangi, Selangor, 27/10/09. https://doi.org/10.1109/DMO.2009.5341898
Ayob M, Jaradat G. Hybrid Ant Colony Systems for course timetabling problems. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 120-126. 5341898 https://doi.org/10.1109/DMO.2009.5341898
Ayob, Masri ; Jaradat, Ghaith. / Hybrid Ant Colony Systems for course timetabling problems. 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. pp. 120-126
@inproceedings{f0d487aae59149fea21c294e1c6748c7,
title = "Hybrid Ant Colony Systems for course timetabling problems",
abstract = "The University Course Timetabling is a complex optimization Problem which is difficult to solve for optimality. It involves assigning lectures to a fixed number of timeslots and rooms; while satisfying some constraints. The goal is to construct a feasible timetable and satisfy soft constraints as much as possible. In this study, we apply two hybrids Ant Colony Systems, namely the Simulated Annealing with Ant Colony System (ACS-SA), and Tabu Search with Ant Colony System (ACS-TS) to solve the university course timetabling, a number of ants in the ACS construct a complete assignment of courses to timeslots. Based on a pre-ordered list of courses, the ants probabilistically choose the timeslot for the given course, guided by heuristic information and stigmergic information. We test both ACS algorithms over the Socha's benchmark course timetabling problem. We also compare our results with those obtained by other methodologies recent literature has illustrated. Experimental results showed that both ACS-SA and ACS-TS produces good quality solutions and outperforms previously applied Ant algorithms; they also outperform other methodologies tested on Socha's benchmark test instances, and approaches on some benchmark instances. We believe that these hybrid ACS algorithms are also valid for other types of combinational optimization problems.",
keywords = "Ant Colony System, Course timetabling problem, Simulated annealing, Tabu search",
author = "Masri Ayob and Ghaith Jaradat",
year = "2009",
doi = "10.1109/DMO.2009.5341898",
language = "English",
isbn = "9781424449446",
pages = "120--126",
booktitle = "2009 2nd Conference on Data Mining and Optimization, DMO 2009",

}

TY - GEN

T1 - Hybrid Ant Colony Systems for course timetabling problems

AU - Ayob, Masri

AU - Jaradat, Ghaith

PY - 2009

Y1 - 2009

N2 - The University Course Timetabling is a complex optimization Problem which is difficult to solve for optimality. It involves assigning lectures to a fixed number of timeslots and rooms; while satisfying some constraints. The goal is to construct a feasible timetable and satisfy soft constraints as much as possible. In this study, we apply two hybrids Ant Colony Systems, namely the Simulated Annealing with Ant Colony System (ACS-SA), and Tabu Search with Ant Colony System (ACS-TS) to solve the university course timetabling, a number of ants in the ACS construct a complete assignment of courses to timeslots. Based on a pre-ordered list of courses, the ants probabilistically choose the timeslot for the given course, guided by heuristic information and stigmergic information. We test both ACS algorithms over the Socha's benchmark course timetabling problem. We also compare our results with those obtained by other methodologies recent literature has illustrated. Experimental results showed that both ACS-SA and ACS-TS produces good quality solutions and outperforms previously applied Ant algorithms; they also outperform other methodologies tested on Socha's benchmark test instances, and approaches on some benchmark instances. We believe that these hybrid ACS algorithms are also valid for other types of combinational optimization problems.

AB - The University Course Timetabling is a complex optimization Problem which is difficult to solve for optimality. It involves assigning lectures to a fixed number of timeslots and rooms; while satisfying some constraints. The goal is to construct a feasible timetable and satisfy soft constraints as much as possible. In this study, we apply two hybrids Ant Colony Systems, namely the Simulated Annealing with Ant Colony System (ACS-SA), and Tabu Search with Ant Colony System (ACS-TS) to solve the university course timetabling, a number of ants in the ACS construct a complete assignment of courses to timeslots. Based on a pre-ordered list of courses, the ants probabilistically choose the timeslot for the given course, guided by heuristic information and stigmergic information. We test both ACS algorithms over the Socha's benchmark course timetabling problem. We also compare our results with those obtained by other methodologies recent literature has illustrated. Experimental results showed that both ACS-SA and ACS-TS produces good quality solutions and outperforms previously applied Ant algorithms; they also outperform other methodologies tested on Socha's benchmark test instances, and approaches on some benchmark instances. We believe that these hybrid ACS algorithms are also valid for other types of combinational optimization problems.

KW - Ant Colony System

KW - Course timetabling problem

KW - Simulated annealing

KW - Tabu search

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

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

U2 - 10.1109/DMO.2009.5341898

DO - 10.1109/DMO.2009.5341898

M3 - Conference contribution

AN - SCOPUS:72449125632

SN - 9781424449446

SP - 120

EP - 126

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

ER -