Research on the Application of Shortest Path Algorithm in the Optimization of Higher Education Curriculum System

Authors

  • Liu Lin Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu, China;Jinling Institute of Technology, Nanjing, Jiangsu, China

DOI:

https://doi.org/10.70917/ijcisim-2026-0308

Keywords:

curriculum system optimization; ant colony algorithm; knowledge graph construction; learning path planning

Abstract

Traditional higher education course recommendation methods mostly rely on static rules or simple associations, making it difficult to dynamically generate optimal learning paths that match learners' characteristics. In this study, we propose a framework for optimizing higher education course system that integrates knowledge graph and shortest path algorithm. The framework first constructs a knowledge map of higher education courses oriented to knowledge points, which formally represents the complex logical relationships of the courses. The learning path planning problem is then converted into a problem of finding the optimal path on the knowledge graph, and an ant colony algorithm is introduced to solve the problem, which describes pheromones, heuristic functions, and other major objects, and dynamically plans the shortest learning path for the learners. The superiority of the algorithm in learning path planning rationality and personalization is verified through parameter optimization experiments and algorithm simulation experiments. The system can effectively help learners to carry out informative and high-quality learning, which provides important help to the Ministry of Education to cultivate high-quality talents.

Downloads

Download data is not yet available.

Downloads

Published

2026-02-07

How to Cite

Liu Lin. (2026). Research on the Application of Shortest Path Algorithm in the Optimization of Higher Education Curriculum System. International Journal of Computer Information Systems and Industrial Management Applications, 18, 19. https://doi.org/10.70917/ijcisim-2026-0308

Issue

Section

Original Articles