Discrete shuffled frog leaping algorithm for examination timetabling problem

A Discrete Shuffled Frog Leaping Algorithm(DSFLA) is proposed to solve Timetabling Problem(ETP),and employs the simple neighborhood search to present two improvement strategies.In light of the optimization mechanism of general SFLA,the algorithm adopts an encoding scheme based on time permutation and a new method of individual production to extend the traditional model of SFLA.The experimental results show that the proposed algorithm and its improvements are effective and efficient for different scale benchmarks of ETP.