Sequencing and counting with the multicost-regular constraint

Abstract : This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems, where a schedule meets patterns and occurrence requirements which are intricately bound. The optimization problem underlying the multicost-regular constraint is NP-hard but it admits an efficient Lagrangian relaxation. Hence, we propose a filtering based on this relaxation. The expressiveness and the efficiency of this new constraint is experimented on personnel scheduling benchmark instances with standard work regulations. The comparative empirical results show how multicost-regular can significantly outperform a decomposed model with regular and global-cardinality constraints.
Type de document :
Communication dans un congrès
6th international conference Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), May 2009, United States. 5547, pp.178-192, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-01929-6_3>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00394434
Contributeur : Sophie Demassey <>
Soumis le : jeudi 11 juin 2009 - 16:09:07
Dernière modification le : jeudi 11 juin 2009 - 16:23:07
Document(s) archivé(s) le : lundi 15 octobre 2012 - 12:20:24

Fichier

cpaior-25-menana.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Julien Menana, Sophie Demassey. Sequencing and counting with the multicost-regular constraint. 6th international conference Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'09), May 2009, United States. 5547, pp.178-192, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-01929-6_3>. <hal-00394434>

Partager

Métriques

Consultations de
la notice

162

Téléchargements du document

105