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...

Full description

Bibliographic Details
Main Author: Leite, Nuno (author)
Other Authors: Melicio, Fernando (author), Rosa, Agostinho C. (author)
Format: conferenceObject
Language:eng
Published: 2019
Subjects:
Examination timetabling
Memetic algorithm
Shuffled Frog-Leaping Algorithm
Simulated annealing
Toronto benchmarks
Online Access:http://hdl.handle.net/10400.21/9724
Country:Portugal
Oai:oai:repositorio.ipl.pt:10400.21/9724

Internet

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

Similar Items