Approximate packing circles in a rectangular container: Valid inequalities and nesting

Journal of Applied Research and Technology

Volumn 12, Issue 4, 2014, Pages 716-723

  Litvinchev, I ^a,b   Ozuna, E L ^a  

^a DORODNICYN COMPUTING CENTER   (Russian Federation)

^b UNIVERSIDAD AUTÓNOMA DE NUEVO LEÓN   (Mexico)

Author keywords

Circle Packing; Integer Programming; Large Scale Optimization

Indexed keywords

EID: 84919774212     PISSN: 16656423     EISSN: 24486736     Source Type: Journal    
DOI: 10.1016/S1665-6423(14)70088-4     Document Type: Article

References (18)

1. H. Akeb and M. Hifi, "Solving the circular open dimension problem using separate beams and look-ahead strategies", Computers & Operations Research, Vol. 40, pp. 1243-1255, 2013.
2. E. Baltacioglu and J.T. Moore, Hill R.R., "The distributor's three-dimensional pallet-packing problem: a human-based heuristical approach", International Journal of Operations Research, Vol. 1, pp. 249-266, 2006.
3. J.E. Beasey, "An exact two-dimensional nonguillotine cutting tree search procedure", Operations Research, Vol. 33, pp. 49-64, 1985.
4. E.G. Birgin and J.M. Gentil, "New and improved results for packing identical unitary radius circles within triangles, rectangles and strips", Computers & Operations Research, Vol. 37, pp. 1318-1327, 2010.
5. I. Castillo, F.J. Kampas and J.D. Pinter, "Solving circle packing problems by global optimization: Numerical results and industrial applications", European Journal of Operational Research, Vol. 191, pp. 786-802, 2008.
6. M.H. Correia, J.F. Oliveira and J.S. Ferreira, "Cylinder packing by simulated annealing". Pesquisa Operacional, Vol. 20, pp. 269-286, 2000.
7. M. Elizondo-Cortes and R. Aceves-Garcia, "Strategy of solution for the inventory-routing problem based on separable cross decomposition", Journal of Applied Research and Technology, Vol. 3, pp. 139-149, 2005.
8. H.J. Frazer and J.A. George, "Integrated container loading software for pulp and paper industry", European Journal of Operational Research, Vol. 77, pp. 466-474, 1994.
9. S.I. Galiev and M.S. Lisafina. "Linear models for the approximate solution of the problem of packing equal circles into a given domain", European Journal of Operational Research, Vol. 230, pp. 505-514, 2013.
10. J.A. George, J.M. George, Lamar B.W., "Packing different-sized circles into a rectangular container", European Journal of Operational Research, Vol. 84, pp. 693-712, 1995.
11. J.A. George, "Multiple container packing: a case study of pipe packing", Journal of the Operational Research Society, Vol. 47, pp. 1098-1109, 1996.
12. M. Hifi and R. M'Hallah, "A literature review on circle and sphere packing problems: models and methodologies", Advances in Operations Research, Vol. 2009, 22 pages, doi:10.1155/2009/150624.
13. Y.C. Lin, "Mixed-integer constrained optimization based on memetic algorithm", Journal of Applied Research and Technology, Vol. 11, pp. 242-250, 2013.
14. I. Litvinchev, S. Rangel, J. Saucedo, "A Lagrangian bound for many-to-many assignment problem", Journal of Combinatorial Optimization, Vol. 19, pp. 241-257, 2010.
15. I. Litvinchev, E. L. Ozuna, "Packing circles in a rectangular container", Proc. Intl. Congr. on Logistics and Supply Chain, Queretaro, Mexico, October 24-25, 2013.
16. I. Litvinchev, E. L. Ozuna, "Integer programming formulations for approximate packing circles in a rectangular container", Mathematical Problems in Engineering, 2014 (to appear).
17. C.O. Lopez, J.E. Beasly, "Packing unequal circles using formulation space search", Computers & Operations Research, Vol. 40, pp. 1276-1288, 2013.
18. Y.G. Stoyan and G.N. Yaskov, "Packing congruent spheres into a multi-connected polyhedral domain", International Transactions in Operational Research, Vol. 20, pp. 79-99, 2013.