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

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

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

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.151-157
• /
• 1999

선석계획 및 크레인 일정계획은 컨테이너 터미널에서 입항하는 선박들의 빈번한 변동상황에 능동적으로 대처하고 유연하면서도 신속한 의사결정이 가능하도록 여러 명의 전문가가 장기적인 계획을 바탕으로 지속적으로 수정 보완해 나가는 방법으로 이루어지고 있다. 본 논문에서는 선사 및 컨테이너 터미널에서 수시로 변경되는 다양한 요구조건을 수용하는 최적의 선석 및 크레인 일정계획 수립을 위하여 제약만족기법과 휴리스틱 교정(Heuristic Repair)기법을 이용하였다. 선석계획 및 크레인 일정 계획문제는 기본적으로 제약조건 만족문제로 정형화할 수 있지만 선박의 접안위치를 결정하는 문제는 목적함수를 가지는 최적화문제이다. 따라서 이 문제는 제약조건 만족문제와 최적화문제가 혼합된 문제(CSOP, Constraint Satisfaction and Optimization Problem)로 볼 수 있다. 이러한 문제를 해결하기 위해서 각 선박의 최적 전압위치를 찾고 최우선 순위 선박의 최적 접안위치로부터 주어진 모든 제약조건을 만족하는 해를 찾는 탐색기법을 활용했고 휴리스틱 교정기법을 사용해서 제약만족기법에서 찾은 해를 교정했다. 우선순위가 가장 높은 선박부터 탐색을 하기 위해 Variable Ordering 기법을 사용했고 그 선박의 최적 접안위치부터 탐색을 해 나가는 Value Ordering 기법을 사용하였다. 실제 부산 신선대 컨테이너 터미널의 선석계획자료를 사용해서 실험을 하였다.

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

• 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 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.45 no.3
• /
• pp.102-108
• /
• 2021

The purpose of this study is to develop a proactive methodology for disruption due to uncertainty in vessels' arrival time. As worldwide imports and exports increased rapidly, the importance of berth planning in container terminals has increased accordingly. Since the berth plan determines the capacity of the container terminal, it aims to maximize efficiency by minimizing the time and space gap between the vessels. In reality, several uncertainties disrupt the initial berth plan resulting in economic losses. In this study, we propose a robust berth plan for preventing disruption.

• Proceedings of the Korean Society of Fisheries Technology Conference
• /
• 2000.05a
• /
• pp.177-178
• /
• 2000

파랑의 내습에 대하여 안전하고 공업용수가 풍부한 내만에 위치한 광양만은 급격한 경제개발의 요구에 따라 다양한 항만 및 산업단지의 조성을 위한 매립 및 준설사업이 활발하게 진행되고 있으며, 이에 따라 수산어장의 면적이 급격히 감소되고 있으며 아울러 수질이 악화일로에 있다(Lee et al., 1998). 해양수산부(1998)에 의하면 광양항을 동북아 중심항만의 기능으로서 창출하기 휘하여 1997년 현재 접안시설 규모는 총선석 52선석, 총연장 11,348m이지만, 광양항 개발에 따른 추가 시설계획 선석은 2006년에는 40선석, 2011년에는 51선석, 연장으로는 2006년까지 8,590m 그리고 2011년까지 12,100m로 계획되어있다.(중략)

• Journal of Intelligence and Information Systems
• /
• v.6 no.2
• /
• pp.1-14
• /
• 2000

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 cranes and berths should be assigned in such a way that all the spatial and temporal constraints are satisfied without any interference. 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, we present an effective and efficient approach to solving this type of problem, which combines constrain satisfaction search and heuristic repair. We first employ a constraint satisfaction search to find a feasib1e solution. Then, the feasible solution is modified to a more optimal one by iteratively applying our heuristic repair operations within the framework of constraint satisfaction search. Experimental results with a real data from Pusan East Container Terminal showed that our approach can derive a schedule of satisfactory quality in a very short time.

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