Solving the Adaptive Curriculum Sequencing Problem with Prey-Predator Algorithm

Adaptive curriculum sequencing (ACS) is still a challenge in the adaptive learning field. ACS is a NP-hard problem especially considering the several constraints of the student and the learning material when selecting a sequence from repositories where several sequences could be chosen. Therefore, this has stimulated several researchers to use evolutionary approaches in the search for satisfactory solutions. This work explores the use of an adaptation of the prey-predator algorithm for the ACS problem. Pedagogical experiments with a real student dataset and convergence experiments with a synthetic dataset have shown that the proposed solution is suitable for the problem, although it is a solution not yet explored in the adaptive learning literature.