Improved Adaptive Genetic Algorithm for Course Scheduling in Colleges and Universities

Abstract

Abstract-Traditional artificial intelligence and computer-aided course scheduling schemes can no longer meet the increasing demands caused by the informatization of teaching management in colleges and universities. To address this problem, this study designed an improved adaptive genetic algorithm that is based on hard and soft constraints for course scheduling. First, the mathematical model of the genetic algorithm was established. The combination of time, teacher, and course number was regarded as the gene coding. The weekly course schedule of each class was a chromosome, and the course schedule of the entire school was the initial population. The fitness was designed according to the priority of each class, curriculum dispersion, and teacher satisfaction. Local columns between individuals were selected through the roulette principle for a variation of crossover and random columns. Iterative calculation was implemented on the basis of the default mutation and crossover rates to study the optimal course scheduling scheme. Experimental results demonstrate that the improved adaptive genetic algorithm is superior to the original genetic algorithm. When the number of iterations is 150, population evolution is optimal and the fitness does not increase. When the population size is 150 classes, the average scheduling time is the shortest. The basic, adaptive, and improved adaptive genetic algorithms are compared in terms of the number of average iterations required for convergence, maximum individual fitness, and average individual fitness. Comparison results show that the improved adaptive genetic algorithm is superior to the two other algorithms. This study provides references for the model building and evaluation of course scheduling in colleges and universities.

Genetic Algorithm for Solving Multi-Objective Optimization in Examination Timetabling Problem

“…The algorithm is split into 2 parts, the first use a bipartite to get a daily schedule in the matrix, then the second phrase assign lectures into the timeslot. Wang designed a genetic algorithm to solve the enrollment timetabling problem [20]. The author used the combination of time, teacher, and course number as the gene coding, the weekly course schedule of each class was a chromosome, the course schedule of the entire school was the initial population.…”

Towards an Approach Based on Adjusted Genetic Algorithms to Improve the Quantity of Existing Data in the Context of Social Learning

“…The Basic Genetic Algorithm has been explained in Algorithm 1. Many studies have addressed genetic algorithms in the context of education and learning [19,20]. We also address genetic algorithms in the context of social elearning, however, in order to increase the quantity of data coming from an available database.…”

A Hybrid Heuristic Algorithm for Solving COVID-19’s Social Distancing at Universities Campus

“…. ; C rs g. A wide range of research works introduced solutions to this kind of problems (i.e., university course timetables) through the development of constructive and enhancement-based heuristic and metaheuristic approaches, such as SA [17,18], GA [19] and TS [20].…”