Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem

Authors:
Luca Gaspero;Andrea Schaerf
Affiliations:
DIEGM, University of Udine, Udine, Italy I-33100;DIEGM, University of Udine, Udine, Italy I-33100
Venue:
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Year:
2008

Citing 7
Cited 2

CSPLIB: A Benchmark Library for Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms

Software—Practice & Experience
Stochastic Local Search: Foundations & Applications

Stochastic Local Search: Foundations & Applications
A quantitative approach for the design of academic curricula

Proceedings of the 2007 conference on Human interface: Part II
Measurability and reproducibility in university timetabling research: discussion and proposals

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Solving the balanced academic curriculum problem with an hybridization of genetic algorithm and constraint propagation

ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing

The balanced academic curriculum problem revisited

Journal of Heuristics
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Balanced Academic Curriculum Problem (BACP) consists in assigning courses to teaching periods satisfying prerequisites and balancing students' load. BACP is included in CSPlib along with three benchmark instances. However, the BACP formulation in CSPLib is actually simpler than the real problem that, in general, universities have to solve in practice.In this paper, we propose a generalized formulation of the problem and we study a set of hybrid solution techniques based on high-level control strategies that drive a collection of basic local search components. The result of the study allows us to build a complex combination of simulated annealing, dynamic tabu search and large-neighborhood search. In addition, we present six new instances obtained from our university, which are much larger and more challenging than the CSPlib ones (the latter are always solved to optimality in less than 0.1 seconds by our techniques).For the sake of possible future comparisons, we make available through the web all the input data, our scores and results, and a solution validator.