The effective adoption of online learning depends on user satisfaction as distance education approaches suffer from a lack of commitment that may lead to failures and dropouts. The adaptive learning literature argues that an alternative to achieve student satisfaction is to treat them individually, delivering the educational content in a personalized manner. In addition, the sequencing of this content—called Adaptive Curriculum Sequencing (ACS)—is important to avoid cognitive overload and disorientation. The search for an optimal sequence from ever-growing databases is an NP-Hard combinatorial optimization problem. Although some approaches have been proposed, it is challenging to assess their contributions due to the lack of benchmark data available. This paper presents a procedure to create synthetic dataset to evaluate ACS approaches and, as a concept proof, analyzes metaheuristics usually used in ACS approaches: Genetic Algorithm, Particle Swarm Optimization (PSO) and Prey–Predator Algorithm using student’s learning goals and their extrinsic and intrinsic information. We also propose an approach based on Differential Evolution (DE). The computational experiments include synthetic datasets with a varied amount of learning materials and real-world datasets for comparison. The results show that DE performed better than the other methods when less than 500 learning materials are used while PSO performed better for larger problems.