A fast simulated annealing 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 set of resources in a limited number of time slots, while satisfying a set of constraints. In this paper, a new variant of the simulated annealing (SA) algorithm, named FastSA, is p...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2019
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.21/9911 |
| País: | Portugal |
| Oai: | oai:repositorio.ipl.pt:10400.21/9911 |