A multi-stage co-evolutionary algorithm for a university timetabling problem
Timetabling in a university is generally regarded as NP-complete, which favors the use of an evolutionary algorithm. The first part examines the university timetabling problem in details. The second part examines current techniques for timetabling. A multi-stage co-evolutionary algorithm (MSCOA), wh...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
2008
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/3138 |