EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Dueling DQN-Based Hyper-Heuristic Framework for Learning Path Optimization

Yong-Wei Zhang, Ming-Yang Zhu, Wen-Kai Xia, Xin-Yang Zhang, Jin-Di Liu

Big Data and Cognitive Computing · 13.05.2026 · 10 (5) · 153

DOI: 10.3390/bdcc10050153 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Big Data and Cognitive Computing, online erschienen am 13.05.2026. Verfasst von Yong-Wei Zhang und 4 weiteren Autor:innen. Die Arbeit nennt 37 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Learning path optimization is crucial in intelligent educational systems, with the core challenge of efficient multi-objective sequential decision-making under complex prerequisite constraints. To address the poor generalization of existing methods relying on fixed operator scheduling or handcrafted heuristics, this paper proposes a hyper-heuristic framework based on Dueling Deep Q-Network (Dueling DQN-HH), formulating operator selection as a sequential decision-making process for dynamic adaptive scheduling of low-level operators. The framework adopts priority-based encoding to unify learning path representation (decoupling the hyper-heuristic layer from the problem domain) and designs a composite reward mechanism integrating reward shaping, exploration incentives, and computational cost awareness to balance solution quality and efficiency. Additionally, it employs a dueling network architecture with prioritized experience replay to enhance policy learning stability. Experimental results show the proposed method outperforms representative baseline algorithms in solution quality, convergence stability, and computational efficiency. The framework demonstrates superior performance across multiple objectives, particularly in minimizing the total learning time (Ftime), as validated on two heterogeneous datasets: MOOCCube (Computer Science) and PsyDataset (Psychology). Further ablation studies and operator evolution analyses verify its adaptive scheduling capability under different objectives and knowledge graph structures, demonstrating strong objective independence and cross-dataset generalization.

Zitieren

APA

Zhang, Y., Zhu, M., Xia, W., Zhang, X., & Liu, J. (2026). A Dueling DQN-Based Hyper-Heuristic Framework for Learning Path Optimization. Big Data and Cognitive Computing, 10(5), 153. https://doi.org/10.3390/bdcc10050153

Vancouver

Zhang Y, Zhu M, Xia W, Zhang X, Liu J. A Dueling DQN-Based Hyper-Heuristic Framework for Learning Path Optimization. Big Data and Cognitive Computing. 2026;10(5):153. doi:10.3390/bdcc10050153

BibTeX
@article{Zhang2026,
  author = {Zhang, Yong-Wei and Zhu, Ming-Yang and Xia, Wen-Kai and Zhang, Xin-Yang and Liu, Jin-Di},
  title = {A Dueling DQN-Based Hyper-Heuristic Framework for Learning Path Optimization},
  journal = {Big Data and Cognitive Computing},
  year = {2026},
  volume = {10},
  number = {5},
  pages = {153},
  doi = {10.3390/bdcc10050153}
}
Kostenlos starten →