Coarse-Grained Parallel Genetic Algorithm for Solving the Timetable Problem

This work studies the application of Genetic Algorithm (GA) to solve the timetable problem (TTP), a problem that is a highly constrained problem. However, the major disadvantage of GA is that the algorithm uses a tremendous amount of processing time. This paper proposes a method that can reduce the processing time by using Parallel Genetic Algorithm (PGA) on the Beowulf-style cluster computer. The experimental results show that substantial speedup of GA can be acquired with small communication overhead.