Abstract
A problem of packing unequal circles in a fixed size rectangular container is considered. The circle is considered in a general sense, as a set of points that are all the same distance (not necessary Euclidean) from a given point. An integer formulation is proposed using a grid approximating the container and considering the nodes of the grid as potential positions for assigning centers of the circles. The packing problem is then stated as a large scale linear 0-1 optimization problem. Valid inequalities are proposed to strengthening the original formulation. Nesting circles inside one another is considered tacking into account the thickness of the circles. Numerical results on packing circles, ellipses, rhombuses and octagons are presented to demonstrate the efficiency of the proposed approach.
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
Akeb, H., Hifi, M.: Solving the circular open dimension problem using separate beams and look-ahead strategies. Computers & Operations Research 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. International Journal of Operations Research 1, 249–266 (2006)
Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 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. Computers & Operations Research 37, 1318–1327 (2010)
Castillo, I., Kampas, F.J., Pinter, J.D.: Solving circle packing problems by global optimization: Numerical results and industrial applications. European Journal of Operational Research 191, 786–802 (2008)
Correia, M.H., Oliveira, J.F., Ferreira, J.S.: Cylinder packing by simulated annealing. Pesquisa Operacional 20, 269–286 (2000)
Fasano, G.: Solving Non-standard Packing Problems by Global Optimization and Heuristics. Springer (2014)
Frazer, H.J., George, J.A.: Integrated container loading software for pulp and paper industry. European Journal of Operational Research 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. European Journal of Operational Research 230, 505–514 (2013)
George, J.A., George, J.M., Lamar, B.W.: Packing different–sized circles into a rectangular container. European Journal of Operational Research 84, 693–712 (1995)
George, J.A.: Multiple container packing: a case study of pipe packing. Journal of the Operational Research Society 47, 1098–1109 (1996)
Hifi, M., M’Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Advances in Operations Research, Article ID 150624 (2009). doi:10.1155/2009/150624
Litvinchev, I., Rangel, S., Mata, M., Saucedo, J.: Studying properties of Lagrangian bounds for many-to-many assignment problems. Journal of Computer and Systems Sciences International 48, 363–369 (2009)
Litvinchev, I., Ozuna, L.: Packing circles in a rectangular container. In: Proc. Intl. Congr. on Logistics and Supply Chain, Queretaro, Mexico, pp. 24–30, October 2013
Litvinchev, I., Ozuna, L.: Integer programming formulations for approximate packing circles in a rectangular container. Mathematical Problems in Engineering, Article ID 317697 (2014). doi:10.1155/2014/317697
Litvinchev, I., Ozuna, L.: Approximate packing circles in a rectangular container: valid inequalities and nesting. Journal of Applied Research and Technologies 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)
Lopez, C.O., Beasley, J.E.: A heuristic for the circle packing problem with a variety of containers. European Journal of Operational Research 214, 512–525 (2011)
Lopez, C.O., Beasley, J.E.: Packing unequal circles using formulation space search. Computers & Operations Research 40, 1276–1288 (2013)
Stoyan, Y.G., Yaskov, G.N.: Packing congruent spheres into a multi-connected polyhedral domain. International Transactions in Operational Research 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. Production Economics 145, 478–487 (2013)
Wang, J.: Packing of unequal spheres and automated radiosurgical treatment planning. Journal of Combinatorial Optimization 3, 453–463 (1999)
Wolsey, L.A.: Integer Programming. Wiley, New York (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Litvinchev, I., Infante, L., Ozuna, L. (2015). Using Different Norms in Packing Circular Objects. In: Nguyen, N., Trawiński, B., Kosala, R. (eds) Intelligent Information and Database Systems. ACIIDS 2015. Lecture Notes in Computer Science(), vol 9012. Springer, Cham. https://doi.org/10.1007/978-3-319-15705-4_52
Download citation
DOI: https://doi.org/10.1007/978-3-319-15705-4_52
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15704-7
Online ISBN: 978-3-319-15705-4
eBook Packages: Computer ScienceComputer Science (R0)