DOI QR코드

DOI QR Code

Intelligent 3D packing using a grouping algorithm for automotive container engineering

  • Joung, Youn-Kyoung (Department of Systems Management Engineering, Sungkyunkwan University) ;
  • Noh, Sang Do (Department of Systems Management Engineering, Sungkyunkwan University)
  • 투고 : 2014.01.19
  • 심사 : 2014.03.19
  • 발행 : 2014.04.01

초록

Storing, and the loading and unloading of materials at production sites in the manufacturing sector for mass production is a critical problem that affects various aspects: the layout of the factory, line-side space, logistics, workers' work paths and ease of work, automatic procurement of components, and transfer and supply. Traditionally, the nesting problem has been an issue to improve the efficiency of raw materials; further, research into mainly 2D optimization has progressed. Also, recently, research into the expanded usage of 3D models to implement packing optimization has been actively carried out. Nevertheless, packing algorithms using 3D models are not widely used in practice, due to the large decrease in efficiency, owing to the complexity and excessive computational time. In this paper, the problem of efficiently loading and unloading freeform 3D objects into a given container has been solved, by considering the 3D form, ease of loading and unloading, and packing density. For this reason, a Group Packing Approach for workers has been developed, by using analyzed truck packing work patterns and Group Technology, which is to enhance the efficiency of storage in the manufacturing sector. Also, an algorithm for 3D packing has been developed, and implemented in a commercial 3D CAD modeling system. The 3D packing method consists of a grouping algorithm, a sequencing algorithm, an orientating algorithm, and a loading algorithm. These algorithms concern the respective aspects: the packing order, orientation decisions of parts, collision checking among parts and processing, position decisions of parts, efficiency verification, and loading and unloading simulation. Storage optimization and examination of the ease of loading and unloading are possible, and various kinds of engineering analysis, such as work performance analysis, are facilitated through the intelligent 3D packing method developed in this paper, by using the results of the 3D model.

키워드

참고문헌

  1. Althaus E, Baumann T, Schomer E, Werth K. Trunk pack-ing revisited. LNCS. 2007; 4525: 420-430.
  2. Beasley JE. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research. 1985; 33(1): 49-64. https://doi.org/10.1287/opre.33.1.49
  3. Cagan J, Shimada K, Yin S. A survey of computational ap-proaches to three-dimensional layout problems. Computer-Aided Design. 2002; 34(8): 597-611. https://doi.org/10.1016/S0010-4485(01)00109-9
  4. Cagan J. Ding Q. Automated trunk packing with extended pattern search. SAE Technical Paper. 2003; No. 2003-01-0671.
  5. Szykman S, Cagan J. Synthesis of optimal nonorthogonal routes. Journal of Mechanical Design. 1996; 118(3): 419-424. https://doi.org/10.1115/1.2826902
  6. Deutsches Institut fur Normung. Automotive engineering, maximum speed, acceleration and other terms, definitions and tests. DIN 70020. 1993.
  7. Eisenbrand F, Funke S, Karrenbauer A, Reichel J, Schomer E. Packing a trunk: now with a twist!. In: Proceedings of the 2005 ACM Symposium on Solid and Physical Modeling; 2005 Jun 13-15; p. 197-206.
  8. Eisenbrand F, Funke S, Reichel J, Schomer E. Packing a trunk. In: Algorithms-ESA 2003, 11th Annual European Symposium; 2003 Sep 16-19; Budapest, Hungary; p. 618-629.
  9. Hong LS, Lee KW, Kim SC. Similarity comparison of me-chanical parts. CAD/CAM Conference; 2000 Aug 4-11; Ko-rea; p. 316-326.
  10. Hooke R, Jeeves TA. "Direct search" solution of numerical and statistical problems. Journal of the ACM (JACM). 1961; 8(2): 212-229. https://doi.org/10.1145/321062.321069
  11. Karrenbauer A. Packing boxes with arbitrary rotations [master's thesis]. Universit at des Saarlandes, Saarbrucken. 2004.
  12. Kolli A, Cagan J, Rutenbar R. Packing of generic, three-dimensional components based on multi-resolution model-ing. In: Proceedings of the 1996 ASME Design Engineering Technical Conferences and Computers in Engineering Confer-ence: Design Automation Conference; 1996 Aug 18-22; 96-DETC/DAC-1479.
  13. Landon MD, Balling RJ. Optimal packaging of complex par-ametric solids according to mass property criteria. Journal of Mechanical Design. 1994; 116(2): 375-381. https://doi.org/10.1115/1.2919389
  14. Reichel J. Combinatorial approaches for the Trunk packing problem [dissertation]. Universitat des Saarlandes, Saarbruck-en. 2007.
  15. Rieskamp J. Automation and optimization of Monte Carlo based trunk packing [master's thesis]. Universitat des Saar-landes, Saarbrucken. 2005.
  16. Society of Automotive Engineers. Motor vehicle dimen-sions. SAE J1100. 2005.
  17. Scheithauer G, Terno J. A branch-and-bound algorithm for solving one-dimensional cutting stock problems exactly. Applicationes Mathematicae. 1995; 23(2): 151-167.
  18. Szykman S, Cagan J. A simulated annealing-based approach to three-dimensional component packing. Journal of Mechanical Design.1995; 117(2A): 308-314. https://doi.org/10.1115/1.2826140
  19. Szykman S, Cagan J. Constrained three-dimensional compo-nent layout using simulated annealing. Journal of Mechanical Design. 1997; 119(1): 28-35. https://doi.org/10.1115/1.2828785
  20. Santosh T, Fadel G, Fenyes P. A fast and efficient compact packing algorithm for free-form objects. In: ASME 2008 In-ternational Design Engineering Technical Conferences and Computers and Information in Engineering Conference; 2008 Aug 3-6; New York, NY; p. 543-552.
  21. Torczon V, Trosset MW. From evolutionary operation to par-allel direct search: Pattern search algorithms for numerical op-timization. Computing Science and Statistics. 1998; 29: 396-401.