Personalized Learning Path Problem Variations: Computational Complexity and AI Approaches

E-learning courses often suffer from high dropout rates and low student satisfaction. One way to address this issue is to use personalized learning paths (PLPs), which are sequences of learning materials that meet the individual needs of students. However, creating PLPs is difficult and often involves combining knowledge graphs (KGs), student profiles, and learning materials. Researchers typically assume that the problem of creating PLPs belong to the nondeterministic polynomial (NP)-hard class of computational problems. However, previous research in this field has neither defined the different variations of the PLP problem nor formally established their computational complexity. Without clear definitions of the PLP variations, researchers risk making invalid comparisons and conclusions when they use different metaheuristics for different PLP problems. To unify this conversation, this article formally proves the NP-completeness of two common PLP variations and their generalizations and uses them to categorize recent research in the PLP field. It then presents an instance of the PLP problem using real-world data and shows how this instance can be cast into two different NP-complete variations. This article then presents three artificial intelligence (AI) strategies, solving one of the PLP variations with back-tracking and branch and bound heuristics and also converting the PLP variation instance to XCSP<inline-formula><tex-math notation="LaTeX">${}^{3}$</tex-math></inline-formula>, an intermediate constraint satisfaction language to be resolved with a general constraint optimization solver. This article solves the other PLP variation instance using a greedy search heuristic. The article finishes by comparing the results of the two different PLP variations.