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
|
Online Access: | http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf http://psasir.upm.edu.my/id/eprint/11930/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The graph heuristic with great deluge algorithm to solve the ITC2007 examination timetabling problem
by: Chuan, Wei Kiat
Published: (2014) -
Heuristic algorithm for university final examination timetabling
by: Thian, Tze Yung
Published: (2015) -
Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem
by: Mandal, Ashis Kumar, et al.
Published: (2020) -
Graph coloring heuristics for solving examination timetabling problem at Universiti Utara Malaysia
by: Abdul Rahman, Syariza, et al.
Published: (2014) -
A nonlinear heuristic modifier for constructing examination timetable
by: Abdul Rahman, Syariza, et al.
Published: (2017)