期刊文献+

Solution to the Balanced Academic Curriculum Problem Using Tabu Search

Solution to the Balanced Academic Curriculum Problem Using Tabu Search
下载PDF
导出
摘要 The Balanced Academic Curriculum Problem (BACP) is a constraint satisfaction problem classified as (Non-deterministic Polynomial-time Hard) NP-Hard. This problem consists in the allocation of courses in the periods that are part of a curriculum such that the prerequisites are satisfied and the load of courses is balanced for the students. This paper presents the solution for a modified BACP where the academic loads and number of curses may be the same or different for each one of the periods and allows having some courses in a specific period. This problem is modeled as an integer programming problem and is proposed the use of Tabu search with short-term memory for its solution because it is not possible to find solutions for all the instances of this modified problem with an exact method.
出处 《Computer Technology and Application》 2012年第9期630-635,共6页 计算机技术与应用(英文版)
关键词 Balanced academic curriculum problem (BACP) Tabu search non-deterministic polynomial-time hard (NP-Hard). 禁忌搜索算法 平衡性 课程 学术 约束满足问题 多项式时间 非确定性 负载平衡
  • 相关文献

参考文献7

  • 1J. Salazar, Programaci6n Matemattica, Diaz de Santos, Madrid, Spain, 2001.
  • 2C. Castro, S. Manzano, Variable and value ordering when solving balanced academic curriculum problem, in: Proceedings of the ERCIM Working Group on Constraints, Prague, the Czech Republic, 2001.
  • 3CSPLib: A problem library for constraints [Online], http://www.csplib.org/.
  • 4T. Lambert, C. Castro, E. Monfroy, F. Saubion, Solving the balanced academic curriculum problem with an hybridization of genetic algorithm an constraint propagation, in: Proceedings of ICAISC, Zakopane, Poland, 2006, pp. 410-419.
  • 5L.D. Gaspero, A. Schaerf, Hybrid local search techniques for the generalized balanced academic curriculum, in: Proceedings of riM, Malaga, Spain, 2008, pp. 146-157.
  • 6J.A.A. Solis, Un modelo basado en optimizaci6n para balancear planes de estudio en Instituciones de Educaci6n Superior, Ph.D. Thesis, UPAEP, Puebla, 2008.
  • 7C. Castro, B. Crawford, E. Monfroy, A genetic local search algorithm for the multiple optimisation of the balanced academic curriculum problem, in: Proceedings of MCDM, Nashville, Tennessee, USA, 2009, pp. 824-832.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部