RESEARCH / 2003
A Genetic Algorithm Approach for Finding a Good Course Schedule
Knut-Edvart Ellingsen and Manuel Penaloza · 2003
Course scheduling brings many competing requirements together: classes need times and rooms, while people and facilities have limited availability. In our 2003 paper, Manuel Penaloza and I explored a genetic algorithm approach to finding a good schedule.
Why a genetic algorithm?
A genetic algorithm explores candidate solutions and evaluates them using a measure of how well they satisfy the problem. It then uses selection and variation to search for improvements. The paper applies that general idea to the course scheduling problem.
This page introduces the research and links to the original paper. More detailed notes on the implementation and results will follow as I revisit the work.