請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36157完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 楊烽正 | |
| dc.contributor.author | Kwan-Wen Hsu | en |
| dc.contributor.author | 許冠文 | zh_TW |
| dc.date.accessioned | 2021-06-13T07:52:36Z | - |
| dc.date.available | 2007-07-27 | |
| dc.date.copyright | 2005-07-27 | |
| dc.date.issued | 2005 | |
| dc.date.submitted | 2005-07-25 | |
| dc.identifier.citation | 1 林光，1995，配櫃決策支援系統之研究，航運季刊，Vol. 4，No. 4，pp. 84-106。
2 于學海、葉榮懋，1996，結合遺傳演算法與類神經網路求解容器內商品裝填問題，國立成功大學工業管理研究所碩士論文。 3 簡禎富、吳文婷，1997，貨櫃排貨模式及方法之研究，中國工業工程學會八十六年度年會論文集，pp. 119-124。 4 田邦廷、吳泰熙，2002，長方體物件堆疊問題解法之研究，大葉大學工業工程學系碩士班碩士論文。 5 鍾正豪、林金玲，2003，多重限制容器裝填問題最佳化系統之研究，華梵大學工業管理學系碩士班學位論文。 6 鄧景豐、簡禎富，2000，單一貨櫃排貨系統，國立清華大學工業工程與工程管理研究所碩士論文 7 Bischoff, E., and Dowsland, W.B., 1990, “A Comparative Evaluation of Heuristics for Container-loading,” European Journal of Operational Research, Vol. 44, pp. 271-280. 8 Bischoff, E.E., and Ratcliff, M.S.W., 1995, “Issues in the development of approaches to container loading,” Omega, Vol. 23, no. 4, pp. 377-390. 9 Bischoff, E.E., Janetz, F., and Racliff, M.S.W., 1995, “Loading pallets with non-identical items,” European Journal of Operational Research, Vol. 84, pp.681-692. 10 Chen, C.S., Lee, S.M., and Shen, Q.S., 1995, “An analytical model for the container loading problem,” European Journal of Operational Research, Vol. 80, pp.68-76. 11 Dowsland, K.A. and Dowsland, W.B., 1992, “Packing Problems,” European Journal of Operational Research, Vol. 56, pp.2- 14. 12 Dyckhoff, H., 1990, “A Typology of Cutting and Packing Problem,” European Journal of Operational Research, Vol.44, pp. 145-159. 13 Gilmore, P. C., and Gommory, R. E., 1961, “A Linear Programming Approach to the Cutting-Stock Problem,” Operations Research, Vol.9, pp. 849-859. 14 Gehring, H., and Menschner, K., and Meyer, M., 1990, “A Computer-Based Heuristic for Packing Pooled Shipment Containers, ” European Journal of Operational Research, Vol. 44, pp. 277-288. 15 Gehring, H., and Bortfeld, A., 1997, “A genetic algorithm for solving the container loading problem,” International Transactions of Operational Research, Vol. 4, pp. 401-418. 16 Gehring, H., and Bortfeld, A., 2001, “A hybrid genetic algorithm for the container loading problem,” European Journal of Operational Research, Vol. 131, pp. 143-161. 17 Gehring, H., and Bortfeld, A., 2003, “A parallel tabu search algorithm for solving the container loading problem,” Parallel Computing, Vol. 29, pp. 641-662. 18 Herz, J. C., 1972, “Recursive Computational Procedure for Two-dimensional Stock Cutting,” IBM Journal of Research and Development, Vol. 16, No. 5, pp. 662-669. 19 Hifi, M. and Zissimopoulos, V., 1996, “A Recursive Exact Alogorithm for Weighted Two-Dimensional Cutting,” European Journal of Operational Research, Vol. 91, pp. 533-564. 20 Hifi, M. and Ouafi, R., 1997, “Best-First Search and Dynamic Programming Methods for Cutting Problems: the Cases of One or More Stock Plates” Computers and Industrial Engineering, Vol. 32, No. 1, pp. 187-205. 21 House, R.L., and Dagli, C.H., 1992, “An approach to three-dimensional packing using genetic algorithm,” ANNIE’92, ASME-press, pp. 937-942. 22 Loh, H.T., and Nee, A.Y., 1992, “A packing algorithm for hexahedral boxes,” in: Proceedings of the Industrial Automation’92 Conference, Singapore, pp. 115-126. 23 Ngoi, B.K.A., and Whybrew, K., 1993, A Fast Spatial representation Method-Applied to Fixture Design,” International Journal of Advanced Manufacturing Technology, Vol. 8, pp. 71-77. 24 Ngoi, B.K.A., and Tay, M.L. and Chua, E.S., 1994, “Applying Spatial Representation Techniques to the Container Packing Problem,” International Journal of Production Research, Vol. 32, No. 1, pp. 111-123. 25 Scheithauer, G., 1999, “LP-based bounds for the container and multi-container loading problem,” Operations Research, Vol.6, pp. 199-213. 26 Terno, J., 2000, “An efficient approach for the multi-pallet loading problem,” European Journal Operational Research, Vol. 123, pp. 372-381. 27 OR LIBRARY 標竿問題範例參考網址http://people.brunel.ac.uk/~mastjjb/jeb/info.html | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36157 | - |
| dc.description.abstract | 本研究以遺傳演算法為基提出四種啟發式裝箱演算法以求解單一容器裝填問題。本研究提示的裝箱演算法核心是一個裁切�延伸（clip-extened）為基的空間演化技術，名為「裁伸空間演化法」。此演化法最多化地且最大化地更新容器內的候選空間，此候選空間演化法提供裝箱演算法在執行裝填物件作業時有更多更寬大的候選空間選擇。本研究並建立一數值化評估指標稱為–空間吻合度，善用物件與候選空間的尺寸、體積等資訊，使裝箱演算法選取最適候選空間並以最適擺置方位裝填物件。同時使用C#程式語言運用Microsoft Visual Studio .Net 2003和Evolver動態鏈結程式庫 (Dynamic Linking Library, DLL)等軟體工具實作上述求解模式。透過小型自創範例和過往文獻標竿問題的比較。確認本研究的四種求解模式能成功地求解單一容器裝填問題，且本研究的求解模式3及模式4，在Loh 和 Nee (1992)以及鄧景豐(2000)等文獻上的問題，整體而言，獲得較其他文獻上的啟發式和人工智慧方法更佳的求解結果。 | zh_TW |
| dc.description.abstract | This research presents genetic algorithm (GA) based four heuristic packing algorithms to solve single container packing problems. The core of heuristic packing algorithms is a “clip-extened based spatial evolution technique”, which dynamically defines usable spaces of container (to be called candidated space) during the packing procedure. This research presents a digitally evaluated formula “space match” to evaluate similarity between objects and candidated spaces. Try to place objects on fit space, and get better solutions. In addition, this research uses C# programming language, Microsoft Visual Studio .Net 2003, and Evolver API to implement the proposed models. Finally, this research compares presented packing algorithms with benchmark single container packing problems to verify performance. The results show that the proposed models can generate appropriate solutions. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T07:52:36Z (GMT). No. of bitstreams: 1 ntu-94-R92546002-1.pdf: 2388888 bytes, checksum: 32dd89b4cfac7bba43d8b7af17b45a00 (MD5) Previous issue date: 2005 | en |
| dc.description.tableofcontents | 目錄.........................................................................i
圖目錄.....................................................................iii 表目錄......................................................................iv 中英文名詞對照表.............................................................v 符號列表...................................................................vii 第1章 緒論...................................................................1 1.1 研究背景和動機........................................................1 1.2 研究目的..............................................................2 1.3 研究方法..............................................................3 1.4 章節概要..............................................................6 第2章 文獻探討...............................................................7 2.1 容器裝填問題..........................................................7 2.1.1 裝填問題常見的類型..............................................7 2.1.2 容器裝填問題的求解方法.........................................11 2.2 遺傳演算法之原理.....................................................17 2.2.1 遺傳演算法之基本演算流程.......................................19 2.2.2 遺傳演算法之基本運算子.........................................21 2.3 Evolver的遺傳演算法簡介..............................................30 2.4 文獻探討小結.........................................................33 第3章 單一容器裝填之遺傳演算最佳化法........................................35 3.1 容器裝填問題模式及求解架構...........................................36 3.1.1 容器裝填問題...................................................37 3.1.2 容器裝填問題求解模式的主要流程.................................38 3.1.3 容器裝填問題求解模式的求解系統架構.............................41 3.2 物件與候選空間模型之建構.............................................45 3.2.1 物件資料結構及其擺置方位之定義.................................46 3.2.2 候選空間資料結構和裁伸空間演化法...............................52 3.3 使用遺傳演算法求解單一容器裝填問題...................................85 3.3.1 物件裝填順序為基優化模式–模式1................................88 3.3.2 物件裝填順序暨方位為基優化模式–模式2.........................102 3.3.3 物件批量批次循環裝填優化模式–模式3...........................109 3.3.4 物件批量批次循環裝填暨預覽不可行候選空間的優化模式–模式4.....118 3.4 小結................................................................131 第4章 演算法設計效能分析及範例驗證.........................................133 4.1 演算法穩健性測試....................................................133 4.1.1 小型自創範例問題測試..........................................133 4.2 標竿題目測試........................................................141 4.2.1 與傳統式啟發式演算法比較......................................141 4.2.2 與其他人工智慧演算法比較......................................147 4.3 小結................................................................149 第5章 結論與未來研究建議...................................................150 5.1 結論................................................................150 5.2 未來研究方向與建議..................................................151 參考文獻 153 | |
| dc.language.iso | zh-TW | |
| dc.title | 遺傳演算法和啟發式裝箱演算法為基之單一容器裝填最佳化方法 | zh_TW |
| dc.title | An Optimization Method for Single Container Packing problems Based on A Genetic Algorithm and Heuristic Packing Algorithms | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 93-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 呂永和,周瑞仁,羅士哲 | |
| dc.subject.keyword | 裝箱問題,單一容器裝填問題,空間演化,遺傳演算法,啟發式裝箱演算法, | zh_TW |
| dc.subject.keyword | bin packing problem,single container packing problem,container loading problem,spatial evolution technique,genetic algorithm,heuristic packing algorithm, | en |
| dc.relation.page | 154 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2005-07-25 | |
| dc.contributor.author-college | 工學院 | zh_TW |
| dc.contributor.author-dept | 工業工程學研究所 | zh_TW |
| 顯示於系所單位： | 工業工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-94-1.pdf 目前未授權公開取用 | 2.33 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。