• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.63-73
• /
• 2008

The aim of study is to analyze the berth occupancy rate according to the ship size. P Iron and steel company operate exclusive bulk terminal at P port and G port and the depth of water at berth are not so equal each other. And to reduce the sea transport cost between loading port and unloading port P and G, P company increases the number of large ship while ship scheduling. But it causes to increase the berth congestion at the specific water depth berth owing to the draught of large ship. At this point, usually ship waiting time starts to rise even at low levels of berth occupancy rate, and will rise more and more sharply at the level of full utilization. But it is not common at exclusive terminal like P port and G port. Bulk ships arrive at port according to the early planned arrival time and the coefficient of variation of ship arrival time is not so big. So queueing time at exclusive terminal does not rise sharply near 80-90 berth occupancy rate.

• Journal of Korea Port Economic Association
• /
• v.26 no.3
• /
• pp.198-220
• /
• 2010

This paper investigate the problems of standard container port handling capacity in establishing national port development plan in Korea. Considering container port developing, it's not easy to adopt container port service quality parameters such as lay time constraint of very large container ships by using the standard guideline of container port handling capacity. A simple methodology that connects vessel waiting to service time(w/s) and berth occupancy to costs has been used to evaluate the performance of a container terminal. But the total handling capacity have to be calculated by the performance of the handling system and number of equipments and layout of terminal by using computer simulation that represents of reality events needs to be performed by probabilistic techniques. A simulation model of estimation of container terminal capacity is introduced in order to establish a hub terminal for very large container ships that focus the port's quality of service and also suggest as tool for policy maker to justify a required port investment.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.71-89
• /
• 2002

In this paper, an integrated planning system is introduced for the efficient operation of container terminal. It consists of discharging and loading planning, yard planning, and berth scheduling subsystem. This interface of this system is considered for user's convenience, and the rule-based system is suggested and developed in order to make planning with automatic procedures, warning functions for errors.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.117-125
• /
• 2004

The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship. determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which all the constraints should be satisfied. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible. while the operation cost of the terminal should be minimized. In this paper. I present an effective approach to solving this problem, which combines both constraint satisfaction search and iterative improvement search. I test this method on a real world container terminal problem and the results show that the method can produce better results than any other existing method.

• Journal of Navigation and Port Research
• /
• v.27 no.2
• /
• pp.179-184
• /
• 2003

In order to mitigate the overcapacity of Busan port, Busan new port has been developed as transshipment port which is capable of handling 8,000 TEU containership. Generally, design of transshipment port has to reflect the capacity of feeder because both mother vessels and feeders enter the planned port at the same time. However, the existing plan of Busan new port capacity needs to be reexamined since the adopted capacity of each berth at new port, 300,000 TEU, does not seem to be enough to handle both mother vessels and feeders. Therefore, in this study we calculated the required number of berth and berth length by considering cargo handling capacity in terms of the ship size and this study makes some implications in relation with the terminal development plan.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.19-27
• /
• 2009

This paper addresses the berth allocation problem in naval ports. Navy vessels need various services such as emergency repair, missile loading, oil supply and many others while commercial vessels only unload and load container at the port. Furthermore, naval vessels have to shift frequently due to a limited capacity of the port. The objective of this paper is to minimize the total number of nesting vessels at the naval port. In other word, the objective is to maximize the total number of naval battleships engaging in the sea. A mixed integer programming(MIP) model is developed and experiments are conducted with ILOG CPLEX 11.0. We compare the computational results of the MIP model to the current scheduling approach by the ROK Navy. The results showed that MIP model performed well by minimizing the number of nesting vessels. and avoiding unnecessary shifts.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.1-3
• /
• 2001

컨테이너 터미널에서의 선석 및 크레인 일정계획은 일정 기간 동안 입항 예정인 선박들을 대상으로 접안 위치와 접안 시기 및 기간을 결정하며, 또한 각 선박별로 컨테이너를 싣고 내릴 크레인을 배정하되 각 크레인의 서비스 시작과 완료시간가지 지정하는 전 과정을 포함한다. 이 문제는 여러 선박들 사이의 시간적 공간적 제약관계를 준수하고 크레인들을 충돌 없이 각 선박에 할당하여야 하는 제약조건 만족 문제인 동시에, 각 선박의 선호 위치와 희망 입출항 시간을 최대한 준수해야 하는 최적화 문제이기도 하다. 기존의 연구에서는 제약만족탐색기법을 사용하여 초기계획을 수립한 후 최적의 해를 유도해 내기 위해 휴리스틱 교정기법을 제약만족 탐색기법의 틀 내에서 반복적으로 적용하였다. 본 논문에서는 반복적 개선 탐색 도중에 도출되는 해의 정보를 이용하여 새로운 제약조건을 추가함으로써 다음 제약만족 탐색 시 보다 쉽게 더 충은 해를 찾을 수 있도록 하였으며 이 방법을 기존의 휴리스틱 교정기법과 결합하여 휴리스틱 교정기법의 성능을 향상시켰다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.10a
• /
• pp.152-152
• /
• 1999

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2018.11a
• /
• pp.271-272
• /
• 2018

부산항 신항은 현재 21개의 선석 규모에서 2030년까지 총 40선석까지 확대할 계획을 갖고 있다. 항만의 확대에 따라 선박 통항량 증가가 예상되며, 이를 대비해 해상교통관제도 해상교통량을 기반으로 집중관제구역을 설정할 필요가 있다. 본 연구는 부산항 신항을 대상으로 해상교통위험도 모델을 이용해 위험구역을 정량화하고 집중적으로 관제가 필요한 구역을 도출하는 것을 목적으로 한다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.407-412
• /
• 2004

A problem of handling capacity calculation of berth is very important factor for decision about a port development scale like as the number of berth, size of back storage yard. If handling capacity per berth calculated low, the number of berth is increasing and the size of yard decided for propriety level of handling capacity. The propose of this paper is re-calculate of handling capacity for Busan container port by firstly government plan and actual result of Busan port like as waiting rate, berth share and handling capacity, and then realistic number of crane and berth share to be applied.