User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

A CP Approach to the Balanced Academic Curriculum Problem

Primary tabs

download
  • Open access
  • PDF
  • 174.99 K
Monette, Jean-Noël [UCL] Schaus, Pierre [UCL] Zampelli, Stéphane [UCL] Deville, Yves [UCL] Dupont, Pierre [UCL]

The Balanced Academic Curriculum Problem (BACP) has received little attention in Constraint Programming. Only a few articles deals with this problem with experimental results on the three small instances publicly available in CSPLIB. The present article describes an approach to efficiently solve this challenging problem. Optimal solutions are produced on a variety of randomly generated instances which generalize the CSPLIB test cases. This work describes four contributions to the resolution of this problem: a new branching heuristic, the use of dominance relations, experiments on several balance criteria and several search strategies among which an hybridization of Constraint Programming and Local Search.

Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Access type Accès libre
Publication date 2007
Language Anglais
Conference "Symcon'07, The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems", Providence, USA (September 23)
Peer reviewed yes
Affiliation UCL - FSA/INGI - Département d'ingénierie informatique
Keywords 1160
Links
Bibliographic reference Monette, Jean-Noël ; Schaus, Pierre ; Zampelli, Stéphane ; Deville, Yves ; Dupont, Pierre. A CP Approach to the Balanced Academic Curriculum Problem.Symcon'07, The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems (Providence, USA, September 23).
Permanent URL http://hdl.handle.net/2078.1/85071