Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Multi-disciplinary Studies | en_US |
| dc.creator | Lau, Chi-kan | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/3628 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | A general-purpose [school] timetable planner | en_US |
| dcterms.abstract | STP, or school timetabling problem, is NP-complete. There is no existing polynomial-time algorithm for this problem. What we could do is to look for a heuristic algorithm that might produce an acceptable, probably not the best, solution. The aim of this project is to develop a fully automatic general-purpose school timetabling package which can make timetables for secondary and primary schools in Hong Kong. In order to achieve this aim, in our first step, we analyze the nature of the STP to great detail. We produce three definitions to describe the problem in sequence, with each latter one refining the former one; we also relate the problem with three well established combinatorial problems in the literature - vertex-coloring, bin-packing and location-optimizing - to gain insight. Then we point out that school timetabling is often done in an over-constrained condition and the software should know how and when to make concession. Based on the third definition (Definition 5.1), we first map the STP to the constraint satisfaction problem (CSP) and then extend it to partial constraint satisfaction problems, PCSPs. We verify three classes of PCSPs relevant to our research and argue that the STP can be broken down into PCSPs and solved in the order of maximal utility problem(MUP), minimal violation problem (MVP) and constraint satisfaction optimization problem (CSOP). The algorithm we use to tackle the school timetabling problem is called TMA (standing for Tuen Mun algorithm). We use this name because the algorithm was first developed in a secondary school in Tuen Mun. TMA is inspired by Freuder's Constraint Synthesis Algorithm. It is basically a solution synthesis algorithm constructively synthesizing the local constraints, variable by variable, to produce a set of n-consistent compound label for the n variables in the problem. Horizontal restructuring procedures, instead of the vertical propagation procedures adopted by Freuder, are used to raise partial solutions from lower to higher levels of consistency. Heuristics like adjacent swapping, iterative repair, constraint ordering, soft-constraint relaxation and variable ordering are also adopted. The timetabling package we have developed is called TMSTP (standing for Tuen Mun School Timetable Programming). It is built upon a two-tiered database system and it turns out that a relational database is very helpful in representing constraint data and very efficient in implementing forward checking and backward checking. Experiments with eleven sets of data from four primary and three secondary schools show that the package can achieve 100% successful rate in all eleven cases. (We follow the practice in the literature that when the timetabler can assign all lectures to all slots without clashing, it is a 100% successful rate. Some minor adjustment is required in some instances.) The quality of timetables is comparable or better than those prepared by human timetablers. | en_US |
| dcterms.alternative | A general-purpose timetable planner | - |
| dcterms.extent | iv, 158 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 1996 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Schedules, School -- Data processing | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b12355550.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 3.86 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- 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.
- 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.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/3628