Journal of Global Optimization

, Volume 56, Issue 3, pp 1187–1215 | Cite as

Packing non-identical circles within a rectangle with open length

Article

Abstract

Packing non-identical circles inside a rectangle witnesses a wide range of industrial applications. However, the non-convex constraints in this problem make it intractable using exact analytical approaches. Even via heuristic methods, the solution time for industrial-scale instances sometimes is too long to be acceptable. This article aims to challenge the existing methods for the benchmark instances. The most significant contributions of this work are: firstly, we proposed three types of packing positions for selection and used human intelligence to convert an arbitrary circle sequence into a feasible compact layout; secondly, diverse position selection criteria have been tested, and it is found that the criterion commonly used in the literature is not the best; thirdly, the traditional genetic algorithm is adapted with lower crossover rate but higher mutation rate particularly, and a minor-adjustment operator with the purpose of exploring the neighborhood of the current best solutions is introduced.

Keywords

Cutting and packing Combinatorial optimization Heuristic Genetic algorithm Decomposition 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akeb H., Hifi M.: Algorithms for the circular two-dimensional open dimension. Int. Trans. Oper. Res. 15, 685–704 (2008)CrossRefGoogle Scholar
  2. 2.
    Akeb H., Hifi M., Negre S.: An augmented beam search-based algorithm for the circular open dimension problem. Comput. Ind. Eng. 61(2), 373–381 (2011)CrossRefGoogle Scholar
  3. 3.
    Birgin E.G., Martinez J.M., Ronconi D.P.: Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. Eur. J. Oper. Res. 160, 19–33 (2005)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Gen M., Cheng R.: Genetic Algorithms and Engineering Optimization. Wiley, New York (1997)Google Scholar
  6. 6.
    George J.A., George J.M., Lamar B.W.: Packing different-sized circles into a rectangular container. Eur. J. Oper. Res. 84, 693–712 (1995)CrossRefGoogle Scholar
  7. 7.
    Goldberg D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)Google Scholar
  8. 8.
    Goldberg D.E., Deb K.: A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins, G (ed.) Foundations of Genetic Algorithms, Morgan Kaufmann, California (1991)Google Scholar
  9. 9.
    He Y., Wu Y., de Souza R.: A global search framework for practical three-dimensional packing with variable carton orientations. Comput. Oper. Res. 39(10), 2395–2414 (2012)CrossRefGoogle Scholar
  10. 10.
    Hifi M., M’Hallah R.: Approximate algorithms for constrained circular cutting problems. Comput. Oper. Res. 31, 675–694 (2004)CrossRefGoogle Scholar
  11. 11.
    Hifi, M., M’Hallah, R.: A literature review on circle and sphere packing problems: models and methodologies. Adv. Oper. Res. (2009)Google Scholar
  12. 12.
    Hifi M., Paschos V.Th., Zissimopoulos V.: A simulated annealing approach for the circular cutting problem. Eur. J. Oper. Res. 159, 430–448 (2004)CrossRefGoogle Scholar
  13. 13.
    Huang W.Q., Li Y., Akeb H., Li C.M.: Greedy algorithms for packing unequal circles into a rectangular container. J. Oper. Res. Soc. 56, 539–548 (2005)CrossRefGoogle Scholar
  14. 14.
    Kallrath J.: Cutting circles and polygons from area-minimizing rectangles. J. Global Optim. 43, 299–328 (2009)CrossRefGoogle Scholar
  15. 15.
    Kubach T., Bortfeldt A., Gehring H.: Parallel greedy algorithms for packing unequal circles into a strip or a rectangle. Cent. Eur. J. Oper. Res. 17, 461–477 (2009)CrossRefGoogle Scholar
  16. 16.
    Poon P.W., Carter J.N.: Genetic algorithm crossover operators for ordering applications. Comput. Oper. Res. 22, 135–147 (1995)CrossRefGoogle Scholar
  17. 17.
    Stoyan Y.G., Yaskov G.N.: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Int. Trans. Oper. Res. 5, 45–57 (1998)Google Scholar
  18. 18.
    Stoyan Y.G., Yaskov G.N.: A mathematical model and a solution method for the problem of placing various-sized circles into a strip. Eur. J. Oper. Res. 156, 590–600 (2004)CrossRefGoogle Scholar
  19. 19.
    Wu Y., Li W., Goh M., de Souza R.: Three dimensional bin packing problem with variable bin height. Eur. J. Oper. Res. 202, 347–355 (2010)CrossRefGoogle Scholar
  20. 20.
    Yu H., Zhang L.: The augmented Lagrangian method for the packing of unequal circles within a strip. Int. J. Pure Appl. Math. 18, 463–470 (2005)Google Scholar

Copyright information

© Springer Science+Business Media, LLC. 2012

Authors and Affiliations

  1. 1.Department of Industrial and Systems Engineering/Office of the ProvostNational University of SingaporeSingaporeSingapore
  2. 2.Department of International Business and Asian StudiesGriffith UniversityGold CoastAustralia

Personalised recommendations