請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/21169
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 黃奎隆 | |
dc.contributor.author | Jou-An Chen | en |
dc.contributor.author | 陳柔安 | zh_TW |
dc.date.accessioned | 2021-06-08T03:28:03Z | - |
dc.date.copyright | 2019-10-17 | |
dc.date.issued | 2019 | |
dc.date.submitted | 2019-10-04 | |
dc.identifier.citation | [1] Amiouny S, Bartholdi J, Zhang J (1992) Balanced loading. Operations Research 40(2), 238–246
[2] Bischoff E, Ratcliff MSWM (1995) Issues in the development of approaches to container loading. Omega 23(4), 377–390 [3] Bischoff, E.E., Ratcliff, M.S.W., 1995. Issues in the development of approaches to container loading. Omega 23, 377–390. [4] Bortfeldt A, Homberger J (2013) Packing first, routing second a heuristic for the vehicle routing and loading problem. Computers & Operations Research 40(3):873–885. [5] Bortfeldt A, Wäscher G (2013) Constraints in container loading a state-of-the-art review. European Journal of Operational Research 229(1). [6] Davies A, Bischoff E (1999) Weight distribution considerations in container loading. European Journal of Operational Research 114(3):509–527. [7] Edgar den Boef, Jan Korst, Silvano Martello, David Pisinger, Daniele Vigo (2005) Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems. Operations Research 53(4):735-736. [8] Edmund K. Burke, Matthew R. Hyde, Graham Kendall, John Woodward (2012) Automating the Packing Heuristic Design Process with Genetic Programming. Evolutionary Computation Volume 20 Issue 1, Spring 2012 Pages 63-89. [9] Fuellerer G, Doerner KF, Hartl RF, Iori M (2010) Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research 201(3):751–759. [10] Gehring H, Bortfeldt A (1997) A genetic algorithm for solving the container loading problem. International Transactions in Operational Research 4(5/6), 401–418. [11] Gendreau M, Iori M, Laporte G, Martello S (2006) A tabu search algorithm for a routing and container loading problem. Transportation Science 40(3):342–350. [12] Hemminki, J., Leipälä, T., Nevalainen, O. (1998). On-line packing with boxes of different size. International Journal of Production Research 36, 2225–2245. [13] Ivancic N, Mathur K, Mohanty BB (1989) An integer-programming based heuristic approach to the three-dimensional packing problem. Journal of Manufacturing Operations Management 2, 268–298. [14] Junqueira L, Morabito R (2012). Three-dimensional container loading models with cargo stability and load bearing constraints. Computer & Operations Research 39(1), 74–85. [15] Junqueira L, Oliveira J, Carravilla M, Morabito R (2013) An optimization model for the vehicle routing problem with practical three-dimensional loading constraints. International Transactions in Operational Research 20(5), 645–666. [16] L. Junqueira, R. Morabito, D.S. Yamashita (2012). Three-dimensional container loading models with cargo stability and load bearing constraints. Computers & Operations Research, 39 (1), 74-85. [17] Liu S, Shang XQ, Cheng CJ, Zhao HX, Shen DY and Wang FY (2017). Heuristic algorithm for the container loading problem with multiple constraints. Computers & Industrial Engineering, 108, 149-164. [18] M. Hifi, I. Kacem, S. Nègre, L. Wu (2010). A linear programming approach for the three-dimensional bin packing problem. Electronic Notes in Discrete Mathematics, 36, 993-1000. [19] Mauro Maria Baldi, Daniele Manerba, Guido Perboli, Roberto Tadei (2019). A Generalized Bin Packing Problem for parcel delivery in last-mile logistics, European Journal of Operational Research, Volume 274, Issue 3, 990-999. [20] Paquay C., Schyns M., Limbourg S (2014). Amixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application. International Transactions in Operational Research, 63, 1271-1283. [21] Ruan Q, Zhang Z, Miao L, Shen H (2013). A hybrid approach for the vehicle routing problem with three- dimensional loading constraints. Computer & Operations Research 40(6), 1579–1589. [22] Scheithauer, G. (1992). Algorithms for the container loading problem. In Gaul, W., Bachem, A., Habenicht, W. (eds) Operations Research Proceedings 1991, Springer, Berlin, Heidelberg, 445–452. [23] Tarantilis C, Zachariadis E, Kiranoudis C (2009) A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Transactions on Intelligent Transportation Systems, 10(2), 255– 271. [24] Wu, Y., Li, W., Goh, M., de Souza, R., (2010). Three-dimensional bin packing problem with variable bin height. European Journal of Operational Research, 202 (2), 347-355. [25] 許冠文,「遺傳演算法和啟發式裝箱演算法為基之單一容 器裝填最佳化方法」, 國立臺灣大學工業工程學研究所碩士論文,2005。 | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/21169 | - |
dc.description.abstract | 隨著科技日新月異,除了以往實體購物,消費者對網路購物的需求逐漸增加。消費者只需要到電子商務平台搜尋商品,再使用信用卡、超商付款等方式支付,商品便會透過宅配送到指定地點。因為網路購物24小時營業,消費者可以時時刻刻挑選並購買喜歡的商品,而網路購物不需店面,除了打破疆界限制外,省下的租金可以回饋給消費者,提供更實惠的價格。同時,透過網路購物,消費者可以得到更多的商品資訊,除了了解詳細的商品規格,消費者更容易在不同店家之間進行比價。然而,網路購物無法像實體購物可以立即獲得商品,因此如何有效控管出貨及送貨速度,在便利性及時間之間取得平衡,便是值得探討的問題。欲加快物流配送速度,除了對運送路線及車次進行規劃,亦可針對貨物在貨車內的擺放位置進行討論,如此可以減低送貨員在各送貨地點的停留時間,以及確保貨物在運送過程中不會損毀。本研究針對最後一哩運送(Last Mile Delivery)作討論,以基因演算法為基,根據貨物運送順序,以及貨物是否為易碎品等條件,決定貨物在貨車上的擺放位置,使得卸貨置出之物品最小。 | zh_TW |
dc.description.abstract | With the advance of science and technology, online shopping has become more and more popular. Consumers can find products they want easily on e-commerce platforms and pay by credit card, gift card or other electronic money. After paying, products will be delivered to the destinations. Consumers are able to shop online anytime and anywhere and know more about the specifications. Besides, consumers can easily make a price comparison between different websites. Although products are delivered rapidly, however, consumers still can’t get them immediately. Thus, the way to reduce lead time and delivery time is worth discussing. To speed up delivery, in addition to optimizing route planning, we can also conduct some research on cargo replacement to reduce delivery time and prevent damage caused during shipping. Under these conditions, this study discusses Last Mile Delivery. With the objective of minimizing cargo unloading times, the study aims to find an optimization method for cargo replacement according to the shipping sequence and cargo attributes based on Genetic Algorithm. | en |
dc.description.provenance | Made available in DSpace on 2021-06-08T03:28:03Z (GMT). No. of bitstreams: 1 ntu-108-R06546043-1.pdf: 3091889 bytes, checksum: 6b70ac4133723520a4e07c8bde1bd8e9 (MD5) Previous issue date: 2019 | en |
dc.description.tableofcontents | 致謝 I
摘要 II ABSTRACT III 目錄 IV 圖目錄 VII 表目錄 IX 第一章 緒論 1 1.1 研究背景 1 1.2 研究動機 4 1.3 研究目的 5 1.4 研究架構 5 第二章 文獻探討 6 2.1 裝箱問題 6 2.1.1 三維裝箱問題 6 2.1.2 實務限制 7 2.1.3 啟發式演算法 9 2.2 遺傳演算法 9 2.2.1 編碼(Encoding) 10 2.2.2 初始化(Initialization) 11 2.2.3 交配(Crossover) 11 2.2.4 突變(Mutation) 13 2.2.5 評估適應度(Evaluation) 14 2.2.6 選擇(Selection)或複製(Reproduction) 15 第三章 問題描述與研究方法 16 3.1 問題描述 16 3.2 問題基本假設與限制 17 3.3 空間建構 17 3.3.1 空間設定 17 3.3.2 擺放方位 18 3.4 演算架構 19 3.5 目標函數 20 3.5.1 卸貨次數計算 21 3.5.2 被搬動之物品位置擺放 21 3.6 裝箱演算法 22 3.6.1 擺放定義與空間分割方式 22 3.6.2 分割其他與貨物交疊的空間 25 3.6.3 篩選候選空間 32 3.6.4 擺放空間選擇 35 3.7 遺傳演算法設定 41 第四章 實例驗證與結果分析 43 4.1 系統執行環境 43 4.2 裝箱演算法範例 43 4.3 資料設定 45 4.4 參數設定 46 4.5 數據分析 47 4.5.1 貨物初始擺放順序之影響 47 4.5.2 貨物數量之數據分析 49 4.5.3 貨物異質度之數據分析 50 4.5.4 易碎品比例之數據分析 50 4.5.5 實驗設計 52 第五章 結論 55 5.1 結論與建議 55 5.2 未來研究方向 55 參考文獻 57 附錄:4.5.5實驗數據 61 | |
dc.language.iso | zh-TW | |
dc.title | 以遺傳演算法為基考量卸貨順序之最適化裝箱法 | zh_TW |
dc.title | Genetic Algorithm Based Optimization Method for Bin Packing Problem Considering Unloading Sequence | en |
dc.type | Thesis | |
dc.date.schoolyear | 108-1 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 楊烽正,范治民 | |
dc.subject.keyword | 容器堆疊問題,基因演算法,最後一哩運送,貨物擺放, | zh_TW |
dc.subject.keyword | Container Loading Problem,Genetic Algorithm,Last Mile Delivery,Cargo Replacement, | en |
dc.relation.page | 64 | |
dc.identifier.doi | 10.6342/NTU201904165 | |
dc.rights.note | 未授權 | |
dc.date.accepted | 2019-10-04 | |
dc.contributor.author-college | 工學院 | zh_TW |
dc.contributor.author-dept | 工業工程學研究所 | zh_TW |
顯示於系所單位: | 工業工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-108-1.pdf 目前未授權公開取用 | 3.02 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。