A cellular memetic algorithm for the examination timetabling problem

The timetabling problem involves the scheduling of a set of entities (e.g., lectures, exams, vehicles, or people) to a given set of resources in a limited number of time slots, while satisfying a set of constraints. In this paper, a cellular memetic algorithm is proposed for solving the examination...

Full description

Bibliographic Details
Main Author: Leite, Nuno (author)
Other Authors: Fernandes, Carlos M. (author), Melicio, Fernando (author), Rosa, Agostinho (author)
Format: article
Language:eng
Published: 2018
Subjects:
Cellular evolutionary algorithm
Examination timetabling
ITC 2007 benchmark set
Memetic algorithms
Threshold acceptance algorithm
Timetabling
Uncapacitated Toronto benchmark set
Online Access:http://hdl.handle.net/10400.21/8140
Country:Portugal
Oai:oai:repositorio.ipl.pt:10400.21/8140

Internet

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

Similar Items