• Title/Summary/Keyword: 컨테이너 3차원 적재

Search Result 6, Processing Time 0.036 seconds

Three-Dimensional Container Packing Problem (컨테이너 3차원 적재문제)

  • 배민주;최세경;김환성
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2003.05a
    • /
    • pp.242-248
    • /
    • 2003
  • In this paper, we propose a new heuristic solution for 3D container packing problem for the variable size and the variable kind of freights. First we consider the total cost of container charges, i.e., loading, transportation and handling charges, where the priority of each frights are dealt. By minimizing the total cost of container charges, the kinds of container and its number can be decided automatically. From these factors, we con determine the position in the container and the loading sequence into the container. Finally, by equivalence of freight's weight in container, we can prevent the freight's damage on the handling.

  • PDF

Three-Dimensional Container Packing Problem with Freight Priority (우선순위를 고려한 컨테이너 3차원 적재문제)

  • Bae, Min-Ju;Choi, Se-Kyoung;Kim, Hwan-Seong
    • Journal of Navigation and Port Research
    • /
    • v.28 no.6
    • /
    • pp.531-539
    • /
    • 2004
  • In this paper, we propose a new heuristic solution for 3D container packing problem for the variable sizes and types of freight. Frist of all, we consider the total cost of container charge i.e., handling, loading and transportation, where each freight will be specifically identified The types of containers and its number to be loaded am be selected automatically by minimizing the total cost of container charge. Maximization of loading space am be achieved efficiently by operating the palletizing and/or depalletizing of freight. By considering these factors we can determine the position of freight in the container and the loading sequence to be packing into the container. In container packing simulation, we can verify that the proposed heuristic algorithm indicates more efficiency space utilization and shows the possibility of using on commercial business.

Development of Sensor Position Optimization Algorithm for Container Loss Detection (컨테이너 유실 감지를 위한 센서 위치 최적화 알고리즘 기술 개발)

  • Seong-Hyun Kim;Hyung-Hoon Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.337-338
    • /
    • 2023
  • 컨테이너 해상 유실 사고는 매해 적지 않은 수로 발생하고 있으나 기존에는 사후적 대응, 사전 대응 관점의 대응책들이 대부분이다. 그렇기에 항해 간 컨테이너 유실에 대한 모니터링이 필요한데, 선원들이 항해하는 선박에 적재된 수천 개의 컨테이너를 일일이 들여다보거나 모든 곳에 센서를 부착해 감지하는 것에는 물리적, 경제적 한계가 존재한다. 본 연구는 선박에 적재된 컨테이너들을 3차원 좌표 화하여 선박의 경사시험에서 모티브를 가져와 일정 정도의 기울기를 선박에 적용하였을 때, 기울기 중심을 기준으로 회전운동이 가장 큰 좌표에 해당하는 컨테이너들을 K-평균 군집화를 통해 최적화 위치로 선정하여 센서 위치를 최적화시켜 효율적인 컨테이너 유실 감지를 위한 기반을 마련한다.

LCL Cargo Loading Algorithm Considering Cargo Characteristics and Load Space (화물의 특성 및 적재 공간을 고려한 LCL 화물 적재 알고리즘)

  • Daesan Park;Sangmin Jo;Dongyun Park;Yongjae Lee;Dohee Kim;Hyerim Bae
    • Journal of Intelligence and Information Systems
    • /
    • v.29 no.4
    • /
    • pp.375-393
    • /
    • 2023
  • The demand for Less than Container Load (LCL) has been on the rise due to the growing need for various small-scale production items and the expansion of the e-commerce market. Consequently, more companies in the International Freight Forwarder are now handling LCL. Given the variety in cargo sizes and the diverse interests of stakeholders, there's a growing need for a container loading algorithm that optimizes space efficiency. However, due to the nature of the current situation in which a cargo loading plan is established in advance and delivered to the Container Freight Station (CFS), there is a limitation that variables that can be identified at industrial sites cannot be reflected in the loading plan. Therefore, this study proposes a container loading methodology that makes it easy to modify the loading plan at industrial sites. By allowing the characteristics of cargo and the status of the container to be considered, the requirements of the industrial site were reflected, and the three-dimensional space was manipulated into a two-dimensional planar layer to establish a loading plan to reduce time complexity. Through the methodology presented in this study, it is possible to increase the consistency of the quality of the container loading methodology and contribute to the automation of the loading plan.

Structural Modeling and Characteristic Analysis of Container Handling System (컨테이너 적재 시스템의 구조 모델링 및 특성 해석)

  • Kim, Young-Sang;Maeng, Hee-Young
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.20 no.4
    • /
    • pp.458-463
    • /
    • 2011
  • A CHS(Container Handling System) is a system to load and to unload ISO 2000 or ISO 4000 standard containers which is widely used for various industrial transport purpose. A new light type of CHS is introduced in this paper, in order to reduce weight of cargos and to give the convenience in cargo loading and unloading without additional lifting equipments. The structural models of this system are created to assemble the smooth integration of system and to interface the each composing units with the specification of truck chassis to be mounted. These models are applied to find the suitable design parameters under the condition of force restrictions of each units. Finally, the stability of this system are investigated by analyzing the dynamic simulation using Visual NASTRAN 4D, and it could be recommend the good design parameters for the manufacturing purpose.

A Heuristic for the Container Loading Problem (3차원 컨테이너 적재 문제를 위한 발견적 해법)

  • Jang, Chang-Sik;Kang, Maeng-Kyu
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.28 no.3
    • /
    • pp.156-165
    • /
    • 2005
  • A new heuristic algorithm for the heterogeneous single container loading problem is proposed in this paper, This algorithm fills empty spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three sub spaces starting with an empty container. An initial loading pattern is built by applying this approach recursively until all boxes are exhausted or no empty spaces are left. In order to generate alternative loading patterns, the load-blocks of pattern determining spaces are replaced with the alternatives that were generated on determining the load-blocks. An improvement algorithm compares these alternatives with the initial pattern to find improved one. Numerical experiments with 715 test cases show the good performance of this new algorithm, above all for problems with strongly heterogeneous boxes.