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,...
Saved in:
Main Author: | Mohammad Pour, Shahrzad |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2009
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving single and bi-objective surgery scheduling problems using local search heuristic
by: Ab Rashid, Nur Shafiqah
Published: (2021) -
Heuristics approaches to improve the quality of examination timetables /
by: Sabar, Nasser R.
Published: (2009) -
A social inspired meta-heuristic based on political ideology for optimization /
by: Teo, Ting Huan
Published: (2018) -
Ant system with heuristics for capacitated vehicle routing problem
by: Tan, Wen Fang
Published: (2013) - Heuristic method for the modified model of capacitated arc routing problems