Journal of Korea Multimedia Society (한국멀티미디어학회논문지)

Korea Multimedia Society (한국멀티미디어학회)
권호 표지
DOI QR코드

DOI QR Code

Quantification of Loading Efficiency of Various Type Loads in a 20 FT Container with Post Selecting Process after Applying Conventional Loading Algorithms

기존 적재 알고리즘을 적용한 후 사후 선택 시 20 FT 컨테이너에 다양한 형태의 화물 적재 효율 정량화

  • Received : 2017.11.08
  • Accepted : 2018.03.09
  • Published : 2018.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

Container load problems are conventional issues in history. Loading cylindrical or rectangle packages in restricted space is required to be efficient to minimize remaining area. Many people have depended on experience or known simple algorithms for a long time. Recently systematic algorithms are published over the world with developed computer technology. Maximal rectangles algorithm is well known to load arbitrary rectangles in a larger rectangle container with the organized manners. However, this algorithm has significant drawbacks, which are influenced by orientation of input load. We propose post-selective method to complement these orientation effects, which is found out to improve the loading efficiency.

Keywords

References

  1. G. Wascher, H. HauBner, and H. Schumann, "An Improved Typology of Cutting and Packing Problems," European Journal of Operational Research, Vol. 183, No. 3, pp. 1109-1130, 2007. https://doi.org/10.1016/j.ejor.2005.12.047
  2. A. Bortfeldt and G. Wascher, "Constraints in Container Loading-A State-of-the-Art Review," European Journal of Operational Research, Vol. 229, No. 1, pp. 1-20, 2013. https://doi.org/10.1016/j.ejor.2012.12.006
  3. K.J. Nurmela and P.R. Ostergard, "Packing up to 50 Equal Circles in a Square," Discrete and Computational Geometry, Vol. 18, No. 1, pp. 111-120, 1997. https://doi.org/10.1007/PL00009306
  4. E.G. Birgin and J.M. Gentil, "New and Improved Results for Packing Identical Unitary Radius Circles within Triangles, Rectangles and Strips," Computers and Operations Research, Vol. 37, pp. 1318-1327, 2010. https://doi.org/10.1016/j.cor.2009.09.017
  5. D.M. Wiirtz, M. Monagan, and R. Peikert, "The History of Packing Circles in a Square," Maple Technical Newsletter, pp. 35-42, 1994.
  6. R.L. Graham and B.D. Lubachevsky, "Repeated Patterns of Dense Packings of Equal Disks in a Square," The Electronic Journal of Combinatorics, Vol. 3, No. R16, pp. 1-17, 1996.
  7. J. Jylanki, "A Thousand Ways to Pack the Bin-a practical Approach to Two-dimenSional Rectangle Bin Packing," http://clb.demon.fi/files/RectangleBinPack.pdf (accessed Nov., 3, 2010).
  8. B. Chazelle, "The Bottomn-left Bin-packing Heuristic: An Efficient Implementation," IEEE Transactions on Computers, Vol. C-328, Issue 8, pp. 697-707, 1983.
  9. L. Wei and E.J. Lee, "Real-Time Container Shape and Range Recognition for Implementation of Container Auto-Landing System," Journal of Korea Multimedia Society, Vol. 12, No. 6, pp. 794-803, 2009.
  10. Y.T. Feng. K. Han and D.R.J. Owen, "Filling Domains with Disks: An Advancing Front Approach," International Journal for Numerical Methods in Engineering, Vol. 56, pp. 699-713, 2003. https://doi.org/10.1002/nme.583
  11. S. Polyakovsky and M, Rym, "An Agent-based Approach to the Two-dimensional Guillotine Bin Packing Problem," European Journal of Operational Research, Vol. 192, No. 3, pp. 767-781, 2009. https://doi.org/10.1016/j.ejor.2007.10.020
  12. A. Watt and P.F. Policarpo, 3D Games, Vol. 2: Animation and Advanced Real-Time Rendering, Addison-Wesley Longman Publishing Co., Inc., 2003. (21415 Network Place Chicago, IL 60673 United States)