1. 中國民用航空總局規劃發展財務司,民國九十四年,從統計看民航2005,北京中國民航出版社。
2. 中國民用航空總局規劃發展財務司,民國九十三年,從統計看民航2004,北京中國民航出版社。
3. 中國民用航空總局規劃發展財務司,民國九十二年,從統計看民航2003,北京中國民航出版社。
4. 中國民用航空總局規劃發展財務司,民國九十一年,從統計看民航2002,北京中國民航出版社。
5. 中國民用航空總局規劃發展財務司,民國九十○年,從統計看民航2001,北京中國民航出版社。
6. 中國民用航空總局規劃發展財務司,民國八十九年,從統計看民航2000,北京中國民航出版社。
7. 中國民用航空總局規劃發展財務司,民國八十八年,從統計看民航1999,北京中國民航出版社。
8. 中國國家旅遊局,民國九十四年,中國旅遊年鑑2005,中國旅遊出版社。
9. 中共中央政府,民國八十九年,展望十五,http://big51.china.com.cn/ch-15/plan2.htm。
10. 中華航空股份有限公司編印,民國九十三年,華航2004財務年報,中華航空股份有限公司出版,http://www.china-airlines.com/ch/about/94ap.pdf。
11. 行政院大陸委員會,民國九十五年,兩岸經濟統計月報,第156期,行政院大陸委員會出版,http://www.mac.gov.tw/big5/statistic/em/156/19.pdf。
12. 朱冠文、張玉君、劉昭榮、陳文富、許美惠、石仲豪、陳世泉、劉亦群、曾琬芸、葉南廷,民國八十七年,赴港澳地區國際空運旅客特性調查與分析,交通部運輸研究所及鼎漢國際工程顧問公司。
13. 林正章、陳英傑,民國88年,兩岸航空貨運直航航線規劃之研究,中華民國第四屆運輸網路研討會,第1-11頁。
14. 許巧鶯、蕭國洲,民國87年,廠商以航空貨運中心為轉運站之研究,運輸計劃季刊,第27卷,第二期,第213-244頁。15. 許巧鶯、王志青,民國86年,軸輻航空貨運網路之直接與轉運路線選擇,運輸計劃季刊,第26卷,第一期,第95-118頁。16. 張國振,民國93年,城際客運營運路線之規劃與設計-遺傳演算法之應用,國立暨南國際大學土木工程研究所碩士論文。17. 曾國雄、王日昌、黃明居,民國85年,以基因演算法與樣板路徑求解旅行推銷員問題,運輸計畫季刊,第25卷,第3期,第493-516頁。
18. 黃玉真,民國93年,探討多期配送系統設計問題之研究-以預算與服務水準條件限制之角度,高雄第一科技大學運輸與倉儲營運研究所碩士論文。19. 楊大輝、蕭凱陽、李綺容,民國93年,考量直航轉運並行之軸輻式航空網路模型,運輸計畫季刊,第33卷,第4期,第603-624頁。
20. 歐陽餘慶、林國顯、朱冠文、呂蕙美、張玉君、鄭樂堯、林弘基、洪清貴、畢金菱、吳雅惠、吳心琪、江芷瑛,民國八十九年,兩岸航空客運市場之研究,交通部運輸研究所及亞聯工程顧問有限公司。
21. 陳建國,民國93年,利用基因演算法於KNN近似查詢之種類型資料對映演算法,國立嘉義大學運輸與工程研究所碩士論文。22. 謝國倫,民國89年,基因演算法應用於捷運轉乘公車區位路徑問題之研究,淡江大學運輸管理學研究所碩士論文。23. 盧建宏,民國93年,應用基因演算法求解二階層設施區位選擇問題,嘉義大學運輸與物流工程研究所碩士論文。
24. 盧華安、陳羿中,民國94年,建構我國國際航空貨運網路之研究-以單一全貨機機種為例,民航季刊,第7卷,第二期,第89-120頁。25. 藍武王、邱裕鈞,民國89年,線性軸輻路網接駁/轉運區位、路線與排班之規劃-遺傳演算法之應用,運輸計畫季刊,第29卷,第三期,第465-498頁。
26. 劉曉君,民國90年,轉接點位址問題之啟發解法,大葉大學工業工程學系碩士班論文。27. 蕭凱陽,民國92年,航空轉運站之選擇與營運網路規劃-以兩岸航空貨物為例,國立嘉義大學運輸與工程研究所碩士論文。28. 顏上堯、黃武強,民國85年,配合轉運中心之飛航定線與航次頻率規劃,運輸計劃季刊,第25卷,第四期,第681-708頁。29. 鐘元享、陳正芳,民國93年,多重分派p-轉接點中位問題的啟發式解法,第一屆台灣作業研究學會學術研討會暨2004年科技與管理學術研討會。
30. Aykin, T., 1995b.The Hub Location and Routing Problem, European Journal of Operations Research,83:200-219.
31. Abdinnour-Helm, S., 1998.A Hybrid Heuristic for The Uncapacitated Hub Location Problem, European Journal of Operational Research,106:489-499.
32. Alp, O., Erkut, E., and Drezner, Z., 2003. An Efficient Genetic Algorithm for The P-Median problem, Annuals of Operations Research,122:21-42.
33. Beasley, J.E., and Chu, P.C., 1996.A Genetic Algorithm for The Set Covering Problem, European Journal of Operational Research,94:392-404.
34. Bryan, D. E., and O’Kelly, M. E., 1999.Hub-and-Spoke Network in Air Transportation: An Analytical Review, Journal of Regional Science,39(2):275-29.
35. Campbell, J.f., 1994b.Integer Programming Formulations of Discrete Hub Location Problems, European Journal of Operational Researc,72:387-405.
36. Campbell, J. F., 1996.Hub Location and The P-Hub Median Problem, Operations Research,44:923-935.
37. Correa, E.S., Steiner, M. T. A., Freitas, A. A. and Carnieri, C., 2001,A Genetic Algorithm for The P-median Problem, 2001 Genetic and Evolutionary Computation Conference (GECCO-2001):1268-1275.
38. Cheung, B. K. –S., Langevin, A., and Villeneuve, B., 2001.High Performing Evolutionary Techniquew for Solving Complex Location Problems in Industrial System Design, Journal of Intelligent Manufacturing,18(4):455-466.
39. Dvorett, J., 1999.Compatibility-Based Genetic Algorithm: A New Approach to The P-Median Problem, Department of Industrial Engineering and Management Sciences Northwestern University, Evanston, IL60208:1-17.
40. Ernst, A. T., and Krishnamoorthy, M., 1998.Exact and Heuristic Algorithms for The Uncapacitated Multiple allocation P-Hub Median Problem, European Journal of Operational Research,104:100-112.
41. Goldberg, D. E, 1989.Genetic Algorithms in Search, Optimization, and Machine Learning? Addison-Wesley.
42. Gen, M., Cheng, R., and Oren, S. S., 2001.Network Design Techniques Using Adapted Genetic Algorithms. Advances in Engineering Software,32:731-744.
43. GEATbx: Genetic and Evolutionary Algorithm Toolbox for Use with Matlab. http://www.geatbx.com/。
44. Holland, J. H., 1975.Adaptation in Nature and Artificial Systems, University of Michigan press, Ann Arbor.
45. Houck, C.R., Joines, J.A., and Kay ,M.G., 1996.Comparison of Genetic Algorithms, Random Restart and Two-Opt Switching for Solving Large Location-Allocation Problems, Computers and Operations Research,23(6):587-596.
46. Jaillet, P., Song, G., and Yu, G., 1996.Airline Network Design and Hub Location Problems, Location Science,4(3):195-212.
47. Jaramillo, J.H., Bhadury, J., and Batta, R., 2002.On The Use of Genetic Algorithms to Solve Location Problem, Computers and Operations Research,29:761-779.
48. Koumousis, V. K., and Georgiou, P. G, 1994.Genetic Algorithms in Discrete Optimization of Steel Truss Roofs, Journal Computing in Civil Engineering, ASCE,8(3):309-325.
49. Klincewicz, J. G., 1996.A Dual Algorithm for The Uncapacitated Hub Location Problem, Location Science,4(3):173-184.
50. Leclerc, F., and Potvin J. Y., 1997.Genetic Algorithms for Vehicle Dispatching, International Transportation Operational Research,4(5/6):391-400.
51. Min, H., Ko H. J., and Ko. C. S., 2006.A Genetic Algorithm Approach to Developing The Multi-Echelon Reverse Logistics Network for Product Returns, The International Journal of Management Science Omega,34:56-69.
52. O’Kelly, M. E., 1986.The Location of Interacting Hub Facilities, Transportation Science,20(2):92-106.
53. O’Kelly, M. E., 1987.A Quadratic Integer Program for The Location of Interacting Hub Facilities, European Journal of Operational Research,32:393-404.
54. O’Kelly, M. E., 1992.Hub Facility Location with Fixed Costs, Regional Science :The Journal of the RSAI,71(3):293-306.
55. O’Kelly, M. E., Bryan, D., Skorin-Kapov, D., and Skorin-Kapov, J., 1996.Hub Network Design with Single and Multiple Allocation: A Computional Study, Location Science,4(3):125-138.
56. O’Kelly, M. E., and Bryan, D. L., 1998.Hub Location with Flow Economies of Scale, Transportation Research B,32(8):605-616.
57. O’Kelly, M. E., 1998.A geographer’s analysis of hub-and-spoke networks, Journal of Transportation Geography,6(3):171-186.
58. Pattnaik, S. B., Mohan, S., and Tom, V. M., 1998.Urban Bus Transit Route Network Design Using Genetic Algorithm, Journal of Transportation Engineering,124(4):368-375.
59. Rolland, E., Schiliing, D. A., Current, J. R., 1996.An Efficient Tabu Search Procedure for The P-Median Problem, European Journal of Operational Research,96:329-342.
60. Song, G., 1995.Integeer Linear Programming Models for Airline Network Design Problem. PHD dissertation, MSIS Department, The University of Texas at Austin.
61. Skorin-Kapov, D., Skorin-Kapov, J., and O’Kelly, M. E., 1996.Tight Linear Programming Relaxation of Uncapacitated P-Hub Median Problems, European Journal of Operational Research,94:582-593.
62. Skorin-Kapov, D., and Skorin-Kapov, J., 1994.On Tabu Search for The Location of Interacting Hub Facilities, European Journal of Operational Research,73:502-509.
63. Sohn, J., and Park, Sungsoo., 1998.Efficient Solution Procedure and Reduced Size Formulations for P-Hub Location Problems, European Journal of Operational Research,108:118-126.
64. Sasaki, M., Suzuki, A. and Drezner, Z., 1999.On the Selection of Hub Airports for an Airline Hub-and-Spoke System, Computers & Operations Research,26:1411-1422.
65. Tom, V. M., and Mohan, S., 2003.Transit Route Network Design Using Frequency Coded Genetic Algorithm, Journal of Transportation Engineering,129(2):186-195.
66. Topcuoglu, H., Corut, F., Ermis, M., and Yilmaz, G., 2005.Solving the Uncapacitated Hub Location Problem Using Genetic Algorithms, Computers & Operations Research,32:967-984.
67. Wang, Q. J., 1997.Using Genetic Algorithm to Optimise Model Parameters, Environmental Modeling & Software,12(1):27-34.