Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results

被引：45

作者：

Bonutti, Alex ^{[1
]}

De Cesco, Fabio ^{[2
]}

Di Gaspero, Luca ^{[1
]}

Schaerf, Andrea ^{[1
]}

机构：

[1] Univ Udine, DIEGM, I-33100 Udine, Italy

[2] EasyStaff Srl, I-33100 Udine, Italy

来源：

ANNALS OF OPERATIONS RESEARCH | 2012年 / 194卷 / 01期

关键词：

SEARCH; ALGORITHM;

D O I：

10.1007/s10479-010-0707-0

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We propose a set of formulations for the Curriculum-Based Course Timetabling problem, with the aim of "capturing" many real-world formulations, and thus encouraging researchers to "reduce" their specific problems to one of them, gaining the opportunity to compare and assess their results. This work is accompanied by a web application that maintains all the necessary infrastructures for benchmarking: validators, data formats, instances, reference scores, lower bounds, solutions, and visualizers. All instances proposed here are based on real data from various universities and they represent a variety of possible situations.

引用

页码：59 / 70

页数：12

共 27 条

[1] A computational study of a cutting plane algorithm for university course timetabling [J].