A Cost-Regular based Hybrid Column Generation Approach - Archive ouverte HAL Access content directly
Journal Articles Constraints Year : 2006

A Cost-Regular based Hybrid Column Generation Approach


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.
Fichier principal
Vignette du fichier
dpr06constraints-final.pdf (256.61 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00293562 , version 1 (05-07-2008)



Sophie Demassey, Gilles Pesant, Louis-Martin Rousseau. A Cost-Regular based Hybrid Column Generation Approach. Constraints, 2006, 11 (4), pp.315-333. ⟨10.1007/s10601-006-9003-7⟩. ⟨hal-00293562⟩
209 View
538 Download



Gmail Mastodon Facebook X LinkedIn More