Hybrid-Genetic-Algorithm-Simulated-Annealing-for-Presentation-Scheduling
Hybrid-Genetic-Algorithm-Simulated-Annealing-for-Presentation-Scheduling copied to clipboard
This repository demonstrates how the Presentation Scheduling problem, which is analogous to the famous University Course Timetabling Problem (UCTP), can be solved using the Hybrid Genetic Algorithm-Si...
As stated in SC01, the number of consecutive presentations should not exceed and should be as close as possible to a supervisor's preference. Penalty points will be given if the...
The improvement of penalty points over iterations is too slow as shown in the sample graph. A better way of changing the scheduling of the presentations in each iteration can...