• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.63-70
• /
• 2004

Port operation is largely divided into gate operation, yard operation and berth operation. Operation strategy and optimal resource allocation for three parts are important in the productivity of the port operation.. Especially the resource allocation planning in berth operation needs optimization, because it is directly connected with the processing time in shipping. Berth planning is not independent on recourse allocation but interrelated with yard stacking area allocation. Therefore, we design the optimized module of berth planning and give priority to interrelationship with yard space allocation, while existing studies design independent resource allocation in berth planning. We suggest constraints by mathematical method, and they are related to yard stacking area allocation with existing constraints. Then we look for solutions, use tabu search to optimize them, and design optimized the berth planning module. In the performance test of optimized module design of berth planning, we find that the berth planning with yard stacking area allocation takes less processing time than without yard stacking area allocation.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.1
• /
• pp.23-32
• /
• 2001

This paper treats the berth planning problem which is encountered at public container terminals. The main issue of the berth planning problem is to decide how to allocate the berths to scheduled calling containerships of which the ETA' s are given beforehand. Three optimization models for the berth planning problem are proposed in the formulation of set problems. Some heuristic algorithms for generating the decision variables of the models are also devised by using the concept of the ship's waiting time and the modified berth occupancy rate. Computational experiments based on the data arising from the real public container terminal are also carried out and the results are reported to show that the proposed optimization models and the heuristic algorithms for generating the decision variables are applicable and useful for the berth planning problem at public container terminals.

• Journal of Navigation and Port Research
• /
• v.44 no.6
• /
• pp.501-508
• /
• 2020

His paper looks more closely at the Republic of Korea's (ROK) Navy submarine berth-allocation strategies, with the study's results ultimately resulting in the proposition of an integer programming model. Current submarine berth-allocation planning problems include the need for more minimal berth-shifting and general support service failures, as a lack of efficient submarine berth-allocation often leads to submarines unable to receive the support service they need due to the inadequacy of their assigned berths. Currently, the ROK Navy allocates berths by only taking available reserve resources and the full-capacity limits of support services into account. This paper expands upon this strategy, and proposes a model which would allow for submarine berth allocation planning to also take submarine support service scheduling into account, allowing for more efficient and timely submarine servicing. This proposed model in turn minimizes berth shifting, support service failures, and allows for full coordination with the submarine support service request schedule. The construction of this model was carried out through data gathered on the ROK Navy's fleets and forces, allowing for a more nuanced analysis of existing issues with submarine berth-allocation planning.

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

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

• 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.

• Journal of Navigation and Port Research
• /
• v.28 no.1
• /
• pp.83-90
• /
• 2004

Navy surface vessels require pier services such as emergency repair, oil supply, arm loading / unloading, craning, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. This study suggests Mixed Integer Programming model for berth allocation problem, considering precedence relationships among services. For an effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 3.1 and ILOG CPLEX 7.0. The results of the model show reduction of berth shifts and increasement of service benefits.

• 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.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.6
• /
• pp.105-114
• /
• 2022

We examine berth allocation problems in tidal bulk ports with an objective of minimizing the demurrage and dispatch associated berthing cost. In the proposed optimization model inventory (or stock) level constraints are considered so as to satisfy the service level requirements in bulk terminals. It is shown that the mathematical programming formulation of this research provides improved schedule resolution and solution accuracy. We also show that the conventional big-M method of standard resource allocation models can be exempted in tidal bulk ports, and thus the computational efficiency can be significantly improved.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.10a
• /
• pp.94-96
• /
• 2012

터미널의 경쟁력 제고, 터미널 생산성 향상이 중요한 요소라고 할 수 있다. 이러한 생산성에 영향을 줄 수 있는 요인은 다양하다. 그 중 야드 이송장비의 경우, 특정 선석크레인(QC, Quay Crane)에 야드 트랙터(YT, Yard Tractor)가 고정 할당되는 방식에서 다수 QC들의 작업을 처리하는 풀링 시스펨 방식으로 전환으로 터미널 생산성과 YT의 가용성을 높일 수 있다.

• Journal of Korean Port Research
• /
• v.11 no.2
• /
• pp.191-202
• /
• 1997

As the suitability of berth allocation will ultimately have a significant influence on the performance of a berth, a great deal of attention should be given to berth allocation. Generally, a berth allocation problem has conflicting factors between servers and users. In addition, there is uncertainty in great extent caused by various factors such as departure delay, inclement weather on route, poor handling equipment, a lack of storage space, and other factors contribute to the uncertainty of arrival and berthing time. Thus, it is necessary to establish berth allocation planning which reflects the positions of interested parties and the ambiguity of parameters. For this, a berth allocation problem is formulated by fuzzy 0-1 integer programming introducing the concept of maximum Position Shift(MPS). But, the above approach has limitations in terms of computational time and computer memory when the size of problem is increased. It also has limitations with respect to the integration of other sub-systems such as ship planning system and yard planning system. For solving such problem, this paper focuses particularly on developing an efficient heuristic algorithm as a new technique of getting an effective solution. And also the suggested algorithm is verified through the illustrative examples and empirical appalicaton to BCTOC.