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

Authors:
Salwani Abdullah;Khalid Shaker;Barry McCollum;Paul McMullan
Affiliations:
Center for Artificial Intelligence Technology, Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia;Center for Artificial Intelligence Technology, Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia;Department of Computer Science, Queen's University Belfast, Belfast, United Kingdom;Department of Computer Science, Queen's University Belfast, Belfast, United Kingdom
Venue:
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2010

Citing 7
Cited 4

A MAX-MIN Ant System for the University Course Timetabling Problem

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization

Journal of Global Optimization
An Extended Implementation of the Great Deluge Algorithm for Course Timetabling

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Generating University Course Timetable Using Genetic Algorithms and Local Search

ICCIT '08 Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 01
A survey of search methodologies and automated system development for examination timetabling

Journal of Scheduling
Electromagnetism-like Mechanism with Force Decay Rate Great Deluge for the Course Timetabling Problem

RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology

Incorporating great deluge with kempe chain neighbourhood structure for the enrolment-based course timetabling problem

RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems

Information Sciences: an International Journal
A hybrid fish swarm optimisation algorithm for solving examination timetabling problems

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
On the performance of Scatter Search for post-enrolment course timetabling problems

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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.