:::

詳目顯示

回上一頁
題名:貨櫃儲存場堆積策略模擬與儲位指派模式構建
作者:高傳凱
作者(外文):Chwan-Kai Kao
校院名稱:國立交通大學
系所名稱:交通運輸研究所
指導教授:藍武王
學位類別:博士
出版日期:2002
主題關鍵詞:貨櫃儲位指派貨櫃儲存場堆積策略整數規劃container slot assignmentcontainer yardstacking strategyinteger programming
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(1) 博士論文(1) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:0
  • 點閱點閱:0
摘要
貨櫃儲位指派係貨櫃進存前預先將貨櫃指定存放於特定儲位,為貨櫃進存前的先期計劃。由於貨櫃進存量及貨櫃屬性未能於事前精確預知,因此目前多由人工依經驗法則進行指派工作。此種指派方式之結果並不能保證能對儲區作最有效之運用,亦造成貨櫃存取時不必要的翻櫃作業,導致作業成本上昇。
本研究首先對貨櫃堆積策略進行探討,將作業時間區分為機具移動時間、存取貨櫃時間及翻櫃時間三部分,以平均每櫃作業時間最短為目標,針對跨載機、貨櫃堆積機及高架換載機等三種不同機具作業,依貨櫃屬性取得與否,區分為「進存時未知提領日期」及「進存時已知提領日期」兩大類,分別比較堆積策略之優勢順位。研究結果發現,不同的作業機具,其堆積策略各異,而機具移動時間對堆積策略之影響極微,翻櫃時間成為決定各堆積策略優勢順位之關鍵因素。
針對單儲區與雙儲區兩種儲區規劃及順序堆置與隨機堆置兩種法則,進行儲位指派模擬及參數變化之敏感度分析,發現儲位選擇自由度較高之單儲區規劃與隨機堆置法則,可得到較佳之指派結果。經分析貨櫃儲位指派問題特性可知,當以最小翻櫃次數為目標構建貨櫃儲位指派整數規劃模式時,由於翻櫃動作係產生在同一疊貨櫃上下層貨櫃之間,因此可將行與列之差異忽略,而降低儲位指派問題的維度。本研究所構建之貨櫃儲位指派模式可以LINGO軟體求解小規模之簡例,驗證本研究所構建之貨櫃儲位指派模式之有效性。
Abstract
Container slot assignment is to allocate container boxes to certain slots in advance. It is a preplanning procedure for container stowage. Because the information of all of container attributes are not precisely known in advance, the operators of container yards normally assign the boxes into slots by experience. This often causes inefficient usage of slot capacities with unproductive moves of containers, which represents an increase in operation cost.
This study develops six container stacking strategies and compares their moving efficiency. The attributes of containers are divided into two categories--attributes that are known and unknown in advance. The moves of containers utilize such equipment as straddle carrier, forklift, and transtainer. The operation time is composed of equipment moving, loading/unloading, and restowage time. By comparing the average operation times of various stacking strategies, we find that equipment moving time has little effect on strategies rankings, while restowage time dominates. In addition, this study also compares the numbers of unproductive moves in single and twin areas under ordered- and random-stacking strategies. It is found that single area random-stacking strategy is more efficient than twin areas ordered-stacking. This implies that a decrease of the freedom of container slots selection will lead to less efficiency of slot assignment.
Since shifting moves occur only at the same row and column in different layers, the interrelationship between row and column of container slot assignment can be ignored; therefore, this study formulates the container slot assignment problem as an integer programming model to minimize the number of unproductive moves. The model can be easily solved by LINGO package and the solutions have been validated with some simplified examples.
王丘明,基隆港貨櫃場站成本結構與生產力分析,國立交通大學交通運輸研究所博士論文,民國八十四年一月。
王丘明、藍武王、黃承傳,「基隆港貨櫃基地生產力成長分析」,運輸計畫季刊,第二十四卷第一期,民國八十四年三月,頁89-124。
周建張,「知識庫系統應用於貨櫃船自動排艙之研究」,航運季刊,第二卷,第四期,民國八十二年十二月。
周和平、林君信、吳清慈,「智慧型貨櫃儲位管理資訊系統之構建」,運輸計劃季刊,第二十三卷第二期,民國八十三年,頁91-124。
林鼎欽,自動倉儲排程問題--N台存取機存料指派之模擬,中原大學機械工程研究所碩士論文,民國七十四年六月。
張智翔,自動倉儲系統之三維分級儲存法則,中原大學工業工程研究所碩士論文,民國八十年六月。
高傳凱,「基隆港貨櫃基地營運績效評估」,基隆港務局,港埠研究報告,第四十期,民國八十三年六月,頁25-59。
高傳凱,「基隆港貨櫃碼頭自動化儲位管理系統構建芻議」,基隆港務局,港埠研究報告,第四十二期(上冊),民國八十五年六月,頁64-93。
高傳凱、藍武王,「貨櫃堆積場儲位指派之研究」,第七屆校際運輸學術聯誼研討會,台南市成功大學,民國八十七年四月,頁257-271。
高傳凱、藍武王,「減少貨櫃場內不具生產力動作之貨櫃儲位指派模式」,交通運輸,第十九期,民國八十九年六月,頁30-39。
陳春益、趙時樑、謝東緯,「時空網路應用於出口貨櫃儲區規劃之研究」,中華民國運輸學會第14屆論文研討會,台北市,民國八十八年十二月。
陳春益,「貨櫃海運營運管理─網路最佳化之應用」,國立成功大學交通管理科學系,民國九十一年元月,台南市,頁55-61。
黃承傳,「貨櫃碼頭營運改善策略之研究」,運輸計劃季刊,第二十卷,第一期,民國八十年三月,頁29-54。
鄭漢濱,裝配業自動倉儲之儲位規劃,中原大學工業工程研究所碩士論文,民國八十一年六月。
藍武王、李怡容、高傳凱,「基隆港貨櫃基地生產效率之資料包絡分析」,運輸學刊,第十卷,第二期,民國八十六年六月,頁1-34。
藍武王、高傳凱,「貨櫃場堆積策略效率比較」,交通運輸第十七期,民國八十七年六月,頁69~90。
藍武王、高傳凱,「貨櫃儲存場儲位指派模式構建與求解」,運輸學刊,已接受刊登,民國九十一年。
Bernardo, D. C. and C. F. Daganzo, "Handling strategies for import containers at marine terminal," Transportation Research -B, Vol. 27, No. 2, pp. 151-166, 1993.
Chen, T., "Land utilization in the container terminal: a global perspective," Maritime Policy and Management, Vol. 25, No. 3, pp. 289-303, 1998.
Chen, T., "Yard operations in the container terminal- a study in the ''unproductive moves'' ", Maritime Policy and Management, Vol. 26, No. 1, pp. 22-38, 1999.
Daganzo, C. F., "The crane scheduling problem," Transportation Research-B, Vol. 23, No. 3, pp. 159-175, 1989.
Dowd, T. I. And T. M. Leschine, "Container terminal productivity: a data envelopment analysis," Martime Policy and Management, Vol. 17, No. 2, pp. 107-112, 1990.
Hausman, Warren H., Leroy B. Schwarz and Stephen C. Graves, "Optimal storage assignment in automatic warehousing system," Management Science, Vol. 22, No. 6, pp. 629-638, 1976.
Kanet, John J. and Richard G. Ramirez, "Optimal stock picking decision in automatic storage and retrieval system," OMEGA, Vol. 14, No. 3, pp. 239-244, 1986.
Kim, K. H. and K. Y. Kim, "An optimal routing algorithm for a transfer crane in port container terminals," Transportation Science, Vol. 33, No. 1, pp. 17-33, 1999.
Lan, Lawrence W. and C. K. Kao, "A container slot assignment model to reduce unproductive moves in yard operation," the 5th Conference of the Asia-Pacific Operation Research Societies, 5-7 July, Singapore, 2000.
Lan, Lawrence W. and C. K. Kao, "A Comparison of Stacking Efficiency for Various Strategies of Slot Assignment in Container Yards," Journal of the Eastern Asia Society for Transportation Studies, Vol. 4, No. 1, pp. 303-318, 2001.
Peterkofsky, R. I. and C. F. Daganzo, "A branch and bound solution method for the crane scheduling problem," Transportation Research- B, Vol. 24, No. 3, pp. 159-172., 1990
Saginaw Ⅱ, D. J. and A. N. Perakis, "A decision support system for containership stowage planning," Marine Technology, Vol. 26, No. 1, pp. 47-61, 1989.
Shields, Jonathan J., "Containership stowage a computer-aided preplanning system," Marine Technology, Vol. 21, No. 4, pp. 370-383, 1984.
Taleb-Ibrahimi, M., D. C. Bernardo and C. F. Daganzo, "Storage space vs. handling work in container terminal," Transportation Research -B, Vol. 27, No. 1, pp. 13-32, 1993.
Talley, W. K., "A short-run cost analysis of ocean containerships," Logistic and Transportation Review, Vol. 22, No. 2, pp. 131-139, 1986.
Total soft bank, System description for CATOS, Pusan, Korea, 1998.
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE