Timetable Scheduling Using Ant Colony Optimization
碩士 === 國立高雄應用科技大學 === 電子工程系 === 98 === In a timetable scheduling problem, examination subjects must be slotted to certain times so as to avoid conflicting as well as meet some specific requirements. They are combinatorial optimization problems and exactly NP-Complete. Modern optimization methods hav...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/75121778428825122873 |