• Title/Summary/Keyword: 신선대컨테이너터미널

Search Result 12, Processing Time 0.02 seconds

Developing a Standard Costing Model for a Container Terminal - A Case Study for to PECT and GCT - (컨테이너부두의 표준원가모델 구축)

  • 임종길;한국해상교통정책연구소연구위원
    • Journal of Korean Port Research
    • /
    • v.13 no.2
    • /
    • pp.279-288
    • /
    • 1999
  • This paper is concerned with developing a standard costing model based on the case study of PECT and GCT in order to improve operation efficiency and design business strategy. In doing so the model can be a useful tool to analyze current calculation system of lease charge at the two terminals and to judge whether the level of lease charge currently applied to them is justifiable for thier profitability.

  • PDF

The Data Envelopment Analysis of Container Terminals to Transshipment Cargo (환적화물의 컨테이너 터미널 효율성 분석)

  • Park, Hong-Gyun
    • Journal of Korea Port Economic Association
    • /
    • v.26 no.1
    • /
    • pp.1-19
    • /
    • 2010
  • This paper focuses measuring the efficiency of container yards on container terminals in Busan (Gasungdae, Shinsundae, Gamman, New Gamman, Uam, Gamchon, PNC) and Gwangyang(GICT, KEC, Dongbu, KIT) using Data Envelopment Analysis(DEA) approach. Container terminals in Busan and Gwangyang play an important role in the region's economic development. The results show that Shinsundae was an efficient DMU during the period of 2007 to 2009, while Gamman, New Gamman and PNC were efficient terminals in 2009. The very inefficient terminals were shown to be GICT, KEC, Dongbu and KIT. GICT(2009), KEC(2009), Dongbu(2008-2009), KIT(2009) on Gwangyang Port were found to be relatively the inefficient terminals in terms of the returns to scale. This study also finds that the efficiency of Shinsundae terminal was so high as to be abel to keep its efficiency in spite of the additional increase of the inputs from 2007 to 2009. Gamman terminal was in the decreasing returns to scale in 2009, while the other terminals were in the increasing returns to scale. It means that we are able to improve the efficiency of the Gamman terminal with increasing returns to scale through enlarging the scale.

Developing a Standard Costing Model for a Container Terminal and Their Profitability Analysis case study of with reference to PECT and GCT (컨테이너부두의 표준원가모델 구축 및 운영수지분석)

  • 임종길;이태우
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 1999.10a
    • /
    • pp.19-33
    • /
    • 1999
  • This paper is concerned with developing a standard costing model based on the case study of PECT and GCT and analysing their profitability in order to improve operation efficiency and design business strategy. In doing so, the model can be a useful tool to analyze current calculation system of lease charge at the two terminals and to judge whether the level of lease charge currently applied to them is justifiable for their profitability. This paper also deals with break-even analysis of container terminal operating companies on the basis of the model and forecast of their profitability. On the top of that, it tries to look into the arguments and to suggest proposals for improving their profitability.

Space Allocation of Export Container Yard by Constraint Satisfaction Search (제약만족탐색 기법을 이용한 수출 컨테이너 장치장 계획)

  • 손예진;류광렬;김갑환
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.05a
    • /
    • pp.99-105
    • /
    • 2002
  • 컨테이너 터미널의 수출 장치장은 수출될 컨테이너들이 지속적으로 반입되어 해당 선박에 선적되기까지 일시적으로 보관되는 장소이다. 장치장의 공간 활용도를 높이면서 선적 시 작업의 능률을 극대화하기 위해서는 여러 가지 제약조건과 장치 규칙에 따라 컨테이너들의 장치 위치를 결정해야 할 뿐 아니라, 소정의 기간을 대상으로 그 동안 반입 예정인 전 컨테이너들에 대한 적절한 공간할당 계획을 미리 수립해 두어야 한다. 본 논문에서는 수출 장치장 계획 문제를 제약조건만족 문제로 보고 이를 효과적으로 해결하기 위한 탐색 기법을 제시하고 있다 대규모의 탐색공간으로부터 효율적으로 해를 찾기 위해 dependency-directed backtracking 기법을 적용하였고, 탐색 중에 제약조건을 만족하는 해를 찾기 어렵다고 판단될 경우에는 일부 제약조건을 완화하여 해를 재 탐색하는 제약조건 완화 기법을 적용하였다. 실제 부산 신선대 컨테이너 터미널의 데이터를 이용한 실험 결과 만족할 만한 수준의 계획을 빠른 시간 내에 수립할 수 있음을 확인하였다

  • PDF

A Brief Clustering Measurement for the Korean Container Terminals Using Neural Network based Self Organizing Maps (자기조직화지도 신경망을 이용한 국내 컨테이너터미널의 클러스터링 측정소고)

  • Park, Ro-Kyung
    • Journal of Korea Port Economic Association
    • /
    • v.26 no.1
    • /
    • pp.43-60
    • /
    • 2010
  • The purpose of this paper is to show the clustering measurement way for Korean container terminals by using neural network based SOM(Self Organizing Map). Inputs[Number of Employee, Quay Length, Container Terminal Area, Number of Gantry Crane], and output[TEU] are used for 3 years(2002,2003, and 2004) for 8 Korean container terminals by applying both DEA and SOM models. Empirical main results are as follows: First, the result of DEA analysis shows the possibility for clustering among the terminals and reference terminals except Gamcheon and Gwangyang terminals because of the locational closeness. Second, the result of neural network based SOM clustering analysis shows the positive clustering in clustering positions 1, 2, 3, 4, and 5. Third, the results between SOM clustering and DEA clustering show the matching ratio about 67%. The main policy implication based on the findings of this study is that the port policy planner of Ministry of Land, Transport and Maritime Affairs in Korea should introduce the clustering measurement way for the Korean container terminals using neural network based SOM with DEA models for clustering Korean ports and terminals.

The Efficiency and Determinants of 4 Major Container Ports in Korea (국내 주요 4대 컨테이너항만의 효율성 및 결정요인 분석)

  • Park, Ho;Kim, Dongjin
    • Journal of Korea Port Economic Association
    • /
    • v.28 no.3
    • /
    • pp.73-89
    • /
    • 2012
  • As the environment surrounding ports is rapidly changing and ports competition in Southeast Asia has become more severe to secure cargo volumes, ports strive to enhance their competitiveness by improving the efficiency of operations. The operational efficiency of ports, plays a crucial role to improve a nation's. This study aims to analyze the efficiency of container port and its determinants during over five year(2006 to 2010) period using DEA-O and Tobit regression respectively. The results show that firstly, Gamman is the most efficient container terminal, followed by New Gamman container terminal and Hutchison Busan container terminal. Secondly, it is notable that the efficiency of Busan Newport is dramatically increasing, and finally, the yard productivity of the container port is only influencing determinant of all.

An Exploratory Study For the Social Feasibility Of the Dredging the Water-Depth of Busan Port (부산항 컨테이너터미널의 증심준설에 관한 사회적 타당성 분석을 위한 탐색적 연구)

  • Kim, Chul-Min;Hong, Han-Gook
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.5
    • /
    • pp.29-43
    • /
    • 2008
  • As the containership has been large-sized, it is important to analyze the social feasibility for the dredging the water-depth of Busan port. We tries to do an exploratory study to analyze the needs of the core port user group by using the survey methodology. We did the survey for the ocean carriers, terminal operating companies, ship pilots respectively. Collected data was analyzed by frequency and cross tabulation method. Result suggests that the Busan North Port should be dredged to the 16 meter depth and Busan New Port should be dredged to the 17 meter depth. And the priority of the depth dredging is ranked as Gamman pier, Sinsundae pier, New Port and Jasungdae pier.

  • PDF

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

  • 백영수;류광렬;박영만;김갑환
    • 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 기법을 사용하였다. 실제 부산 신선대 컨테이너 터미널의 선석계획자료를 사용해서 실험을 하였다.

  • PDF

A Study on the Calculation of Construction Costs and Their Annual Equivalent Recovery at PECT and GCT (컨테이너부두의 건설원가와 연간투자비 회수에 관한 연구)

  • 이태우;임종길
    • Journal of Korean Port Research
    • /
    • v.14 no.2
    • /
    • pp.165-173
    • /
    • 2000
  • Major factors that are considered to determine lease charges of container terminals are, among others, construction cost of berth, discount rate, financing cost, and size of annual equivalent recovery. This paper aims to calculate construction costs at PECT and GCT and their annual equivalent recovery on the basis of historical data, and to identify whether or not the relationship of the above result and current lease charges at the two terminals are justifiable.

  • PDF

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

  • 류광렬;김갑환;백영수;황준하;박영만
    • 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.

  • PDF