:::

詳目顯示

回上一頁
題名:應用模擬退火演算法求解貨物配櫃利用率之研究
書刊名:航運季刊
作者:薛朝光李雨築陳淑玲
作者(外文):Hsueh, Chao-kuangLi, Yu-zhuChen, Shu-ling
出版日期:2011
卷期:20:3
頁次:頁61-88
主題關鍵詞:模擬退火演算法配櫃堆疊問題平穩度Simulated annealing algorithmStuffingContainer loading problemStability
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:1
  • 點閱點閱:52
非整櫃貨物之併櫃配裝(簡稱配櫃)在目前貨櫃運輸流程中,係一項非常重要且複雜而需仰賴實務經驗的工作,由於貨物的種類與尺寸繁多,配櫃人員往往得耗費許多時間藉助個人經驗或試誤法則來進行排貨和裝櫃,相當不符合經濟效益。因此,在兼顧最佳空間利用率及平穩度下,本研究運用模擬退火演算法之運算架構及特性,加入實際配櫃時所需考量貨物堆疊限制、擺放型態、貨櫃限重與平衡等重要因素,結合改良式「下後左角」優先之貨物堆疊準則,透過MATLAB(上標 ®)(數值計算工具加以程式化,並經由參數分析和探討,建構出可用於求解實際貨物配櫃問題的數值模型。同時,亦發展一3D圖像化展示介面,以便能具體展現各貨物之完整堆疊情形。最後經由實例運算結果顯示,於貨櫃空間利用率及整體貨物裝載之平穩度,皆符合配櫃作業所需;且對於多尺寸、不同堆疊限制、組合貨物含棧板,或非矩形體等貨物部分之模擬分析,亦均與現場配櫃情形相當一致,充分展現本數值分析模型在協助實際配櫃作業上良好的適用性及處理能力。
Container stuffing work is a quite important and complicated assignment in container transportation. It is still he accomplished by the workers with actual experiences, but they usually depend mainly on the trial-and-error experiences to load and discharge again and again in order to multiple types and sizes of the cargo could be packed successfully. It may consume much of time and make cost increased. Based on the optimal space utilization and stability conditions, therefore, the purpose of this study is to develop a simulated annealing algorithm approach considering the effects of cargo allocated constraints, container loading limits and stability on packing and integrating with a improved bottom-back-left packing model to solve for actual container stuffing problems. The numerical approach is programmed by MATLAB(superscript ®) and a 3D graphic demonstrated interface is also constructed in this study to show the analyzed results specifically. Finally, the computational results indicated that a good container space utilization and stability is good enough to satisfy the requirement of container stuffing assignment. The analyzed results for packing simulation on objects of multiple sizes, irregular shapes, various loading constraints and combination with pallet are agreed well with the practical stuffing work to certify this approach is to be provided with good applicability.
期刊論文
1.George, J. A.、Robinson, D. F.(1980)。A heuristic for packing boxes into a container。Computers and Operations Research,7(3),147-156。  new window
2.Scheithauer, G.(1999)。LP-based bounds for the container and multi-container loading problem。International Transactions in Operational Research,6(2),199-213。  new window
3.Terno, J.、Scheithauer, G.、Sommerwei, B. U.、Riehme, J.(2000)。An efficient approach for the multi-pallet loading problem。European Journal of Operational Research,123(2),372-381。  new window
4.吳泰熙、鄭豐聰、趙楷(20070900)。以加入升溫機制之模擬退火演算法求解單原片方形物件排列問題。技術學刊,22(3),253-261。  延伸查詢new window
5.Kirkpatrick, Scott、Gelatt, C. D. Jr.、Vecchi, M. P.(1983)。Optimization by simulated annealing。Science,220(4598),671-680。  new window
6.Chien, C.-F.、Deng, J. F.(2004)。A Container Packing Support System for Determining and Visualizing Container Packing Patterns。Decision Support Systems,37(1),23-34。  new window
7.Gehring, H.、Bortfeldt, A.(1997)。A genetic algorithm for solving the container loading problem。International Transactions in Operational Research,4(5/6),401-418。  new window
8.林光、李選士、王昱傑(1995)。配櫃決策系統之研究。航運季刊,4(4),84-106。new window  延伸查詢new window
9.Abdou, G.、Yang, M.(1994)。A systematic approach for the three-dimensional palletization problem。International Journal of Production Research,32(10),2381-2394。  new window
10.Bischoff, E.E.、Ratcliff, M.S.W.(1995)。Loading multiple pallets。The Journal of the Operational Research Society,46,1322-1336。  new window
11.Bortfeldt, A.、Gehring, H.(2001)。A hybrid genetic algorithm for the container loading problem。European Journal of Operational Research,131(1),143-161。  new window
12.Davies, A.P.、Bischoff, E.E.(1999)。Weight distribution considerations in container loading。European Journal of Operational Research,114(3),509-527。  new window
13.Eley, M.(2002)。Sloving container loading problems by block arrangement。European Journal of Operational Research,141(2),393-409。  new window
14.Gehring, H.、Menschner, K.、Meyer, M.(19900125)。A computer-based heuristic for packing pooled shipment containers。European Journal of Operational Research,44(2),277-288。  new window
15.George, J.A.(1992)。A method for solving container packing for a single size of box。Journal of the Operational Research Society,43(4),307-312。  new window
16.Liu, F.F.、Hsiao, C.J.(1997)。A threedimensional pallet loading method for singlesize boxes。Journal of the Operational Research Society,48(7),726-735。  new window
17.Metropolis, N.、Rosenbluth, A.W.、Rosenbluth, M.N.、Teller, A.H.、Teller, E.(1953)。Equations of calculation by fast computing machines。Journal of Chemical Physics,21(6),1087-1092。  new window
18.Ngoi, B.K.A.、Tay, M.L.、Chua, E.S.(1994)。Applying spatial representation techniques to the container packing problem。International Journal of Production Research,32(1),111-123。  new window
19.Ratcliff, M.S.W.、Bischoff, E.E.(1998)。Allowing for weight considerations in container loading。OR Spectrum,20(1),65-71。  new window
會議論文
1.Nahar, S.、Sahni, S.、Shragowitz E.(1986)。Simulated annealing and combinatorial optimization。The 23rd ACM/IEEE Design Automation Conference,293-299。  new window
2.薛朝光、柯宜伶、賴奕安(2008)。以基因演算法求解限重與平穩度考量下之貨物配櫃問題。高雄。3257-3286。  延伸查詢new window
學位論文
1.田邦廷(2002)。長方體物件堆疊問題解法之研究(碩士論文)。大葉大學。  延伸查詢new window
2.李兆涵(2006)。宅配業車輛裝載規劃問題之研究(碩士論文)。輔仁大學。  延伸查詢new window
3.柯宜伶(2008)。以基因演算法求解限重與平穩度考量下之貨物配櫃問題(碩士論文)。國立臺灣海洋大學。  延伸查詢new window
4.張美忠(1992)。貨物運輸棧板裝載問題啟發式解法之應用(碩士論文)。國立交通大學。  延伸查詢new window
5.楊佳燕(2005)。多重限制多容器裝填問題最佳化系統之研究(碩士論文)。華梵大學。  延伸查詢new window
6.李起毓(2007)。以混合啟發式演算法求解空間裝載利用率的最佳化問題(碩士論文)。朝陽科技大學。  延伸查詢new window
圖書
1.Garey, Michael R.、Johnson, David S.(1979)。Computers and Intractability: A Guide to the theory of NP-Completeness。W. H. Freeman and Company。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top