A Cost-Regular based Hybrid Column Generation Approach

Abstract : Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To solve hard combinatorial optimization problems using CP alone or hybrid CP-ILP decomposition methods, costs also have to be taken into account within the propagation process. Optimization constraints, with their cost-based filtering algorithms, aim to apply inference based on optimality rather than feasibility. This paper introduces a new optimization constraint: cost-regular. Its filtering algorithm is based on the computation of shortest and longest paths in a layered directed graph. The support information is also used to guide the search for solutions. We believe this constraint to be particularly useful in modeling and solving Column Generation subproblems and evaluate its behaviour on complex Employee Timetabling Problems through a flexible CP-based column generation approach. Computational results on generated benchmark sets and on a complex real-world instance are given.
Type de document :
Article dans une revue
Constraints, Springer Verlag, 2006, 11 (4), pp.315-333. 〈10.1007/s10601-006-9003-7〉
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger

Contributeur : Sophie Demassey <>
Soumis le : samedi 5 juillet 2008 - 17:30:32
Dernière modification le : mardi 16 janvier 2018 - 14:37:39
Document(s) archivé(s) le : vendredi 28 mai 2010 - 23:12:29


Fichiers produits par l'(les) auteur(s)




Sophie Demassey, Gilles Pesant, Louis-Martin Rousseau. A Cost-Regular based Hybrid Column Generation Approach. Constraints, Springer Verlag, 2006, 11 (4), pp.315-333. 〈10.1007/s10601-006-9003-7〉. 〈hal-00293562〉



Consultations de la notice


Téléchargements de fichiers