Abstract: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.
王海波. 基于改进遗传算法的智能排课研究[J]. 电脑与电信, .
WANG Hai-bo. Research on Intelligent Scheduling Based on Improved Genetic Algorithm. Computer & Telecommunication, 2017, 1(12): 88-91.