A binary integer programming model for global optimization of learning path discovery

  1. (PDF, 486 KB)
AuthorSearch for: ; Search for: ; Search for:
Proceedings titleEDM 2014 Extended Proceedings
ConferenceG-EDM workshop, July 4-7, 2014, London, UK
AbstractThis paper introduces a method based on graph theory and operations research techniques to optimize learning path discovery. In this method, learning objects are considered as nodes and competencies as vertices of a learning graph. A first step consists in reducing the solution space by obtaining an induced subgraph H. In a second step, the search of an optimal learning path in H is considered as a binary integer programming problem which we propose to solve using an exact method based on the well-known branch-and-bound algorithm. The method detailed in the paper takes into account the prerequisite and gained competencies as constraints of the optimization problem by minimizing the total competencies needed to reach the learning objective.
Publication date
AffiliationInformation and Communication Technologies; National Research Council Canada
Peer reviewedYes
NPARC number21275389
Export citationExport as RIS
Report a correctionReport a correction
Record identifier273ea05b-5e9d-49bd-800a-6f529a3967e0
Record created2015-06-25
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)