博碩士論文 104322076 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:8 、訪客IP:34.204.168.209
姓名 詹孟穎(CHAN,MENG-YING)  查詢紙本館藏   畢業系所 土木工程學系
論文名稱
(A Mixed Integer Programming Formulation for the Three-Dimensional Unit Load Device Packing Problem)
相關論文
★ 圖書館系統通閱移送書籍之車輛途程問題★ 起迄對旅行時間目標下高速公路匝道儀控之研究
★ 結合限制規劃法與螞蟻演算法求解運動排程問題★ 共同邊界資料包絡分析法在運輸業之應用-以國內航線之經營效率為例
★ 雙北市公車乘客知覺服務品質、知覺價值、滿意度、行為意向路線與乘客之跨層次中介效果與調節式中介效果★ Investigating the influential factors of public bicycle system and cyclist heterogeneity
★ 高速公路旅行時間預測之研究--函數資料分析之應用★ Behavior Intention and its Influential Factors for Motorcycle Express Service
★ 含額外限制式動態用路人均衡模型之研究★ 動態起迄旅次矩陣推估模型之研究
★ 動態號誌時制控制模型求解演算法之研究★ 不同決策變數下動態用路人均衡路徑選擇模型之研究
★ 動態人口分布最佳化控制之研究-雙層規劃模型之應用★ 含容量限制之軟時窗動態用路人出發時間/路徑選擇雙層模型之研究
★ 普羅比機率型動態用路人均衡模型演算法求解效率之比較★ 含先進先出及流出率容量限制之動態用路人均衡模型之研究
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   至系統瀏覽論文 ( 永不開放)
摘要(中) 本研究建立一套混合整數線性規劃模型,應用於三維航空貨運之盤櫃裝載問題,透過多組限制式,目標為最小化盤櫃的使用數。此模型修改並延伸Paquay, Schyns, & Limbourg (2016)的模型。數值範例的求解驗證了此模型的可行性及與文獻結果的比較。
摘要(英) In this paper, we develop a zero-one mixed integer linear programming formulation for a three-dimensional unit load device (ULD) packing problem, which can be deemed as a special bin packing problem called a multiple bin-size bin packing problem (MBSBPP) (Wäscher, Haußner, & Schumann, 2007). The objective function of the proposed model is aimed at minimizing the number of ULDs used, whereas in the constraint set, in addition to the basic geometric constraints, non-basic constraints – such as weight limits, orientation constraints, stacking constraints, positioning constraints, weight distribution constraints, stability constraints and the special shape constraints (for some ULDs are contoured to fit in the aircraft) – were taken into consideration. A comparison of our model formulation and Paquay, Schyns, & Limbourg (2016) is also made. Numerical results show that results from the proposed model indeed exhibit a good satisfaction. A few remarks are provided in the end.
關鍵字(中) ★ 航空貨運
★ 貨盤
★ 貨櫃
★ 裝載問題
★ 盤櫃裝載
關鍵字(英) ★ Air cargo
★ Unit load device packing problem
★ Bin packing
★ Container loading
論文目次 Abstract i
中文摘要 ii
Acknowledgments iii
Table of Contents iv
List of Figures vi
List of Tables vii
1. Introduction 1
2. Literature review 4
2.1 Constraints for the basic bin packing problem (or BBPP) 6
2.2 Constraints for the non-basic bin packing problem (or NBBPP) 6
3. Model formulation 12
3.1 Problem Description 12
3.2 Mathematical model 12
3.2.1 Parameters 13
3.2.2 Objective function 13
3.2.3 Constraints considered 14
3.2.3.1 Geometric constraints 14
3.2.3.2 Weight limits 16
3.2.3.3 Orientation constraints 16
3.2.3.4 Stacking constraints 16
3.2.3.5 Positioning constraints 17
3.2.3.6 Weight distribution constraints 17
3.2.3.7 Special shape constraints 18
3.2.3.8 Stability constraints 19
3.3 Summary 24
4. Numerical results 26
4.1 Context 26
4.2 Results 26
4.2.1 Series 1 27
4.2.2 Series 2 29
4.2.3 Series 3 32
4.3 Summary 33
5. Conclusions 34
References 36
參考文獻 Al-Shayea, A. M. (2011). Solving the Three-Dimensional Palet-Paking Problem Using Mixed 0-1 Model. Journal of Service Science and Management, 4(4), 513.
Bischoff, E. E., Janetz, F., & Ratcliff, M. (1995). Loading pallets with non-identical items. European Journal of Operational Research, 84(3), 681-692.
Boeing Website. (2012).
http://www.boeing.com/resources/boeingdotcom/company/about_bca/pdf/CargoPalletsContainers.pdf/. (Accessed 23/06/2016).
Boeing Website. (2014).
http://www.boeing.com/resources/boeingdotcom/commercial/about-our-market/cargo-market-detail-wacf/download-report/assets/pdfs/wacf.pdf/.(Accessed 23/06/2016).
Bortfeldt, A., & Gehring, H. (1999). Zur Behandlung von Restriktionen bei der Stauraumoptimierung am Beispiel eines genetischen Algorithmus für das Containerbeladeproblem. In: Kopfer, H., Bierwirth, C. (Eds.), Logistik Management – Intelligente I + K Technologien, Berlin: Springer, pp. 83–100. (cited from Bortfeldt et al., 2013)
Bortfeldt, A., & Wäscher, G. (2013). Constraints in container loading–A state-of-the-art review. European Journal of Operational Research, 229(1), 1-20.
Ceschia, S., & Schaerf, A. (2013). Local search for a multi-drop multi-container loading problem. Journal of Heuristics, 19(2), 275-294.
Chan, F. T., Bhagwat, R., Kumar, N., Tiwari, M., & Lam, P. (2006). Development of a decision support system for air-cargo pallets loading problem: A case study. Expert Systems with Applications, 31(3), 472-485.
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.
Egeblad, J., & Pisinger, D. (2009). Heuristic approaches for the two-and three-dimensional knapsack packing problem. Computers & Operations Research, 36(4), 1026-1049.
Eley, M. (2002). Solving container loading problems by block arrangement. European Journal of Operational Research, 141(2), 393-409.
Eley, M. (2003). A bottleneck assignment approach to the multiple container loading problem. Operations Research Spectrum, 25(1), 45–60.
Federal Aviation Administration. (2007). Aircraft Weight and Balance Handbook. https://www.faa.gov/regulations_policies/handbooks_manuals/aircraft/media/FAA-H-8083-1A.pdf (Accessed 23/06/2016).
Fok, K., & Chun, A. (2004). Optimizing air cargo load planning and analysis. Proceedings of the international conference on computing, communications and control technologies, Austin, Texas, USA
Gehring, H., & Bortfeldt, A. (1997). A genetic algorithm for solving the container loading problem. International Transactions in Operational Research, 4(5‐6), 401-418.
George, J. A., & Robinson, D. F. (1980). A heuristic for packing boxes into a container. Computers & Operations Research, 7(3), 147-156.
Haessler, R. W., & Talbot, F. B. (1990). Load planning for shipments of low density products. European Journal of Operational Research, 44(2), 289-299.
Hodgson, T.J. (1982). A combined approach to the pallet loading problem. IIE Transactions, 14, 175–182.
Jin, Z., Ohno, K., & Du, J. (2004). An efficient approach for the three-dimensional container packing problem with practical constraints. Asia-Pacific Journal of Operational Research, 21(3), 279-295.
Junqueira, L., Morabito, R., & Yamashita, D. S. (2012). Three-dimensional container loading models with cargo stability and load bearing constraints. Computers & Operations Research, 39(1), 74-85.
Limbourg, S., Schyns, M., & Laporte, G. (2012). Automatic aircraft cargo load planning. Journal of the Operational Research Society, 63(9), 1271-1283.
Liu, J., Yue, Y., Dong, Z., Maple, C., & Keech, M. (2011). A novel hybrid tabu search approach to container loading. Computers & Operations Research, 38(4), 797-807.
Martello, S., Pisinger, D., & Vigo, D. (2000). The three-dimensional bin packing problem. Operations Research, 48(2), 256-267.
Padberg, M. (2000). Packing small boxes into a big box. Mathematical Methods of Operations Research, 52(1), 1-21.
Paquay, C., Schyns, M., & Limbourg, S. (2016). A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application. International Transactions in Operational Research, 23(1-2), 187-213.
Terno, J., Scheithauer, G., Sommerweiß, U., & Riehme, J. (2000). An efficient approach for the multi-pallet loading problem. European Journal of Operational Research, 123(2), 372-381.
Vancroonenburg, W., Verstichel, J., Tavernier, K., & Berghe, G. V. (2014). Automatic air cargo selection and weight balancing: A mixed integer programming approach. Transportation Research Part E: Logistics and Transportation Review, 65, 70-83.
VRR Aviation Website. (2016). http://vrr-aviation.com/uld-info/uld-id-code/. (Accessed 23/06/2016).
Wäscher, G., Haußner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109-1130.
Westerlund, J., Papageorgiou, L. G., & Westerlund, T. (2005). A problem formulation for optimal mixed-sized box packing. In L. Puigjaner, & A. Espuna, (Eds.), Computer Aided Chemical Engineering (pp. 913–918). Barcelona: Elsevier.
指導教授 陳惠國 審核日期 2016-8-4
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明