The optimal allocation of academic resources to individual students is essential for addressing learner diversity and fostering equitable educational outcomes. Within the framework of the Erasmus+ KA220-SCH project, this paper models the selection of educational materials for high school mathematics students as a 0--1 binary combinatorial optimization problem subject to strict study time constraints. Given the NP-hard complexity of the formulation, exact solution methods become computationally intractable as resource catalogs scale. To address this challenge, we propose a Genetic Algorithm integrated with a specialized constraint repair mechanism to effectively search the binary decision space. Experimental evaluation across 10 independent runs demonstrates fast convergence, high solution quality, and strong algorithmic stability across different base seeds. These results confirm the practical utility of metaheuristic approaches for real-time decision-support systems in secondary education.

翻译：暂无翻译