Using a Space Coding and Sine Selection Operator GA to Solve the Timetabling Problem
QIAN Haijun
Abstract：Genetic algorithm(GA)is an effective algorithm to solve multi-constrained and multi-objective combinatorial opti-mization problems.The classical genetic algorithm has the characteristics of premature convergence,which can lead to the local opti-mal solution. In order to improve the algorithm global searching performance,the paper proposed the genetic algorithm based on space coding and sine selection operator,or SCSS,taking the two aspects of chromosome coding design and selection operator de-sign for the genetic algorithm as the cut-in point.The simulation results show that the SCSS genetic algorithm can solve the Open Ed-ucation timetabling problem with multiple constraints,and provides a practical mathematical method to solve the problem of sched-uling problem effectively.The improved genetic algorithm can quickly converge to the global optimal solution of the problem,and the global search performance of the algorithm is obviously enhanced.
Keywords：genetic algorithmmulti-constrainedspace codingsine selection operatorthe Open Educationthe global optimal solution
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：7( 1924-1930 )