Improving the cooperation between the master problem and the subproblem in constraint programming based column generation

Authors:
Bernard Gendron;Hocine Lebbah;Gilles Pesant
Affiliations:
,Département d'informatique, et de recherche opérationnelle, Université de Montréal, Montreal, Quebec;,Centre de recherche sur les transports, Université de Montréal, Montreal, Quebec;,Centre de recherche sur les transports, Université de Montréal, Montreal, Quebec
Venue:
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2005

Citing 6
Cited 1

Constraint Programming Based Column Generation for Crew Assignment

Journal of Heuristics
A Framework for Constraint Programming Based Column Generation

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A Filtering Algorithm for the Stretch Constraint

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

Operations Research
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

A constraint programming-based solution approach for medical resident scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint programming (CP) based column generation uses CP to solve the pricing subproblem. We consider a set partitioning formulation with a huge number of variables, each of which can be generated by solving a CP subproblem. We propose two customized search strategies to solve the CP subproblem, which aim to improve the coordination between the master problem and the subproblem. Specifically, these two strategies attempt to generate more promising columns for the master problem in order to counter the effect of slow convergence and the difficulty of reaching integer solutions. The first strategy uses the dual variables to direct the search towards columns that drive the relaxed master problem faster to optimality. The second strategy exploits the structure of the constraints in the master problem to generate columns that help to reach integer solutions more quickly. We use a physician scheduling problem to test the strategies.