考量直航轉運並行之軸輻式航空網路模型

Hub-And-Spoke Airline Network Planning with the Coexistence of Direct and Hub Connected Services

10.6402/TPJ.200412.0603

楊大輝(Ta-Hui Yang)；蕭凱陽(Kai-Yang Shaiu)；李綺容(Chi-Jung Lee)

軸輻式網路 ； 網路設計 ； 混合整數規劃問題 ； 成本折扣率 ； Hub-and-spoke network ； Network design ； Mixed integer problem ； Cost discount factor

運輸計劃季刊

33卷4期（2004 / 12 / 30）

603 - 624

繁體中文

軸輻式網路(hub-and-spoko network)具有集貨之功能，可降低航空公司的單位運輸成本，因此經常被業者採用。一般而言，軸輻式網路規劃大多先決定轉運站位址與數目，再對飛航網路進行規劃。然而轉運站位址與飛航網路彼此影響，須同時考慮，因此分階段的規劃方法並不能保證達到航空公司營運成本的最佳化。此外，實務上常有某些航線可允許直航及轉運兩種路徑並存，但過去的文獻並未曾對此做探討。本研究依據模式延伸性分別建構三個模式，其模式約假設直航與轉運兩種路徑可二擇一亦可同時並存。其中完整模式將轉運站位址、數目與營運網路一併同時納入模式考量，外加考慮轉運站容量限制與設置成本，以更接近實務上之需求。三個模式皆被定式為混合整數規劃問題，本研究利用數學規劃軟體CPLEX結合自行發展的程式來求解。實證部分則以兩岸航空貨物運輸為例，分別對三個模式進行不同的情境及敏感度分析。

Hub-and-spoke network has been wildly used in the airline operations. In the design of a hub-and-spoke network, usually the number of hubs and their locations will be determined first, and then the airline service network is established based on the given hubs. However as the efficiency of a service network highly depends on hub number and locations, the above two-step procedure cannot guarantee the optimal operation cost. Besides, practically, there are three possible service policies in a hub-and-spoke system, direct flight, hub connected flight, and coexistence of both flights. Earlier studies only addressed the service network with either direct or hub connected services. This study developed three different hub-and-spoke network planning models considering three possible service policies. The third unified model was able to determine the number of hubs, hub locations, and flight service network simultaneously. The models were formulated as mix-integer programs. A mathematical programming software, CPLEX, in conjunction with C programs developed by this study was used to solve the models. Finally, the air freight data between Taiwan and Mainland China was used to test the model performance.

1. Aykin, T.(1990).On a Quadratic Integer Program for the Location of Interacting Hub Facilities.European Journal of Operational Research,46,409-411.
2. Aykin, T.(1995).Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System.Transportation Science,29(3),201-221.
3. Aykin, T.(1994).Lagrangean Relaxation Based Approaches to Capacitated Hub-and-Spoke Network Design Problem.European Journal of Operational Research,79,501-523.
4. Campbell, J. F.(1996).Hub Location and the P-Hub Median Problem.Operations Research,44,923-935.
5. Campbell, J. F.(1994).Integer Programming Formulations of Discrete Hub Location Problems.European Journal of Operational Research,72,387-405.
6. Jaillet, P.,Song, G.,Yu, C.(1996).Airline Network Design and Hub Location Problems.Location Science,4(3),195-212.
7. Jinhyeon, S.,Sungsoo, P.(1998).Efficient Solution Procedure and Reduced Size Formulations for P-Hub Location Problems.European Journal of Operational Research,108,118-126.
8. Klincewicz, J. G.(1996).A Dual Algorithm for the Uncapacitated Hub Location Problem.Location Science,3,173-184.
9. O`Kelly, M. E.(1987).A Quadratic Integer Program for the Location of Interacting Hub Facilities.European Journal of Operational Research,32,393-404.
10. OKelly, M. E.,Skorin-Kapov, D.,Skorin-Kapov, J.(1996).Hub Network Design with Single and Multiple Allocation a Computational Study.Location Science,4(3),125-138.
11. Skorin-Kapov, D.,Skorin-Kapov, J.(1994).On Tabu Search for the Location of Interacting Hub Facilities.European Journal of Operational Research,73,502-509.
12. Skorin-Kapov, D.,Skorin-Kapóv, J.,OKelly, M. E.(1996).Tight Linear Programming Relaxation of Uncapacitated P-Hub Median Problems.European Journal of Operations Research,94,582-593.
13. 中國民用航空總局計劃司(2000)。從統計看民航。北京中國民航出版社。
14. 中華航空股份有限公司(2001)。華航2001財務年報。
15. 行政院大陸委員會(2001)。兩岸經濟統計月報。
16. 林正章、陳英傑(1999)。兩岸航空貨運直航航線規劃之研究。中華民國第四屆運輸網路研討會。
17. 許巧鶯、王志青(1997)。軸輻航空貨運網路之直接與轉運路線選擇。運輸計劃季刊，26(1)，95-118。
18. 歐陽餘慶、林國顯、朱冠文、呂蕙美、張玉君、鄭樂堯、林弘基、洪清貴、畢金菱、吳雅惠、吳心琪、江芷瑛(2000)。兩岸航空客運市場之研究。交通部運輸研究所及亞聯工程顧問有限公司。

1. 楊大輝、李綺容(2007)。需求變動下之航空貨運網路規劃。運輸學刊，19(2)，169-189。