Keyword Search:

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

Mohammad Pour, Shahrzad (2009) Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling. Masters thesis, Universiti Putra Malaysia.

[img] PDF
548Kb

Abstract

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, depending on the size, structure and constraints of that institution. Therefore generality of the proposed methods is one of the major goals in solving timetabling problem nowadays. These methods are trying to keep generality while adding to factors of these methods. Hyperheuristic is one of these approaches which make the basis of this thesis. In heuristic approaches getting stuck in local optimum is one of the propounded problems from early days. The main cause for the local optimal problem is that heuristic algorithms either focus on exploration (global improvement) rather than exploitation (local improvement) or vice versa.

Item Type:Thesis (Masters)
Subject:Computer algorithms
Subject:Heuristic programming
Chairman Supervisor:Abu Bakar Md Sultan, PhD
Call Number:FSKTM 2009 11
Faculty or Institute:Faculty of Computer Science and Information Technology
ID Code:11930
Deposited By: Mohd Nezeri Mohamad
Deposited On:19 Jul 2011 11:41
Last Modified:27 May 2013 15:50

Repository Staff Only: Edit item detail

Document Download Statistics

This item has been downloaded for since 19 Jul 2011 11:41.

View statistics for "Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling "