A Double Evolutionary Pool Memetic Algorithm for Examination Timetabling Problems

Algorithm 4

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

: the original individual

PN: the new individual

Iter: the iteration number

Itermax: the maximum iteration number:

: the number of examinations

: the exchange number of timeslots

;

WHILE  

 Selecte examinations randomly from individual .

 Perform the mutation and crossover process, and then obtain the new individual ;

 ;

 IF  

  ;

 ELSE

  ;

 END

END