Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem

The Timetable Problem is one of the complex problems faced in any university in the world. It is a highly-constrained combinatorial problem that seeks to find a possible scheduling for the university course offerings. There are many algorithms and approaches adopted to solve this problem, but one of...

Full description

Saved in:
Bibliographic Details
Published in:Procedia computer science 2018, Vol.126, p.899-906
Main Authors: Assi, Maram, Halawi, Bahia, Haraty, Ramzi A.
Format: Article
Language:English
Subjects:
genetic algorithms
graph coloring
meta-heuristics
University Timetable Problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Timetable Problem is one of the complex problems faced in any university in the world. It is a highly-constrained combinatorial problem that seeks to find a possible scheduling for the university course offerings. There are many algorithms and approaches adopted to solve this problem, but one of the effective approaches to solve it is the use of meta-heuristics. Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. In this paper, we analyse the Genetic Algorithm approach for graph colouring corresponding to the timetable problem. The GA method is implemented in java, and the improvement of the initial solution is exhibited by the results of the experiments based on the specified constraints and requirements.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2018.08.024