Abstract
We consider the 3-stage two-dimensional bin packing problem, which occurs in real-world problems such as glass cutting. For it, we present a new integer linear programming formulation and a branch and price algorithm. Column generation is performed by applying either a greedy heuristic or an Evolutionary Algorithm (EA). Computational experiments show the benefits of the EA-based approach. The higher computational effort of the EA pays off in terms of better final solutions; furthermore more instances can be solved to provable optimality.
This work is supported by the Austrian Science Fund (FWF) under grant P16263-N04.
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.
Similar content being viewed by others
References
Belov, G., Scheithauer, G.: A branch-and-cut-and-price algorithm for onedimensional stock cutting and two-dimensional two-stage cutting. Technical Report MATH-NM-03-2003, Dresden University of Technology, Germany (2003)
Berkey, J.O., Wang, P.Y.: Two-dimensional finite bin packing algorithms. Journal of the Operational Research Society 38, 423–429 (1987)
Gilmore, P.C., Gomory, R.E.: Multistage cutting-stock problems of two and more dimensions. Operations Research 13, 90–120 (1965)
Lodi, A., Martello, S., Vigo, D.: Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization (to appear)
Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123, 373–390 (2002)
Lougee-Heimer, R.: The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community. IBM Journal of Research and Development 47(1), 57–66 (2003)
Martello, S., Vigo, D.: Exact solutions of the two-dimensional finite bin packing problem. Management Science 44, 388–399 (1998)
Pisinger, D., Sigurd, M.: Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem. Technical Report 03/01, University of Copenhagen, Denmark (2003)
Puchinger, J., Raidl, G.R., Koller, G.: Solving a real-world glass cutting problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol. 3004, pp. 162–173. Springer, Heidelberg (2004)
Vanderbeck, F.: A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem. Management Science 47(2), 864–879 (1998)
Wolsey, L.A.: Integer Programming. Wiley-Interscience, Hoboken (1998)
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
Puchinger, J., Raidl, G.R. (2004). An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-30217-9_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23092-2
Online ISBN: 978-3-540-30217-9
eBook Packages: Springer Book Archive