Parallel hybrid adventures with simulated annealing and genetic algorithms

Abstract

In this study, a solution to the school timetabling problem using a parallel genetic algorithm with simulated annealing is presented. The hybridization of simulated annealing and the parallel genetic algorithm is explained. Running these algorithms in parallel on a local network of workstations is also discussed. Comparative results among the different parallel models are given. Implementation of the parallel algorithms is used to construct conflict-free and satisfactory timetables for the Department of Mathematics of the University of the Philippines Diliman. The program output of this study can be easily modified to be used as a helpful and efficient guide in the decision-making process of the scheduler.