Abstract
In this paper, we propose a global optimization method based on DC (Difference of Convex functions) programming and DCA (DC Algorithm) involving cutting plane techniques for solving two-dimensional Bin packing and Strip packing problems. Given a set of rectangular items, we consider problems of allocating each item to larger rectangular standardized units. In two-dimensional bin packing problem, these units are finite rectangles, and the objective is to pack all the items into the minimum number of units. In two-dimensional strip packing problem, there is a single standardized unit of given width, and the objective is to pack all the items within the minimum height. These problems are characterized as BLP (Binary Linear Programming) problems. Thanks to exact penalty technique in DC Programming, the BLP can be reformulated as polyhedral DC program which can be efficiently solved via the proposed DC programming approach. Computational experiments on large-scale dataset involving up to 200 items show the good performance of our algorithm.
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
Boschetti, M.A., Mingozzi, A.: The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR 1, 27–42 (2003)
CPLEX Optimization ILOG, IncUsing the CPLEXR Callable Library and CPLEX Barrier and Mixed Integer Solver Options Version 11.0 (2007)
Dell’Amico, M., Martello, S., Vigo, D.: A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Appl. Math. 118, 13–24 (2002)
Dyckhoff, H., Scheithauer, G., Terno, J.: Cutting and packing (C&P). In: Dell’Amico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 393–413. Wiley, Chichester (1997)
Fekete, S.P., Schepers, J.: New classes of lower bounds for the bin packing problem. Math. Programming 91, 11–31 (2001)
Gomory, R.E.: Solving Linear Programming Problems in Integer. In: Bellman, R.E., Hall Jr., M. (eds.) Combinatorial Analysis, pp. 211–216. American Mathematical Society (1960)
Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem - part II. Operations Research 11, 863–888 (1963)
Gilmore, P.C., Gomory, R.E.: Multistage cutting problems of two and more dimensions. Oper. Res. 13, 94–119 (1965)
Le Thi, H.A., Pham Dinh, T.: Convex analysis approach to d.c. programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica 22(1), 289–355 (1997)
Le Thi, H.A., Pham Dinh, T.: The DC Programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of Operations Research 133, 23–46 (2005)
Le Thi, H.A., Pham Dinh, T.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optimisation 8, 476–505 (1998)
Le Thi, H.A., Pham Dinh, T., Le Dung, M.: Exact penalty in dc programming. Vietnam Journal of Mathematics 27(2), 169–178 (1999)
Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. European Journal of Operational Research 141, 241–252 (2002)
Marchand, H., Martin, A., Weismantel, R., Wolsey, L.: Cutting Planes in integer and mixed integer programming. Core Discussion Paper 9953, 1–50 (1999)
Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Management Science 44, 388–399 (1998)
Ndiaye, B.M., Pham Dinh, T., Le Thi, H.A.: DC programming and DCA for SSCRP. In: Modelling, Computation and Optimization in Information Systems and Management Sciences. CCIS, vol. 14, pp. 21–30. Springer, Heidelberg (2008)
Nguyen, V.V.: Exact methods for polyhedral DC program with mixed 0-1 variables, based on DCA and New cutting planes. PhD Thesis, National Institute for Applied Sciences, Rouen (July 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ndiaye, B.M., An, L.T.H., Tao, P.D., Niu, Y.S. (2012). DC Programming and DCA for Large-Scale Two-Dimensional Packing Problems. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28490-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-28490-8_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28489-2
Online ISBN: 978-3-642-28490-8
eBook Packages: Computer ScienceComputer Science (R0)