基于改进遗传算法的智能排课研究

Research on Intelligent Scheduling Based on Improved Genetic Algorithm

本文深入地分析了排课问题的软约束条件和硬约束条件,抽象出求解智能排课问题的数学模型。深入分析遗传算法,针对传统的遗传算法,对初始种群进行均匀化、适应度函数、变异算子等方面改进。通过对比实验证明改进的算法完全适用于智能排课问题,而且具有较高的效率,为排课问题的发展提供了新的思路。

This paper analyzes the soft constraints and hard constraints of the course scheduling problem, and abstracts the mathematical model for solving the problem of intelligent scheduling. The genetic algorithm is deeply analyzed. In view of the traditional genetic algorithm, the initial population is improved in the aspects of homogenization, fitness function, and mutation operator. The experiment proves that the improved algorithm is completely suitable for intelligent scheduling problem, and it has high efficiency,which provides a new idea for the development of scheduling problem.