잠수함 지원업무 요구일정과 부두 가용자원을 고려한 선석할당계획

최지원(Ji-Won Choi),최인찬(In-Chan Choi) 한국항해항만학회 2020 한국항해항만학회지 Vol.44 No.6

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. 본 논문은 현재 한국 해군 잠수함 선석할당방법을 반영하여 기존의 잠수함 선석 할당계획문제를 확장하고 해당문제를 해결하는 정수계획모형을 제안한다. 기존의 잠수함 선석 할당계획 문제는 정박 중 선석 이동과 지원업무 실패를 최소화하면서, 잠수함이 필요한 지원업무가 가능한 선석에 잠수함을 할당하는 것이다. 반면, 한국 해군에서는 선석이동과 지원업무실패 최소화뿐만 아니라 부두 가용자원을 고려하여 잠수함이 요구하는 지원업무의 일정을 최대한 보장하면서, 선석을 할당한다. 따라서 본 논문은 한국 해군의 운용상황에 맞게 기존의 잠수함 선석 할당계획 문제를 확장하고, 부두가용자원의 특징과 잠수함 지원업무 일정의 조율을 포함하는 모형을 제시한다. 제안하는 모형은 선석 이동 횟수, 지원업무 지원 실패 횟수, 잠수함 지원업무 요구 일정 조율 횟수를 최소화하는 것을 목적으로 한다. 본 모형의 검증을 위해서 한국 해군의 상황을 바탕으로 고려한 가상의 데이터로 실험을 수행하여 기존의 잠수함 선석 할당계획 문제와 비교·분석한다.

Effect of Terminal Layouts on the Performance of Marine Terminals for Mega-containerships

Akio IMAI,Etsuko NISHIMURA,Stratos PAPADIMITRIOU 한국항해항만학회 2006 한국항해항만학회 학술대회논문집 Vol.2 No.-

The appearance of over 10,000 TEU containerships (so called Mega-containerships) is determined. In order to operate these ships effectively, the number of these calling ports will diminish, and then feeder ships will transport car-goes from the hub-ports where mega-containerships call to the destination ports. In the hub-ports, handling containers for mega-containerships become huger, thus it is important for terminals to deal with cargo handling as soon as possible. However, the present terminal layout might have the limitation of maximum throughput per time unit. And then the transit time at the ports become longer. Therefore, we investigate the effect on some different terminal layouts containerships on three types of terminal layouts. First one is the conventional type consisted by some linear berths, most container terminals in the world are normally this type. Second one is the indented type consisted by linear the floating type consisted by linear berths and the floating berth. On this type, mega-containerships can moor between linear and floating berths. The merits of this type are that we can also handle from both sides of mega-containerships simultaneously, and ships can go through between linear berth and floating berths. Thus it is easier for ships to moor and leave berths. Under such assumptions, we examine the numerical experiments. In most cases, the total service times on the indented type are the longest among three types, these on the floating type are the next longer. Those reasons are that these layouts have the differences of berth occupancy obtained by the time and space axes, and whether the precedence constraints of ship service order needs or not.

A ship berthing system design with four tug boats

Van Phuoc Bui,Hideki Kawai,김영복,이권순 대한기계학회 2011 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.25 No.5

In harbor areas, precise ship steering is the most important operation. This requires a set of adequate thrust devices taking into account surge, sway and yaw motions precisely. However, the effectiveness of actuators during low-speed maneuvering is reduced, making it necessary to use tugboats to ensure safe berthing. In this paper, we present a mathematical model of a system describing the interaction between an unactuated ship and tugboats. Thrust allocation is solved by using the redistributed pseudo-inverse (RPI) algorithm to determine the thrust and direction of each individual tugboat. The main goal of this method is to minimize the power supplied to tugboats and increase their controllability. The constraints are twofold. First, the tugboat can only exert a limited pushing force, and second, it can only change directions slowly. Additionally, an adaptive control law is proposed to capture the draft coefficients of the ship, which are known as uncertainty parameters. The controller guarantees that the ship follows a given path (geometric task) with desired velocities (dynamic task). The specifications of Cybership I, a model ship, are used to evaluate the efficiency of the proposed method through Matlab simulations.

Berth allocation and scheduling at marine container terminals: A state-of-the-art review of solution approaches and relevant scheduling attributes

Li Bokang,Elmi Zeinab,Manske Ashley,Jacobs Edwina,Lau Yui-yip,Chen Qiong,Dulebenets Maxim A 한국CDE학회 2023 Journal of computational design and engineering Vol.10 No.4

Marine container terminals play a significant role for international trade networks and global market. To cope with the rapid and steady growth of the seaborne trade market, marine container terminal operators must address the operational challenges with appropriate analytical methods to meet the needs of the market. The berth allocation and scheduling problem is one of the important decisions faced by operators during operations planning. The optimization of a berth schedule is strongly associated with the allocation of spatial and temporal resources. An optimal and robust berth schedule remarkably improves the productivity and competitiveness of a seaport. A significant number of berth allocation and scheduling studies have been conducted over the last years. Thus, there is an existing need for a comprehensive and critical literature survey to analyze the state-of-the-art research progress, developing tendencies, current shortcomings, and potential future research directions. Therefore, this study thoroughly selected scientific manuscripts dedicated to the berth allocation and scheduling problem. The identified studies were categorized based on spatial attributes, including discrete, continuous, and hybrid berth allocation and scheduling problems. A detailed review was performed for the identified study categories. A representative mathematical formulation for each category was presented along with a detailed summary of various considerations and characteristics of every study. A specific emphasis was given to the solution methods adopted. The current research shortcomings and important research needs were outlined based on the review of the state-of-the-art. This study was conducted with the expectation of assisting the scientific community and relevant stakeholders with berth allocation and scheduling.

게임이론 접근법에 의한 부산항 컨테이너부두의 비용배분에 관한 연구

성숙경(S. K. Sung) 한국항만경제학회 2008 韓國港灣經濟學會誌 Vol.24 No.3

현행 접안료 부과방법은 부두건설비용과 무관하게 사용료를 부과하고 있으므로 부두건설비용을 제대로 회수하지 못하는 문제점이 있다. 본 논문에서는 부두건설비용 배분문제에 협조적 게임이론을 응용함으로써 컨테이너부두의 건설비용 보전을 위한 접안료 부과방법을 제시하였다. 연구결과 부산항 컨테이너부두의 경우 선박간에 상호보조(cross subsidy)가 발생하는 것으로 분석되었다. 2만톤 미만 선박은 현행방법이 유리한 반면 2만톤 초과선박은 샤플리밸류에 의한 비용배분이 유리한 것으로 나타났다. 따라서 부두건설비용을 회수하기 위한 사용료 인상뿐만 아니라 각 선박별로 상호보조를 완화시킬 수 있도록 접안료 부과방법을 개선할 필요가 있다는 시사점을 얻었다. 현행방법을 그대로 유지하는 상태에서 일괄적으로 사용료를 인상하는 방법은 비용보전의 문제는 해결할 수 있지만, 그 경우에도 상호보조의 문제는 여전히 남게 된다. 본 연구는 공정하고 효율적인 접안료 부과방법으로서 협조적 게임이론을 응용한 비용배분방법을 제안한다. The purpose of this paper is to suggest a rational cost allocation method that is efficient and fair. Cost allocation by taking cooperative game theory shows fair allocation considering marginal cost by ship type. Current berth occupancy charging method can not recover quay construction costs. Because it levies charges according to berthing time and tonnage of ships without considering the recovery of quay construction costs. And there are also cross subsidies among ships. This paper suggests the cost allocation method of cooperative game theory as a fair and efficient method.

A Simulation Study of Collaborative Approach to Berth Allocation Problem under Uncertainty

Adi BUDIPRIYANTO,Budisantoso WIRJODIRDJO,I Nyoman PUJAWAN,Saut GURNING 한국해운물류학회 2017 The Asian journal of shipping and Logistics Vol.33 No.3

The Berth Allocation Problem (BAP) is a critical issue for the efficient operation of a container terminal. While there are many works on berth allocation, most of the BAP models have used the assumption of a deterministic situation where arrival time and number of containers brought by a vessel are known in advance. Such a deterministic assumption, however, never holds true in real life. The purpose of this paper is to examine how collaboration between berth terminals could affect the port performance when dealing with uncertainty. Given the complexity of the problem, we have used discrete event simulation to model the system. Two major scenarios were evaluated, namely non-collaborative-response and collaborative-response. Collaborative-response is implemented by sharing resources such as berth, quay cranes and container yard among two terminals. The port performance was evaluated based on ship waiting time, container handling time and total ship turnaround time. The results show that collaborative strategy can reduce overall waiting time, container-handling time and total ship turnaround time; however, the impacts on each terminal vary.

불확실성을 고려한 해군함정 선석 할당 방안

정환식,이재영,이용대,Jung, Whan-Sik,Lee, Jae-Yeong,Lee, Yong-Dae 한국군사과학기술학회 2010 한국군사과학기술학회지 Vol.13 No.5

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 and the uncertainty of the arrival and departure for each vessel. For an effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 6.0 and ILOG CPLEX 11.1., which shows a reasonable result.

컨테이너터미널에서 선석계획과 안벽크레인할당의 동시 결정

이원봉(Won-Bong Lee),구평회(Pyung-Hoi Koo) 한국SCM학회 2010 한국SCM학회지 Vol.10 No.2

This paper addresses berth scheduling and quay crane (QC) allocation problems in seaport container terminals. Identifying the berth and QCs as bottleneck resources, we present an optimization model to simultaneously determine the berth schedule and QC allocation, with the objective of minimizing ship turnaround time. Since the optimization model is a NP-hard, a GA(genetic algorithm)-based berth scheduling procedure is proposed to solve real problems. Numerical experiments are performed to verify the performance of the proposed models. Experimental results show that our study can drive a berth schedule and QC allocation decision of satisfactory quality.

Design of an adaptive backstepping controller for auto-berthing a cruise ship under wind loads

Park, Jong-Yong,Kim, Nakwan The Society of Naval Architects of Korea 2014 International Journal of Naval Architecture and Oc Vol.6 No.2

The auto-berthing of a ship requires excellent control for safe accomplishment. Crabbing, which is the pure sway motion of a ship without surge velocity, can be used for this purpose. Crabbing is induced by a peculiar operation procedure known as the push-pull mode. When a ship is in the push-pull mode, an interacting force is induced by complex turbulent flow around the ship generated by the propellers and side thrusters. In this paper, three degrees of freedom equations of the motions of crabbing are derived. The equations are used to apply the adaptive backstepping control method to the auto-berthing controller of a cruise ship. The controller is capable of handling the system non-linearity and uncertainty of the berthing process. A control allocation algorithm for a ship equipped with two propellers and two side thrusters is also developed, the performance of which is validated by simulation of auto-berthing.

Design of an adaptive backstepping controller for auto-berthing a cruise ship under wind loads

박종용,김낙완 대한조선학회 2014 International Journal of Naval Architecture and Oc Vol.6 No.2

The auto-berthing of a ship requires excellent control for safe accomplishment. Crabbing, which is the pure sway motion of a ship without surge velocity, can be used for this purpose. Crabbing is induced by a peculiar operation procedure known as the push-pull mode. When a ship is in the push-pull mode, an interacting force is induced by complex turbulent flow around the ship generated by the propellers and side thrusters. In this paper, three degrees of freedom equations of the motions of crabbing are derived. The equations are used to apply the adaptive backstepping control method to the auto-berthing controller of a cruise ship. The controller is capable of handling the system non-linearity and uncertainty of the berthing process. A control allocation algorithm for a ship equipped with two propellers and two side thrusters is also developed, the performance of which is validated by simulation of auto-berthing.