標題: | 船席模板設計問題:以雅加達國際貨櫃中心個案為例 Berth Template Design Problem - Case Study in Jakarta International Container Terminal |
作者: | 艾帝尼 Ariantini 黃寬丞 Kuancheng Huang Suprayogi 運輸與物流管理學系 |
關鍵字: | 船席模板問題;貨櫃碼頭;多碼頭場站;整數規劃;雅加達貨櫃港;Berth Template Problem;Container Terminal;Multi-Wharf Terminal;Integer Programming;Jakarta Port |
公開日期: | 2013 |
摘要: | 在印尼25個國際通航之港口中,雅加達之Tanjung Priok港伴隨著過去幾年貨運量顯著的增加,以成為當前最大和最繁忙港口之一,同時也躍昇為全球前50大之貨櫃港。然而,它的貨運量與其它國家之海港相比,特別是鄰近東南亞國家,如新加坡之singapore港與馬來西亞之Klang港、Tanjung Pelepas港與泰國之Laem Chabang港,其貨運量卻相對地較低。而事實上,由於港口發展迅速,勢必將面臨需求無法負荷的困境,因此對於Tanjung Priok港而言,是良好的機會也是一個重大的挑戰。而隨著貨運量的增加,對於作為海港裝卸處理重要一環之貨櫃碼頭,如何有效地處理貨物,並且如何完善規劃貨運量,達到最佳化目標,即為船席模板設計問題(Berth Template Problem,BTP)。
本研究將以中期船席模板(BTP)問題為基礎,探討如何決定船舶之船席時間窗,以提供碼頭營運者與航商之間協商依據,因此本研究以最小化總偏差作為目標,發展整數規劃船席模板(BTP)問題數學模式。而為了確立其模式可行性與效益,本研究將以擁有多碼頭的雅加達國際貨櫃碼頭(JICT)中,其Terminal I之實際貨運量為例,進行實際驗證。實證結果發現,所發展的船席模板(BTP)模式能有效地提升資源使用與貨櫃碼頭營運效率。首先,我們得知船席模板在時間與空間並無重疊情況下,能降低服務時間偏差,達到最小化處罰成本目標,另一方面,我們也找到在現存模版以及最小化處罰成本基礎下,新加入船舶之最適規劃方式,供雅加達港之碼頭營運者決策參考。 Indonesia has 25 international seaports, Tanjung Priok (Port of Jakarta) is the biggest and the busiest one. It has significant increase of traffic volume for last few years. Moreover, it is one of the top 50 world container ports based on traffic volume. However, its traffic volume is lower than seaport’s traffic volume in many other countries, especially for those in Southeast Asia, such as Port of Singapore (Singapore), Port Klang and Tanjung Pelepas (Malaysia), and Laem Chabang (Thailand). As a matter of fact, Tanjung Priok has the highest increasing rate. It means that Tanjung Priok has a big opportunity and challenge when facing the issue demand development. The container terminal, as one of seaport’s main parts to handle the loading/unloading of container activities, should be prepared to face the traffic volume increasing. One of the decision plans to support the problem solving of that issue is work on one of the tactical decision plans, the Berth Template Problem (BTP). The Berth Template Problem determines the berthing windows of the calling ships within a planning horizon (e.g., a week). As a mid-term tactical decision problem, BTP provides the decision support for a terminal operator to negotiate the contracts with the shipping lines. This study develops an integer programming (IP) model aiming to minimize the total deviation, given the ship-dependent target times preferred by the shipping lines. In particular, a cylinder constraint is imposed to take into account the periodic planning nature of the BTP. In order to validate the applicability and benefit of the model, this study performs a numerical experiment based on the operational data of Jakarta International Container Terminal (JICT) – Terminal I, which has multiple perpendicular wharfs. This unique feature of multi-wharf sides has led to the IP formulation that has never seen in the literature. Based on the experiments, the developed model is found to be promising for raising the resource utilization and operational efficiency of container terminals. First, it can find the berth template which has the optimum (minimum) penalty cost (least starting service time deviation), with no overlapping in time dimension and space dimension as well as no violation of the constraint related to the planning horizon. On the other hand, it also can find the optimum way of accommodating the new ships, which can be inserted to the existing template, with minimum penalty cost. This pursued objective could make great contribution to the terminal operator, especially for JICT. It can also serve as the decision tool to make a plan for dealing with increased demand. |
URI: | http://140.113.39.130/cdrfb3/record/nctu/#GT070253215 http://hdl.handle.net/11536/75033 |
顯示於類別: | 畢業論文 |