English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27287/39131
Visitors : 2444885      Online Users : 35
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/19050

Title: 定期貨櫃航商新船部署與導入作業之研究
New Fleet Deployment and Phase-In Operation for Container Liner
Authors: 盧華安
Contributors: NTOU:Department of Transportation Science
Keywords: 定期貨櫃航線;數學規劃;船期排程;船隊部署;導入作業
Containership liner service;Mathematical programming;Ship scheduling;Fleet deployment;Phase-in operation
Date: 2001-08
Issue Date: 2011-08-17T07:07:33Z
Publisher: 行政院國家科學委員會
Abstract: 摘要:定期航商進行船隊及航線之重新部署與調整時,必須面臨船舶導入 暨導出(Phase-in and phase-out)之船期安排,亦即如何完成船舶由原先服務航線轉換至新航線間之過渡性接續。該項課題之重點,乃是處理船舶在時間與空間上之替換,以延續各船舶應有之服務;其決策內容涵蓋船舶之航程調整與載貨換船之處理方式。本研究針對新船導入所產生之船期擾動問題,藉時間-運具網路(Time-vehicle network)之概念,設計船流與櫃流之網路圖形,除船舶之移動外,將各起迄對貨流分類為流入規劃期、規劃期內部與流出規劃期三層網 路,進而建立四層結構之多元商品流量問題(Multi-commodity flow problem)模式,以追求流動成本極小化。由於額外限制式之約束性質不高,本研究參考各航商之案例進行實驗設計,並利用分枝限界法( Branch-and-bound method)進行求解,即可在有限時間內解算實務所需之問題規模。此外,經以特定航商之實例進行分析比較,模式所得結果頗具可用性。而在敏感度分析方面,則以貨流供給之變化對決策之影響較大。
Abstract:Liner carriers have to face the scheduling problem of ships' phase-in and phase-out, when they adjust the existing routes or change their fleet deployment. That means a smooth connection between the original service route and the new one for involved ships. Not only the time and place of connection within their service routes but containers transferring plan also are most concerned decision. In this paper, we focus on the scheduling problem of disturbance caused from the new ship's phase-in to design a network, which applies the concept of time-vehicle network, with four tiers to describe the movement of ships and containers. Except the ships' movement, the other three tiers are the goods flowing into the planning horizon, inner flowing, and flowing out the planning horizon. Through this network, the discussed problem can be formulated as a multi-commodity flow problem for minimizing the total flowing cost. Since For the sake of sparse side constraints in this model, we exploit the branch-and-bound method to solve the self-designed cases directly. The results show it can obtain the optimal solutions within reasonable CUP times for the scale of practical cases. The test to the case of Yang-Ming Lines shows that the results obtained from the model can be promisingly applied in practice. The sensitivity analysis also indicates that the carrying demand of containers governs the variation of decision.
Relation: NSC90-2416-H019-001
URI: http://ntour.ntou.edu.tw/handle/987654321/19050
Appears in Collections:[運輸科學系] 研究計畫

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback