Solving circle packing problems by global optimization: Numerical results and industrial applications

European Journal of Operational Research

Volumn 191, Issue 3, 2008, Pages 786-802

  Castillo, Ignacio ^a   Kampas, Frank J ^b   Pintér, János D ^c  

^a WILFRID LAURIER UNIVERSITY   (Canada)

^b WAM Systems Inc   (United States)

^c Pintér Consulting Services Inc   (Canada)

Author keywords

Circle packing problems; Global optimization; Industrial applications; Numerical examples

Indexed keywords

CONTAINERS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; INDUSTRIAL APPLICATIONS; SOFTWARE PACKAGES;

CIRCLE PACKING PROBLEMS; NUMERICAL PRACTICES;

PROBLEM SOLVING;

EID: 44649160575     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.01.054     Document Type: Article

References (46)

1. Adickes M.D., Billo R.E., Norman B.A., Banerjee S., Nnaji B.O., and Rajgopal J. Optimization of indoor wireless communication network layouts. IIE Transactions 34 (2002) 823-836
2. Anjos M.F., and Vannelli A. An attractor-repeller approach to floorplanning. Mathematical Methods of Operations Research 56 (2002) 3-27
3. Birgin E.G., Martinez J.M., and Ronconi D.P. Optimizing the packing of cylinders into a rectangular container: A nonlinear approach. European Journal of Operational Research 160 (2005) 19-33
4. Boll D.W., Donovan J., Graham R.L., and Lubachevsky B.D. Improving dense packings of equal disks in a square. The Electronic Journal of Combinatorics 7 (2000) R46
5. Buffa E.S., Armour G.C., and Vollmann T.E. Allocating facilities with CRAFT. Harvard Business Review 42 (1964) 136-158
6. Castillo I., and Sim T. A spring-embedding approach for the facility layout problem. Journal of the Operational Research Society 55 (2004) 73-81
7. Correia M.H., Oliveira J.F., and Ferreira J.S. Cylinder packing by simulated annealing. Pesquisa Operacional 20 (2000) 269-286
8. Correia M.H., Oliveira J.F., and Ferreira J.S. A new upper bound for the cylinder packing problem. International Transactions in Operational Research 8 (2001) 571-583
9. Cui Y. Generating optimal t-shape cutting patterns for circular blanks. Computers & Operations Research 32 (2005) 143-152
10. Dowsland K.A. Optimising the palletisation of cylinders in cases. OR Spectrum 13 (1991) 204-212
11. Dowsland K.A., and Dowsland W.B. Packing problems. European Journal of Operational Research 56 (1992) 2-14
12. Drezner Z. Discon: A new method for the layout problem. Operations Research 28 (1980) 1375-1384
13. Drezner Z., and Erkut E. Solving the continuous p-dispersion problem using non-linear programming. Journal of the Operational Research Society 46 (1995) 516-520
14. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research 44 (1990) 145-159
15. Erkut E. The discrete p-dispersion problem. European Journal of Operational Research 46 (1990) 48-60
16. Fraser H.J., and George J.A. Integrated container loading software for pulp and paper industry. European Journal of Operational Research 77 (1994) 466-474
17. George J.A. Multiple container packing: A case study of pipe packing. Journal of the Operational Research Society 47 (1996) 1098-1109
18. George J.A., George J.M., and Lamar B.W. Packing different-sized circles into a rectangular container. European Journal of Operational Research 84 (1995) 693-712
19. Graham R.L., Lubachevsky B.D., Nurmela K.J., and Ostergard P.R.J. Dense packings of congruent circles in a circle. Discrete Mathematics 181 (1998) 139-154
20. Haessler R.W., and Sweeney P.E. Cutting stock problems and solution procedures. European Journal of Operational Research 54 (1991) 141-150
21. Hifi M., and M'Hallah R. Approximate algorithms for constrained circular cutting problems. Computers & Operations Research 31 (2004) 675-694
22. Hifi M., Paschos V.T., and Zissimopoulos V. A simulated annealing approach for the circular cutting problem. European Journal of Operational Research 159 (2004) 430-448
23. Huang W., Li Y., Jurkowiak B., Li C.M., and Xu R.C. A two-level search strategy for packing unequal circles into a circle container. Proceedings of the International Conference on Principles and Practice of Constraint Programming (2003), Springer-Verlag, Ireland 868-872
24. Huang, W., Li, Y., Akeb, H., Li, C., forthcoming. Greedy algorithms for packing unequal circles into a rectangular container. Journal of the Operational Research Society.
25. Kravitz S. Packing cylinders into cylindrical containers. Mathematics Magazine 40 (1967) 65-71
26. Lindo Systems. LINGO (release version: 9.0). Lindo Systems, Inc., 2004.
27. Locatelli M., and Raber U. Packing equal circles in a square: A deterministic global optimization approach. Discrete Applied Mathematics 122 (2002) 139-166
28. Lubachevsky B.D., and Graham R.L. Curved hexagonal packings of equal disks in a circle. Discrete & Computational Geometry 18 (1997) 179-194
29. Markót M.C., and Csendes T. A new verified optimization technique for the "packing circles in a unit square" problems. SIAM Journal on Optimization 16 (2005) 193-219
30. Martin, C.F. 2004. How many robots can talk at the same time? Department of Mathematics, The Royal Institute of Technology, Stockholm. .
31. Melissen, J.B.M. 1997. Packing and covering with circles. Ph.D. Dissertation, Universiteit Utrecht.
32. Mladenovic N., Plastria F., and Uroevi D. Reformulation descent applied to circle packing problems. Computers & Operations Research 32 (2005) 2419-2434
33. Nurmela K.J., and Östergȧrd P.R.J. Packing up to 50 equal circles in a square. Discrete & Computational Geometry 18 (1997) 111-120
34. Pintér J.D. Global Optimization in Action (1996), Kluwer Academic Publishers
35. Pintér J.D., and LGO. A Model Development and Solver System for Continuous Global Optimization, User Guide (2005), Pintér Consulting Services, Inc.
36. Pintér J.D., and Kampas F.J. Nonlinear optimization in Mathematica with MathOptimizer professional. Mathematica in Education and Research 10 (2005) 1-18
37. Pintér J.D., and Kampas F.J. MathOptimizer professional: Key features and illustrative applications. In: Liberti L., and Maculan N. (Eds). Global Optimization: From Theory to Implementation (2006), Springer Science + Business Media, New York 263-280
38. Riskin M.D., Bissette K.C., and Castillo I. A logarithmic barrier approach to solving the dashboard planning problem. INFOR 41 (2003) 245-257
39. Stoyan Y.G., and Yaskov G.N. Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. International Transactions in Operational Research 5 (1998) 45-57
40. Stoyan Y.G., and Yaskov G.N. A mathematical model and a solution method for the problem of placing various-sized circles into a strip. European Journal of Operational Research 156 (2004) 590-600
41. Szabó P.G., Csendes T., Casado L.G., and García I. Equal circles packing in a square I - Problem setting and bounds for optimal solutions. In: Giannessi F., Pardalos P.M., and Rapcsak T. (Eds). Optimization Theory: Recent Developments from Mátraháza (2001), Kluwer, Dordrecht
42. Szabó P.G., Markót M.C., and Csendes T. Global optimization in geometry - circle packing into the square. In: Audet C., Hansen P., and Savard G. (Eds). Essays and Surveys in Global Optimization (2005), Kluwer, Dordrecht
43. Theodoracatos V.E., and Grimsley J.L. The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules. Computer Methods in Applied Mechanics and Engineering 125 (1995) 53-70
44. Wang H., Huang W., Zhang Q., and Xu D. An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research 141 (2002) 440-453
45. Wolfram Research. Mathematica (release version: 5.2). Wolfram Research, Inc., 2005.
46. Zhang D., and Deng A. An effective hybrid algorithm for the problem of packing circles into a larger containing circle. Computers & Operations Research 32 (2005) 1941-1951