Timetabling using genetic algorithms

Pao Yue-kong Library Electronic Theses Database

Timetabling using genetic algorithms

 

Author: Leung, Yim-ming
Title: Timetabling using genetic algorithms
Degree: M.Sc.
Year: 1998
Subject: Scheduling -- Data processing
Genetic algorithms
Hong Kong Polytechnic University -- Dissertations
Department: Dept. of Computing
Pages: viii, 110 leaves : ill. ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1439177
URI: http://theses.lib.polyu.edu.hk/handle/200/3889
Abstract: The construction of timetable usually involving three or more variables taking values from domains having thousands of values, with several dozens of constraints having different priorities, is a problem common to many educational institutions. Various heuristic solutions have been proposed to timetabling problem using results based on Tabu Search, Logic Approach, Simulated Annealing. This project tries to use Genetic Algorithm approach developed by John. H. Holland to solve this problem. Genetic Algorithm is an appealing approach for scheduling since it is a relatively easy and flexible problem encoding method. To achieve the optimum results, it is found that the mutation operator and crossover operator have to be manipulated. Also, reproduction technique has to be modified to obtain a feasible solution.

Files in this item

Files Size Format
b14391776.pdf 3.280Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information