Repository logo
 
Publication

A hybrid shuffled frog-leaping algorithm for the university examination timetabling problem

2016Conference object Restricted access
Simple item page
dc.contributor.authorLeite, Nuno
dc.contributor.authorMelicio, Fernando
dc.contributor.authorRosa, Agostinho C.
dc.date.accessioned2019-03-18T09:00:10Z
dc.date.available2019-03-18T09:00:10Z
dc.date.issued2016
dc.description.abstractThe problem of examination timetabling is studied in this work. We propose a hybrid solution heuristic based on the Shuffled Frog-Leaping Algorithm (SFLA) for minimising the conflicts in the students's exams. The hybrid algorithm, named Hybrid SFLA (HSFLA), improves a population of frogs (solutions) by iteratively optimising each memeplex, and then shuffling the memeplexes in order to distribute the best performing frogs by the memeplexes. In each iteration the frogs are improved based on three operators: crossover and mutation operators, and a local search operator based on the Simulated Annealing metaheuristic. For the mutation and local search, we use two well known neighbourhood structures. The performance of the proposed method is evaluated on the 13 instances of the Toronto datasets from the literature. Computational results show that the HSFLA is competitive with state-of-the-art methods, obtaining the best results on average in seven of the 13 instances.pt_PT
dc.description.versioninfo:eu-repo/semantics/publishedVersionpt_PT
dc.identifier.citationLEITE, Nuno; MELÍCIO, Fernando; ROSA, Agostinho C. – A hybrid shuffled frog-leaping algorithm for the university examination timetabling problem. Computational Intelligence – IJCCI 2013. ISSN 1860-949X. Vol. 613 (2016), pp. 173-188pt_PT
dc.identifier.doi10.1007/978-3-319-23392-5_10pt_PT
dc.identifier.issnISSN 1860-949X
dc.identifier.urihttp://hdl.handle.net/10400.21/9724
dc.language.isoengpt_PT
dc.publisherSpringerpt_PT
dc.relationSFRH/PROTEC/67953/2010 - FCTpt_PT
dc.subjectExamination timetablingpt_PT
dc.subjectMemetic algorithmpt_PT
dc.subjectShuffled Frog-Leaping Algorithmpt_PT
dc.subjectSimulated annealingpt_PT
dc.subjectToronto benchmarkspt_PT
dc.titleA hybrid shuffled frog-leaping algorithm for the university examination timetabling problempt_PT
dc.typeconference object
dspace.entity.typePublication
oaire.awardURIinfo:eu-repo/grantAgreement/FCT/3599-PPCDT/PEst-OE%2FEEI%2FLA0009%2F2013/PT
oaire.citation.conferencePlaceSep 20-22, 2013 – Vilamoura, Portugalpt_PT
oaire.citation.endPage188pt_PT
oaire.citation.startPage173pt_PT
oaire.citation.title5th International Joint Conference on Computational Intelligence (IJCCI)pt_PT
oaire.citation.volume613pt_PT
oaire.fundingStream3599-PPCDT
person.familyNameLeite
person.familyNameMelicio
person.givenNameNuno
person.givenNameFernando
person.identifier.orcid0000-0001-6328-3579
person.identifier.orcid0000-0001-7825-2687
person.identifier.scopus-author-id55894265100
project.funder.identifierhttp://doi.org/10.13039/501100001871
project.funder.nameFundação para a Ciência e a Tecnologia
rcaap.rightsclosedAccesspt_PT
rcaap.typeconferenceObjectpt_PT
relation.isAuthorOfPublicationa30c7dc8-db92-4fb2-8700-5ba093cdb74c
relation.isAuthorOfPublication204f288e-1618-482d-ad30-4b86afc47d25
relation.isAuthorOfPublication.latestForDiscoverya30c7dc8-db92-4fb2-8700-5ba093cdb74c
relation.isProjectOfPublication9e152db9-9776-4b55-aedf-203a6dc11d8a
relation.isProjectOfPublication.latestForDiscovery9e152db9-9776-4b55-aedf-203a6dc11d8a

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A hybrid_NLeite.pdf
Size:
482.65 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

ISEL - Eng. Elect. Tel. Comp. - Comunicações