Design and statistical analysis of a hybrid local search algorithm for course timetabling

We propose a hybrid local search algorithm for the solution of the Curriculum-Based Course Timetabling Problem and we undertake a systematic statistical study of the relative influence of the relevant features on the performances of the algorithm. In particular, we apply modern statistical technique...

Full description

Saved in:
Bibliographic Details
Published in:Journal of scheduling 2012-02, Vol.15 (1), p.49-61
Main Authors: Bellio, Ruggero, Di Gaspero, Luca, Schaerf, Andrea
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control
Optimization
Colleges & universities
Competition
Core curriculum
Curricula
Design engineering
Hypercubes
Operations Research/Decision Theory
Optimization
Public speaking
Response surfaces
Scheduling
Search algorithms
Statistical analysis
Studies
Supply Chain Management
Teaching
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a hybrid local search algorithm for the solution of the Curriculum-Based Course Timetabling Problem and we undertake a systematic statistical study of the relative influence of the relevant features on the performances of the algorithm. In particular, we apply modern statistical techniques for the design and analysis of experiments, such as nearly orthogonal space-filling Latin hypercubes and response surface methods. As a result of this analysis, our technique, properly tuned, compares favorably with the best known ones for this problem.
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-011-0224-2