摘要:Curriculum sequencing problem is crucial to e-learning system, which is a NP-hard optimization problem and commonly solved by swarm intelligence. As a form of swarm intelligence, particle swarm optimization (PSO) is widely used in various kinds of optimization problems. However, PSO is found ineffective in complex optimization problems. The main reason is that PSO is ineffective in diversity preservation, leading to high risks to be trapped by the local optima. To solve this problem, a novel hybrid PSO algorithm is proposed in this study. First, a competitive-genetic crossover strategy is proposed for PSO to balance the convergence and diversity. Second, an adaptive polynomial mutation is introduced in PSO to further improve its diversity preservation ability. Furthermore, a curriculum scheduling model is proposed, where several constraints are taken into considerations to ensure the practicability of the curriculum sequencing. The numerical comparison experiments show that the proposed algorithm is effective in solving function optimization in comparison to several popular PSO variants; furthermore, for the optimization of the designed curriculum sequencing problem, the proposed algorithm shows significant advantages over the compared algorithms with respect to the degree of the satisfaction of the objectives, i.e., 20, 14, and 5 percentages higher, respectively.