Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
Examination timetabling involves assigning the exam into timeslots and rooms, fitting student numbers into suitable exam location, and ensuring adequate rest gaps between exams for all students. In this study, the examination timetabling problem from Kolej Poly-Tech Mara (KPTM) Kuantan, is being inv...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 出版: |
2017
|
| 主题: | |
| 在线阅读: | http://icsecs.ump.edu.my/index.php/en/# http://icsecs.ump.edu.my/index.php/en/# http://umpir.ump.edu.my/19753/1/Solving%2001%20Knapsack%20Problem%20Using%20Hybrid%20HS%20and%20Jaya%20Algorithms.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|