A Double Evolutionary Pool Memetic Algorithm for Examination Timetabling Problems

Algorithm 3

The pseudocode of the local search approach in the main evolutionary pool.

: the original individual

PN: the new individual

Iter: the iteration number

Itermax: the maximum iteration number:

SD: the search depth.

: the number of examinations

: the increasing step

WHILE   OR

 randomly select examinations and rearrange the in descending order, then obtain

 IF  

      BREAK

 END

 IF  

 END

END