Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem
Examination timetabling problem is hard to solve due to its NP-hard nature, with a large number of constraints having to be accommodated. To deal with the problem effectually, frequently heuristics are used for constructing feasible examination timetable while meta-heuristics are applied for improvi...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
Institute of Advanced Engineering and Science
2020
|
| 主題: | |
| オンライン･アクセス: | http://umpir.ump.edu.my/id/eprint/29896/1/Performance%20analyses%20of%20graph%20heuristics%20and%20selected%20trajectory.pdf http://umpir.ump.edu.my/id/eprint/29896/ http://section.iaesonline.com/index.php/IJEEI/article/view/1660 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|