Repository logo
 
Publication

A shuffled complex evolution algorithm for the examination timetabling problem

dc.contributor.authorLeite, Nuno
dc.contributor.authorMelicio, Fernando
dc.contributor.authorRosa, Agostinho C.
dc.date.accessioned2019-03-06T08:54:15Z
dc.date.available2019-03-06T08:54:15Z
dc.date.issued2016
dc.description.abstractIn this work two instances of the examination timetabling problem are studied and solved using memetic algorithms. The first is the uncapacitated single-epoch problem instance. In the second problem instance two examination epochs are considered, with different durations. The memetic algorithm, named Shuffled Complex Evolution Algorithm, uses a population organized into sets called complexes which evolve independently using a recombination and local search operators. Population diversity is preserved by means of the recombination operator and a special solution update mechanism. Experimental evaluation was carried out on the public uncapacitated Toronto benchmarks (single epoch) and on the ISEL-DEETC department examination benchmark (two epochs). Results show that the algorithm is competitive on the Toronto benchmarks, attaining a new lower bound on one benchmark. In the ISEL-DEETC benchmark, the algorithm attains a lower cost when compared with the manual solution.pt_PT
dc.description.versioninfo:eu-repo/semantics/publishedVersionpt_PT
dc.identifier.citationLEITE, Nuno; MELÍCIO, Fernando; ROSA, Agostinho C. – A shuffled complex evolution algorithm for the examination timetabling problem. In Computational Intelligence – 6th International Joint Conference on Computational Intelligence (IJCCI 2014). Rome, Italy: Springer, 2016. ISSN 1860-949X. Vol. 620/Pp. 151-168pt_PT
dc.identifier.doi10.1007/978-3-319-26393-9_10pt_PT
dc.identifier.issn1860-949X
dc.identifier.urihttp://hdl.handle.net/10400.21/9633
dc.language.isoengpt_PT
dc.publisherSpringer Verlagpt_PT
dc.relationPEst-OE/EEI/ LA0009/2013 - FCTpt_PT
dc.relationSFRH/ PROTEC/67953/2010 - PROTEC Program fundspt_PT
dc.subjectExamination timetablingpt_PT
dc.subjectShuffled complex evolution algorithmpt_PT
dc.subjectMemetic computingpt_PT
dc.subjectGreat deluge algorithmpt_PT
dc.subjectToronto benchmarkspt_PT
dc.subjectTwo-epoch examination timetablingpt_PT
dc.titleA shuffled complex evolution algorithm for the examination timetabling problempt_PT
dc.typeconference object
dspace.entity.typePublication
oaire.citation.endPage168pt_PT
oaire.citation.startPage151pt_PT
oaire.citation.titleComputational Intelligencept_PT
oaire.citation.volume620pt_PT
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
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

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A Shuffled Complex_NLeite.pdf
Size:
590.99 KB
Format:
Adobe Portable Document Format
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: