Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search
Course timetabling is a combinatorial optimization problem and has been confirmed to be an NP-complete problem. Course timetabling problems are different for different universities. The studied university course timetabling problem involves hard constraints such as classroom, class curriculum, and o...
Shranjeno v:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
MDPI AG
2013-04-01
|
| Serija: | Algorithms |
| Teme: | |
| Online dostop: | http://www.mdpi.com/1999-4893/6/2/227 |
| Oznake: |
Brez oznak, prvi označite!
|