a multi-objective bisexual reproduction genetic algorithm for ...

47
where W 1 and W 2 denote weights of hard and soft constraints respectively. We will
do experiments to identify suitable values for these weights.
In this study, we design a course scheduling algorithm to find solutions that
have the highest fitness value f(x). This is a heuristic search, so we will look at
solutions having high fitness value until we meet a solution whose f 1 (x) is equal to 1.
3.6.4.1 Checking Conflicts about Small Classrooms
Each course must be booked to a classroom that is large enough to hold the
students of that course.
A pseudo code for checking this is given in Figure 3-13.
Count=0
For each classroom
For each day in a week
For each time-slot in a day
If ( number of students attending the course held in the current classroom >
number of seats of the current classroom) Count =Count+1
FIGURE 3-13 Pseudo code for checking small classroom conflicts
3.6.4.2 Checking Conflicts Regarding Lecturer’s Busy Time
The courses taught by a lecturer cannot be booked to his/her busy workingsessions
in a week.
A pseudo code for checking this is given in Figure 3-14.
Count=0
For each lecturer
For each day in a week
For each time-slot in a day
For each classroom
If (the current lecturer teaching the class is held in the current classroom and at
this time-slot ) and (the current lecturer is busy at this time) Count=Count+1
FIGURE 3-14 Pseudo code for checking lecturer’s busy time