• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.9-19
• /
• 2014

The automotive industry has made much efforts to deliver finished vehicles to customers with speed and reliability. Decreasing the time a vehicle stays within an assembly plant from production release to shipment contributes to reduce the total order lead-time and consequently, the total transportation cost as well. Conventional shipment planning algorithms are limited in accommodating the dynamics of assembly plant operations as to finished vehicle shipment. This paper presents a market-based multi-agent shipment planning algorithm to optimize the performance of vehicle shipment process, capturing the operationally disruptive events. Experimental results using simulation show that the algorithm improves vehicle shipment performance with respect to lead time, labor efficiency, finished product quality, and transportation efficiency.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2021.11a
• /
• pp.19-20
• /
• 2021

Domestic car ferries do not operate a dedicated information system for cargo loading and management, It is impossible to arrange according to the cargo type and quantity at the time of cargo reservation due to restrictions such as the need to comply with the cargo layout drawings in advance approved by the Korean Register. For this reason, this is a study to utilize similar information systems in operation in container ships and terminals for the purpose of improving cargo shipment management tasks for car ferries.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2006.05a
• /
• pp.78-82
• /
• 2006

현재 치수계획은 선적인 개념의 제방위주 하천대응 치수계획에서 벗어나 면적인 개념의 유역 대응 치수계획으로 전환되고 있다. 이에 유역종합치수계획에서 유역대응 치수계획으로 천변저류지 계획이 수립되고 있지만 계획수립에 대한 표준화된 방법이 제시되어 있지 않은 실정이다. 이에 낙동강 유역종합치수계획을 중심으로 각 유역종합치수계획에서 사용하였던 방법들을 정리하여 천변저류지 수립절차, 분석방법, 홍수조절효과, 운영방안 등에 대해 살펴보고 또한 천변저류지 홍수조절효과 산정에 대한 문제점 및 향후 계획을 제시하여 천변저류지 계획 전반에 대한 수립 방안을 제시하고자 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.2
• /
• pp.186-191
• /
• 2020

In this paper, we proposed an optimization technique for efficiently placing vehicles on decks in a vehicle-carrying ship to efficiently handle loading and unloading. For this purpose, we utilized the transformation method of the XML data representing the ship's spatial information, merging and branching algorithm and genetic algorithm, and implemented the function to visualize the optimized vehicle placement results. The techniques of selection, crossover, mutation, and elite preservation, which are used in the conventional genetic algorithms, are used. In particular, the vehicle placement optimization method is proposed by merging and branching the ship space for the vehicle loading. The experimental results show that the proposed merging and branching method is effective for the optimization process that is difficult to optimize with the existing genetic algorithm alone. In addition, visualization results show vehicle layout results in the form of drawings so that experts can easily determine the efficiency of the layout results.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.11a
• /
• pp.279-280
• /
• 2022

In the case of domestic coastal ships, an information system for the purpose of managing cargo loading, securing, and inspection processes is not in operation. It presents functional elements that meet the service requirements for information systems for more efficient execution of ship loading and unloading services at port. This is a study on the information system that manages the process of reservation, onboard arrangement, securing and inspection of sea freight.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2010.10a
• /
• pp.55-56
• /
• 2010

본 연구는 컨테이너 터미널에서 선박의 선적작업을 위한 선석배정 및 크레인 할당문제를 동시에 결정하는 문제를 다루고 있다. 실제 컨테이너 터미널에서 고려하고 있는 다양한 형태의 제약을 고려하여 선석계획 및 크레인할당 문제에 대한 혼합정수모델을 제시하였다. 제안된 문제에 대해 좋은 해를 짧은 시간 안에 구하기 위하여 발견적 해법을 제시하였다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2009.06a
• /
• pp.167-168
• /
• 2009

As the rapid increase of the container trade, most of the container terminals strive to improve the container handling productivity. Therefore, they consider to find efficient operating strategies and to introduce new container handling facilities. In terms of equipment, there are a variety of types of quay cranes. Single-lift crane operates only one container regardless of size and twin-lift crane operates two 20' containers or one 40' container simultaneously. Tandem crane, recently introduced, can operate four 20' containers or two 40' containers simultaneously. In this paper, we propose the mathematical model and the solution procedure of the ship loading scheduling problem for the tandem crane.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.7-11
• /
• 2007

This paper considers a shipment planning of products from manufacturers to a third-party warehouse for demands with production time windows where a demand must be replenished in its time window. The underling lot-sizing model also assumes cargo delivery cost in each inbound replenishment to the warehouse. For this model, an optimal O($nT^4$) is presented where n is the number of demands and T is the length of the planning horizon.

• Journal of Navigation and Port Research
• /
• v.35 no.1
• /
• pp.63-70
• /
• 2011

This paper discusses the problem of scheduling berth and container cranes simultaneously in port container terminals. A mixed-integer programming model is formulated by considering various practical constraints. A heuristic algorithm is suggested for solving the mathematical model. A numerical experiment was conducted to test the performance of the suggested heuristic algorithm.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.287-295
• /
• 2004

컨테이너 터미널의 적하 작업은 사전에 계획된 순서대로 컨테이너를 장치장(yard)에서 하나씩 반출하여 선박에 선적하는 작업이다. 만일 현재 반출하고자 하는 컨테이너의 상단에 다른 컨테이너들이 장치되어 있다면, 부득이하게 위에 놓여 있는 컨테이너들을 다른 곳으로 옮겨야 하는 재취급(rehandling)이 발생하고 이로 인하여 반출 작업은 지연된다. 본 논문에서는 적하 계획이 수립되어 장치장의 한 베이(bay)내 컨테이너들의 반출 순서가 결정되었을 때, 반출 시작 시점까지 남는 유휴 시간을 활용하여 재취급이 발생하지 않도록 컨테이너들을 재정돈(이적, 리마샬링)하는 방안을 제안한다. 본 제안 방안은 분지 한계법(branch and bound)을 적용하여 컨테이너 이동 계획을 탐색하며, 생성된 해는 최소의 컨테이너 이동 횟수가 보장된다. 4 단 6 열과 5 단 9 열의 장치장 구조를 대상으로 실험한 결과 99% 이상의 상황에서 허용할 수 있는 시간 내에 계획을 수립할 수 있음을 확인하였다.