具容量限制之p-Hub 中位問題（capacitated p-Hub median problem）是當需求已知時，在符合網路容量限制下，由所有可候選的中繼站選取P 個中繼站，以達到整體網路營運成本的最佳化。以往有關軸輻式網路規劃之相關文獻，多以數學規劃的方式進行求解 （Bryan & O’Kelly, 1999），且通常不考慮網路中之容量限制。但當網路規模擴大時，節點與節線數目將呈現指數成長，因而耗費可觀的求解時間。基因演算法（genetic algorithm）已廣泛應用於求解各種最佳化問題，因此本研究以此演算法的概念，設計適合網路問題的演算法。本研究以大陸內陸航空貨運量前40 大城市所形成之網路進行實證測試。

　　　The typed of design problem we want to choose a fixed number p of the nodes to be hubs and allocate(or connect) the remaining nodes to one or more of the chosen hubs in such a way that operating costs of resulting network are minimized, which also considered capacity restrictions on hub is known as a capacitated p-Hub median problem.
　　　Due to it’s characteristics of NP-complete, a genetic algorithm which is widely complications to optimal problems was adopted within an acceptable a mount of running time. Finally, a mainland China airline freights network used to testing the accuracy and practicability on the model.

1. 林正章，「路線貨運業單一路徑限制之貨物排程規劃問題」，運輸計劃季刊，29(1)，民國89年，頁1-32。
2. 陳英傑，「兩岸航空貨運直航航點選擇與航線規劃問題」，國立成功大學交通管理研究所碩士論文，民國91年。
3. 從統計看民航，中國民用航空總局規劃科技司編著，中國民航出版社，2000年，北京。
4. 上海航空公司，http://www.shanghai-air.com/index.htm。
5. 中國國際航空公司，http://www.airchina.com.cn。
6. 港龍航空公司，http://www.dragonair.com/chinese/cargo/index.html。
7. Aykin, T., “Lagrangian Relaxation Based Approaches to Capacitated Hub-and-Spoke Network Design Problem,” European Journal of Operations Research, Vol.79, 1994 ,pp. 501-523.
8. Abdinnour-Helm, S., “A hybrid heuristic for the uncapacitated hub location　problem,” European Journal of Operational Research 106, 1998, pp.489-499.
9. Bryan, D.L. and O’Kelly, M.E., “Hub-and-spoke networks in air transportation: An analytical review” Journal of Regional Science, 1999, 39(2), 275-295.
10. Campbell, J. F, “Integer programming formulations of discrete hub location problems”, European Journal of Operational Research, 1994, 72, 387-405.
11. Campbell, J. F, “Hub Location and the p-Hub Median Problem”, Operations Research,　1996, 44, 923-935.
12. Current, J. R., “The design of a hierarchical transportation network with transshipment facilities” Transportation Science, 1988, 22(4), 270-277.
13. Deb and Kalyanmoy, "An efficient constraint handling method for genetic algorithms", Computer Methods in Applied Mechanics and Engineering Volume: 186, Issue: 2-4, 2000, pp. 311-338.
14. Goldberg, D., Genetic Algorithms in Search Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
15. Ernst, A. T. and Krishnamoorthy, M., “Efficient Algorithms for the Uncapacitated Single Allocation p-Hub Median Problem,” Location Science, 1996, Vol. 4, No. 3, pp. 139-154.
16. Ernst, A. T. and Krishnamoorthy, M., 1998, “An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems,” INFORMS Journal on Comprting, Vol.10, No. 2, pp.149-162.
17. Lin,C.C. and Chen,Y. I., “The Integration of Taiwanese and Chinese Air Networks for Direct Air Cargo Services,” Transportation Research Part A, 2003, Vol. 37, pp. 629-647.
18. Michalewicz, Z., Genetic Algorithm + Data Structures = Evolution Programs, 1996, 3rd. revised and extended edition, Springer-Verlag Berlin Heidelberg New York.
19. O’Kelly, M. E., “A Quadratic Integer Program for The Location ofInteracting Hub Facilities,” European Journal of Operation Research, 1987, 32,pp.393-404”