| 研究生: |
翁佩鈺 Pei-Yu Weng |
|---|---|
| 論文名稱: |
國際航空快遞貨物裝櫃規劃模式及求解演算法之研究 A Cargo Container Loading Plan Model and solution algorithm for International Air Express Delivery |
| 指導教授: |
顏上堯
Shangyao Yan |
| 口試委員: | |
| 學位類別: |
碩士 Master |
| 系所名稱: |
工學院 - 土木工程學系 Department of Civil Engineering |
| 畢業學年度: | 92 |
| 語文別: | 中文 |
| 論文頁數: | 84 |
| 中文關鍵詞: | 國際航空快遞業 、貨物裝櫃規劃 、非線性混合整數規劃問題 、演算法 |
| 外文關鍵詞: | Nonlinear Mixed Integer Programs, International Air Express Carriers, Cargo Container Loading Plan, Algorithm |
| 相關次數: | 點閱:10 下載:0 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
摘要
近年來國際航空快遞業成長迅速且競爭激烈。由於其營運相當重視「時效」的掌握,因此在貨物處理作業上,如何有效率進行貨物收集、分類及組裝等作業程序顯得相當重要。其中,貨物裝櫃作業對於總處理時間與成本影響甚鉅,故如何妥善規劃快遞貨物裝櫃方式,以達到整體成本最小,實為一重要課題。由於快遞貨物系統裝櫃方式與各機場城市及空運中心處理成本相關,而處理成本與貨物指派整櫃或混櫃之決策、處理量及可允許處理時間等因素密切相關,且呈現非線性關係,因此使得此等快遞貨櫃裝櫃問題變得相當複雜。然而,目前業界多以經驗法則及人工判斷來決策,此做法在面臨目前大型空運中心及複雜的營運網路環境下,甚不具效率及效果。其次,在學術上,至今尚未發現有類似課題之研究或探討。因此,本研究以一國際航空快遞公司立場,以總成本最小為目標,考量相關營運限制,構建一國際航空快遞貨物裝櫃決策模式。本研究能提供一有效的決策輔助工具,以幫助快遞業者決定整櫃與混櫃的貨物指派與裝載,降低營運成本,進而提升其獲利及市場競爭力。此模式為一非線性混合整數規劃問題,屬於NP-hard性質,求解上遠較一般線性整數規劃問題為難,尤其針對實際大型問題,在有限時間內難以求得最佳解。由於目標式中的部份函數含有非線性(nonlinear)且呈階梯式的函數型態,本研究使用線性分段技巧將含此特性之目標函數轉換成線性函數,並進一步透過C程式語言並配合數學規劃軟體CPLEX,發展有效的演算法以求解模式。最後,為了驗證本研究之實用性,本研究以一國際快遞公司的營運為例,並在個人電腦上執行求解,測試效果甚佳。
Abstract
In recent years, international air express services have grown rapidly. The markets become very competitive for the carriers. Since air express services rather emphasize on time-definite deliveries, it is important for carriers to efficiently to collect, classify and assembly cargos at every service station. In which, the cargo container loading operation, in general, significantly affects the total operating time and cost. As a result, how to determine a suitable cargo container loading plan in order to minimize the operating cost is an important issue for air express carriers. Since the cargo container loading plan is related to the operating cost of each airport and the hub, which is further nonlinearly correlated with the assignment of cargos to pure/mixed containers, the cargo quantity and their allowable operating times, the cargo container loading plan problem is very complicated. However, the current cargo container loading plan in practice is solved manually with staff’s experience, which is neither effective nor efficient, especially for the environment of large hubs and complicated network operations today. As to academics, there has not yet research found on the cargo container loading plan problem of international air express cargos. Therefore, on the basis of the international air express carriers’ perspective, this research develops a cargo container loading plan model, with the objective of minimizing total cost, subject to related operating constraints. The model is a useful planning tool for International air express carriers to decide on their cargo loading plans in order to lower their operating costs, so that their profits and market competitiveness can be enhanced. The model is formulated as a nonlinear mixed integer program that is characterized as NP-hard and is more difficult to solve than integer linear programs, especially for realistically large-scale problems that cannot be optimally solved in a reasonably short time. Since the model’s objective contains nonlinear ladder-functions, we convert them into piece-wise linear functions. Furthermore, we employ C computer language, coupled with a mathematical programming solver, CPLEX, to develop an efficient algorithm to solve the problem. To evaluate the model and the solution algorithm, we perform a case study using real operating data from an international air express carrier. The results are good.
1.經濟部商業司,「中正機場物流發展現況及趨勢」,2000中華民國物流年鑑,頁423。
2.王怡真,「國際快遞業一般化航空路網設計之研究」,國立成功大學交通管理研究,碩
士論文,2003。
3.王鼎欽,「航空貨運承攬業建構電子商務及其對經營績效影響之研究」,國立海洋大學
航運管理學系碩士論文,2000。
4.田邦廷,「長方體物件堆疊問題解法之研究」,大葉大學工業工程研究所碩士論文,
2001。
5.李俊勳,「航空公司貨運網路航線頻次與機型規劃之研究」,國立交通大學運輸工程與
管理系碩士論文,1999。
6.林正章、許瓊文,「當日快遞路運網路設計之研究」,運輸學刊,第十一卷,第二期,
頁61-85,1999。
7.高秀如,「以資源基礎觀點探討航空貨運承攬業核心能力及其對營運績效影響之研
究」,國立海洋大學/航運管理學系碩士論文,2001。
8.高傳凱,「貨櫃儲存場堆積策略模擬與儲位指派模式構建」,國立交通大學交通運輸研
究所博士論文,2002。
9.高傳凱、藍武王,「減少貨櫃場內不具生產力動作之貨櫃儲位指派模式」,交通運輸,
第十九期,頁30-39,2000。
10.張美忠,「貨物運輸棧板裝載問題啟發式解法之應用」,國立交通大學土木工程研究所
碩士論文,中華民國八十年。
11.張斐茹,「軸輻路網模式在定期貨櫃船定線之應用」,運輸計劃季刊,第三十卷,第四
期,頁 871 -890,2001。
12.許巧鶯,王志青,「軸幅航空貨運網路之直接與轉運路線選擇」,運輸計劃季刊,第二
十六卷,第一期,頁95-118,1997。
13.許巧鶯、蕭國洲,「廠商以航空貨運中心為轉運站之研究」,運輸計劃季刊,第二十七
卷,第二期,頁213-244,1998。
14.陳世欽,「多時效性貨物需求下貨機飛航排程暨班次表建立之研究」,國立中央大學土
木工程學系碩士論文,2003。
15.陳俊豪,「即時資訊下軸輻式網路效率評估」,逢甲大學交通工程與管理學系碩士論
文,2002。
16.陳春益、邱明琦、林佐鼎,「貨櫃排程模式之研究」,運輸計劃季刊,第三十一卷,第
三期,頁495-522,2002。
17.游至誠,「允許集貨港與軸心港不直接相連之海運軸輻路網模式」,交通大學運輸工程
與管理研究所碩士論文,2001。
18.鄭明仁,「模糊績效評估之應用-以評估航空貨運承攬業的績效為例」,國立海洋大學
航運管理學系碩士論文,1999。
19.鄧景豐,「單一貨櫃排貨系統」,國立清華大學工業工程與工程管理學系碩士論文,
1999。
20.顏上堯、王中瑞,「多目標飛航網路路線及頻次規劃」,工業工程學刊,第十三卷,第
四期,頁307-316,1996。
21.顏上堯、黃武強,「配合轉運忠心之飛航定線與航次頻率規劃」,運輸計劃季刊,第二
十五卷,第四期,頁681-708,1996。
22.Aykin, T., “Lagrangian relaxation based approach to capacitated hub-and-
spoke network design problem,” European Journal of Operational Research,
Vol. 79, pp 501-523, 1994.
23.Aykin, T., “On the location of hub facilities,” Transportation Science,
Vol. 22, pp.155-157, 1988
24.Aykin, T., “The Hub Location and Routing Problem,” European Journal of
Operational Research, Vol. 83, pp. 200-219, 1995.
25.Bryan, D. L. and O’Kelly, M. E., “Hub-and-spoke network in air
transportation: an analytical review,” Journal of regional Science,
Vol.39, pp.275-295, 1999.
26.Chestler, L, “Overnight Air Express: Spatial Pattern, Competition and the
Future of Small Package Delivery Services,” Transportation Quarterly,
Vol. 39, pp.59-71, 1985.
27.Chou Y. H, “The Hierarchical-Hub Model for Airline Networks,”
Transportation Planning and Technology, Vol. 14, pp.243-258, 1990.
28.Current, J. R., Revelle, C. S. and Cohon, J. L., “The hierarchical network
design problem,” European Journal of Operations Research, Vol.2, pp.57-
66,1986.
29.Hall, R. W., “Configuration of an overnight package air network,”
Transportation Research, Vol. 23, pp.139-149, 1989.
30.Jaillet, P., Gao, S. and Gang, Y., “Airline network design and hub location problems,” Location Science, Vol. 4, pp.195-212, 1996.
31.Lin, C. C. and Chen, Y. C., “The integration of Taiwanese and Chinese air
networks for direct air cargo services,” Transportation Research, Vol. 37,
pp. 629-647, 2003.
32.Lin, C. C., Lin, Y. J, and Lin, D.Y, “The economic effects of center-to-
center directs on hub-and-spoke networks for air express common
carriers,”Journal of Air Transport Management, Vol. 9, pp.255-265, 2003.
33.Lin, C. C; “The freight routing problem of time-definite freight delivery
common carriers,” Transportation Research Part B, Vol. 35, pp.525-547, 2001.
34.Nero, G., “A note on the competitive advantage of large hub-and-spoke
networks,” Transportation Research, Vol.35, pp.225-239, 1999.
35.O’Kelly, M. E., “A Quadratic Integer Program for the Location of
Interacting Hub Facilities,” European Journal of Operational Research, Vol. 32, pp. 393-404, 1987.
36.O’kelly, M. E., “The Location of Interacting Hub Facilities,”
Transportation Science, Vol.20, No.2, pp.92-106, 1986.
37.Prokop, D., “The logistics of air cargo co-mingling at Ted Stevens
Anchorage International Airport,” Journal of Air Transport Management, Vol.
8, pp.109-114, 2002.
38.Powell, W. B. and Sheffi, Y. , “Design and implementation of an
interactive optimization system for network design in the motor carrier
industry, ” Operations Research, Vol.37, No.1, pp.12-29, 1989.
39.Sohn, J. and Park, S., “linear program for the two-hub location problem,”
European Journal of Operational Research, Vol. 100, pp. 617-622, 1997.
40.Sue, A. H, “A hybrid heuristic for the incapacitated hub location
problem,” European Journal of Operational Research, Vol. 106, pp.489-499,
1998.
41.Xue, J. and Lai, K. K., “A Study on Cargo Forwarding Decision,” Computers
& Industrial Engineering, Vol. 33, pp. 63-66, 1997.
42.Zhang, A. and Zhang , Y., “A model of air cargo liberalization: passenger
vs. all-cargo carriers”, Transportation Research Part E ,Vol. 38, pp.175-
191, 2002.
43.Zhang, A., “Analysis of an international air-cargo hub: the case of Hong
Kong” Journal of Air Transport Management, Vol. 9, pp.123 -138, 2003.