A Mixed Integer Programming Formulation for the Three-Dimensional Unit Load Device Packing Problem

NCUIR > Engineering College > Graduate Institute of Civil Engineering > Electronic Thesis & Dissertation > Item 987654321/71199

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/71199

Title:	A Mixed Integer Programming Formulation for the Three-Dimensional Unit Load Device Packing Problem
Authors:	詹孟穎;CHAN,MENG-YING
Contributors:	土木工程學系
Keywords:	航空貨運;貨盤;貨櫃;裝載問題;盤櫃裝載;Air cargo;Unit load device packing problem;Bin packing;Container loading
Date:	2016-08-04
Issue Date:	2016-10-13 12:12:04 (UTC+8)
Publisher:	國立中央大學
Abstract:	本研究建立一套混合整數線性規劃模型，應用於三維航空貨運之盤櫃裝載問題，透過多組限制式，目標為最小化盤櫃的使用數。此模型修改並延伸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.
Appears in Collections:	[Graduate Institute of Civil Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	430	View/Open

社群 sharing

Loading...