Publication
A shuffled complex evolution algorithm for the examination timetabling problem
dc.contributor.author | Leite, Nuno | |
dc.contributor.author | Melicio, Fernando | |
dc.contributor.author | Rosa, Agostinho C. | |
dc.date.accessioned | 2019-03-06T08:54:15Z | |
dc.date.available | 2019-03-06T08:54:15Z | |
dc.date.issued | 2016 | |
dc.description.abstract | In 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.version | info:eu-repo/semantics/publishedVersion | pt_PT |
dc.identifier.citation | LEITE, 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-168 | pt_PT |
dc.identifier.doi | 10.1007/978-3-319-26393-9_10 | pt_PT |
dc.identifier.issn | 1860-949X | |
dc.identifier.uri | http://hdl.handle.net/10400.21/9633 | |
dc.language.iso | eng | pt_PT |
dc.publisher | Springer Verlag | pt_PT |
dc.relation | PEst-OE/EEI/ LA0009/2013 - FCT | pt_PT |
dc.relation | SFRH/ PROTEC/67953/2010 - PROTEC Program funds | pt_PT |
dc.subject | Examination timetabling | pt_PT |
dc.subject | Shuffled complex evolution algorithm | pt_PT |
dc.subject | Memetic computing | pt_PT |
dc.subject | Great deluge algorithm | pt_PT |
dc.subject | Toronto benchmarks | pt_PT |
dc.subject | Two-epoch examination timetabling | pt_PT |
dc.title | A shuffled complex evolution algorithm for the examination timetabling problem | pt_PT |
dc.type | conference object | |
dspace.entity.type | Publication | |
oaire.citation.endPage | 168 | pt_PT |
oaire.citation.startPage | 151 | pt_PT |
oaire.citation.title | Computational Intelligence | pt_PT |
oaire.citation.volume | 620 | pt_PT |
person.familyName | Leite | |
person.familyName | Melicio | |
person.givenName | Nuno | |
person.givenName | Fernando | |
person.identifier.orcid | 0000-0001-6328-3579 | |
person.identifier.orcid | 0000-0001-7825-2687 | |
person.identifier.scopus-author-id | 55894265100 | |
rcaap.rights | closedAccess | pt_PT |
rcaap.type | conferenceObject | pt_PT |
relation.isAuthorOfPublication | a30c7dc8-db92-4fb2-8700-5ba093cdb74c | |
relation.isAuthorOfPublication | 204f288e-1618-482d-ad30-4b86afc47d25 | |
relation.isAuthorOfPublication.latestForDiscovery | a30c7dc8-db92-4fb2-8700-5ba093cdb74c |