Luận văn toán học TIMETABLING PROBLEM

The Timetabling Problem

Definitions
Applications
- Examination Timetabling This section is cited from T.Muller (2007) [5], page 2.
- Post Enrollment based Course Timetabling This section is cited from T.Muller (2007) [5], page 3-4.
- Curriculum based Course Timetabling This section is cited from T.Muller (2007) [5], page 4-5.

Some General Algorithms

Genetic AlgorithmsSee M.A.Aydin (2008) [2] for more precisely details.
- Introduction and Some Fundamentals
- Main Ideas of Genetic Algorithm
Memetic Algorithms See E.K.Burke, J.P.Newall and R.F.Weare [1]for more precisely details.
- Solution Representation
- Generating the First Population
- The Evolutionary Operators

Specific Method for the International Timetabling Competition

Algorithm SeeT.Muller (2007) [5], page 5-7 for more precisely details.
- Construction Phase
- Hill Climbing Phase
- Great Deluge Phase
- Simulated Annealling Phase
Applying to Competition Problems See T.Muller (2007) [5], page 8-11 for more precisely details.
- Applying to Examination Timetabling
- Applying to Post Enrollment based Course Timetabling
- Applying to Curriculum based Course Timetabling

Applying to the University Timetabling Problem

Definition of the Problem
Algorithm
- Deal with Hard Constraints
- Deal with Soft Constraints
Results
- Improve the Original Timetable
- Apply the Algorithm to Create a Brand New Timetable
- Comparing Solution between Original Timetable and New Timetable