Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling

Examination Timetabling Problem (ETTP) is an NP-hard typical optimization problem faced by institutions and universities across the world. This nature leads to heuristic methods cover a large branch of researches in this area. On the other hand, the problem varies from one institution to another,...

詳細記述

書誌詳細
第一著者: Mohammad Pour, Shahrzad
フォーマット: 学位論文
言語:英語
英語
出版事項: 2009
主題:
オンライン・アクセス:http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf

類似資料