Reactive tabu search in a team-learning problem

Yuelin Shen*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


In designing an MBA core curriculum, student cohorts are assigned to a number of sections in each term. In a given term, different sections have exclusive schedules, while the cohorts in the same section have an identical schedule. By altering the cohorts in the sections through the terms, any cohort can meet as many other cohorts as possible via the core courses. We model this problem as a quadratic integer programming problem and construct the performance measure to characterize the properties of the problem. We design a reactive tabu search metaheuristic that solves the model effectively. Two other solution methods, constraint logic programming and an improved hill-climbing search heuristic, are also discussed. We analyze the computational results for the cases in practice.

Original languageEnglish
Pages (from-to)500-509
Number of pages10
JournalINFORMS Journal on Computing
Issue number4
Publication statusPublished - 2008
Externally publishedYes


  • Constraint programming
  • Local search
  • Quadratic integer programming
  • Scheduling
  • Tabu search


Dive into the research topics of 'Reactive tabu search in a team-learning problem'. Together they form a unique fingerprint.

Cite this