Dual sequence simulated annealing with round-robin approach for university course timetabling

Salwani Abdullah, Khalid Shaker, Barry McCollum, Paul McMullan

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

27 Citations (Scopus)

Abstract

The university course timetabling problem involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraints; the objective is to satisfy the hard constraints (essential requirements) and minimize the violation of soft constraints (desirable requirements). In this study we employed a Dual-sequence Simulated Annealing (DSA) algorithm as an improvement algorithm. The Round Robin (RR) algorithm is used to control the selection of neighbourhood structures within DSA. The performance of our approach is tested over eleven benchmark datasets. Experimental results show that our approach is able to generate competitive results when compared with other state-of-the-art techniques.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages1-10
Number of pages10
Volume6022 LNCS
DOIs
Publication statusPublished - 2010
Event10th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2010 - Istanbul
Duration: 7 Apr 20109 Apr 2010

Publication series

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

Other

Other10th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2010
CityIstanbul
Period7/4/109/4/10

Fingerprint

Timetabling
Simulated annealing
Simulated Annealing
Soft Constraints
Requirements
Simulated Annealing Algorithm
Benchmark
Minimise
Experimental Results
Universities

Keywords

  • Course timetabling
  • Dual Sequence Simulated Annealing
  • Round Robin algorithm

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Abdullah, S., Shaker, K., McCollum, B., & McMullan, P. (2010). Dual sequence simulated annealing with round-robin approach for university course timetabling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6022 LNCS, pp. 1-10). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6022 LNCS). https://doi.org/10.1007/978-3-642-12139-5-1

Dual sequence simulated annealing with round-robin approach for university course timetabling. / Abdullah, Salwani; Shaker, Khalid; McCollum, Barry; McMullan, Paul.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6022 LNCS 2010. p. 1-10 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6022 LNCS).

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

Abdullah, S, Shaker, K, McCollum, B & McMullan, P 2010, Dual sequence simulated annealing with round-robin approach for university course timetabling. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6022 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6022 LNCS, pp. 1-10, 10th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2010, Istanbul, 7/4/10. https://doi.org/10.1007/978-3-642-12139-5-1
Abdullah S, Shaker K, McCollum B, McMullan P. Dual sequence simulated annealing with round-robin approach for university course timetabling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6022 LNCS. 2010. p. 1-10. (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-12139-5-1
Abdullah, Salwani ; Shaker, Khalid ; McCollum, Barry ; McMullan, Paul. / Dual sequence simulated annealing with round-robin approach for university course timetabling. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6022 LNCS 2010. pp. 1-10 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{052e5fab217940679f6f375fbf0627fd,
title = "Dual sequence simulated annealing with round-robin approach for university course timetabling",
abstract = "The university course timetabling problem involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraints; the objective is to satisfy the hard constraints (essential requirements) and minimize the violation of soft constraints (desirable requirements). In this study we employed a Dual-sequence Simulated Annealing (DSA) algorithm as an improvement algorithm. The Round Robin (RR) algorithm is used to control the selection of neighbourhood structures within DSA. The performance of our approach is tested over eleven benchmark datasets. Experimental results show that our approach is able to generate competitive results when compared with other state-of-the-art techniques.",
keywords = "Course timetabling, Dual Sequence Simulated Annealing, Round Robin algorithm",
author = "Salwani Abdullah and Khalid Shaker and Barry McCollum and Paul McMullan",
year = "2010",
doi = "10.1007/978-3-642-12139-5-1",
language = "English",
isbn = "3642121381",
volume = "6022 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1--10",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Dual sequence simulated annealing with round-robin approach for university course timetabling

AU - Abdullah, Salwani

AU - Shaker, Khalid

AU - McCollum, Barry

AU - McMullan, Paul

PY - 2010

Y1 - 2010

N2 - The university course timetabling problem involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraints; the objective is to satisfy the hard constraints (essential requirements) and minimize the violation of soft constraints (desirable requirements). In this study we employed a Dual-sequence Simulated Annealing (DSA) algorithm as an improvement algorithm. The Round Robin (RR) algorithm is used to control the selection of neighbourhood structures within DSA. The performance of our approach is tested over eleven benchmark datasets. Experimental results show that our approach is able to generate competitive results when compared with other state-of-the-art techniques.

AB - The university course timetabling problem involves assigning a given number of events into a limited number of timeslots and rooms under a given set of constraints; the objective is to satisfy the hard constraints (essential requirements) and minimize the violation of soft constraints (desirable requirements). In this study we employed a Dual-sequence Simulated Annealing (DSA) algorithm as an improvement algorithm. The Round Robin (RR) algorithm is used to control the selection of neighbourhood structures within DSA. The performance of our approach is tested over eleven benchmark datasets. Experimental results show that our approach is able to generate competitive results when compared with other state-of-the-art techniques.

KW - Course timetabling

KW - Dual Sequence Simulated Annealing

KW - Round Robin algorithm

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

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

U2 - 10.1007/978-3-642-12139-5-1

DO - 10.1007/978-3-642-12139-5-1

M3 - Conference contribution

AN - SCOPUS:77952317081

SN - 3642121381

SN - 9783642121388

VL - 6022 LNCS

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

SP - 1

EP - 10

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

ER -