A Double Evolutionary Pool Memetic Algorithm for Examination Timetabling Problems

Algorithm 2

The details of the crossover operator in the main evolutionary pool.

Input: Randomly selected parents , and the crossover probability

Output: Newly produced children ,

Step  1. Assume that the examinations sets in the alternate timeslot in , are , and is the number of total

   timeslots in our timetable. Randomly select examinations in timeslots, which do not contain any

   examination in ,

Step  2. Exchange the selected timeslots in , , and then delete the duplicate examinations in unselected timeslots in ,

   , which are denoted as , .

Step  3. Output the newly produced children ,