Implementation of Algorithm Recommendation Models for Timetabling Instances

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Curriculum-Based Course Timetabling (CB-CTT) is a problem periodically solved in educational institutions, still, because of the diversity of conditions that define it within different educational contexts, selecting the solution approach that best suits the particular requirements of an instance is a complex task that can be properly formulated as an algorithm selection problem. In this paper, we analyze four selection mechanisms that could be used as algorithms recommendation models. From this analysis, it is concluded that the proposed regression approach exhibited the highest performance. Therefore, it could be applied for algorithm recommendation to solve CB-CTT instances.

Cite

CITATION STYLE

APA

de la Rosa-Rivera, F., & Nunez-Varela, J. I. (2019). Implementation of Algorithm Recommendation Models for Timetabling Instances. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11835 LNAI, pp. 15–27). Springer. https://doi.org/10.1007/978-3-030-33749-0_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free