Please use this identifier to cite or link to this item:
|Keywords: ||盤櫃設備、設備規模、時空網路、分枝限界法、Unit load device ULD、Fleet size、Time-space network、Branch-and-bound algorithm|
|Issue Date: ||2016-04-08T01:28:18Z
Abstract:The volume of international air cargo has rapidly grown in recent years, especially obvious in the Asia Pacific area. The required quantities of unit load devices (ULDs) will also increase when airlines confront the booming trend of air cargo services. ULD is the equipment that airlines have to purchase as a long-term investment. The fleet size problem of ULDs ought to be addressed in a suitable planning of purchase. However, the studied company in this research did not have any tool to assist the decision making on ULD preparation. Based on the detailed exploration in practical operations, this study exploits the time-space network to formulate a mathematical programming model for optimizing the fleet scale of ULDs in consideration of short-term repositioning constraints. We suggest to obtain the exact solution by applying the branch-and-bound algorithm. A case extracted from the freighter network of European services of an international airline in Taiwan is tested. According to the test results and sensitivity analysis, we find that the scale of ULDs is almost 3.61 times the slot capacity of the deployed airplanes. The lower the estimated load factor, the less the decrease in the number of prepared ULDs. As the ratio of cargo density becomes lower, the number of prepared ULDs is nonlinearly increased slightly. Furthermore, the purchase cost have a linear decrease when the basic usage of containers and inventory of the main airport are decreased, respectively.
|Relation: ||21(4),P385 - 411|
|Appears in Collections:||[航運管理學系] 期刊論文|
Files in This Item:
All items in NTOUR are protected by copyright, with all rights reserved.