Staff View: Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables

Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables

This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three a...

Full description

Saved in:

Bibliographic Details
Main Authors:	Abdullah S., Shaker K., Shaker H.
Other Authors:	23395783300
Format:	Article
Published:	2023
Subjects:	Great deluge Hill climbing algorithm Round robin Simulated annealing University course timetabling problem
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my.uniten.dspace-29594
record_format	dspace
spelling	my.uniten.dspace-295942023-12-28T15:05:44Z Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables Abdullah S. Shaker K. Shaker H. 23395783300 35231134200 55990421500 Great deluge Hill climbing algorithm Round robin Simulated annealing University course timetabling problem This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three algorithms, that is, Great Deluge, Simulated Annealing and Hill Climbing where the Round Robin algorithm is used as control strategy in choosing the algorithm to be employed at the current stage. The performance of the approach is tested with over two sets of benchmark datasets, that is, enrolment-based course timetabling and curriculum-based course timetabling (UD1) in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed approach is able to produce competitive results for the test UCTPs. � 2011 Academic Journals. Final 2023-12-28T07:05:44Z 2023-12-28T07:05:44Z 2011 Article 2-s2.0-79957936133 https://www.scopus.com/inward/record.uri?eid=2-s2.0-79957936133&partnerID=40&md5=761b6422abca790ef38beffc44af1e0b https://irepository.uniten.edu.my/handle/123456789/29594 6 6 1452 1462 Scopus
institution	Universiti Tenaga Nasional
building	UNITEN Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	Universiti Tenaga Nasional
content_source	UNITEN Institutional Repository
url_provider	http://dspace.uniten.edu.my/
topic	Great deluge Hill climbing algorithm Round robin Simulated annealing University course timetabling problem
spellingShingle	Great deluge Hill climbing algorithm Round robin Simulated annealing University course timetabling problem Abdullah S. Shaker K. Shaker H. Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
description	This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three algorithms, that is, Great Deluge, Simulated Annealing and Hill Climbing where the Round Robin algorithm is used as control strategy in choosing the algorithm to be employed at the current stage. The performance of the approach is tested with over two sets of benchmark datasets, that is, enrolment-based course timetabling and curriculum-based course timetabling (UD1) in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed approach is able to produce competitive results for the test UCTPs. � 2011 Academic Journals.
author2	23395783300
author_facet	23395783300 Abdullah S. Shaker K. Shaker H.
format	Article
author	Abdullah S. Shaker K. Shaker H.
author_sort	Abdullah S.
title	Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
title_short	Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
title_full	Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
title_fullStr	Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
title_full_unstemmed	Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
title_sort	investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
publishDate	2023
_version_	1806423359398871040
score	13.211869

Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables

Similar Items