跳到主要內容

臺灣博碩士論文加值系統

(35.153.100.128) 您好!臺灣時間:2022/01/19 03:01
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:許乃云
研究生(外文):Nai-Yun Hsu
論文名稱:貨櫃儲區整櫃之最佳化網路模式
論文名稱(外文):An optimal network model for pre-marshalling in the container yard
指導教授:李宇欣李宇欣引用關係
指導教授(外文):Yu-Sin Lee
學位類別:碩士
校院名稱:國立成功大學
系所名稱:土木工程學系碩博士班
學門:工程學門
學類:土木工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:中文
論文頁數:104
中文關鍵詞:貨櫃場軌道型門式起重機翻櫃整櫃多元商品流動問題時空網路
外文關鍵詞:multi-commodity flow problemtime-space networkcontainer yardpre-marshallingrestowagerail mounted gantry crane
相關次數:
  • 被引用被引用:23
  • 點閱點閱:1439
  • 評分評分:
  • 下載下載:367
  • 收藏至我的研究室書目清單書目收藏:2
在貨櫃運輸領域中,貨櫃裝船作業為重要的一環。由於貨櫃以堆疊方式存放且僅能由堆疊的最上方被存取,因此貨櫃儲區之作業效率取決於堆疊中貨櫃之排列以及翻櫃次數。
在實際作業時,二艘貨櫃船的裝卸作業之間通常有超過四個小時的閒置時間。善用此段時間於貨櫃儲區進行整櫃作業,可為其後之裝船作業作準備。本研究發展一套以網路最佳化為基礎之數學模式,求解最佳整櫃搬移順序,利用閒置時間進行作業。其中目標函數以及限制式均為線性。在時空網路中描述貨櫃屬性與搬移存置規則,並將不同種類之貨櫃視為在網路中流動的不同類商品。模式中以限制式以表達運作規則,例如僅能由各堆疊最上方存取貨櫃。本研究並針對不同情況與實用上之需求發展數個延伸模式。
本研究所建立之模式為一整數問題,可利用分支定限法進行求解。然而,當測試例大小趨近於真實貨櫃場時,由於模式規模過大導致難以求得最佳解。為使之能在合理時間內應用個人電腦進行求解,因而發展數種求解方法以簡化模式。數個求解技巧包括鬆弛限制式、納入較多之假設等。在論文中亦對每個求解方法提出詳細討論。
論文中呈現數個測試例,對應各個模式並以各求解技巧嘗試求解。求解結果可驗證所發展模正確性以及求解效率。
The process of loading containers into ships plays a key role in the container shipping industry. Due to the fact that containers are stored in stacks, and can be accessed only from the top of each stack, the efficiency of a given container yard operation largely depends on how the stacks are managed and the number of remarshalling.
In practice, there is usually a waiting time of 4 hours or more between two ships’ loading/unloading work. The time gap can be utilized to remarshall the containers to prepare for the loading work in the specified order of the following ship. In this research we develop a mathematical model that is a network flow based optimization problem and solves for an optimal moving sequence that can be performed during the waiting period. The objective function as well as all constraints are linear. Attributes and physical rules regarding container movements are captured in a time-space network, and different containers are represented as different flow commodities in the network. Side constraints are deployed to express certain rules such as containers can be accessed only from the top of each stack. Several varieties of the model are developed for different situations and requirements that occur in practice.
The resulting models are integer problems that can be solved by any standard algorithm such as branch and bound. However, for instances that are close to real container yards in size, the model is too large to solve to optimum in this way. Therefore we developed several heuristics to simplify the models and allow them to be solved with a personal computer in reasonable time. A variety of simplifying techniques are used, including relaxation of constraints, making more restricting assumptions, and others. Detailed discussion on each approach is also provided in the thesis.
Computation examples for each model and solving heuristic are also presented in the thesis. The results indicate that the models developed are correct and efficient.
目錄
中文摘要 I
Abstract II
誌謝 III
目錄 IV
表目錄 VI
圖目錄 VII
第一章 緒論 1
1.1 研究動機與目的 1
1.2 研究範圍與方法 2
1.3 論文架構 3
第二章 文獻回顧 5
2.1 貨櫃管理相關文獻 5
2.1.1 文獻內容概述 5
2.1.2 文獻內容統整 8
2.2 多元商品流動問題相關文獻 9
第三章 貨櫃場之運作與管理 11
3.1 貨櫃場作業流程 11
3.2 貨櫃搬運機具與作業方式 15
3.3 貨櫃儲區座標系統定義 18
3.4軌道式門式起重機之運作 21
3.5基本假設 22
第四章 數學模式 25
4.1 貨櫃儲區整櫃問題 25
4.2 窮舉法 26
4.2.1 利用廣度優先搜尋法求解 26
4.2.2 整櫃窮舉演算法 30
4.2.3 簡例驗證 31
4.3 整櫃網路模式 33
4.3.1 節點 35
4.3.2 節線 37
4.3.3 貨櫃儲區網路模式 40
4.4 整櫃數學模式 44
4.4.1 參數定義 45
4.4.2 決策變數 45
4.4.3 限制式 46
4.4.4 目標函數 51
4.5 模式延伸 52
4.5.1 延長時間區段 52
4.5.2末終狀態目標設定 53
第五章 求解方法 60
5.1 鬆弛整數限制 60
5.2 鬆弛限制式 61
5.3 減少搬移機會並增加時間點 61
5.4 刪除目標函數 64
5.5 減少商品種類 65
5.6打破迴圈之限制 66
5.7 整櫃前對部分貨櫃定位 69
第六章 測試與分析 71
6.1模式Ⅰ測試例 72
6.2模式Ⅱ測試例 81
6.2.1模式ⅡCASE 1 82
6.2.2 模式ⅡCASE 2 83
6.2.3模式ⅡCASE 3 85
6.3模式Ⅲ測試例 86
6.4模式Ⅳ測試例 87
6.4.1模式ⅣCASE 1 88
6.4.2模式ⅣCASE 2、3 90
第七章 結論與後續研究 98
7.1 結論 98
7.2 後續研究 98
參考文獻 100
簡歷 104
參考文獻
1.Ravindra K. Ahuja, Thomas L. Magnanti and James B. Orlin, ”Network Flows,” Prentice Hall, 1993.
2.Mordecai Avriel and Michal Penn, “Exact and approximate solutions of the container ship storage problem,” Computers and Industry Engineering, vol.25, pp.271-274, 1993.
3.Mordecai Avriel, Michal Penn, Naomi Shpirer and Smadar Witteboon, “Stowage planning for container ships to reduce the number of shifts,” Annals of Operational Research, vol.76, pp.55-71, 1998.
4.Mordecai Avriel, Michal Penn and Naomi Shpirer, “Container ship stowage problem﹕complexity and connection to the coloring of circle graphs,” Discrete Applied Mathematics, vol.103, pp.271-279, 2000.
5.Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms,” The MIT Press, p.469-470, 1989.
6.Yonug-Gyo Chung, Sabah U.Randhawa and Edward D. Mcdowell, “A simulation analysis for a transtainer-based container handling facility,” Computers and Industry Engineering, vol.14, no.2, pp.113-125, 1988.
7.Carlos F. Daganzo, “The crane scheduling problem,” Transportation Research, vol.23B, no.3, pp.159-175, 1989.
8.Robert Fourer, David M. Gay and Brian W. Kernighan, “AMPL (A Modeling Language For Mathematical Programming),” Boyd & Fraser, 1993.
9.Ali Haghani and Sei-Chang Oh, “Formulation and solution of a multi-commodity, multi-model network-flow model for disaster relief operations,” Transporation Research, vol.30A, no.3, pp231-250, May 1996.
10.Jonathan J. Shields, “Containership stowage﹕A computer-aided preplanning system,” Marine technology, vol.21,no.4, pp.370-383, October 1984.
11.Kap Hwan Kim, “Evaluation of the number of rehandles in container yards,” Computers and Industry Engineering, vol.32, no.4, pp.701-711, 1997.
12.Ki Young Kim and Kap Hwan Kim, “A routing algorithm for a single transfer crane to load export containers onto a containership,” Computers and Industry Engineering, vol.33, pp.673-676, 1997.
13.Kap Hwan Kim and Hong Bae Kim, “The optimal determination of the space requirement and the number of transfer cranes for import containers,” Computers and industry Engineering, vol.35, nos.3-4, pp.427-430, 1998.
14.Kap Hwan Kim and Jong Wook Bae, “Re-marshalling export container s in port container terminals,” Computers and Industry Engineering, vol.35, nos.3-4, pp.655-658, 1998.
15.Kap Hwan Kim and Ki Young Kim, “An optimal routing algorithm for a transfer crane in port container terminals,” Transportation Science, vol.33, no.1, pp.17-33, February 1999.
16.Kap Hwan Kim and Ki Young Kim, “Routing straddle carriers for the loading operation of containers using a beam search algorithm,” Computers and Industry Engineering, vol.36, pp.109-136, 1999.
17.Ki Young Kim and Kap Hwan Kim, “A routing algorithm for a single straddle carrier to load export containers onto a containership,” Int. J. Production Economics, vol.59, pp.425-433, 1999.
18.Kap Hwan Kim and Hong Bae Kim, “Segregating space allocation models for container inventories in port container terminals,” Int. J. Production Economics, vol.59, pp.415-423, 1999.
19.Kap Hwan Kim, Young Man Park and Kwang-Ryul Ryu, “Deriving decision rules to locate export containers in container yards,” European Journal of Operational Research, vol.124, pp.89-101, 2000.
20.Angel Marin and Javier Salmeron, “Tactical design of rail fright-networks. Part I.exact and heuristic methods,” European Journal of Operational Research, vol.90, no.1, pp26-44,April 5 1996.
21.Roy I. Peterkofsky and Carlos F. Daganzo, “A branch and bound solution method for the crane scheduling problem,” Transportation Research, vol.24B, no.3, pp.159-172, 1990.
22.D. J. Saginaw II and A. N. Perakis, “A decision support system for container ship stowage planning,” Marine technology, vol.26, no.1, pp.47-61, Jan 1989.
23.Mounira Taleb-Ibrahimi, Bernardo de Castilho and Carlos F. Daganzo, “Storage space vs handling work in container terminals,” Transportation Research, vol.27B, no.1, pp.13-32, 1993.
24.Tao Chen, “Yard operations in the container terminal—a study in the ‘unproductive moves’,” Maritime policy and management, vol.26, no.1, pp.27-38, 1999.
25.http.//www.hit.com.hk
26.林志成,「以基因演算法為基礎之排艙自動化之研究」,國立台灣海洋大學航運管理學系碩士論文,民國87年。
27.高傳凱,「貨櫃堆積場儲位指派之研究」,第七屆校際運輸學術聯誼研討會論文集,頁257-271,民國87年,國立成功大學。
28.許瓊文,「路線貨運業提供快捷服務網路設計問題之研究」,國立成功大學交通管理研究所碩士論文,民國85年。
29.陳潔如,「考慮轉車之鐵路列車排點模式」,國立成功大學土木工程學研究所碩士論文,民國90年。
30.陳春益、趙時樑,「時空網路應用港區貨櫃場軌道式門型起重機移動路徑之研究」,中華民國第五屆運輸網路研討會論文集,頁275-285,民國89年。
31.陳國泉,「不同高度貨櫃混合積載對船舶穩度影響之計算研究」,國立台灣海洋大學航運技術研究所碩士論文,民國84年。
32.陳壽山,「貨櫃堆積場機具作業時間模式構建及比較」,國立成功大學交通管理科學研究所碩士論文,民國84年。
33.陽明海運公司 (高雄港埠貨櫃場實地調查)。
34.張中議,「高雄港專用貨櫃碼頭裝卸機具作業時間之研究」,國立成功大學交通管理科學研究所碩士論文,民國87年。
35.劉森添,「港埠貨櫃作業系統之規劃研究—以高雄港為例」,國立成功大學交通管理科學研究所碩士論文,民國73年。
36.簡君珊,「土方銀行營運最佳化管理模式」,國立成功大學土木工程學研究所碩士論文,民國88年。
37.謝玉霜,「限制式規劃應用於港區貨櫃場軌道式門型起重機移動路徑之研究」,國立交通管理科學研究所碩士論文,民國90年。
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top