Show simple item record

dc.contributor.authorSakal, J
dc.contributor.authorFieldsend, JE
dc.contributor.authorKeedwell, E
dc.date.accessioned2021-04-23T09:18:53Z
dc.date.issued2021-07-07
dc.description.abstractPrevious studies have employed Ant Colony Optimisation to solve the University Course Timetabling task — which requires the order of lecture assignments to be defined for its construction graph. Various heuristic or random ordering techniques have been proposed in the literature, but uncertainty remains regarding the best approach for this. We investigate the effect that permuting assignment order has on the quality of timetable produced. As part of this we develop a novel MAX-MIN Ant System including dynamic constraint handling and partial function evaluations. We also explore algorithm variants with and without Local Search and employ a form of transfer learning to identify appropriate permutations. We find that between smaller problems in the International Timetabling Competition 2007 benchmark, timetabling performance can be improved using such an approach. However we find that we lose this performance gain when attempting to transfer to considerably larger problems — indicating that similar structures are required when using a ‘learnt’ permutation approach in such a framework.en_GB
dc.description.sponsorshipEngineering and Physical Sciences Research Council (EPSRC)en_GB
dc.identifier.citationGECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference, 10 - 14 July 2021, Lille, France, pp. 77–78en_GB
dc.identifier.doi10.1145/3449726.3459534
dc.identifier.urihttp://hdl.handle.net/10871/125447
dc.language.isoenen_GB
dc.publisherAssociation for Computing Machinery (ACM)en_GB
dc.rights© 2021 Copyright held by the owner/author(s). Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).en_GB
dc.subjectTimetabling and schedulingen_GB
dc.subjectant algorithmsen_GB
dc.subjectcombinatorial optimisationen_GB
dc.subjectempirical studyen_GB
dc.titleLearning assignment order in an ant colony optimiser for the university course timetabling problemen_GB
dc.typeConference paperen_GB
dc.date.available2021-04-23T09:18:53Z
dc.identifier.isbn978-1-4503-8351-6
dc.descriptionThis is the author accepted manuscript. The final version is available from ACM via the DOI in this recorden_GB
dc.rights.urihttp://www.rioxx.net/licenses/all-rights-reserveden_GB
dcterms.dateAccepted2021-03-26
exeter.funder::Engineering and Physical Sciences Research Council (EPSRC)en_GB
rioxxterms.versionAMen_GB
rioxxterms.licenseref.startdate2021-07-10
rioxxterms.typeConference Paper/Proceeding/Abstracten_GB
refterms.dateFCD2021-04-22T09:07:02Z
refterms.versionFCDAM
refterms.dateFOA2021-08-18T13:22:04Z
refterms.panelBen_GB


Files in this item

This item appears in the following Collection(s)

Show simple item record