(3.80.6.131) 您好!臺灣時間:2021/05/15 02:01
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:陳啟昌
研究生(外文):Chen chi chang
論文名稱:長方形物體在一定容積內可堆疊順序之最佳化
論文名稱(外文):The Computer System of Motion-Time Measurement and Application
指導教授:林威成林威成引用關係張雲龍張雲龍引用關係
指導教授(外文):Wei-Cheng LinWeng-Long Chang
學位類別:碩士
校院名稱:國立高雄應用科技大學
系所名稱:資訊工程系
學門:教育學門
學類:專業科目教育學類
論文種類:學術論文
畢業學年度:100
語文別:中文
論文頁數:41
中文關鍵詞:長方形物體堆疊順序問題混合遺傳演算法混合遺傳演算法
外文關鍵詞:Genetic AlgorithmsStacking order problemThree-dimensional cutting problems
相關次數:
  • 被引用被引用:1
  • 點閱點閱:948
  • 評分評分:
  • 下載下載:18
  • 收藏至我的研究室書目清單書目收藏:0
長方形物體的堆疊問題在目前企業是一個常見的問題,例如倉庫物件的擺放,貨運卡車載貨等,這些情況在物流業、食品業及製造業中均是經常出現的問題,因此物件緊密的堆疊使其空間更加有效地利用,將大大節省業者的空間成本,提高市場競爭力。
長方形物體的堆疊順序問題在學術上是屬於難解的NP-complete問題,若以單純的數學規則法求解,將無法在可接受的時間內求得最佳解,因此本研究的主要目的是在於建立啟發式演算法與遺傳基因演算法互相結合的混合遺傳演算法方法來求解長方形物體的堆疊順序問題,以快速求得長方形物體的堆疊順序演算模式,以便在合理的時間內,求得可接受之最佳解。冀望本研究所發展的演算法,可提供業界處理此類問題的參考,並進一步改善相關作業,達成降低營運成本的目標。
Three-dimensional cutting problems is a common problem. For example, in a company, the goods to put in the warehouse, the container to put on the boats or air- transportation to put the goods in the airplane, The main problem is how to effectively use the space and put the goods, makes use of space to maximize the reach and thus save a lot of space and time cost.

Three-dimensional cutting problems is based on Two-dimensional cutting problems, the two-dimensional cutting problems is difficult to obtain the optimal solution in a short time, so three-dimensional cutting problems are more difficult, we hope to in a short time to obtain an acceptable solution, we call a near optimum solution.

In this paper we study how to use the Genetic Algorithms to solving two-dimensional cutting problems, the cube in a certain space, the stacking order of the near optimum solution, to find an acceptable answer in a short time, can be a reference to help in dealing with similar problems, to achieve savings in time and space costs.
摘要 .............................................................. vi
ABSTRACT ........................................................ vii
致謝 ............................................................ viii
目錄 .............................................................. ix
第一章 緒論 ......................................................... 1
1-1 前言 ........................................................... 1
1-2 研究背景 ........................................................ 1
1-3 研究動機與目的 .................................................. 2
二、文獻探討 ........................................................ 3
2-1 貨櫃堆疊規劃的運作原理 ........................................... 3
2-2 基因演算法的現況與發展............................................ 3
2-2-1 簡介 ......................................................... 3
2-2-2 基因演算法的流程 ............................................... 4
2-3 堆疊問題簡介 .................................................... 9
2-4 三維裝箱問題 .................................................... 9
第三章 系統設計與實作 ............................................... 11
3-1 前言 .......................................................... 11
3-2 系統規劃 ...................................................... 11
3-2-1 系統架構 .................................................... 11
3-2-2 模組規劃 .................................................... 13
3-2-3 貨櫃擺放運作流程 ............................................. 14
3-3 系統設計 ...................................................... 15
3-3-1 開發方法 .................................................... 15
3-3-2 系統實作 .................................................... 17
第四章 案例研究與分析 ............................................... 20
4-1 模擬空間擺放 ................................................... 20
4-1-1 案例分析 .................................................... 20
4-1-2 需求分析 .................................................... 20
4-1-3 實驗結果 .................................................... 21
4-1-4 結果分析 .................................................... 21
4-2 小型貨車擺放 ................................................... 22
4-2-1 案例分析 .................................................... 22
4-2-2 需求分析 .................................................... 22
4-2-3 實驗結果 .................................................... 22
4-2-4 結果分析 .................................................... 23
4-3 大型貨車擺放 ................................................... 24
4-3-1 案例分析 ..................................................... 24
4-3-2 需求分析 ..................................................... 24
4-3-3 實驗結果 ..................................................... 24
4-3-4 結果分析 ..................................................... 25
第五章 結論 ........................................................ 27
參考文獻 ........................................................... 28
[1]張美忠,「貨物運輸棧板裝載問題啟發式解法之應用」,碩士論文,交通大學,新竹(1992)。
[2]葉進儀、吳泰熙、張維昌,2006,結合平行基因演算法與排列啟發式方法解二維長方形排列問題。
[3]張瑞玫,2006,線性規劃應用於配置及裝箱問題。
[4]吳泰熙、邱創鈞、賴志昌,2006,以協力演化遺傳演算法求解容器堆疊問題。
[5]Holland, J.H., Adaptation in Natural and Artificial Systems, the university of Michigan Press, Ann Arbor, 1975.
[6]Chung, F.RK., Carey, M.R and Johnson, D.J., "On packing two-dimensional bins," SIAM J. Alg. Disc. Meth., 3, 1982, pp.66-76.
[7]Gehring, H., and Bortfeld, A., “Davis, L. (Editor), Handbook of Genetic Algorithms, Van Nostrand Reinhold, Reading Mass,
[8]Lin, F.-T. and Kao, C.Y., Incorporating the Genetic Approach to Simulated Annealing in Solving Combinatorial Optimization Problems, Ph.D. Dissertation, National Taiwan Univ., 1991.
[9]1991.A Genetic Algorithm for Solving the Container Loading Problem,” International Transactions of Operational Research, Vol. 4, pp.401-418 (1997).
[10]Bortfeldt, A., and Gehring, H., “A Hybrid Genetic Algorithm for the Container Loading Problem,” European Journal Operational Research, Vol. 131, pp. 143-161 (2001).
[11]Ngoi, B. K. A., Tay, M. L., and Chua, E. S., “Applying Spatial Representation Techniques to the Container Packing Problem,” International Journal of Production Research, Vol. 32, pp. 111-123 (1994).
[12]Eley, M., “Solving Container Loading Problem by Block Arrangement,” European Journal Operational Research, Vol. 141, pp. 393-409 (2002).
[13]George, J. A., and Robinson, D. F., “A Heuristic for Packing Boxes into a Container,” Computers and Operations Research, Vol. 7, pp. 147-156 (1980).
[14]Terno, J., Scheithauer, G., Sommerweiβ, U., and Riehme, J., “An Efficient Approach for the Multi-Pallet Loading Problem,” European Journal Operational Research, Vol. 123, pp. 372-381 (2000).
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top