Hub number Cost
Appendix 4: Descriptive Statistics for Different Customer Groups
Index Name Unit Group1 Group2 Group3
Contribution from secondary industry billion(RMB) 2240.86 2113.61 820.71 Contribution from tertiary industry billion(RMB) 4146.41 2011.67 1385.62
Total export and import volume billion(USD) 62.36 36.27 11.08
Foreign capital utilized billion(USD) 8.05 4.26 0.96
Highway freight volume billion
ton
kilometer 13.73 9.16 4.14Railway freight volume billion
ton
kilometer 23.09 18.05 10.03 Air freight volume by civil aviation thousand
ton 1730.58 328.53 83.78High-tech enterprises output billion(RMB) 1389.49 458.91 89.96
Number of wholesalers and retailers thousand 9.846 7.825 2.467
Sales volume of consumer goods billion(RMB) 621.98 255.68 98.74
Disposable income of urban residents RMB 26738 16789 8764
Urban population size million 12.67 9.7 6.5
Business volume of postal delivery service and
EDS billion piece per year 80.56 75.95 67.86
Reference
Abdinnour-Helm, S. (1998). A hybrid heuristic for the uncapacitated hub location problem. European Journal of Operational Research, 106(2), 489-499.
Abdinnour-Helm, S. & Venkataramanan, M. A. (1998). Solution approaches to hub location problems. Annals of Operations Research, 78, 31-50.
Agarwal, Y. K. (1989). An algorithm for designing survivable networks. AT & T TECH. J., 68(3), 64-76. Alba, E. (2005). Parallel metaheuristics: a new class of algorithms. Wiley-Interscience.
Albareda-Sambola, M., et al. (2005). A compact model and tight bounds for a combined location-routing prob- lem. Computers & operations research, 32(3), 407-428.
Alminyana, M., et al. (1998). A new directed branching heuristic for the pq-median problem. Location Science 6(1), 1-23.
Altinkemer, K. & Yu, Z. (1992). Topological design of wide area communication networks. Annals of Operations Research, 36(1), 365-381.
Altinkemer, K. (1994). Topological design of ring networks. Computers & operations research, 21(4), 421-431. Alumur, S. & Kara, B. Y. (2008a). Network hub location problems: The state of the art. European Journal of Operational Research, 190(1), 1-21.
Alumur, S. & Kara, B. Y. (2008b). A hub covering network design problem for cargo applications in Turkey. Journal of the Operational Research Society, 60(10), 1349-1359.
Alumur, S. A., et al. (2009). The design of single allocation incomplete hub networks. Transportation Research Part B: Methodological, 43(10), 936-951.
Anonymous (2008). Administrative Measures for Express Market. Compile of New Registration and Law of P.R.China, 9th Ed., China Legal Publishing House, Beijing.
Anonymous (2007). The First Statistic Survey on Express Delivery Service. State Post Bureau of the People's Re- public of China.
Armacost, A. P., et al. (2002). Composite Variable Formulations for Express Shipment Service Network De- sign. Transportation Science, 36(1), 1-20.
Armacost, A. P., et al. (2004). UPS optimizes its air network. Interfaces, 34(1), 15-25.
Aykin, T. (1994). Lagrangian relaxation based approaches to capacitated hub-and-spoke network design prob- lem. European Journal of Operational Research, 79(3), 501-523.
Aykin, T. (1995a). Networking policies for hub-and-spoke systems with application to the air transportation system. Transportation Science, 29(3), 201-221.
Aykin, T (1995b). The hub location and routing problem. European Journal of Operational Research, 83(1), 200– 219.
Bailey, E. E. (1991). Deregulating the airlines. The Massachusetts Institute of Technology, Fourth printing Balakrishnan, A. & Graves, S. C. (1989). A composite algorithm for a concave-cost network flow problem. Networks, 19(2), 175-202.
Balakrishnan, A., et al. (1991). Models for planning capacity extension in local access telecommunication net- works. Annals of Operations Research, 33(4), 237-284.
Balakrishnan, A. & Altinkemer, K. (1992). Using a hop-constrained model to generate alternative communica- tion network design. ORSA Journal on Computing, 4(2), 192-205.
Balakrishnan, A., et al. (1994). A dual-based algorithm for multi-level network design. Management Science, 40(5), 567-581.
Balakrishnan, A., et al. (1995). A decomposition algorithm for local access telecommunications network exten- sion planning. Operations research, 58-76.
Barnhart, C., et al. (2002). Network design for express shipment delivery. Computational Optimization and Ap- plications, 21(3), 239-262.
Barreto, S., et al. (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research, 179(3), 968-977.
Bauer, P. W. (1987). Airline hubs: A study of determining factors and effects. Economic Review-Federal Reserve Bank of Cleveland,4, 13-19.
Bautista, J. & Pereira, J. (2007). A GRASP algorithm to solve the unicost set covering problem. Computers & Operations Research, 34(10), 3162-3173.
Baybars, I. & Edahl, R. H. (1988). A heuristic method for facility planning in telecommunications networks with multiple alternate routes. Naval Research Logistics (NRL), 35(4), 503-528.
Beasley, J. E. & Nascimento, E. M. (1996). The vehicle routing-allocation problem: A unifying framework. Top ,4(1), 65-86.
Bednar, L. & Strohmeier, E. (1979). Lagerstandortoptimierung und Fuhrparkeinsatzplanung in der Konsumgüter-Industrie. Mathematical Methods of Operations Research, 23(4), 89-104.
Ben-Ayed, O. (2010). Hierarchical parcel distribution facility ground network design problem. International Journal of Logistics Economics and Globalisation, 2(3), 250-269.
Ben-Ayed, O. (2012). Parcel distribution network design problem. Operational Research, to be published, DOI10.1007/s12351-011-0118-2
Berman, O., et al. (2007). The transfer point location problem. European journal of operational research, 179(3), 978-989.
Berry, S. T. (1990). Airport presence as product differentiation. The American Economic Review, 80(2), 394-399. Bhutta, K. S., et al. (2003). An integrated location, production, distribution and investment model for a multi- national corporation. International Journal of Production Economics, 86(3), 201-216.
Blum, C. & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual compari- son. ACM Computing Surveys (CSUR), 35(3), 268-308.
Blum, C. (2005). Beam-ACO hybridizing ant colony optimization with beam search: An application to open shop scheduling. Computers & Operations Research, 32(6), 1565-1591.
Blum, C. & Roli, A. (2008). Hybrid metaheuristics: an introduction. Hybrid Metaheuristics, 1-30.
Boland, N., et al. (2004). Preprocessing and cutting for multiple allocation hub location problems. European Journal of Operational Research, 155(3), 638-653.
Bookbinder, J. H. & Reece, K. E. (1988). Vehicle routing considerations in distribution system design. European Journal of Operational Research, 37(2), 204-213.
Boorstyn, R. & Frank, H. (1977). Large-scale network topological optimization. Communications, IEEE Trans- actions, 25(1), 29-47.
Borenstein, S. (1989). Hubs and high fares: dominance and market power in the US airline industry. The RAND Journal of Economics, 344-365.
Borenstein, S. (1991). The dominant-firm advantage in multiproduct industries: Evidence from the US airlines. The Quarterly Journal of Economics, 106(4), 1237-1266.
Boventer, E. (1961). The relationship between transportation costs and location rent in transportation prob- lems. Journal of Regional Science, 3(2), 27-40.
Bruns, A., et al. (2000). Restructuring of Swiss parcel delivery services. OR Spectrum, 22(2), 285-302.
Bryan, D. (1998). Extensions to the hub location problem: Formulations and numerical examples. Geographical Analysis, 30(4), 315-330.
Bryan, D. L. & O'Kelly, M. E. (1999). Hub-and-spoke Networks in Air Transportation: An Analytical Review. Journal of Regional Science, 39(2), 275-295.
Büdenbender, K., et al. (2000). A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem. Transportation Science, 34(4), 364-380.
Butler, R. V. & Huston, J. H. (1990). Airline service to non-hub airports ten years after deregulation. Logistics and Transportation Review, 26(1), 3-16.
Calik, H., et al. (2009). A tabu-search based heuristic for the hub covering problem over incomplete hub net- works. Computers & Operations Research, 36(12), 3088-3096.
Campbell, J. F. (1993). Continuous and discrete demand hub location problems. Transportation Research Part B: Methodological, 27(6), 473-482.
Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72(2), 387-405.
Campbell, J. F. (1996). Hub location and the p-hub median problem. Operations Research, 923-935.
Campbell, J. F. (2002), Hub location problems. Chapt.12, pp. 373-402. In: Drezner Z, Hammacher H (eds) Fa- cility location: applications and theory. Berlin, Springer
Campbell, J. F., et al. (2003). Solving hub arc location problems on a cluster of workstations. Parallel Compu- ting, 29(5), 555-574.
Campbell, J. F., et al. (2005a). Hub arc location problems: part I: introduction and results. Management Science, 51(10), 1540-1555.
Campbell, J. F., et al. (2005b). Hub arc location problems: part II: formulations and optimal algorithms. Man- agement Science, 51(10), 1556-1571.
Campbell, A. M., et al. (2007). The p-hub center allocation problem. European journal of operational research, 176(2), 819-835.
Campbell, J. F. (2009). Hub location for time definite transportation. Computers & Operations Research, 36(12), 3107-3116.
Canovas, L., et al. (2007). Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. European Journal of Operational Research, 179(3), 990-1007.
Cetiner, S., et al (2010). Hubbing and routing in postal delivery systems. Annals of Operations Research, 181(1), 109-124.
Chakravarthy, A., et al. (2009). Review of models and methodology for scheduling problems in USPS mail processing and distribution centers. International Journal of Operational Research, 5(4), 445-467.
Chang, S. G. & Gavish, B. (1993). Telecommunications network topological design and capacity extension: Formulations and algorithms. Telecommunication Systems, 1(1), 99-131.
Chao, I. (2002). A tabu search method for the truck and trailer routing problem. Computers & Operations Re- search, 29(1), 33-51.
Chen, J. F. (2007). A hybrid heuristic for the uncapacitated single allocation hub location problem. Omega, 35(2), 211-220.
Chen, H., et al. (2008). Network design for time constrained delivery. Naval Research Logistics (NRL), 55(6), 493-515.
Chernev, A. & Kotler, P. (2008). Strategic Marketing Management. Brightstar Media, Incorporated.
Chestler, L. (1985). Overnight Air Express: Spatial Pattern, Competition and the Future in Small Package Delivery Service. Transportation Quarterly, 39(1), 59-71.
Chiarandini, M., et al. (2008). Very large-scale neighborhood search: Overview and case studies on coloring problems. Hybrid Metaheuristics, 117-150.
China Federation of Logistics & Purchasing (2008). China Logistic Yearbook 2008. China Material Press. Chootinan, P. & Chen, A. (2006). Constraint handling in genetic algorithms using a gradient-based repair method. Computers & operations research, 33(8), 2263-2281.
Chou, Y. H. (1990). The hierarchical-hub model for airline networks. Transportation Planning and Technology, 14(4), 243-258.
Colome, R., et al. (2003). A new chance-constrained maximum capture location problem. Annals of Operations Research ,122(1), 121-139.
Cominetti, R. & Ortega, F. (1997). A branch & bound method for minimum concave cost network flows based on sensi- tivity analysis. Universidad de chile.
Committee for China Transportation Yearbook (2011). Year Book of China Transportation & Communication. Year Book House of China Transporation & Communication, Beijing.
Contreras, I., et al. (2011). Branch and price for large-scale capacitated hub location problems with single as- signment. INFORMS Journal on Computing, 23(1), 41-55.
Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331-343.
Cooper, L. (1964). Heuristic methods for location-allocation problems. SIAM review, 6(1), 37-53.
Costa, A. M., et al. (2011). Two-level network design with intermediate facilities: An application to electrical distribution systems. Omega, 39(1), 3-13.
Crainic, T. G. & Laporte, G. (1997). Planning models for freight transportation. European Journal of Operation- al Research, 97(3), 409-438.
Crainic, T. G. (2000). Service network design in freight transportation. European Journal of Operational Re- search, 122(2), 272-288.