Abstract
Using a regular grid to approximate a container, packing is reduced to assigning objects to the nodes of the grid subject to non-overlapping constraints. The packing problem is then stated as a large scale linear 0–1 optimization problem. A problem of packing unequal circles in a fixed size rectangular container is considered. The circle is considered as a set of points that are all the same distance (not necessary Euclidean) from a given point. Different shapes, such as ellipses, rhombuses, rectangles, octagons, etc. can be treated similarly by simply changing the definition of the norm used to define the distance. Valid inequalities are used to strengthening the LP-relaxation. An LP-based heuristic is proposed. Numerical results on packing circles and octagons are presented to demonstrate the efficiency of the proposed approach.
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
Similar content being viewed by others
References
Akeb, H., Hifi, M.: Solving the circular open dimension problem using separate beams and look-ahead strategies. Comput. Oper. Res. 40, 1243–1255 (2013)
Baltacioglu, E., Moore, J.T., Hill, R.R.: The distributor’s three-dimensional pallet-packing problem: a human-based heuristical approach. Int. J. Oper. Res. 1, 249–266 (2006)
Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res. 33, 49–64 (1985)
Birgin, E.G., Gentil, J.M.: New and improved results for packing identical unitary radius circles within triangles, rectangles and strips. Comput. Oper. Res. 37, 1318–1327 (2010)
Burtseva, L., Valdez Salas, B., Romero, R., Werner, F.: Recent advances on modeling of structures of multi-component mixtures using a sphere packing approach. Int. J. Nanotechnol. 13(1–3), 41–56 (2016)
Castillo, I., Kampas, F.J., Pinter, J.D.: Solving circle packing problems by global optimization: numerical results and industrial applications. Eur. J. Oper. Res. 191, 786–802 (2008)
Fasano, G.: Solving Non-standard Packing Problems by Global Optimization and Heuristics. Springer, Heidelberg (2014)
Fasano, G., Pinter, J.A. (eds.): Optimized Packings with Applications. Springer Optimization and Its Applications, vol. 105. Springer, Switzerland (2015)
Frazer, H.J., George, J.A.: Integrated container loading software for pulp and paper industry. Eur. J. Oper. Res. 77, 466–474 (1994)
Galiev, S.I., Lisafina, M.S.: Linear models for the approximate solution of the problem of packing equal circles into a given domain. Eur. J. Oper. Res. 230, 505–514 (2013)
George, J.A.: Multiple container packing: a case study of pipe packing. J. Oper. Res. Soc. 47, 1098–1109 (1996)
Hifi, M., M’Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies, In: Advances in Operations Research, vol. 2009, p. 22 (2009). doi:10.1155/2009/150624
Litvinchev, I., Rangel, S., Saucedo, J.: A Lagrangian bound for many-to-many assignment problem. J. Comb. Optim. 19, 241–257 (2010)
Litvinchev, I., Ozuna, L.: Approximate packing circles in a rectangular container: valid inequalities and nesting. J. Appl. Res. Technol. 12, 716–723 (2014)
Litvinchev, I., Infante, L., Ozuna Espinosa, E.L.: Approximate circle packing in a rectangular container: integer programming formulations and valid inequalities. In: González-Ramírez, R.G., Schulte, F., Voß, S., Ceroni Díaz, J.A. (eds.) ICCL 2014. LNCS, vol. 8760, pp. 47–60. Springer, Heidelberg (2014)
Litvinchev, I., Infante, L., Ozuna, L.: Approximate packing: integer programming models, valid inequalities and nesting. In: Fasano, G., Pinter, J.A. (eds.) Optimized Packings with Applications. Springer Optimization and Its Applications, vol. 105, pp. 117–135. Springer, Switzerland (2015)
Lopez, C.O., Beasley, J.E.: A heuristic for the circle packing problem with a variety of containers. Eur. J. Oper. Res. 214, 512–525 (2011)
Lopez, C.O., Beasley, J.E.: Packing unequal circles using formulation space search. Comput. Oper. Res. 40, 1276–1288 (2013)
Murty, K.G.: Linear Programming. Wiley, New York (1983)
Stoyan, Y.G., Yaskov, G.N.: Packing congruent spheres into a multi-connected polyhedral domain. Int. Trans. Oper. Res. 20, 79–99 (2013)
Toledo, F.M.B., Carravilla, M.A., Ribero, C., Oliveira, J.F., Gomes, A.M.: The dotted-board model: a new MIP model for nesting irregular shapes. Int. J. Prod. Econ. 145, 478–487 (2013)
Wang, J.: Packing of unequal spheres and automated radiosurgical treatment planning. J. Comb. Optim. 3, 453–463 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Litvinchev, I., Infante, L., Espinosa, E.L.O. (2016). Using Valid Inequalities and Different Grids in LP-Based Heuristic for Packing Circular Objects. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49390-8_66
Download citation
DOI: https://doi.org/10.1007/978-3-662-49390-8_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49389-2
Online ISBN: 978-3-662-49390-8
eBook Packages: Computer ScienceComputer Science (R0)