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

The 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 (solut...

ver descrição completa

Detalhes bibliográficos
Autor principal: Leite, Nuno (author)
Outros Autores: Melicio, Fernando (author), Rosa, Agostinho C. (author)
Formato: conferenceObject
Idioma:eng
Publicado em: 2019
Assuntos:
Examination timetabling
Memetic algorithm
Shuffled Frog-Leaping Algorithm
Simulated annealing
Toronto benchmarks
Texto completo:http://hdl.handle.net/10400.21/9724
País:Portugal
Oai:oai:repositorio.ipl.pt:10400.21/9724

Texto Completo

http://hdl.handle.net/10400.21/9724

Registos relacionados