• 제목/요약/키워드: Ship scheduling

검색결과 97건 처리시간 0.024초

선박운항 일정계획 문제에 대한 컴퓨터 그래픽 기반 상호대화식 모델링 시스템 (A Computer Graphic Based Interactive Modeling System with Application to Ship Scheduling)

  • 이희용;김시화
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2000년도 추계종합학술대회
    • /
    • pp.388-399
    • /
    • 2000
  • 본 논문은 정수계획 문제로 수리모형화 되는 선박운항 일정계획 문제에 대한 컴퓨터 그래픽 기반의 상호 대화식 모델링 시스템의 개발에 관해서 논한다. 선박운항 일정계획 문제는

  • PDF

MIMO-aided Efficient Communication Resource Scheduling Scheme in VDES

  • Sung, Juhyoung;Cho, Sungyoon;Jeon, Wongi;Park, Kyungwon;Ahn, Sang Jung;Kwon, Kiwon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권8호
    • /
    • pp.2736-2750
    • /
    • 2022
  • As demands for the maritime communications increase, a variety of functions and information are required to exchange via elements of maritime systems, which leads communication traffic increases in maritime frequency bands, especially in VHF (Very High Frequency) band. Thus, effective resource management is crucial to the future maritime communication systems not only to the typical terrestrial communication systems. VHF data exchange system (VDES) enables to utilize more flexible configuration according to the communication condition. This paper focuses on the VDES communication system among VDES terminals such as shore stations, ship stations and aids to navigation (AtoN) to address efficient resource allocation. We propose a resource management method considering a MIMO (Multiple Input Multiple Output) technique in VDES, which has been widely used for modern terrestrial wireless networks but not for marine environments by scheduling the essential communication resources. We introduce the general channel model in marine environment and give two metrics, spectral and the energy efficiencies to examine our resource scheduling algorithm. Based on the simulation results and analysis, the proposed method provides a possibility to enhance spectral and energy efficiencies. Additionally, we present a trade-off relationship between spectral and energy efficiencies. Furthermore, we examine the resource efficiencies related to the imperfect channel estimation.

$H^{\infty}$ Gain-Scheduling 기법을 이용한 컨테이너 크레인의 흔들임 제어에 관한 연구 (A Study on the Sway Control of a Container Crane Based on $H^{\infty}$ Gain-Scheduling Approach)

  • 김영복;정용길
    • 제어로봇시스템학회논문지
    • /
    • 제7권7호
    • /
    • pp.559-566
    • /
    • 2001
  • The sway control problem of the pendulum motion of a container hanging on the trolly, which transports containers from a container ship to trucks, is considered in the paper. In the container crane control problem, suppressing the residual swing motion of the container at the end of acceleration, deceleration or the case of that the unexpected disturbance input exists is main issue. For this problem, in general, the trolley motion control strategy is introduced and applied. In this paper, we introduce and synthesize a new type of swing motion control system in which a small auxiliary mass is installed on the spreader. The actuator reacting against the auxiliary mall applies inertial control forces to the container to reduce the swing motion in the desired manner. In this paper, we apply the $H^{\infty}$ based gain-scheduling control technique to the anti-swing motion control system design problem of the controlled plant. In this control system, the controller dynamics are adjusted in real-time according to time-varying plant parameters. And the simulation result shows that the proposed control strategy is shown to be useful for the case of time-varying system and, robust to disturbances such as winds and initial sway motion.

  • PDF

Spatial Scheduling in Shipbuilding Industry

  • Duck Young Yoon;Varghese Ranjan;Koo Chung Kon
    • 한국해양공학회:학술대회논문집
    • /
    • 한국해양공학회 2004년도 학술대회지
    • /
    • pp.106-110
    • /
    • 2004
  • In any large heavy industry like that of ship building, there exist a lot of complications for the arrangement of building blocks optimally for the minimal space consumption. The major problem arises at yard because of laxity in space for arranging the building blocks of ship under construction. A standardized erection sequence diagram is generally available to provide the prioritised erection sequence. This erection sequence diagram serves as the frame work. In order to make a timely erection of the blocks a post plan has to be developed so that the blocks lie in the nearest possible vicinity of the material handling devices while keeping the priority of erection. Therefore, the blocks are arranged in the pre-erection area. This kind of readiness of blocks leads to a very complex problem of space. This arises due to the least available space leading to an urgent need of an availability of intelligent spatial schedule without compromising the rate of production. There exists two critical problems ahead namely, the spatial occupation layout of pre-erection area and the emptying pattern in the spatial vicinity. The block shape is assumed be rectangular. The related input data's are the dates of erection (earliest as well as the latest), geometrical parameters of block available on pre-erection area, slack time and the like.

  • PDF

인천항의 효율적 선석운영을 위한 실시간 의사결정지원시스템 구축 (Development of Real-Time Decision Support System for the Efficient Berth Operation of Inchon Port)

  • 유재성
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 1998년도 추계학술대회 및 정기총회
    • /
    • pp.12-16
    • /
    • 1998
  • The purpose of this paper is to develop a knowledge-based real-time decision support system to support decision makers for efficient berth operation of Inchon Port. In these days, the efficient berth operation has been many studied. The berth operation rules differ from port to port and the problem is highly dependent on natural, geographical and operational environment of port. In Inchon Port, the ship's entrance into port and departure from port is extremely affected by the status of dock and berth because of capacity restriction. First, we analyzed the specific characteristics of Inchon Port such as dock based on the data of 1997. And then, we construct the database of experts knowledge for berth utilization. Finally, we build the real-time decision support system for the efficient berth operation of Inchon Port to make the better berth allocation in case of not only regular scheduling but also dynamic scheduling such as delay in berth operation and exchange of ship between berths. The DSS is developed with graphic user interface(GUI) concept to help the user determining user interactive updating of the port status. Then this DSS will be provide decision maker with an efficient and fast way to berth allocation, and reduce wastes of time, space, and manpower in Inchon Port operation.

  • PDF

수주생산 환경에서의 CIM 시스템을 위한 BOM과 라우팅의 구조화 -조선산업 사례 중심- (Structuring of BOM and Routings for CIM System In Make to Order Environments -Application of CIM System for Ship Production-)

  • 황성룡;김재균
    • 산업공학
    • /
    • 제15권1호
    • /
    • pp.26-39
    • /
    • 2002
  • Two key data areas of the integrated production database in computer-integrated manufacturing (CIM) systems are the product structure in the forms of bills of material(BOM) and the process structure in the forms of routings. The great majority of existing information systems regard the BOM and routing as two separate data entities, possibly with some degree of cross-referencing. This paper proposes new information structure called the bills of material and routings(BMR) that logically integrates the BOM and routings for the CIM systems in ship production. The characteristics of ship production are described as: 1) make-to-order production type, 2) combined manufacturing principles (workshop production and construction site production), 3) significant overlapping of design, planning and manufacturing, 4) very long order throughput time, 5) complex product structure and production process. The proposed BMR systematically manages ail parts and operations data needed ship production considering characteristics of ship production. Also, the BMR situated on the integrated production database more efficiently supports interface between engineering and production functions, and integrates a wide variety of functions within production such as production planning, process planning, operation scheduling, material planning, costing etc., and simplifies information flow between sub-systems in CIM systems.

제약만족 탐색과 휴리스틱 교정기법을 이용한 최적 선석 및 크레인 일정계획 (Optimal Berth and Crane Scheduling Using Constraint Satisfaction Search and Heuristic Repair)

  • 류광렬;김갑환;백영수;황준하;박영만
    • 지능정보연구
    • /
    • 제6권2호
    • /
    • pp.1-14
    • /
    • 2000
  • 컨테이너 터미널에서의 선석 및 크레인 일정계획은 일정 기간 동안 입항 예정인 선박들을 대상으로 선석을 배정하고 접안 시기와 기간을 결정하며, 또한 각 선박별로 컨테이너를 싣고 내릴 크레인을 배정하되 각 크레인의 서비스 시작과 완료시간까지 지정하는 전 과정을 포함한다. 이 문제는 본적으로 서로 시간적 공간적으로 복잡한 제약 관계에 있는 여러 선석들과 크레인들을 충돌 없이 각 선박에 할당하여야 하는 제약조건 만족 문제인 동시에, 각 선박의 희망 입출항 시간을 최대한 존중하면서 터미널의 운영비용을 최소화할 수 있는 계획안을 도출해야 하는 최적화 문제이기도 하 다. 본 논문에서는 이 문제의 해결을 위해 제약만족 탐색기법을 동원하여 먼저 제약조건을 만족하는 해를 찾은 뒤, 제약조건을 만족하는 범위 내에서 보다 최적의 해를 유도해 내기 위해 휴리스틱 교정 기법을 제약만족 탐색기법의 틀 내에서 반복적으로 적용하는 방안을 제시하고 있다. 실제 부산 신선대 컨테이너 터미널의 데이터를 이용한 실험 결과 현장 전문가가 만족할 만한 수준의 일정 계획을 신속하게 수립할 수 있음을 확인하였다.

  • PDF

반복적 개선 탐색을 이용한 최적 선석 및 크레인 일정계획 (An Iterative Improvement Search for the Optimal Berth and Crane Scheduling)

  • 황준하
    • 한국컴퓨터정보학회논문지
    • /
    • 제9권4호
    • /
    • pp.117-125
    • /
    • 2004
  • 컨테이너 터미널에서의 선석 및 크레인 일정계획은 일정 기간 동안 입항 예정인 선박들을 대상으로 선석을 배정하고 접안 시기와 기간을 결정하며, 또한 각 선박별로 컨테이너를 싣고 내릴 크레인을 배정하되 각 크레인의 서비스 시작과 완료시간을 지정하는 전 과정을 포함한다. 이 문제는 기본적으로 다양한 제약조건을 만족해야 하는 제약만족 탐색 문제인 동시에, 각 선박의 희망 입출항 시간을 최대한 존중하면서 터미널의 운영 비용을 최소화할 수 있는 계획을 도출해야 하는 최적화 문제이기도 하다. 본 논문에서는 이 문제를 효과적으로 해결하기 위해 반복적 개선 탐색의 틀 내에서 제약만족 탐색기법을 적용하는 방안을 제시하고 있다. 실제 컨테이너 터미널에 대한 실험 결과 기존 알고리즘을 적용했을 때보다 더 좋은 계획을 수립할 수 있음을 확인하였다.

  • PDF

선행 탑재장에서의 공간일정계획에 관안 연구 (A Study on Spatial Scheduling in the P.E. Stage)

  • 구충곤;윤덕영;배태규;조민철
    • 한국해양공학회:학술대회논문집
    • /
    • 한국해양공학회 2004년도 학술대회지
    • /
    • pp.61-66
    • /
    • 2004
  • In this paper an effort is made to develop an innovative spatial arrangement concept pertaining to ship building industry. The spatial scheduling is the problem that concentrates on effective planning of available space and arrangements of blocks and in a priority manner. In order to create an effective spatial scheduling. a database providing the priority has to be available to make the erection sequence. Such a system works hand in hand with erection sequence generator program The erection sequence program works on the conventional network analysis method which uses a typical parent-children idea for the calculation of the ENT(possible earliest network start time) and LNT(possible latest network start time). This program works in a cyclic manner taking turns by calculating the ENT in upward trace and LNT on the return trace thereby generating the entire erection sequence diagram for the requisite problem The generated database serves as an input data for spatial scheduling problem. When the system works it takes into consideration the entire system based on heuristic concepts as mentioned. There system uses the spatial aspects such as the available area of the P. E area and plan area of the corresponding blocks and its priority of erection from the erection sequence generator program develops the spatial scheduling arrangement. In this paper using all these concepts an innovative spatial schedule development system developed.

  • PDF

계층적 클러스티링 방법을 통한 컨테이너 적재순서 결정 방법 (The Method of Container Loading Scheduling through Hierarchical Clustering)

  • 홍동희
    • 한국컴퓨터정보학회논문지
    • /
    • 제10권1호
    • /
    • pp.201-208
    • /
    • 2005
  • 오늘날 컨테이너터미널의 운영방식의 변화를 통해 컨테이너터미널의 효율을 증대시키기 위한 대처방안에 대한 연구가 활발히 이루어지고 있다. 컨테이너터미널의 효율을 증대시키기 위해서는 적하계획 수립이 상당히 중요한 역할을 한다. 적하계획은 크게 적재의 위치를 결정하는 문제와 적재의 순서를 결정하는 문제로 나눌 수 있는데, 본 논문에서는 보다 효율적인 적재순서 결정 방안을 제시한다. 컨테이너 적재순서 결정 문제는 장치위치 및 운영 장비 등 여러 가지 경우의 수를 고려해야 하는 조합 최적화 문제이다. 컨테이너 적재순서를 결정하는 기존의 클러스터 구성방식은 재처리 문제로 작업의 효율성을 높이는데 한계가 있다. 따라서 선적지시서와 야드맵을 기초로 동일한 속성을 가진 컨테이너들을 계층적 클러스터링 방법을 적용하여 스택단위의 클러스터로 구성하고, 작업순서의 제약을 정의하는 보다 효율적인 컨테이너 적재순서결정 방법을 제안한다. 그 과정에서 작업순서 제약을 정의함으로서 클러스터간의 가능한 작업경로를 파악할 수 있고, 작업경로에 대한 제약적 탐색이 가능하여 기존의 방식에 비해 탐색효율이 증가됨을 알 수 있다.

  • PDF