A shuffled complex evolution algorithm for the examination timetabling problem
In 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, name...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.21/9633 |
| Country: | Portugal |
| Oai: | oai:repositorio.ipl.pt:10400.21/9633 |