近年來由於資訊發達、國際貿易活動熱絡，帶動國際航空貨運量的增加；
同時在貨主對商業文件與包裹的時效性需求越來越高的趨勢下，促使國際快遞
產業的蓬勃發展。國際快遞業者為達到快速送達的目標，「營運網路規劃」是
其節省運輸時間的重要因素，故選擇「國際快遞產業的營運網路規劃問題」做為本研究領域。
以往多將營運網路規劃問題化為「路徑演算方式」(path formulation)進行
求解，且多假設網路為「對稱型態」。然而「節線演算方式」(link formulation)
的求解效率，一般而言，會比路徑演算方式要佳；且實務上，國際快遞業的航
空營運網路確實有不對稱飛行的情況發生，因此本研究嘗試以「節線演算方式」
進行演算法設計，套用「隱約式窮舉法」(implicit enumeration)、並利用「深度
搜尋矩陣」、撰寫「C 程式語言」來進行求解。
實證分析乃以「美國聯邦快遞」於民國88 年的亞太營運網路為對象，將
本研究所設計之演算法套用於實務資料，規劃一總運輸成本最小之航空營運網
路。結果發現：(1)節線演算方式較路徑演算方式所考慮的網路組合為多，因此
可能找出成本較低的運輸網路；(2)本研究所設計的演算法中，「可行路徑」乃
交由程式搜尋，可免去路徑演算方式在此利用人工搜尋的時間；(3)利用「擴張
樹」做為「進入空運中心」與「出於空運中心」的節線屬性分類，係本研究在
飛機航線搜尋方法上的一大突破；(4)「隱約式窮舉法」雖不能稱得上是一效率
高的求解方法，但本研究仍提出一個以節線演算方式來設計網路問題求解演算法新概念，供作未來研究參考。

In recent years, the development of technology and the prosperity of
international trade increase the international air freight demand. Besides, the owners
of cargo ask about the time definite of business files and packages. Both of these
promote the development of air express common carriers. “Fast arrival” is one of
the goals which air common carriers want to catch. And “network planning” is the
important factor of saving shipping time. Therefore, I chose the ”network planning
problem of air common carriers” to be my field.
Most of the study used “path formulation” to solve the network planning
problem before. And they often assumed the network to be a “symmetric network”.
However, the solving efficiency of “link formulation” is generally better than path
formulation. And practically, there are certainly asymmetric networks exist in the air
common carriers. So, I try to design the solving algorithm with link formulation,
use “implicit enumeration” on the algorithm, and program with “C language” to
solve the problem.
I use “FedEx AsiaOne network in 1999” to do the practical analysis and the
objective is to find a network with minimal total transportation cost. The
conclusions are (1)Link formulation can include more combinations than path
formulation, therefore could probably find a network with lower cost. (2)Within the
algorithm in this thesis, we find the “feasible paths” by the programming, instead of
finding them by ourselves while using path formulation. This can save our time.
(3)Using “directed spanning tree” to separate the “inbound” from “outbound” arcs
is a big break point on constructing the flights. (4)Although we cannot say that
implicit enumeration is an efficient solving approach, we still provide a new
concept of designing a transportation network with link formulation. And it can be a
reference in the future.

[中文部分]
1. 中華民用航空總局，從統計看民航，1997 年7 月。
2. 陳秀華，「一般化軸輻式網路問題設計與應用」，成功大學交通管理科學
研究所博士論文，民國92 年5 月。
3. 張有恆、楊弘道，「航空公司飛機形式選擇之研究」，運輸學刊，第二十
五卷，第一期，民國85 年6 月。
4. 張有恆，航空運輸管理，鼎漢國際工程顧問公司，民國87 年2 月。
5. 許巧鶯、王志清，「軸輻航空網路之直運與轉運路線選擇」，運輸計劃季
刊，第二十六卷，第一期，民國86 年3 月。
[英文部分]
1. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993) Network Flows. Prentice
Hall, New Jersey.
2. Akyilmaz, M.O. (1994) “An algorithmic framework for routing LTL
shipments.” Journal of Operational Research Society, 45(5), 529-538.
3. Aykin, T., (1995) “Networking Polices for Hub-and-Spoke Systems with
Application to the Air Transportation System, “Transportation Science,
39(3), 201-221.
4. Barnhart, C. and Schneur, R. R. (1996) “Air network design for express
shipment service.” Operations Research, 44(6), 852-863.
5. Bryan, D.L. and O’Kelly, M.E. (1999) “Hub-and-spoke networks in air
transportation: An analytical review. ” Journal of Regional Science, 29(2),
275-295.
6. C.-C. Lin et al.(2003) “The economic effects of center-to-center directs on
hub-and –spoke networks for air express common carriers” Journal of Air
Transport Management, 9, 255-265.
7. C.-C. Lin and S.-H. Chen (2003) “The hierarchical network design problem
for time-definite express common carriers” Transportation Research B, 406,
1-13.
8. Chan, Y. and Ponder, R., (1979) “The Small Package Air Freight Industry in
the United States: A review of the Federal Express Experience.”
Transportation Research A, 13, 221-229.
9. Chestler, L. (1985) “Overnight air express: spatial pattern, competition and
the future in small package delivery services.” Transportation Quarterly, 39,
59-71.
10. Chou Y.H., (1990) “The Hierarchical-Hub Model for Airline Networks”
Transportation Planning and Technology, 14, 243-258.
11. Crainic, T.G. and Laporte, G. (1997) “Invited Review Planning models for
freight transportation”, European Journal of Operational Research, 97,
409-438.
12. Current, J.R. (1988) “The design of a hierarchical transportation network
with transshipment facilities.” Transportation Science, 22(4), 270-277.
13. Current, J.R., ReVelle, C.S. and Cohon, J. L. (1986) “The hierarchical
network design problem.” European Journal of Operational Research, 27,
57-66.
14. Eckstein, J. and Sheffi, T. (1987) “Optimization of group line-haul
operations for motor carriers using twin trailers.” Transportation Research
Record, 1120, 1223.
15. Kuby, M.J. and Gray, R.G. (1993) “The hub network design problem with
stopovers and feeders: The case of Federal Express.” Transportation
Research A, 27, 1-12.
16. Lin, C.-C. (2001a) “The feeder fleet planning problem of the same-day
ground express service in Taiwan.” Asia-Pacific Journal of Operational
Research 18, 165-191.
17. Lin, C.-C. (2001b) “The freight routing problem of time definite freight
delivery common carriers,” Transportation Research B, 35(6): 525-547.
18. O’Kelly, M. E., (1986) ”The Location of Interacting Hub Facilities”,
Transportation Science, 20(2), 92-105.
19. O’Kelly, M. E., (1992) “Hub Facility Location with Fixed Costs”, Papers in
Regional Science, 71(3), 293-306.