Leite, NunoMelicio, FernandoRosa, Agostinho C.2019-03-062019-03-062016LEITE, 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-1681860-949Xhttp://hdl.handle.net/10400.21/9633In 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.engExamination timetablingShuffled complex evolution algorithmMemetic computingGreat deluge algorithmToronto benchmarksTwo-epoch examination timetablingconference object10.1007/978-3-319-26393-9_10