铁路行包快运服务网络设计理论与方法研究
|
摘要
伴随着快运业的迅猛发展,通过优质的运输服务为客户创造更多的效益,以吸引客户、扩展市场成为快运企业日趋认同的经营理念,而高水准的快运服务在很大程度上取决于企业对其服务网络的设计、控制、组织和协调能力,因此作为制定运输企业运营策略基础的服务网络设计问题在小件货物快运领域中得到了越来越多的重视。对运输服务网络进行优化设计的目的是制定经济合理的整体运营策略,有计划地组织运输企业的生产活动,最大限度地协调运输服务供求双方的目标利益,实现运输企业客户服务和经营效益的双重目标。由于铁路行包快运在我国小件货物快运市场中占有重要的位置,以及铁路行包快运的运营战术计划人工编制现状,因此有必要根据行包快运的生产组织特点,借助服务网络设计理论和方法,对铁路行包快运组织优化方法进行深入地探讨和研究。
本论文以中国铁路行包快运为研究背景,在总结网络设计与优化、服务网络设计与优化现有研究成果的基础上,运用优化方法的思想,对主要的铁路行包快运服务产品,即专列运输和客运普包运输的服务网络设计问题进行了较为全面和系统的研究。主要研究内容包括以下几个方面:
(1)网络设计问题理论和方法研究网络设计问题是研究运输服务网络设计问题的重要基础,本文对网络设计问题的相关理论和方法进行了总结。在给出网络设计一般模型的基础上,讨论了线性和非线性两类网络设计问题的求解方法,总结了大规模网络设计问题的一般算法思想和步骤。并且对后面研究内容涉及到的相关网络设计特例的模型及算法进行了详细分析。
(2)运输服务网络设计问题理论和方法研究铁路行包快运服务网络设计问题属于运输服务网络设计问题中的一个应用特例。本文对运输服务网络设计问题的理论和方法进行了系统分析和总结。对比网络设计问题与运输服务网络设计问题二者之间的关系;给出运输服务网络设计问题的一般模型及其分类;重点分析静态和动态的运输服务网络设计模型,分别为专列运输和客运普包运输服务网络设计研究奠定基础。
(3)铁路行包快运系统的分析研究铁路行包快运系统是研究行包快运服务网络设计的依据和载体。通过供需分析、作业过程分析、服务产品特点分析和费用分析,从整体上认识和把握铁路行包快运系统。鉴于行包快运组织目前存在的问题,给出铁路行包快运服务网络设计问题研究的必要
With the rapid growth of express shipment delivery industry, carriers have begun to offer high quality, reliable services to capture a large share of the delivery market. While the quality of express services depends on the ability that carriers design, control, organize and coordinate their service networks. With these changes, the service network design problem (SNDP) that designates the set of main tactical issues and decisions relevant of operating planning for carriers becomes more important. The objective of designing transportation service network is to satisfy all customer demand with an acceptable level of service at minimum cost. Since railway parcel transportation plays an important role in the China express small shipment delivery market, and tactical operating planning for railway parcel transportation is made manually, it is necessary and important to study the theory and method of service network design for railway express parcel transport.
In this research, both literature and basic theory related to network design problem and service network design problem are overviewed. There are two parcel transportation products or service types (i.e. special train parcel transport and general parcel transport) offered in the China railway parcel transportation system. Then based on the characteristics of transportation organization mode of these service products, this research studies extensively the SNDP of special train parcel transport and general parcel transport by mathematical optimization approaches. The research consists of the following sections.
(1) As network design problem (NDP) provides the important groundwork for studying service network design problem, the thesis summarizes the related theory and method of network design problem. This research presents the general model of NDP, discusses the approaches to solve linear and nonlinear NDP, and analyze the common solution procedure for the large-scale network design problem. The models and algorithms of special cases of NDP involved in the remainder of this research are analyzed in detail.
(2) Service network design with application to railway parcel transportation is a special case of well-studied SNDP. This research analyzed the theory and method of service network design problem systematically. By comparing SNDP with NDP, the research presents the general model of SNDP. As a rule, SNDP can be divided into two sorts by the traits of the model. And the thesis places emphasis on static frequency and dynamic models of SNDP, since they provide the significant foundation for studying two railway parcel transportation products respectively.
(3) Railway express parcel transport system is the base for studying SNDP of railway
本论文以中国铁路行包快运为研究背景,在总结网络设计与优化、服务网络设计与优化现有研究成果的基础上,运用优化方法的思想,对主要的铁路行包快运服务产品,即专列运输和客运普包运输的服务网络设计问题进行了较为全面和系统的研究。主要研究内容包括以下几个方面:
(1)网络设计问题理论和方法研究网络设计问题是研究运输服务网络设计问题的重要基础,本文对网络设计问题的相关理论和方法进行了总结。在给出网络设计一般模型的基础上,讨论了线性和非线性两类网络设计问题的求解方法,总结了大规模网络设计问题的一般算法思想和步骤。并且对后面研究内容涉及到的相关网络设计特例的模型及算法进行了详细分析。
(2)运输服务网络设计问题理论和方法研究铁路行包快运服务网络设计问题属于运输服务网络设计问题中的一个应用特例。本文对运输服务网络设计问题的理论和方法进行了系统分析和总结。对比网络设计问题与运输服务网络设计问题二者之间的关系;给出运输服务网络设计问题的一般模型及其分类;重点分析静态和动态的运输服务网络设计模型,分别为专列运输和客运普包运输服务网络设计研究奠定基础。
(3)铁路行包快运系统的分析研究铁路行包快运系统是研究行包快运服务网络设计的依据和载体。通过供需分析、作业过程分析、服务产品特点分析和费用分析,从整体上认识和把握铁路行包快运系统。鉴于行包快运组织目前存在的问题,给出铁路行包快运服务网络设计问题研究的必要
With the rapid growth of express shipment delivery industry, carriers have begun to offer high quality, reliable services to capture a large share of the delivery market. While the quality of express services depends on the ability that carriers design, control, organize and coordinate their service networks. With these changes, the service network design problem (SNDP) that designates the set of main tactical issues and decisions relevant of operating planning for carriers becomes more important. The objective of designing transportation service network is to satisfy all customer demand with an acceptable level of service at minimum cost. Since railway parcel transportation plays an important role in the China express small shipment delivery market, and tactical operating planning for railway parcel transportation is made manually, it is necessary and important to study the theory and method of service network design for railway express parcel transport.
In this research, both literature and basic theory related to network design problem and service network design problem are overviewed. There are two parcel transportation products or service types (i.e. special train parcel transport and general parcel transport) offered in the China railway parcel transportation system. Then based on the characteristics of transportation organization mode of these service products, this research studies extensively the SNDP of special train parcel transport and general parcel transport by mathematical optimization approaches. The research consists of the following sections.
(1) As network design problem (NDP) provides the important groundwork for studying service network design problem, the thesis summarizes the related theory and method of network design problem. This research presents the general model of NDP, discusses the approaches to solve linear and nonlinear NDP, and analyze the common solution procedure for the large-scale network design problem. The models and algorithms of special cases of NDP involved in the remainder of this research are analyzed in detail.
(2) Service network design with application to railway parcel transportation is a special case of well-studied SNDP. This research analyzed the theory and method of service network design problem systematically. By comparing SNDP with NDP, the research presents the general model of SNDP. As a rule, SNDP can be divided into two sorts by the traits of the model. And the thesis places emphasis on static frequency and dynamic models of SNDP, since they provide the significant foundation for studying two railway parcel transportation products respectively.
(3) Railway express parcel transport system is the base for studying SNDP of railway
引文
[1] Ahuja, R. K., Magnanti T. L., Orlin, J. B. Network flows: theory, algorithms, and application[M]: Englewood Cliffs, New Jersey, Prentice Hall, 1993
[2] Armacost, A. P., Barnhart, C., Ware, K. A. Composite variable formulations for express shipment service network design[J]: Transportation Science, 2002, 36(1): 1-20
[3] Assad, A. A. Multicommodity network flows—A survey[J]: Networks, 1978, 8: 37-91
[4] Assad, A. A. Models for rail transportation[J]: Transportation Research A, 1980, 14(3): 205-220
[5] Assad, A. A. Modeling of rail networks: toward a routing/make-up model[J]: Transportation Research B, 1980, 14(1-2): 101-114
[6] Balakrishnan, A., Magnanti T. L., Mirchandani P. Network design[A]: Annotated Bibliographies in Combinatorial Optimization, Chichester; John Wiley & Sons, 1997: 311-334
[7] Balakrishnan, A., Magnanti T. L., Wong, R. A dual-ascent procedure for large-scale uncapacitated network design[J]: Operations Research, 1989, 37(5): 716-740
[8] Barnhart, C., Jin, H., Vance, P. H. Railroad blocking: A network design application[J]: Operations Research, 2000, 48(4): 603-614
[9] Barnhart, C., Krishnan N., Kim D. et al. Network design for express shipment delivery[J]: Computational Optimization and Applications, 2002, 21(3): 239-262
[10] Barnhart, C., Schneur, R. R. Air network design for express freight service[J]: Operations Research, 1996, 44(6): 852-863
[11] Barnhart, C., Sheffi, Y. A network-based primal-dual heuristic for the solution of multicommdity network flow problems[J]: Transportation Science, 1993, 27(2): 102-117
[12] Bazaraa, M. S., Jarvis, J. J. Linear Programming and Network Flow[M]: Willey, New York, 1977
[13] Billheimer, W., Gray,P. Network design with fixed and variable cost elements[J], Transportation Science, 1973, 7: 49-74
[14] Boyce, D. E., Farhi, A., Weischedel, R. Optimal network problem: branch-and-bound algorithm[J]: Environment and Planning, 1973, 5: 519-533
[15] Buedenbender, K., Grünert, T., Sebastian, H.-J. A hybrid tabu search/branch and bound algorithm for the direct flight network design problem[J]: Transportation Science, 2000, 34(4): 364-380
[16] C1arke, L.W., Gong, P. Capacitated network design with column generation[R]: The logistics Institute, School of Industrial and System Engineering, Georgia Institute of Technology, Atlanta, GA, 1995
[17] Cordeau, J.-F., Soumis, F., Desrosiers, J. A Benders decomposition approach for the locomotive and car assignment problem[J]: Transportation Science, 2000, 34(2): 133-149
[18] Cordeau, J.-F., Toth, P., Vigo, D. A survey of optimization models for train routing and scheduling[J]: Transportation Science, 1998, 32(4): 380-404
[19] Crainic, T. G. A comparison of two methods for tactical planning in rail freight transportation[A]: Operational Research’84, North-Holland, Amsterdam, 1984: 707-720
[20] Crainic, T. G. Service network design in freight transportation[J]: European Journal of OperationalResearch, 2000, 122(2): 272-288
[21] Crainic, T. G. Long Haul Freight Transportation[M], Handbook of Transportation Science. Kluwer, Norwell, MA, 2002
[22] Crainic, T. G., Ferland, J-A., Rousseau, J-M. A tactical planning model for rail freight transportation[J]: Transportation Science, 1984, 18(2): 165-184
[23] Crainic, T. G., Rousseau, J-M. Multicommodity, multimode freight transportation: a general modeling and algorithmic framework[J]: Transportation Research B, 1986, 20(3): 225-242
[24] Delorme, L., Roy, J., Rousseau, J.-M. Motor-carrier operation planning models: A state of the art[A]: Freight Transport Planning and Logistics, Lecture notes in economics and mathematical systems, 317, Berlin: Springer-Verlag, 1988: 510-545
[25] Duran M. A., Grossmann I. E. An outer approximation algorithm for a class of mixed-integer nonlinear program. Mathematical Programming, 1986, 36(3): 307-336
[26] Farvolden, J. M., Powell, W. B. Subgradient method for the service network design problem[J]: Transportation Science, 1994, 28(3): 256-272
[27] Farvolden, J. M., Powell, W. B., Lustig, I. J. A primal partitioning solution for the multicommodity network flow problem[J]: Operations Research, 1992, 41(4): 669-693
[28] Gao, Z. Y., Sun H. J. Solution algorithem for the bi-level discrete network design problem[J]: Transportation Research B, 2005, 39(6): 479-495
[29] Gendron, B., Crainic, T. G. Relaxation for multicommditiy capacitated network design problem [R]: Centre de Recherche sur les Transports, Université de Montréal, Canada, 1994
[30] Geoffrion, A. M. Generalized benders decompositon[J]: Journal of Optimizaiton Theory and Application. 1972, 10(4): 237-260
[31] Gorman, M. F. An application of genetic and tabu search to the freight railroad operating plan problem[J]: Annals of Operations Research, 1998, 78: 51-69
[32] Grünert, T., Sebastian, H.-J. Planning models for long-haul operations of postal and express shipment companies[J]: European Journal of Operational Research, 2000, 122(2): 289-309
[33] Grünert, T., Sebastian, H.-J., Th?erigen, M. The design of a letter-mail transportation network by intelligent techniques[A]: Proceedings of the Hawaii International Conference on System Sciences 32, 1999
[34] Günlük, O. A branch-and-cut algorithm for capacitated network design problems[J]: Mathematical Programming, 1999, 86: 17-39
[35] Haghani, A. E. Formulation, solution of combined train routing and makeup, and empty car distribution model[J]: Transportation Research B, 1989, 23(6): 433-452
[36] Hane, C. A., Barnhart, C., Johnson, E. L. et al. The fleet assignment problem: solving a large-scale integer problem. Mathematical Programming, 1995, 70: 211-232
[37] Hershberger, J., Suri, S., Bhosle , A. Finding the K shortest simple paths. Technical Report[R], University of California, Santa Barbara, 2001
[38] Hoang H. H. Topological optimization of networks: a nonlinear mixed integer model employinggeneralized Benders decomposition[A]: IEEE Transportation Automatic Control AC-27, 1982: 164-169
[39] Holmberg K. Mean value cross decomposition applied to integer programming problems. European Journal of Operational Research, 1997, 97(2): 124-138
[40] Holmberg K., Hellstrand J. Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound[J]: Operations Research, 1998, 46(2): 247-259
[41] Holmberg, K., Yuan, D. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem[J]: Operations Research, 2000, 48(3): 461-481
[42] Holmberg, K., Yuan, D. A multicommodity network-flow problem with side constraints on paths solved by column generation[J]: INFORMS Journal on Computing, 2003, 15(1): 42-57
[43] Jara Diaz S. R. The estimation of transport cost functions: a methodological review. Transport Review, 1982, 2: 257-278
[44] Jensen, P. A., Barnes, J. W. Network flow programming[M]: New York: John Wiley&Sons, 1980
[45] Ji, C. X., Yang, T. B. A forecasting of OD matrix of railway luggage and package transportation[J]: Journal of System Science and Information, 2005, 3(2): 443-452
[46] Johnson, D. S. Lenstra J. K., Rinnooy H.G. The complexity of the network design problem[J]: Networks, 1978, 8: 278-285
[47] Jones, K. L., Lustig, I. J., Farvolden, J. M., Powell, W. B. Multicommodity network flows: the impact of formulation on decomposition[J]: Mathematical Programming, 1993, 62: 95-117
[48] Keaton, M. H. Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches[J]: Transportation Research B, 1989, 23(6): 415-431
[49] Keaton, M. H. Designing optimal railroad operating plans: a dual adjustment method for implementing lagrangian relaxation[J]: Transportation Science, 1992, 26(3): 263-279
[50] Kennington, J. Solving multicommodity transportation problem using a primal partitioning simplex technique[J]: Naval Research Logistics Quarterly, 1977, 24: 309-325
[51] Kennington, J. Multicommodity flows: a state-of-art survey of linear models and solution techniques[J], Operations Research, 1978, 26(2): 209-236
[52] Kim D. Large scale transportation service network design: models, algorithms and applications[D]: Center for Transportation Studies, Massachusetts Institute of Technology, Cambridge, 1997.
[53] Kim, D., Barnhart, C. Transportation service network design: models and algorithms[A]: Computer-Aided Transit Scheduling, Lecture notes in economics and mathematical systems, 471, Berlin: Springer-Verlag, 1999: 259-283
[54] Kim, D., Barnhart, C., Ware, K. et al. Multimodal express package delivery: a service network design application[J]: Transportation Science, 1999, 33(4): 391-407
[55] Kuby, M. J., Gray, R. G. The hub network design problem with stopovers and feeders: the case of federal express[J]: Transportation Research A, 1993: 27(1): 1-12
[56] Lamar, B.W., Sheffi, Y., Powell, W. B. A capacity improvement lower bound for fixed charge network design problems[J]: Operations Research, 1990, 38(4): 704-710
[57] Leung, L., Cheung, W. An integrated decision methodology for designing and operating an air expresscourier’s distribution network[J]: Decision Science, 2003, 1(1): 105-126
[58] Leung, J. M. Y., Magnanti, T. L., Singhal, V. Routing point-to-point delivery system: formulation and heuristics[J]: Transportation Science, 1990, 24(4): 245-260
[59] Magnanti, T. L., Wong, R. T. Network design and transportation planning: models and algorithms[J]: Transportation Science, 1984, 18(1): 1-55
[60] Magnanti, T. L., Mireault, P., Wong, R. T. Tailoring benders decomposition for uncapacitated network design problem[J]: Mathematical Programming, 1986, 26: 112-154
[61] Magnanti, T. L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem, Operations Research, 1995, 43(1): 142-157
[62] Mccallum C. J. A generalized upper bounding approach to a communication network planning problem[J]: Networks, 1977, 7: 1-23
[63] Minoux, M. Network synthesis and optimum network design problem: models, solution methods and applications[J]: Networks, 1989, 19 (4): 313-360
[64] Nemhauser, G. L., Wolsey, L. A. Integer and combinatorial optimization[M]: John Wiley&Sons, New York, 1999
[65] Newton, H. N. Network design under budget constraints with application to the railroad blocking problem[D]: Auburn University, Auburn, AL, 1996
[66] Newton, H. N., Barnhart, C., Vance, P. H. Constructing railroad blocking plans to minimize handling costs[J]: Transportation Science, 1998, 32 (4): 330-345
[67] Owen S. H., Daskin M. S. Strategic facility location: a review[J]: European Journal of Operational Research, 1998, 111 (3): 423-447
[68] Parker, R. G., Rardin R. L. Discrete optimization[ M]: Academic Press, New York, 1989
[69] Perko, A. Implementation of algorithms for K shortest loopless paths[J]: Networks, 1986, 16: 149–160
[70] Petersen, E. R. Railyard modeling—Part I: prediction of putthought time[J]: Transportation Science, 1977, 11: 37-49
[71] Petersen, E. R. Railyard modeling — Part II: the effect of yard facilities on congestion[J]: Transportation Science, 1977, 11: 50-59
[72] Powell, W. B. A local improvement heuristic for the design of less-than-truckload motor carrier networks[J]: Transportation Science, 1986, 20(4): 246-357
[73] Powell, W. B., Sheffi, Y. The load-planning problem of motor carriers: problem description and a proposed solution approach[J]: Transportation Research A, 1983, 17(6): 471-480
[74] Powell, W. B., Sheffi, Y. Interactive optimization for motor carrier load planning[J]: Journal of Business Logistics, 1986, 7(2): 64-90
[75] Premkumar, G., Chu, C.-H. Telecommunication network design decision: a genetic algorithm approach[R]. eBusiness Research Center, The Pennsylvania State University, 1999
[76] Roy, J., Crainic, T. G. Improving intercity freight routing with a tactical planning model[J]: Interfaces, 1992, 22(3): 31-44
[77] Roy, J., Delorme, L. NETPLAN: a network optimization model for tactical planning in theless-than-truckload motor-carrier industry[J]: Information, 1989, 27 (1): 22-35
[78] Shenoi, R. G. Integrated airline schedule optimization: models and solution methods[D]: Massachusetts Institute of Technology, 1996
[79] Smilowitz, K., Atamtürk, A., Daganzo, C. F. Deferred item and vehicle routing within integrated networks[J]: Transportation Research E, 2003, 39(4): 305-323
[80] Smilowitz, K. Design and operation of multimode, multiservice logistics system[D]: University of California, Berkeley, Institute of Transportation Studies, 2001
[81] Sridhar, V., Park, J. S. Benders-and-cut algorithm for fixed-charge capacitated network design problem[J]: European Journal of Operational Research, 2000, 125 (3): 622-632
[82] Thomadsen, T., Clausen J. Hierarchical network design using simulated annealing, Technical report[R], IMM-2002-14 Informatics and Mathematical Modeling, Technical University of Denmark, 2002
[83] Turnquist M.A., Daskin M. S. Queuing models of classification and connection delay in railyards[J]: Transportation Science, 1982, 16: 207-230
[84] Van Roy, T. J. Cross decomposition algorithm for mixed integer programming[J]: Mathematical Programming, 1983, 25: 46-63
[85] Vavasis, S. A. Nonlinear optimization: complexity issues[M]: Oxford University Press, New York, 1991
[86] Yang, H., Bell, M. G. H. Transportation bilevel programming programming problems: recent methodological advances[J]: Transportation Research B, 2001, 35:1-4
[87] Yen, J. Y. Finding the K shortest loopless paths in a network[J]: Management Science, 1971, 17: 712-716
[88] Yen, J. Y. Another algorithm for finding the K shortest loopless network paths[A]: Proceedings of 41st Meeting Operations Research Society of America, 1972: 20-24
[89] 杨肇夏, 季常煦, 刘军等. “十一五”铁路行包运输发展规划研究报告[R]: 北京: 北京交通大学, 2005
[90]刘军, 季常煦, 杨肇夏. 中铁行包快递有限责任公司经营管理调研报告[R]: 北京:北京交通大学, 2004
[91] 查伟雄, 秦作睿. 路网上车流径路最优配流法[J]: 北方交通大学学报, 1999, 2l(3): 259-263
[92] 查伟雄, 符卓. 直通旅客列车开行方案优化方法的研究[J]: 铁道学报, 2000, 22(5): 1-5
[93] 陈宝林. 最优化理论与算法[M]: 北京: 清华大学出版社, 1989
[94] 陈京亮. 我国铁路快运业务发展的思考[J]: 综合运输, 2006, (2): 71-74
[95] 陈志平, 徐宗本. 计算机数学—计算复杂性理论与 NPC、NP 难问题的求解[M]: 北京: 科学出版社, 2001
[96] 成思危, 胡清淮, 刘敏. 大型线性目标规划及其应用[M]: 郑州: 河南科学技术出版社, 2000
[97] 戴建设等. 多供需点快速调运问题研究[J]: 系统工程学报, 1995, 10(3): 124-130
[98] 丁立言. 物流管理[M]: 北京: 清华大学出版社, 1999
[99] 董晓岩. 基于始发能力最大化的快运企业运输方案的设计与研究[D]: 北京: 北京交通大学,2004
[100] 杜端甫. 运筹图论(图、网络理论中的运筹问题)[M]: 北京: 北京航空航天大学出版社, 1990
[101] 高旭敏, 周潮,顾炎. 铁路网货车车流径路分配的优化模型及算法[J]: 铁道学报, 1992, 14(4): 43-47
[102] 高自友, 孙会君. 现代物流与交通运输系统[M]: 北京: 人民交通出版社, 2003
[103] 高自友, 孙会君, 张好智.城市交通网络设计问题中双层规划模型、方法及应用[J].交通运输系统工作与信息, 2004, 4(1): 35-44
[104] 洪文, 吴本忠. LINGO 4.0 for Windows[M]: 北京: 北京大学出版社, 2002
[105] 胡思继. 列车运行组织及通过能力理论[M]: 北京: 中国铁道出版社, 1993
[106] 胡思继. 铁路行车组织[M]: 北京: 中国铁道出版社, 1998
[107] 胡伟, 杜欣, 李文新. 德国铁路运营管理评析. 铁道经济研究, 2001, (6): 24-30
[108] 黄平, 张仲义. 运输网络运量分配问题的模型与算法研究[J]: 中国管理科学, 1999, 7(1): 48-54
[109] 季常煦. 区域公路运输系统网络规划理论模型的研究[D]: 长春: 吉林工业大学, 1996
[110] 金永吉. 优化行包运输组织 实现企业资源价值最大化[J]: 铁道经济研究, 2004, (4): 29-30
[111] 兰家隆, 刘军. 应用图论及算法[M]: 成都: 电子科技大学出版社, 1995
[112] 李志华, 王启富, 钟毅芳, 周亦波. 物流网络设计建模与求解算法研究[J]: 机械工程学报, 2003, 39(2): 84-89
[113] 李夏苗. 现代铁路货物运输组织理论研究[D]: 北京: 北京交通大学, 2002
[114] 李夏苗, 卢红岩. 快运货物列车编组方案的优化[J]: 中国铁道科学, 2004, 25(2): 117-120
[115] 林柏梁. 线路与编组站能力限制下的车流组织模型与模拟退火方法[J]: 北方交通大学学报, 1997, 21(3): 264-272
[116] 林柏梁. 具有非线性改编费用的列车编组计划优化[J]: 铁道学报, 1996, 18(增刊): 37-41
[117] 林柏梁, 朱松年. 路网上车流径路与列车编组计划的整体优化[J]: 铁道学报, 1996, 18(1): 1-7
[118] 林柏梁, 朱松年, 陈竹生等. 路网上车流径路优化的 0-1 规划模型及其合理径路集生成算法[J]: 1997, 铁道学报, 19(1): 7-12
[119] 林大兴. 关于代数图论中的全单模矩阵[J]: 厦门大学学报(自然科学版), 1992, 31(5): 469-473
[120] 陆化普. 交通规划理论与方法[M]: 北京: 清华大学出版社, 1998
[121] 罗庆中, 江文斌, 祝继常等. 世界铁路客货运输发展策略与借鉴[J]: 中国铁路, 2000, (12): 30-33
[122] 罗旭. 铁路行包运价里程计算问题的研究及计算机求解[D]: 北京: 北京交通大学, 2002
[123] 马仲蕃. 线性整数规划的数学基础[M]: 北京: 科学出版社, 1995
[124] 毛保华, 曾会欣, 袁振洲. 交通规划模型及其应用[M]: 北京: 中国铁道出版社, 1999
[125] 钱颂迪主编, 《运筹学》教材编写组编. 运筹学(修订版)[M]: 北京:清华大学出版社, 1990
[126] 荣朝和. 关手铁路规模经济与范围经济的探讨[J]: 铁道经济研究, 2001, (4): 5-8
[127] 沈睿 刘军. A service network design model for railway express parcel delivery[A]: 2005 全国博士生学术论坛(交通运输工程学科)论文集, 2005, 307-312
[128] 沈睿. 运输企业向第三方物流拓展的相关问题研究[D]: 北京: 北京交通大学, 2001
[129] 史峰, 孔庆钤, 胡安洲. 车流径路与编组计划综合优化的网络方法[J]: 铁道学报, 1997, 19(1): 1-6
[130] 史峰, 李致中. 集结耗费的计算公式[J]: 铁道学报, 1992, 14(4): 35-42
[131] 史峰, 黎新华, 莫辉辉等. 铁路 OD 分配优化方法[J]: 中国铁道科学, 2004, 25(4): 116-119
[132] 史峰, 莫辉辉, 黎新华等. 区段管内车流组织优化方法[J]: 交通运输工程学报, 2003, 3(2): 84-87
[133] 施其洲. 多目标铁路车流分配模型及 GP-STEM 算法的求解[J]: 上海铁道学院学报, 1989, 10(3): 27-38
[134] 束金龙, 闻人凯. 线形规划理论与模型应用[M]: 北京: 科学出版社, 2003
[135] 宋华, 胡左浩. 现代物流与供应链管理[M]: 北京: 经济管理出版社, 2000
[136] 田有文, 范明哲. 遗传算法在农村电力网规划中的应用[J]: 沈阳农业大学学报, 1999, 30(4): 444-446
[137] 铁道部. 铁路旅客运输规程[G]: 1997
[138] 铁道部. 中长期铁路网规划[R]: 2004
[139] 铁道部. 关于铁路运输企业 2004 年财务结算问题有关规定的通知[G]: 2004
[140] 铁道部.铁路客运运价里程表[G]: 北京: 中国铁道出版社,2005
[141] 铁道部科技司. 铁路科技发展“十一五”计划和 2020 年长期规划纲要[R]: 2005
[142] 铁道部统计中心. 2002-2004 年铁路各站行包办理量[G]: 2005
[143] 铁道部运输局. 行包快运专列组织管理暂行办法[G]: 1999
[144] 铁道部运输局. 2004 年跨局行包快运专列开行方案[G]: 2004
[145] 铁道部运输局. 全国铁路旅客列车时刻表(2004 年 4 月 18 日起实行)[G]: 北京: 中国铁道出版社, 2004
[146] 王晓东. 算法设计与分析[M]: 北京: 清华大学出版社, 2003
[147] 万华,叶耀华. 一种带路径约束的多商品流网络设计问题及其禁忌算法[J]: 复旦学报(自然科学版), 2004, 44(2): 220-223
[148] 吴文泷. 图论基础及应用[M]: 北京: 中国铁道出版社, 1984
[149] 吴育俭, 刘作义. 运输市场营销学[M]: 北京: 中国铁道出版社, 2000
[150] 谢金星, 邢文训. 网络优化[M]: 北京: 清华大学出版社, 2000
[151] 谢政, 李建平. 网络算法与复杂性理论[M]: 长沙: 国防科技大学出版社, 1995
[152] 邢文训, 谢金星. 现代优化计算方法[M]: 北京: 清华大学出版社, 1999
[153] 许庆斌, 荣朝和, 马运. 运输经济学导论[M]: 北京: 中国铁道出版社, 1998
[154] 杨浩. 我国铁路快速货物运输发展的现状与展望[J]: 北方交通大学学报, 200024(6): 20-24
[155] 杨浩, 张秀媛, 赵鹏. 综合交通与区域经济[M]: 北京: 中国铁道出版社, 1995
[156] 杨浩, 何世伟. 铁路运输组织学[M]: 北京: 中国铁道出版社, 2001
[157] 杨杰, 陈建文, 尹群等. 关于整数线性规划代理对偶间隙的注记[J]: 系统工程理论与实践, 2002, (9): 70-73
[158] 王鑫, 秦四平. 发展我国铁路快速货物运输体系的构想[J]: 铁道货运, 2003, (6): 17-19
[159] 叶耀华, 蒋怡乐, 王律. 一种省际邮件转运网络设计的模型与算法[J]: 复旦学报(自然科学版), 2003, 42(5): 680-684
[160] 叶耀华, 钟嵬, 朱屹容. 一种市内邮件转运问题的模型与算法[J]: 运筹学学报, 1998, 2(4): 91-94
[161] 张建中, 许绍吉. 线性规划[M]: 北京: 科学出版社, 1999
[162] 张迎, 费奇. 多供需点带时间约束实时调运问题的启发式算法[J]: 计算机工程与应用, 2002, (11): 61-62
[163] 中铁行包快递有限责任公司. 中铁行包物流基地建设规划实施方案[R]: 2005
[164] 中铁行包快递有限责任公司. 中铁行包关于加快市场化进程的报告[R]: 2005
[165] 中铁行包快递有限责任公司. 1980 至 2004 年国家铁路行包运输统计[G]: 2005
[166] 中铁行包快递有限责任公司. 中铁行包快递有限责任公司年鉴[G]: 2005
[167] 朱道立. 大系统优化理论与应用[M]: 上海: 上海交通大学出版社, 1987
[168] 朱松年, 曹家明, 赵强等. 车流组织综合优化[J]: 铁道学报, 1993, 15(3): 59-69
[2] Armacost, A. P., Barnhart, C., Ware, K. A. Composite variable formulations for express shipment service network design[J]: Transportation Science, 2002, 36(1): 1-20
[3] Assad, A. A. Multicommodity network flows—A survey[J]: Networks, 1978, 8: 37-91
[4] Assad, A. A. Models for rail transportation[J]: Transportation Research A, 1980, 14(3): 205-220
[5] Assad, A. A. Modeling of rail networks: toward a routing/make-up model[J]: Transportation Research B, 1980, 14(1-2): 101-114
[6] Balakrishnan, A., Magnanti T. L., Mirchandani P. Network design[A]: Annotated Bibliographies in Combinatorial Optimization, Chichester; John Wiley & Sons, 1997: 311-334
[7] Balakrishnan, A., Magnanti T. L., Wong, R. A dual-ascent procedure for large-scale uncapacitated network design[J]: Operations Research, 1989, 37(5): 716-740
[8] Barnhart, C., Jin, H., Vance, P. H. Railroad blocking: A network design application[J]: Operations Research, 2000, 48(4): 603-614
[9] Barnhart, C., Krishnan N., Kim D. et al. Network design for express shipment delivery[J]: Computational Optimization and Applications, 2002, 21(3): 239-262
[10] Barnhart, C., Schneur, R. R. Air network design for express freight service[J]: Operations Research, 1996, 44(6): 852-863
[11] Barnhart, C., Sheffi, Y. A network-based primal-dual heuristic for the solution of multicommdity network flow problems[J]: Transportation Science, 1993, 27(2): 102-117
[12] Bazaraa, M. S., Jarvis, J. J. Linear Programming and Network Flow[M]: Willey, New York, 1977
[13] Billheimer, W., Gray,P. Network design with fixed and variable cost elements[J], Transportation Science, 1973, 7: 49-74
[14] Boyce, D. E., Farhi, A., Weischedel, R. Optimal network problem: branch-and-bound algorithm[J]: Environment and Planning, 1973, 5: 519-533
[15] Buedenbender, K., Grünert, T., Sebastian, H.-J. A hybrid tabu search/branch and bound algorithm for the direct flight network design problem[J]: Transportation Science, 2000, 34(4): 364-380
[16] C1arke, L.W., Gong, P. Capacitated network design with column generation[R]: The logistics Institute, School of Industrial and System Engineering, Georgia Institute of Technology, Atlanta, GA, 1995
[17] Cordeau, J.-F., Soumis, F., Desrosiers, J. A Benders decomposition approach for the locomotive and car assignment problem[J]: Transportation Science, 2000, 34(2): 133-149
[18] Cordeau, J.-F., Toth, P., Vigo, D. A survey of optimization models for train routing and scheduling[J]: Transportation Science, 1998, 32(4): 380-404
[19] Crainic, T. G. A comparison of two methods for tactical planning in rail freight transportation[A]: Operational Research’84, North-Holland, Amsterdam, 1984: 707-720
[20] Crainic, T. G. Service network design in freight transportation[J]: European Journal of OperationalResearch, 2000, 122(2): 272-288
[21] Crainic, T. G. Long Haul Freight Transportation[M], Handbook of Transportation Science. Kluwer, Norwell, MA, 2002
[22] Crainic, T. G., Ferland, J-A., Rousseau, J-M. A tactical planning model for rail freight transportation[J]: Transportation Science, 1984, 18(2): 165-184
[23] Crainic, T. G., Rousseau, J-M. Multicommodity, multimode freight transportation: a general modeling and algorithmic framework[J]: Transportation Research B, 1986, 20(3): 225-242
[24] Delorme, L., Roy, J., Rousseau, J.-M. Motor-carrier operation planning models: A state of the art[A]: Freight Transport Planning and Logistics, Lecture notes in economics and mathematical systems, 317, Berlin: Springer-Verlag, 1988: 510-545
[25] Duran M. A., Grossmann I. E. An outer approximation algorithm for a class of mixed-integer nonlinear program. Mathematical Programming, 1986, 36(3): 307-336
[26] Farvolden, J. M., Powell, W. B. Subgradient method for the service network design problem[J]: Transportation Science, 1994, 28(3): 256-272
[27] Farvolden, J. M., Powell, W. B., Lustig, I. J. A primal partitioning solution for the multicommodity network flow problem[J]: Operations Research, 1992, 41(4): 669-693
[28] Gao, Z. Y., Sun H. J. Solution algorithem for the bi-level discrete network design problem[J]: Transportation Research B, 2005, 39(6): 479-495
[29] Gendron, B., Crainic, T. G. Relaxation for multicommditiy capacitated network design problem [R]: Centre de Recherche sur les Transports, Université de Montréal, Canada, 1994
[30] Geoffrion, A. M. Generalized benders decompositon[J]: Journal of Optimizaiton Theory and Application. 1972, 10(4): 237-260
[31] Gorman, M. F. An application of genetic and tabu search to the freight railroad operating plan problem[J]: Annals of Operations Research, 1998, 78: 51-69
[32] Grünert, T., Sebastian, H.-J. Planning models for long-haul operations of postal and express shipment companies[J]: European Journal of Operational Research, 2000, 122(2): 289-309
[33] Grünert, T., Sebastian, H.-J., Th?erigen, M. The design of a letter-mail transportation network by intelligent techniques[A]: Proceedings of the Hawaii International Conference on System Sciences 32, 1999
[34] Günlük, O. A branch-and-cut algorithm for capacitated network design problems[J]: Mathematical Programming, 1999, 86: 17-39
[35] Haghani, A. E. Formulation, solution of combined train routing and makeup, and empty car distribution model[J]: Transportation Research B, 1989, 23(6): 433-452
[36] Hane, C. A., Barnhart, C., Johnson, E. L. et al. The fleet assignment problem: solving a large-scale integer problem. Mathematical Programming, 1995, 70: 211-232
[37] Hershberger, J., Suri, S., Bhosle , A. Finding the K shortest simple paths. Technical Report[R], University of California, Santa Barbara, 2001
[38] Hoang H. H. Topological optimization of networks: a nonlinear mixed integer model employinggeneralized Benders decomposition[A]: IEEE Transportation Automatic Control AC-27, 1982: 164-169
[39] Holmberg K. Mean value cross decomposition applied to integer programming problems. European Journal of Operational Research, 1997, 97(2): 124-138
[40] Holmberg K., Hellstrand J. Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound[J]: Operations Research, 1998, 46(2): 247-259
[41] Holmberg, K., Yuan, D. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem[J]: Operations Research, 2000, 48(3): 461-481
[42] Holmberg, K., Yuan, D. A multicommodity network-flow problem with side constraints on paths solved by column generation[J]: INFORMS Journal on Computing, 2003, 15(1): 42-57
[43] Jara Diaz S. R. The estimation of transport cost functions: a methodological review. Transport Review, 1982, 2: 257-278
[44] Jensen, P. A., Barnes, J. W. Network flow programming[M]: New York: John Wiley&Sons, 1980
[45] Ji, C. X., Yang, T. B. A forecasting of OD matrix of railway luggage and package transportation[J]: Journal of System Science and Information, 2005, 3(2): 443-452
[46] Johnson, D. S. Lenstra J. K., Rinnooy H.G. The complexity of the network design problem[J]: Networks, 1978, 8: 278-285
[47] Jones, K. L., Lustig, I. J., Farvolden, J. M., Powell, W. B. Multicommodity network flows: the impact of formulation on decomposition[J]: Mathematical Programming, 1993, 62: 95-117
[48] Keaton, M. H. Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches[J]: Transportation Research B, 1989, 23(6): 415-431
[49] Keaton, M. H. Designing optimal railroad operating plans: a dual adjustment method for implementing lagrangian relaxation[J]: Transportation Science, 1992, 26(3): 263-279
[50] Kennington, J. Solving multicommodity transportation problem using a primal partitioning simplex technique[J]: Naval Research Logistics Quarterly, 1977, 24: 309-325
[51] Kennington, J. Multicommodity flows: a state-of-art survey of linear models and solution techniques[J], Operations Research, 1978, 26(2): 209-236
[52] Kim D. Large scale transportation service network design: models, algorithms and applications[D]: Center for Transportation Studies, Massachusetts Institute of Technology, Cambridge, 1997.
[53] Kim, D., Barnhart, C. Transportation service network design: models and algorithms[A]: Computer-Aided Transit Scheduling, Lecture notes in economics and mathematical systems, 471, Berlin: Springer-Verlag, 1999: 259-283
[54] Kim, D., Barnhart, C., Ware, K. et al. Multimodal express package delivery: a service network design application[J]: Transportation Science, 1999, 33(4): 391-407
[55] Kuby, M. J., Gray, R. G. The hub network design problem with stopovers and feeders: the case of federal express[J]: Transportation Research A, 1993: 27(1): 1-12
[56] Lamar, B.W., Sheffi, Y., Powell, W. B. A capacity improvement lower bound for fixed charge network design problems[J]: Operations Research, 1990, 38(4): 704-710
[57] Leung, L., Cheung, W. An integrated decision methodology for designing and operating an air expresscourier’s distribution network[J]: Decision Science, 2003, 1(1): 105-126
[58] Leung, J. M. Y., Magnanti, T. L., Singhal, V. Routing point-to-point delivery system: formulation and heuristics[J]: Transportation Science, 1990, 24(4): 245-260
[59] Magnanti, T. L., Wong, R. T. Network design and transportation planning: models and algorithms[J]: Transportation Science, 1984, 18(1): 1-55
[60] Magnanti, T. L., Mireault, P., Wong, R. T. Tailoring benders decomposition for uncapacitated network design problem[J]: Mathematical Programming, 1986, 26: 112-154
[61] Magnanti, T. L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem, Operations Research, 1995, 43(1): 142-157
[62] Mccallum C. J. A generalized upper bounding approach to a communication network planning problem[J]: Networks, 1977, 7: 1-23
[63] Minoux, M. Network synthesis and optimum network design problem: models, solution methods and applications[J]: Networks, 1989, 19 (4): 313-360
[64] Nemhauser, G. L., Wolsey, L. A. Integer and combinatorial optimization[M]: John Wiley&Sons, New York, 1999
[65] Newton, H. N. Network design under budget constraints with application to the railroad blocking problem[D]: Auburn University, Auburn, AL, 1996
[66] Newton, H. N., Barnhart, C., Vance, P. H. Constructing railroad blocking plans to minimize handling costs[J]: Transportation Science, 1998, 32 (4): 330-345
[67] Owen S. H., Daskin M. S. Strategic facility location: a review[J]: European Journal of Operational Research, 1998, 111 (3): 423-447
[68] Parker, R. G., Rardin R. L. Discrete optimization[ M]: Academic Press, New York, 1989
[69] Perko, A. Implementation of algorithms for K shortest loopless paths[J]: Networks, 1986, 16: 149–160
[70] Petersen, E. R. Railyard modeling—Part I: prediction of putthought time[J]: Transportation Science, 1977, 11: 37-49
[71] Petersen, E. R. Railyard modeling — Part II: the effect of yard facilities on congestion[J]: Transportation Science, 1977, 11: 50-59
[72] Powell, W. B. A local improvement heuristic for the design of less-than-truckload motor carrier networks[J]: Transportation Science, 1986, 20(4): 246-357
[73] Powell, W. B., Sheffi, Y. The load-planning problem of motor carriers: problem description and a proposed solution approach[J]: Transportation Research A, 1983, 17(6): 471-480
[74] Powell, W. B., Sheffi, Y. Interactive optimization for motor carrier load planning[J]: Journal of Business Logistics, 1986, 7(2): 64-90
[75] Premkumar, G., Chu, C.-H. Telecommunication network design decision: a genetic algorithm approach[R]. eBusiness Research Center, The Pennsylvania State University, 1999
[76] Roy, J., Crainic, T. G. Improving intercity freight routing with a tactical planning model[J]: Interfaces, 1992, 22(3): 31-44
[77] Roy, J., Delorme, L. NETPLAN: a network optimization model for tactical planning in theless-than-truckload motor-carrier industry[J]: Information, 1989, 27 (1): 22-35
[78] Shenoi, R. G. Integrated airline schedule optimization: models and solution methods[D]: Massachusetts Institute of Technology, 1996
[79] Smilowitz, K., Atamtürk, A., Daganzo, C. F. Deferred item and vehicle routing within integrated networks[J]: Transportation Research E, 2003, 39(4): 305-323
[80] Smilowitz, K. Design and operation of multimode, multiservice logistics system[D]: University of California, Berkeley, Institute of Transportation Studies, 2001
[81] Sridhar, V., Park, J. S. Benders-and-cut algorithm for fixed-charge capacitated network design problem[J]: European Journal of Operational Research, 2000, 125 (3): 622-632
[82] Thomadsen, T., Clausen J. Hierarchical network design using simulated annealing, Technical report[R], IMM-2002-14 Informatics and Mathematical Modeling, Technical University of Denmark, 2002
[83] Turnquist M.A., Daskin M. S. Queuing models of classification and connection delay in railyards[J]: Transportation Science, 1982, 16: 207-230
[84] Van Roy, T. J. Cross decomposition algorithm for mixed integer programming[J]: Mathematical Programming, 1983, 25: 46-63
[85] Vavasis, S. A. Nonlinear optimization: complexity issues[M]: Oxford University Press, New York, 1991
[86] Yang, H., Bell, M. G. H. Transportation bilevel programming programming problems: recent methodological advances[J]: Transportation Research B, 2001, 35:1-4
[87] Yen, J. Y. Finding the K shortest loopless paths in a network[J]: Management Science, 1971, 17: 712-716
[88] Yen, J. Y. Another algorithm for finding the K shortest loopless network paths[A]: Proceedings of 41st Meeting Operations Research Society of America, 1972: 20-24
[89] 杨肇夏, 季常煦, 刘军等. “十一五”铁路行包运输发展规划研究报告[R]: 北京: 北京交通大学, 2005
[90]刘军, 季常煦, 杨肇夏. 中铁行包快递有限责任公司经营管理调研报告[R]: 北京:北京交通大学, 2004
[91] 查伟雄, 秦作睿. 路网上车流径路最优配流法[J]: 北方交通大学学报, 1999, 2l(3): 259-263
[92] 查伟雄, 符卓. 直通旅客列车开行方案优化方法的研究[J]: 铁道学报, 2000, 22(5): 1-5
[93] 陈宝林. 最优化理论与算法[M]: 北京: 清华大学出版社, 1989
[94] 陈京亮. 我国铁路快运业务发展的思考[J]: 综合运输, 2006, (2): 71-74
[95] 陈志平, 徐宗本. 计算机数学—计算复杂性理论与 NPC、NP 难问题的求解[M]: 北京: 科学出版社, 2001
[96] 成思危, 胡清淮, 刘敏. 大型线性目标规划及其应用[M]: 郑州: 河南科学技术出版社, 2000
[97] 戴建设等. 多供需点快速调运问题研究[J]: 系统工程学报, 1995, 10(3): 124-130
[98] 丁立言. 物流管理[M]: 北京: 清华大学出版社, 1999
[99] 董晓岩. 基于始发能力最大化的快运企业运输方案的设计与研究[D]: 北京: 北京交通大学,2004
[100] 杜端甫. 运筹图论(图、网络理论中的运筹问题)[M]: 北京: 北京航空航天大学出版社, 1990
[101] 高旭敏, 周潮,顾炎. 铁路网货车车流径路分配的优化模型及算法[J]: 铁道学报, 1992, 14(4): 43-47
[102] 高自友, 孙会君. 现代物流与交通运输系统[M]: 北京: 人民交通出版社, 2003
[103] 高自友, 孙会君, 张好智.城市交通网络设计问题中双层规划模型、方法及应用[J].交通运输系统工作与信息, 2004, 4(1): 35-44
[104] 洪文, 吴本忠. LINGO 4.0 for Windows[M]: 北京: 北京大学出版社, 2002
[105] 胡思继. 列车运行组织及通过能力理论[M]: 北京: 中国铁道出版社, 1993
[106] 胡思继. 铁路行车组织[M]: 北京: 中国铁道出版社, 1998
[107] 胡伟, 杜欣, 李文新. 德国铁路运营管理评析. 铁道经济研究, 2001, (6): 24-30
[108] 黄平, 张仲义. 运输网络运量分配问题的模型与算法研究[J]: 中国管理科学, 1999, 7(1): 48-54
[109] 季常煦. 区域公路运输系统网络规划理论模型的研究[D]: 长春: 吉林工业大学, 1996
[110] 金永吉. 优化行包运输组织 实现企业资源价值最大化[J]: 铁道经济研究, 2004, (4): 29-30
[111] 兰家隆, 刘军. 应用图论及算法[M]: 成都: 电子科技大学出版社, 1995
[112] 李志华, 王启富, 钟毅芳, 周亦波. 物流网络设计建模与求解算法研究[J]: 机械工程学报, 2003, 39(2): 84-89
[113] 李夏苗. 现代铁路货物运输组织理论研究[D]: 北京: 北京交通大学, 2002
[114] 李夏苗, 卢红岩. 快运货物列车编组方案的优化[J]: 中国铁道科学, 2004, 25(2): 117-120
[115] 林柏梁. 线路与编组站能力限制下的车流组织模型与模拟退火方法[J]: 北方交通大学学报, 1997, 21(3): 264-272
[116] 林柏梁. 具有非线性改编费用的列车编组计划优化[J]: 铁道学报, 1996, 18(增刊): 37-41
[117] 林柏梁, 朱松年. 路网上车流径路与列车编组计划的整体优化[J]: 铁道学报, 1996, 18(1): 1-7
[118] 林柏梁, 朱松年, 陈竹生等. 路网上车流径路优化的 0-1 规划模型及其合理径路集生成算法[J]: 1997, 铁道学报, 19(1): 7-12
[119] 林大兴. 关于代数图论中的全单模矩阵[J]: 厦门大学学报(自然科学版), 1992, 31(5): 469-473
[120] 陆化普. 交通规划理论与方法[M]: 北京: 清华大学出版社, 1998
[121] 罗庆中, 江文斌, 祝继常等. 世界铁路客货运输发展策略与借鉴[J]: 中国铁路, 2000, (12): 30-33
[122] 罗旭. 铁路行包运价里程计算问题的研究及计算机求解[D]: 北京: 北京交通大学, 2002
[123] 马仲蕃. 线性整数规划的数学基础[M]: 北京: 科学出版社, 1995
[124] 毛保华, 曾会欣, 袁振洲. 交通规划模型及其应用[M]: 北京: 中国铁道出版社, 1999
[125] 钱颂迪主编, 《运筹学》教材编写组编. 运筹学(修订版)[M]: 北京:清华大学出版社, 1990
[126] 荣朝和. 关手铁路规模经济与范围经济的探讨[J]: 铁道经济研究, 2001, (4): 5-8
[127] 沈睿 刘军. A service network design model for railway express parcel delivery[A]: 2005 全国博士生学术论坛(交通运输工程学科)论文集, 2005, 307-312
[128] 沈睿. 运输企业向第三方物流拓展的相关问题研究[D]: 北京: 北京交通大学, 2001
[129] 史峰, 孔庆钤, 胡安洲. 车流径路与编组计划综合优化的网络方法[J]: 铁道学报, 1997, 19(1): 1-6
[130] 史峰, 李致中. 集结耗费的计算公式[J]: 铁道学报, 1992, 14(4): 35-42
[131] 史峰, 黎新华, 莫辉辉等. 铁路 OD 分配优化方法[J]: 中国铁道科学, 2004, 25(4): 116-119
[132] 史峰, 莫辉辉, 黎新华等. 区段管内车流组织优化方法[J]: 交通运输工程学报, 2003, 3(2): 84-87
[133] 施其洲. 多目标铁路车流分配模型及 GP-STEM 算法的求解[J]: 上海铁道学院学报, 1989, 10(3): 27-38
[134] 束金龙, 闻人凯. 线形规划理论与模型应用[M]: 北京: 科学出版社, 2003
[135] 宋华, 胡左浩. 现代物流与供应链管理[M]: 北京: 经济管理出版社, 2000
[136] 田有文, 范明哲. 遗传算法在农村电力网规划中的应用[J]: 沈阳农业大学学报, 1999, 30(4): 444-446
[137] 铁道部. 铁路旅客运输规程[G]: 1997
[138] 铁道部. 中长期铁路网规划[R]: 2004
[139] 铁道部. 关于铁路运输企业 2004 年财务结算问题有关规定的通知[G]: 2004
[140] 铁道部.铁路客运运价里程表[G]: 北京: 中国铁道出版社,2005
[141] 铁道部科技司. 铁路科技发展“十一五”计划和 2020 年长期规划纲要[R]: 2005
[142] 铁道部统计中心. 2002-2004 年铁路各站行包办理量[G]: 2005
[143] 铁道部运输局. 行包快运专列组织管理暂行办法[G]: 1999
[144] 铁道部运输局. 2004 年跨局行包快运专列开行方案[G]: 2004
[145] 铁道部运输局. 全国铁路旅客列车时刻表(2004 年 4 月 18 日起实行)[G]: 北京: 中国铁道出版社, 2004
[146] 王晓东. 算法设计与分析[M]: 北京: 清华大学出版社, 2003
[147] 万华,叶耀华. 一种带路径约束的多商品流网络设计问题及其禁忌算法[J]: 复旦学报(自然科学版), 2004, 44(2): 220-223
[148] 吴文泷. 图论基础及应用[M]: 北京: 中国铁道出版社, 1984
[149] 吴育俭, 刘作义. 运输市场营销学[M]: 北京: 中国铁道出版社, 2000
[150] 谢金星, 邢文训. 网络优化[M]: 北京: 清华大学出版社, 2000
[151] 谢政, 李建平. 网络算法与复杂性理论[M]: 长沙: 国防科技大学出版社, 1995
[152] 邢文训, 谢金星. 现代优化计算方法[M]: 北京: 清华大学出版社, 1999
[153] 许庆斌, 荣朝和, 马运. 运输经济学导论[M]: 北京: 中国铁道出版社, 1998
[154] 杨浩. 我国铁路快速货物运输发展的现状与展望[J]: 北方交通大学学报, 200024(6): 20-24
[155] 杨浩, 张秀媛, 赵鹏. 综合交通与区域经济[M]: 北京: 中国铁道出版社, 1995
[156] 杨浩, 何世伟. 铁路运输组织学[M]: 北京: 中国铁道出版社, 2001
[157] 杨杰, 陈建文, 尹群等. 关于整数线性规划代理对偶间隙的注记[J]: 系统工程理论与实践, 2002, (9): 70-73
[158] 王鑫, 秦四平. 发展我国铁路快速货物运输体系的构想[J]: 铁道货运, 2003, (6): 17-19
[159] 叶耀华, 蒋怡乐, 王律. 一种省际邮件转运网络设计的模型与算法[J]: 复旦学报(自然科学版), 2003, 42(5): 680-684
[160] 叶耀华, 钟嵬, 朱屹容. 一种市内邮件转运问题的模型与算法[J]: 运筹学学报, 1998, 2(4): 91-94
[161] 张建中, 许绍吉. 线性规划[M]: 北京: 科学出版社, 1999
[162] 张迎, 费奇. 多供需点带时间约束实时调运问题的启发式算法[J]: 计算机工程与应用, 2002, (11): 61-62
[163] 中铁行包快递有限责任公司. 中铁行包物流基地建设规划实施方案[R]: 2005
[164] 中铁行包快递有限责任公司. 中铁行包关于加快市场化进程的报告[R]: 2005
[165] 中铁行包快递有限责任公司. 1980 至 2004 年国家铁路行包运输统计[G]: 2005
[166] 中铁行包快递有限责任公司. 中铁行包快递有限责任公司年鉴[G]: 2005
[167] 朱道立. 大系统优化理论与应用[M]: 上海: 上海交通大学出版社, 1987
[168] 朱松年, 曹家明, 赵强等. 车流组织综合优化[J]: 铁道学报, 1993, 15(3): 59-69