跳到主要內容

簡易檢索 / 詳目顯示

回結果列表
研究生： 張耿宗
Keng-Chung Chang
論文名稱： 變動需求下貨櫃船排艙最佳化之研究
指導教授： 顏上堯
Shang-Yao Yan
口試委員:
學位類別： 碩士
Master
系所名稱： 工學院 - 土木工程學系
Department of Civil Engineering
畢業學年度： 91
語文別： 中文
論文頁數： 88
中文關鍵詞： 貨櫃 、排艙 、變動需求 、零壹整數規劃問題
外文關鍵詞： binary integer programming problem, stowage planning, container, variable demand
相關次數： 點閱：5  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 為了降低貨櫃運輸的成本，船舶的大型化為目前貨櫃運輸的趨勢，影響貨櫃
    裝卸成本的排艙規劃將因而變得更複雜，而以人工經驗為主的排艙規劃作業難度
    亦將隨之增加。由於過去的研究皆假設航線上各港口的出口貨櫃需求量為固定，
    與實際情形不符，故本研究針對變動需求下貨櫃船排艙規劃發展有效率之求解方
    法。
    本研究參考相關文獻將排艙規劃分成兩階段，以最小化翻櫃成本為目標，在
    考量船舶平衡及壓櫃的限制條件下，分別構建最佳化數學模式進行求解。第一階
    段為艙區指派模式：將貨櫃船的艙位分區，且將性質相近的貨櫃編為同組，構建
    貨櫃組指派數學模式；第二階段為艙位指派模式，依據第一階段的指派結果對每
    一艙區內的貨櫃進行指派。兩階段的數學模式皆為零壹整數規劃問題，本研究使
    用數學規劃軟體進行求解。
    為測試本研究構建之模式的正確性及演算法的績效，本研究以一國籍海運業
    者的營運資料為例進行測試，並分析演算法中的參數對求解結果的影響。最後根
    據測試結果提出結論與建議。

    This research deals with a stowage plan for containers in a container ship. Since
    1970s, shipping companies compete around the world to provide profitable container
    transportation services. In order to increase the benefits of economy of scale, the
    capacity of container ships has increased. The complexity of stowage planning is
    increased by the capacity of containership naturally. The work of perform stowage
    plan is arranged by the human planners today. Future, this work will be more
    difficult for human planners because the capacity of container ship increasing. In the
    literatures, they have assumed that container demand is fixed. In reality, container
    demand is variable, so we consider a container ship stowage plan with variable
    demand.
    We consider a solution algorithm which embodies two stage processes to computerize
    the planning. The objective of this algorithm is to minimize the number of container
    shifting. The mathematical programming technique is used to formulate each model
    of two stages. The first stage deal with assigning groups of container with the same
    OD into the holds, which be formulated as binary integer programming problem
    which includes the constraints of stability of the ship to reduce overstow. In the
    second stage, the model deal with assigning each container into slots according the
    solution from fist stage. We solve the two models by ILOG CPLEX. In order to
    evaluate the model and the solution framework, we perform a case study using data
    based on information obtained from an ocean container liner in Taiwan, and this
    algorithm can generate a solution in a reasonable time.

    第一章緒論..................................................................................................................1 1.1 研究背景與動機...........................................................................................................................1 1.2 研究目的與範圍...........................................................................................................................3 1.3 研究方法與論文架構...................................................................................................................3 第二章文獻回顧與現況分析......................................................................................5 2.1 文獻回顧.......5 2.2 國內排艙作業現況.......................................................................................................................8 2.2.1 排艙規劃人員的工作內容....................................................................................................8 2.2.2 排艙作業要點........................................................................................................................8 2.2.3 排艙規劃作業常見的困難因素............................................................................................9 2.3 小結.............10 第三章模式構建........................................................................................................11 3.1 問題特性.....11 3.2 第一階段模式構建.....................................................................................................................13 3.2.1 模式假設.............................................................................................................................13 3.2.2 模式特性.............................................................................................................................14 3.2.3 啟發成本............................................................................................................................16 3.2.4 數學定式.............................................................................................................................19 3.2.5 求解方法.............................................................................................................................23 3.3 第二階段模式構建.....................................................................................................................24 3.3.1 問題描述.............................................................................................................................24 3.3.2 模式假設與符號說明..........................................................................................................24 3.3.3 數學定式.............................................................................................................................24 3.3.4 求解方法.............................................................................................................................28 3.4 整合演算法.29 3.4.1 兩階段演算法整合..............................................................................................................29 3.4.2 計算總翻櫃成本..................................................................................................................30 3.5 小結.............31 第四章範例測試........................................................................................................33 4.1 測試資料設定.............................................................................................................................33 4.1.1 船舶資料設定......................................................................................................................33 4.1.2 貨櫃資料設定......................................................................................................................34 4.2 演算法驗証.35 4.2.1 簡例測試a ..........................................................................................................................35 4.2.2 簡例測試b ..........................................................................................................................38 4.3 範例測試.....42 4.3.1 CPLEX 參數設定................................................................................................................43 4.3.2 範例資料及測試結果..........................................................................................................43 4.4 應用於實務上的修正方式.........................................................................................................48 4.5 小結.............49 第五章參數分析........................................................................................................51 5.1 最小貨櫃分組基準之設定分析.................................................................................................51 5.1.1 最小貨櫃分組基準的影響與調整......................................................................................51 5.1.2 測試例a 之測試結果..........................................................................................................52 5.1.3 不同測試例的求解結果......................................................................................................54 5.2 不同港口數目的分析.................................................................................................................56 5.2.1 未到達港口的貨櫃量對求解的影響..................................................................................56 5.2.2 測試例a 求解結果..............................................................................................................57 5.2.3 不同測試例的求解結果......................................................................................................59 5.3 收斂標準設定分析.....................................................................................................................61 5.3.1 更改收斂標準(gap) 設定.....................................................................................................61 5.3.2 測試例a 求解結果..............................................................................................................61 5.3.3 其他測試例的收斂標準測試..............................................................................................63 5.4 參數設定之建議及大型測試例求解..........................................................................................65 5.4.1 參數設定之建議..................................................................................................................65 5.4.2 大型測試例求解..................................................................................................................65 5.4 啟發成本改善測試.....................................................................................................................67 5.4.1 折減係數測試......................................................................................................................67 5.4.2 回饋式求解..........................................................................................................................68 5.6 確定需求下的求解測試.............................................................................................................69 第六章結論與建議....................................................................................................71 6.1 結論.............71 6.2 建議.............72 6.3 貢獻.............73 參考文獻......................................................................................................................75 附錄1：第四章範例求解結果之積載圖...................................................................77 附錄2：第五章測試例貨櫃資料...............................................................................87

    李選士、林志成，「以基因演算法為基礎之排艙自動化」，航運季刊，第八卷，第
    二期，頁21~45(1999)。
    周建張，「知識庫系統應用於貨櫃船自動化排艙之研究」，航運季刊，第二卷，第
    四期，頁11-24 (1993)。
    陳春益、溫哲欽，「貨櫃船舶艙位指派問題之研究」，中華民國第七屆運輸網路研
    討會論文集(2002)。
    Avriel, M., and Penn, M., “Exact and approximate solutions of the container ship
    stowage problem,” Computers and Industrial Engineering, Vol.25,
    pp.271-274(1993).
    Avriel, M., Penn, M., and Shpirer, N., “Container ship stowage problem :complexity
    and connection to the coloring of circle graphs,” Discrete Applied
    Mathematics,Vol.103, pp.271-279(2000).
    Avriel, M., Penn, M., Shpirer, N., and Witteboon, S.,” Stowage planning for container
    ships to reduce the number of shifts,” Annals of Operations Research,Vol.76,
    pp.55-71(1998).
    Dubrovsky, O., Levitin, G., and Penn, M., “A Genetic Algorithm with a Compact
    Solution Encoding for the Container Ship Stowage Problem,” Journal of
    Heuristics, Vol.8, No.6, pp. 585-599 (2002).
    J-G., Kang and Y-D, Kim., “Stowage planning in maritime container transportation,”
    Journal of Operational Research Society, Vol.53, pp.415-426(2002).
    Martin, G. L., Randhawa, S. U. and McDowell, E.D., “Computerized container ship
    load planning: a methodology and evaluation,” Computers and Industrial
    Engineering, Vol.14, pp.429-440(1988).
    Shield, J. J., “Container stowage :a computer-aided preplanning system,” Marine
    Technology, Vol.21, No.4, 370-383 (1984).
    Wilson, I. D., and Roach, P. A., “Container stowage planning - a methodology for
    generating computerized solutions,” Journal of Operational Research Society,
    Vol 51, Iss 11, pp 1248-1255 (2000).
    Wilson, I. D., and Roach, P. A., “Principles of combinatorial optimization applied to
    container-ship stowage planning,” Journal of Heuristics, Vol.5, No.4, pp.
    403-418 (1999).
    Wilson, I. D., and Roach, P. A., and Ware, J. A. “Container stowage
    pre-planning :using search to generate solutions, a case study,” Knowledge Based
    Systems, Vol.14, 137-145 (2001).

    QR CODE
    :::