臺灣博碩士論文加值系統

貨櫃最佳化倉儲在港務工作中是重要的問題，基於空間的考慮，貨櫃須以堆疊的方式儲存，並且只可以由上方之貨櫃開始裝卸，因此貨櫃管理的成本與效率取決於貨櫃排程的編製。在貨櫃出口船期之前，所有的貨櫃皆堆疊於貨櫃場，堆疊的方式決定成本與效率，因此，貨櫃如何搬移進與出是一個值得研究的主題，而船務公司也可以節省燃料成本與人力時間。
　　傳統的貨櫃排程是根據裝卸人員的經驗法則，然而那是簡易的，沒有理論基礎的。本研究提出運用基因演算求出貨櫃倉儲中的貨櫃移動路徑與夾櫃機的起降次數達到最佳化。

The optimal schedule for containers storage is an important issue for harbors’ activities. With the consideration of space, containers are always stored in stack and accessed only from the tops of stacks. Thus, the cost and efficiency of containers’ management depend on how the inventories are scheduled. Before the sailing date of containers’ exportation, all of containers have to be stacked in container yards. The way of stacking determine the cost and efficiency. Therefore, how containers are moved in and out is an interesting research topic, by which cargo companies can save cost of
gasoline and labor hours.
　　The traditional technique to arrange the containers’ schedule is to use experience’s rules by the workers. However it is straightforward without any theoretical support. This study use the genetic algorithm to find the optimal schedule for containers’ storage based on the walking distance and the number of hoists’
raising.

目錄
摘要 iii
Abstract iv
誌謝 v
目錄 xi
一、緒論 1
1.1.研究背景與動機 1
1.2.研究目的 1
1.3.研究範圍 2
1.4.研究方法與架構 2
1.5.研究限制 4
二、文獻探討與相關研究 5
三、貨櫃場之運作與管理 9
3.1 貨櫃場作業流程..........................................9
3.2 貨櫃搬運機具與作業方式.................................11
四、基因演算法理論背景.....................................15
4.1遺傳演算法基本架構......................................15
4.3基因演算法的演算步驟....................................17
4.2基因演算法的參數設定....................................17
五、基因演算法在貨櫃排程應用...............................20
5.1 適應性函數.............................................20
5.2適應性函數驗證......................................21
5.3基因演算程式設計....................................25
　　 5.3.1編碼方式......................................25
5.3.2產生初始貨櫃堆疊族群..........................25
5.3.3染色體交配....................................26
5.3.4擷取優秀子代進行演化..........................27
5.3.5染色體突變....................................27
5.4 程式流程圖.........................................27
5.5 模擬事件...........................................30
5.6數據結果分析........................................33
5.7改善狀況討論............................................37
六、結論與後續研究.........................................36
6.1.結論...................................................36
6.2.後續研究...............................................38
參考文獻 38
中文部份 39
英文部份 41

中文部份
[1] 田邦廷，民91，「長方體物件堆疊問題解法之研究」，大葉大學工業工程研究所，碩士論文。
[2] 何信瑩，民90，「設計最佳化之演化式模糊決策樹」，逢甲大學資訊工程學系碩士班，碩士論文。
[3] 高傳凱，民87，「貨櫃堆機場儲位指派之研究」，第七屆校際運輸學術聯誼研討會論文集，257-271頁。
[4] 高傳凱，民91，「貨櫃儲存場儲位指派模式構建與求解」，運輸學刊，第十四卷，第四期，99-117頁。
[5] 陳木松、廖鴻翰，民87，「適應性突變運算及其運用」，大葉學報，第七卷，第一期：91-101頁。
[6] 陽銘賢，民88，「基因演算法在配置陳列空間上的應用」，管理學報，第十六卷，第二期：231-253頁。
[7] 游昌翰，民89，「應用遺傳演算法解序列組合問題」，國立中央大學資訊工程研究所，碩士論文。
[8] 廖裕璋、民90，「遺傳演算法應用於拆卸程序之研究」，國立台灣機械工程學研究所，碩士論文。
[9] 謝日章，民91，「柔性計算於生產管理之應用」，私立元智大學工業工程與管理研究所，博士論文。
[10] 劉森添，民73，「港埠貨櫃作業系統之規劃研究─ 以高雄港為例」，國立成功大學交通管理科學研究所碩士論文。
[11] 林志成，民87，「以基因演算法為基礎之排艙自動化之研究」，國立台灣海洋大學航運管理學系碩士論文。
[12] 陳壽山，民84，「貨櫃堆積場機具作業時間模式構建及比較」，國立成功大學交通管理科學研究所碩士論文。
[13] 張中議，民87，「高雄港專用貨櫃碼頭裝卸機具作業時間之研究」，國立成功大學交通管理科學研究所碩士論文。
[14] 陳春益、趙時樑，民89，「時空網路應用港區貨櫃場軌道式門型起重機移動路
　　徑之研究」，中華民國第五屆運輸網路研討會論文集，頁275-285。
[15] 謝玉霜，民90，「限制式規劃應用於港區貨櫃場軌道式門型起重機移動路徑之
研究」，國立交通管理科學研究所碩士論文。
[16] 曾一民，民90，「一個適用於大型矩陣類型問題的演化演算法」，逢甲大學資
訊工程學系碩士班，碩士論文。
[17] 游昌翰，民89，「應用遺傳演算法解序列組合問題」，國立中央大學資訊工程
　　研究所，碩士論文。
[18] 劉森添，民73，「港埠貨櫃作業系統之規劃研究─ 以高雄港為例」，國立成功
　　大學交通管理科學研究所碩士論文。
[19] 黃玟錫，民90，「不規則物件排列問題解法之研究」，大葉大學工業工程研究
　　所碩士論文。
[20] 吳泰熙、駱景堯、林東養, 民89,「多尺寸方形排列問題啟發式解法之研究」,
工業工程學刊,第17卷, 頁75-85。
[21] 徐德興, 民89,「利用模擬退火演算法求解不規則物件排列及切割問題」,大
　　葉大學工業工程研究所碩士論文。
[22] 楊家豪, 民86, 「以遺傳演算法應用於電腦輔助裝配程序規劃問題之研究」,
　　國立台灣大學工業工程研究所, 碩士論文。
英文部分
[23] A Ching-Mei Lin,”Using Genetic Algorithms to Solve Multiple Sequence
Alignments,” National Central University Department of Computer Science and
Information Engineering,2000.
[24] Albano, A. and G. Sapuppo, “Optimal allocation of twodimensional irregular
shapes using heuristic search methods”,IEEE Transactions on System, Man, and
Cybernetics, vol.10, pp. 242-248, 1980.
[25] Carlos F. Daganzo, “The crane scheduling problem,” Transportation Research,
vol.23B, no.3, pp.159-175, 1989.
[26] Deogun, J. S., “On shcduling with Ready Time to Minimize Mean Flow
Time,” The Computer Journal, Vol. 26, No 4, pp.320-328, 1983.
[27] Gungor, A., and Gupta, S. M., “Evaluation Methodology for Disassembly
Processes,” Computers & Industrial Engineering, Vol. 33,No. 1-2, pp.
329-332,1997.
[28] Goldberg, David E., Genetic Algorithms in Search,Optimization, and Machine
Learing, Addison-Wesley, 1989.
[29] Goulimis C., “Optimal solution for the cutting stock problem”,European Journal
Of Operational Research, vol.44, pp.197-208,1990.
[30] Grinde, R. B. and T. M. Cavalier, “A new algorithm for the minimal-area convex
enclosure problem”, European Journal of Operational Research, vol.84,
pp.522-538,1995.
[31] Ki Young Kim and Kap Hwan Kim, “A routing algorithm for a single straddle
carrier to load export containers onto ac ontainership,” I nt. J. Production
Economics, vol.59, pp.425-433, 1999.
[32] Mounira Taleb-Ibrahimi, Bernardo de Castilho and Carlos F. Daganzo,”Storage
space vs handling work in container terminals,”Maritime policy and management,
vol.26, no.1, pp.27-38, 1999.
[33] Kap Hwan Kim, “Evaluation of the number of rehandles in container yards,”
Computers and Industry Engineering, vol.32, no.4, pp.701-711,1997.
[34] Kap Hwan Kim and Ki Young Kim, “Routing straddle carriers for theloading
operation of containers using a beam search algorithm,” Computersand Industry
Engineering, vol.36, pp.109-136, 1999.
[35] 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.
[36] Mordecai Avriel and Michal Penn, “Exact and approximate solutions of
thecontainer ship storage problem,” Computers and Industry Engineering,vol.25,
pp.271-274, 1993.
[37] Yonug-Gyo Chung, Sabah U.Randhawa and Edward D. Mcdowell, “Asimulation
analysis for a transtainer-based container handling facility,”Computers and
Industry Engineering, vol.14, no.2, pp.113-125, 1988.
[38] 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.
[39] Kap Hwan Kim and Hong Bae Kim, “The optimal determination of thespace
requirement and the number of transfer cranes for import containers,”Computers
and industry Engineering, vol.35, nos.3-4, pp.427-430, 1998.
[40] 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.
[41] 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.
[42] Kap Hwan Kim and Jong Wook Bae, “Re-marshalling export container sin port
container terminals,” Computers and Industry Engineering, vol.35,nos.3-4,
pp.655-658, 1998.
[43] Louis, S. J., and Z. Xu, “Genetic Algorithms for Open Shop Scheduling and
Re-Scheduling,” In Proceedings of the ISCA 11th International Conferenceon
Computers and Their Applications, pp. 99-102, 1996.
[44] 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.
[45] 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.
[46] http://www.hit.com.hk
[47] http://www.khb.gov.tw/www/intro/index.htm