TABU SEARCH: AN EFFICIENT METAHEURISTIC FOR UNIVERSITY ORGANIZATION PROBLEMS

Authors

  • Ramón Alvarez-Valdés Department of Statistics and Operations Research, University of Valencia
  • Enric Crespo Department of Financial and Mathematical Economy, University of Valencia
  • José M. Tamarit Department of Financial and Mathematical Economy, University of Valencia

Keywords:

timetabling, university, heuristic, tabu search

Abstract

In the last 10 years we have been working on large scale academic organization problems. For the university we have worked on exam scheduling, student assignment to sections, course scheduling and a process of student self-registration. The developed algorithms are quite complex and are based on different techniques, but for all of them the Tabu Search procedures have been the essential tool for obtaining good solutions. In this paper we describe the common elements and the special characteristics of these algorithms

Downloads

Download data is not yet available.

Downloads

Published

2023-06-27

How to Cite

Alvarez-Valdés, R., Crespo, E., & Tamarit, J. M. (2023). TABU SEARCH: AN EFFICIENT METAHEURISTIC FOR UNIVERSITY ORGANIZATION PROBLEMS. Investigación Operacional, 22(2). Retrieved from https://revistas.uh.cu/invoperacional/article/view/7031

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.