Reward-Based Hybrid Genetic Algorithm for Solving the Class Scheduling Problem

In this paper, the problem of class scheduling is addressed, and both hard and soft constraints are considered. These constraints play a crucial role in the proposed algorithm. While the fulfilment of hard conditions is mandatory, the satisfaction of soft constraints is evaluated through rewards, which are assigned based on the degree to which the constraints are met. The genetic algorithm proposed in this article validates potential solutions by considering the rewards associated with meeting soft restrictions. A hybrid genetic algorithm is described and validated, and the results of some computational experiments are presented and discussed.