Abstract
Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming (CP) to solve column generation subproblems. In the past, this framework has been successfully used to solve both scheduling and routing problems. Unfortunately the stabilization problems well known with column generation can be significantly worse when CP, rather than Dynamic Programming (DP), is used at the subproblem level. Since DP can only be used to model subproblem with special structures, there has been strong motivation to develop efficient CP based column generation in the last five years. The aim of this short paper is to point out potential traps for these new methods and to propose very simple means of avoiding them.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-Price: Column Generation for Huge Integer Programs. Operations Research 46, 316–329 (1998)
Chabrier, A.: Using Constraint Programming Search Goals to Define Column Generation Search Procedures. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, pp. 19–27 (2000)
Chabrier, A.: Maestro: A column and cut generation modeling and search framework. Technical report, ILOG SA (2002), http://chabrier.free.fr/work.html
Dantzig, G.B., Wolfe, P.: Decomposition principles for linear programs. Operations Research 8, 101–111 (1960)
Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time Constrained Routing and Scheduling. In: Ball, M.O., Magnanti, T.L., Monma, C.L. (eds.) Network Routing. Handbooks in Operations Research and Management Science, vol. 8, pp. 35–139. North-Holland, Amsterdam (1995)
du Merle, O., Villeneuve, D., Desrosiers, J., Hansen, P.: Stabilized Column Generation. Discrete Mathematics 194, 229–237 (1999)
Fahle, T., Junker, U., Karisch, S.E., Kohl, N., Sellmann, M., Vaaben, B.: Constraint Programming Based Column Generation for Crew Assignment. Journal of Heuristics (8), 59–81 (2002)
Fahle, T., Sellmann, M.: Constraint Programming Based Column Generation with Knapsack Subproblems. Annals of Operations Research 115, 73–94 (2002)
Harvey, W., Ginsberg, M.: Limited Discrepancy Search. In: Proc. of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI 1995), Montréal, Canada, pp. 607–615. Morgan Kaufmann, San Francisco (1995)
Junker, U., Karisch, S.E., Kohl, N., Vaaben, B., Fahle, T., Sellmann, M.: A Framework for Constraint Programming Based Column Generation. In: Principles and Practice of Constraint Programming. LNCS, pp. 261–274 (1999)
Rousseau, L.-M., Focacci, F., Gendreau, M., Pesant, G.: Solving VRPTWs with Constraint Programming Based Column Generation. Annals of Operations Research (2004) (to appear)
Rousseau, L.-M., Gendreau, M., Feillet, D.: Interior Point Stabilization for Column Generation. Technical report, Centre de recherche sur les transports (2003)
Sellmann, M., Zervoudakis, K., Stamatopoulos, P., Fahle, T.: Crew Assignment via Constraint Programmging: Integrating Column Generation and Heuristic Tree Search. Annals of Operations Research 115, 207–225 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rousseau, LM. (2004). Stabilization Issues for Constraint Programming Based Column Generation. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive