An Enhanced Genetic Algorithm for Optimized Educational Assessment Test Generation Through Population Variation

The most important aspect of a genetic algorithm (GA) lies in the optimal solution found. The result obtained by a genetic algorithm can be evaluated according to the quality of this solution. It is important that this solution is optimal or close to optimal in relation to the defined performance criteria, usually the fitness value. This study addresses the problem of automated generation of assessment tests in education. In this paper, we present the design of a model of assessment test generation used in education using genetic algorithms. The assessment covers a series of courses taught over a period of time. The genetic algorithm presents an improvement or development, which consists of the initial population variation, obtained by the selection of a large fixed number of individuals from various populations, which are ordered by the fitness value using merge sort, chosen for the reason of the high number of individuals. The initial population variation can be seen as a specific modality for increasing the diversity and number of the initial population of a genetic algorithm, which influences the algorithm performance. This process increases the diversity and quality of the initial population, improving the algorithm’s overall performance. The development/novelty brought about by this paper is related to its application to a specific issue (educational assessment test generation) and the specific methodology used for population variation. This development can be applied for large sets of individuals, the variety, and the large number of generated individuals leading to higher odds to increase the performance of the algorithm. Experimental results demonstrate that the proposed method outperforms traditional GA implementations in terms of solution quality and convergence speed, showing its effectiveness for large-scale test generation tasks.