Implementing kempe chain neighborhood structure in harmony search for solving curriculum based course timetabling
An essential aspect that contributes to the success of meta-heuristic algorithm over a curriculum-based course timetabling problem is determined by the neighborhood structure used. The basic neighborhood structures such as move and swap between lectures has no method for escaping from local minima o...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE Computer Society
2013
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |