Abstract
We propose a general framework for the combination of column generation (CG) with metaheuristics (MHs) aiming to solve combinatorial optimization problems amenable for decomposition approaches, “SearchCol”. The combination of the two approaches is based on representing the solution of the problem as the selection of a subset of solutions of smaller (sub)problems which are generated by CG. In each iteration of a SearchCol algorithm, CG provides the optimal solution (primal and dual) to the MH which returns a (incumbent) solution used for defining the (perturbed) CG problem of the next iteration. We describe the SearchCol framework and a general SearchCol algorithm based on local search.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
van den Akker, J.M., Hoogeveen, J.A., van de Velde, S.L.: Parallel machine scheduling by column generation. Operations Research 47, 862–872 (1999)
Ben Amor, H., Desrosiers, J., Valério de Carvalho, J.M.: Dual-optimal inequalities for stabilized column generation. Operations Research 54, 454–463 (2006)
Alvelos, F., Valério de Carvalho, J.M.: Comparing branch-and-price algorithms for the unsplittable multicommodity flow problem. In: Ben-Ameur, W., Petrowski, A. (eds.) Proceedings of the INOC - International Network Optimization Conference, Evry, Paris, pp. 7–12 (2003)
Alvelos, F., Valério de Carvalho, J.M.: An Extended Model and a Column Generation Algorithm for the Planar Multicommodity Flow Problem. Networks 50, 3–16 (2007)
Danna, E., Pape, C.L.: Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows. In: Desaulniers, G., Descrosiers, J., Solomon, M.M. (eds.) Column Generation, ch. 4. Springer Science and Business Media, New York (2005)
Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research 8, 101–111 (1960)
Desrosiers, J., Soumis, F., Desrochers, M.: Routing with time windows by column generation. Networks 14, 545–565 (1984)
Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.): Column Generation. Springer, New York (2005)
Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time Constrained Routing and Scheduling. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing, pp. 35–139. North Holland, Amsterdam (1995)
Ford, L.R., Fulkerson, D.R.: A suggested computation for maximal multicommodity network flows. Management Science 5, 97–101 (1958)
Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Aragão, M., Reis, M., Uchoa, E., Werneck, R.F.: Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. Mathematical Programming, Series A 106, 491–511 (2006)
Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research 9, 849–859 (1961)
Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem - Part II. Operations Research 11, 863–888 (1963)
Liang, D., Wilhelm, W.E.: A generalization of column generation to accelerate convergence. Mathematical Programming, Series A 122, 349–378 (2010)
Lübbecke, M.E., Desrosiers, J.: Selected topics in column generation. Operations Research 53, 1007–1023 (2005)
Manne, A.S.: Programming of Economic Lot Sizes. Management Science 4, 115–135 (1958)
Martin, R.K.: Large Scale Linear and Integer Optimization, A Unified Approach. Kluwer Academic Publishers, Dordrecht (1999)
Pimentel, C., Alvelos, F.P., Valério de Carvalho, J.M.: Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optimization Methods and Software 25, 299–319 (2010)
Pisinger, D., Sigurd, M.: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS Journal on Computing 19, 1007–1023 (2007)
Puchinger, J., Raidl, G.R.: Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research 183, 1304–1327 (2007)
Raidl, G.R.: A Unified View on Hybrid Metaheuristics. In: Almeida, F., Blesa Aguilera, M.J., Blum, C., Moreno Vega, J.M., Pérez Pérez, M., Roli, A., Sampels, M. (eds.) HM 2006. LNCS, vol. 4030, pp. 1–12. Springer, Heidelberg (2006)
Santos, D., de Sousa, A., Alvelos, F.: Traffic Engineering of Telecommunication Networks based on Multiple Spanning Tree Routing. In: Valadas, R. (ed.) FITraMEn 2008. LNCS, vol. 5464, pp. 114–129. Springer, Heidelberg (2009)
Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Operations Research 45, 831–841 (2007)
Villeneuve, D., Desrosiers, J., Lübbecke, M.E., Soumis, F.: On Compact Formulations for Integer Programs Solved by Column Generation. Annals of Operations Research 139, 375–388 (2005)
Wilhelm, W.E.: A technical review of column generation in integer programming. Optimization and Engineering 2, 159–200 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alvelos, F., de Sousa, A., Santos, D. (2010). SearchCol: Metaheuristic Search by Column Generation . In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2010. Lecture Notes in Computer Science, vol 6373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16054-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-16054-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16053-0
Online ISBN: 978-3-642-16054-7
eBook Packages: Computer ScienceComputer Science (R0)