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

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,...

Full description

Saved in:
Bibliographic Details
Main Author: Mohammad Pour, Shahrzad
Format: Thesis
Language:English
English
Published: 2009
Subjects:
Computer algorithms
Heuristic programming
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!
id my-upm-ir.11930
record_format uketd_dc
spelling my-upm-ir.119302013-05-27T07:50:21Z Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling 2009-10 Mohammad Pour, Shahrzad 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. Computer algorithms Heuristic programming 2009-10 Thesis http://psasir.upm.edu.my/id/eprint/11930/ http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf application/pdf en public masters Universiti Putra Malaysia Computer algorithms Heuristic programming Faculty of Computer Science And Infomation Technologi English
institution Universiti Putra Malaysia
collection PSAS Institutional Repository
language English
English
topic Computer algorithms
Heuristic programming
spellingShingle Computer algorithms
Heuristic programming

Mohammad Pour, Shahrzad
Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
description 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.
format Thesis
qualification_level Master's degree
author Mohammad Pour, Shahrzad
author_facet Mohammad Pour, Shahrzad
author_sort Mohammad Pour, Shahrzad
title Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
title_short Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
title_full Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
title_fullStr Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
title_full_unstemmed Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
title_sort tolerable constructive graph-based hyper-heuristic algorithm for examination timetabling
granting_institution Universiti Putra Malaysia
granting_department Faculty of Computer Science And Infomation Technologi
publishDate 2009
url http://psasir.upm.edu.my/id/eprint/11930/1/FSKTM_2009_11_A.pdf
_version_ 1747811281996349440

Similar Items