求解考试时间安排问题的离散蛙跳算法

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.