Evolutionary algorithms using cluster patterns for timetabling
The examination timetabling problem (ETP) is a NP complete, combinatorial optimization problem. Intuitively, use of properties such as patterns or clusters in the data suggests possible improvements in the performance and quality of timetabling. This pape
|Collections||ANU Research Publications|
|Source:||Intelligent Decision Technologies|
|01_Sharma_Evolutionary_algorithms_using_2013.pdf||1.36 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.