运能释放条件下铁路既有繁忙干线货运产品布局规划理论与方法研究
|
摘要
随着既有繁忙干线运能的释放,我国铁路运输的格局将由运能紧张型向运能宽松型转变,这为铁路货运产品的布局规划提供了难得的契机。同时产业结构的逐步调整,也导致快捷货运及高附加值运输需求量的急剧增长。由于先前铁路运能的制约,铁路货运产品主要以满足大宗物资、低附加值运输需求为主,难以形成对高附加值运输需求的吸引力,导致了铁路在运输市场的占有率逐年降低,铁路运输在货运市场的竞争力也逐步减弱。因此在铁路运力释放的背景下,也迫切需要对货运产品的布局规划问题进行研究,以提高铁路运输的竞争力与经济效率。本文针对运力释放后货运产品布局规划问题展开研究,从而为铁路运营者制定货运产品布局规划方案提供一定的理论依据。
本文主要研究内容包括以下几个部分：
(1)研究了既有繁忙干线货运产品相关的基础理论。包括铁路货运的供需特征分析、铁路货运产品布局的定义；分析影响铁路货运产品的布局的因素以及铁路货运产品布局的原则。为增加铁路货运产品布局方案的合理性,在现有货运产品开行结构的基础上,结合供需特征给出了铁路货运产品调整策略。
(2)研究了既有繁忙干线基于货运产品的流量分配问题。根据货运产品的开行方案,借鉴节点拆分的思路描述货运产品的节点作业,构建了繁忙干线铁路货运产品网络。在网络构建的基础上,分析现有路径搜索算法的不足,提出了OD对合理径路集合的求解方法,在充分考虑运输需求特征基础上,以运输费用最小为优化目标,构建了既有繁忙干线基于货运产品的流量分配模型。根据模型的特点,给出了ILOG CPLEX动态求解算法和免疫克隆算法两种求解方法,并通过算例对模型和算法进行验证,结果表明,文中给出的求解算法能够获得全局最优解。
(3)研究了既有繁忙干线货运产品布局规划问题。提出了货运产品布局规划的流程,并对货运产品布局规划问题进行了范围界定。结合货运供需特点、区位等因素,给出了铁路货运产品备选集合的生成策略。通过引入货运产品备选集合,简化了模型的形式；在此基础上以运输收益最大化为目标,充分考虑了铁路货运需求层次特征构建了既有繁忙干线铁路货运产品布局规划模型,给出了基于反馈的免疫克隆算法及和声搜索算法两种求解方法。并通过算例对模型和算法求解效率进行验证,结果表明两种算法各具有其特点,应根据对求解质量及求解时间的要求选择合适的方法。
(4)在研究内容(3)的基础上进行一定扩展,研究了铁路货运产品与车站协同布局优化问题。分析了车站布局与货运产品间的相互关系,重点阐述了货运产品结构对车站布局的影响,并构建了综合考虑货运站的铁路货运产品网络。在车站布局规划中通过货运站预分配策略,缩小了问题的求解规模。在此基础上重点针对多分配布局模式,构建了铁路货运产品与车站协同布局模型,最后利用基于反馈的免疫克隆算法及和声搜索算法对模型进行求解。
(5)在研究内容(3)的基础上,研究市场竞争条件下货运产品的布局规划问题。分析了影响运输方式竞争力的因素。给出了货运需求价格敏感度的计算方法,考虑货运产品、价格敏感度以及货主偏好度三个因素,构建了运输方式的分担率模型。在此基础上采用两阶段模型描述市场竞争条件下货运产品布局规划问题,结合两阶段模型分析运能充足条件下铁路最优运价问题,得到了影响铁路运价的主要因素。并根据模型的特点采用两阶段启发式求解算法。最后通过算例对模型和算法进行验证分析。并对部分参数进行灵敏度分析,分析不同情景下铁路运价和市场占有率的变化。
With the transport capacity released of busy truck line, the transportation structure of railway is changed from situation of transport capacity shortage to situation of transport capacity surplus, which is provides an opportunity to cargo products layout adjustment. Meantime, the structure of transport demand has changed due to industrial structure adjustment. The demand for express and high additional value transport increase rapidly. While the tradition cargo products for railway main satisfy large-quantity and low additional value cargoes transportation, which have no attraction to the high additional value transport. Therefore, the market share ration for railway is decreased year by year. The cargo products can not adapt the structure and characteristics of cargo market. So it is the urgent need to adjust the cargo products layout of railway under the environment of transport capacity released, which is benefit to improve competitiveness and economic benefit of railway. This paper research on plan for cargo products layout of railway, and it is provide theoretical basis to make cargo products layout plan for railway operators. The main contents of this paper include:
(1) The basic theory for cargo products layout for busy truck railway line is analyzed, including the characteristics of supply and demand for railway cargo transportation, the definition of cargo products layout, analysis of influence factor and Principles for cargo products layout.in order to improve the reasonableness of cargo products plan, the adjustment strategy on the current cargo products plan.
(2) The problem of flow assignment based on the cargo products for busy truck line is investigated., the cargo products network based on the operation plan of cargo products is built by the way of nodes splitting. Based on this network, the flow assignment model for busy truck line, which takes demand characteristics and generalized cost into consideration, is built. The solution of ILOG CPLEX and Immune Clone algorithm is proposed according to model features analysis. And one case is presented to test the feasibility and efficiency of solution strategy. The result shows that the algorithm can obtain the global optimum of this problem.
(3) Cargo products layout problem for busy truck line is investigated. And the procedure for plan of cargo products layout is proposed. Meantime, the research scope is defined for cargo products layout of this paper focused on. The generation strategy of alternative set for cargo products of railway is provided, which take supply and demand feature and locational factor and so on into consideration. By construction the cargo products alternative set, the model can be simply. On the construction alternative set, the cargo products layout model for busy truck line, which takes hierarchy of demand and transport revenue into consideration, is built. And the solutions of improved immune clone algorithm, harmony search algorithm are presented. And the case is used to test the model and solution. The test shows that the algorithms have different applicable scope, and the reasonable algorithm is choose by scale of the problem and computation time
(4) Based on the content (3), the collaborative optimization for cargo products and station layout is investigated. The relation between station layout and cargo products is analyzed. Cargo product effect on station layout is elaborated. And the cargo products network taking the freight station is built, according to the station preallocation strategy, the problem scale is reduced. The collaborative optimization model for cargo products and station layout is presented. The reasonable cargo product layout and the station layout plan under the cargo products plan are got. At last, the solution of immune clone algorithm and harmony search algorithm are also presented to solve the model.
(5)The problem of cargo products layout plan under the position of competitive market is analyzed. This is the extension of content (3). And influence factors for competitiveness of transport modes. Meantime, calculation method of price sensitivity for transportation demand is presented. And the rate sharing model which takes cargo products, price sensitivity and preference degree of shipper into consideration is proposed. The two-stage model is used to describe the problem of cargo products layout plan under the position of competitive market. And the optimization price for railway is got under assumption of not considering the railway capacity.Then the influence factors of railway price is got. And the two steps heuristic algorithm is used to solve the model.at last a case is used to test the model and algorithm. The way of sensitivity analysis for some parameters are used to analyze the railway price and market sharing rate under different scenarios
本文主要研究内容包括以下几个部分：
(1)研究了既有繁忙干线货运产品相关的基础理论。包括铁路货运的供需特征分析、铁路货运产品布局的定义；分析影响铁路货运产品的布局的因素以及铁路货运产品布局的原则。为增加铁路货运产品布局方案的合理性,在现有货运产品开行结构的基础上,结合供需特征给出了铁路货运产品调整策略。
(2)研究了既有繁忙干线基于货运产品的流量分配问题。根据货运产品的开行方案,借鉴节点拆分的思路描述货运产品的节点作业,构建了繁忙干线铁路货运产品网络。在网络构建的基础上,分析现有路径搜索算法的不足,提出了OD对合理径路集合的求解方法,在充分考虑运输需求特征基础上,以运输费用最小为优化目标,构建了既有繁忙干线基于货运产品的流量分配模型。根据模型的特点,给出了ILOG CPLEX动态求解算法和免疫克隆算法两种求解方法,并通过算例对模型和算法进行验证,结果表明,文中给出的求解算法能够获得全局最优解。
(3)研究了既有繁忙干线货运产品布局规划问题。提出了货运产品布局规划的流程,并对货运产品布局规划问题进行了范围界定。结合货运供需特点、区位等因素,给出了铁路货运产品备选集合的生成策略。通过引入货运产品备选集合,简化了模型的形式；在此基础上以运输收益最大化为目标,充分考虑了铁路货运需求层次特征构建了既有繁忙干线铁路货运产品布局规划模型,给出了基于反馈的免疫克隆算法及和声搜索算法两种求解方法。并通过算例对模型和算法求解效率进行验证,结果表明两种算法各具有其特点,应根据对求解质量及求解时间的要求选择合适的方法。
(4)在研究内容(3)的基础上进行一定扩展,研究了铁路货运产品与车站协同布局优化问题。分析了车站布局与货运产品间的相互关系,重点阐述了货运产品结构对车站布局的影响,并构建了综合考虑货运站的铁路货运产品网络。在车站布局规划中通过货运站预分配策略,缩小了问题的求解规模。在此基础上重点针对多分配布局模式,构建了铁路货运产品与车站协同布局模型,最后利用基于反馈的免疫克隆算法及和声搜索算法对模型进行求解。
(5)在研究内容(3)的基础上,研究市场竞争条件下货运产品的布局规划问题。分析了影响运输方式竞争力的因素。给出了货运需求价格敏感度的计算方法,考虑货运产品、价格敏感度以及货主偏好度三个因素,构建了运输方式的分担率模型。在此基础上采用两阶段模型描述市场竞争条件下货运产品布局规划问题,结合两阶段模型分析运能充足条件下铁路最优运价问题,得到了影响铁路运价的主要因素。并根据模型的特点采用两阶段启发式求解算法。最后通过算例对模型和算法进行验证分析。并对部分参数进行灵敏度分析,分析不同情景下铁路运价和市场占有率的变化。
With the transport capacity released of busy truck line, the transportation structure of railway is changed from situation of transport capacity shortage to situation of transport capacity surplus, which is provides an opportunity to cargo products layout adjustment. Meantime, the structure of transport demand has changed due to industrial structure adjustment. The demand for express and high additional value transport increase rapidly. While the tradition cargo products for railway main satisfy large-quantity and low additional value cargoes transportation, which have no attraction to the high additional value transport. Therefore, the market share ration for railway is decreased year by year. The cargo products can not adapt the structure and characteristics of cargo market. So it is the urgent need to adjust the cargo products layout of railway under the environment of transport capacity released, which is benefit to improve competitiveness and economic benefit of railway. This paper research on plan for cargo products layout of railway, and it is provide theoretical basis to make cargo products layout plan for railway operators. The main contents of this paper include:
(1) The basic theory for cargo products layout for busy truck railway line is analyzed, including the characteristics of supply and demand for railway cargo transportation, the definition of cargo products layout, analysis of influence factor and Principles for cargo products layout.in order to improve the reasonableness of cargo products plan, the adjustment strategy on the current cargo products plan.
(2) The problem of flow assignment based on the cargo products for busy truck line is investigated., the cargo products network based on the operation plan of cargo products is built by the way of nodes splitting. Based on this network, the flow assignment model for busy truck line, which takes demand characteristics and generalized cost into consideration, is built. The solution of ILOG CPLEX and Immune Clone algorithm is proposed according to model features analysis. And one case is presented to test the feasibility and efficiency of solution strategy. The result shows that the algorithm can obtain the global optimum of this problem.
(3) Cargo products layout problem for busy truck line is investigated. And the procedure for plan of cargo products layout is proposed. Meantime, the research scope is defined for cargo products layout of this paper focused on. The generation strategy of alternative set for cargo products of railway is provided, which take supply and demand feature and locational factor and so on into consideration. By construction the cargo products alternative set, the model can be simply. On the construction alternative set, the cargo products layout model for busy truck line, which takes hierarchy of demand and transport revenue into consideration, is built. And the solutions of improved immune clone algorithm, harmony search algorithm are presented. And the case is used to test the model and solution. The test shows that the algorithms have different applicable scope, and the reasonable algorithm is choose by scale of the problem and computation time
(4) Based on the content (3), the collaborative optimization for cargo products and station layout is investigated. The relation between station layout and cargo products is analyzed. Cargo product effect on station layout is elaborated. And the cargo products network taking the freight station is built, according to the station preallocation strategy, the problem scale is reduced. The collaborative optimization model for cargo products and station layout is presented. The reasonable cargo product layout and the station layout plan under the cargo products plan are got. At last, the solution of immune clone algorithm and harmony search algorithm are also presented to solve the model.
(5)The problem of cargo products layout plan under the position of competitive market is analyzed. This is the extension of content (3). And influence factors for competitiveness of transport modes. Meantime, calculation method of price sensitivity for transportation demand is presented. And the rate sharing model which takes cargo products, price sensitivity and preference degree of shipper into consideration is proposed. The two-stage model is used to describe the problem of cargo products layout plan under the position of competitive market. And the optimization price for railway is got under assumption of not considering the railway capacity.Then the influence factors of railway price is got. And the two steps heuristic algorithm is used to solve the model.at last a case is used to test the model and algorithm. The way of sensitivity analysis for some parameters are used to analyze the railway price and market sharing rate under different scenarios
引文
[1]郭玉华.高速铁路发展与中国铁路货运[J].铁道经济研究,2010,(6)：27-31.
[2]高小殉.铁路运输产品的物品属性及供给分析[J].兰州交通大学学报,2011,30(5)：85-88.
[3]J. Guelat, M.Florian, T.G Crainic. GA multimode multiproduct network assignment model for strategic planning of freight flows[J]. Transportation Science,1990,24(1):25-39.
[4]Reddy VR, Kasilingam R.G. Intermodal transportation considering transfer costs[C]. Proce--edings of the 1995 Global Trends Conference of the Academy of business Administration. Aruba,1995.
[5]RK Cheung, B Muralidharan.Dynamic routing for priority shipments in LTL service networks [J]. Transportation Science,2000,34(1):86-96.
[6]A Ziliaskopoulos, W Wardell.An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays [J]. European Journal of Operational Research,2000, 125(3):486-502.
[7]Cheng-Chang Lin.The freight routing problem of time-definite freight delivery common carriers [J]. Transportation Research Part B,,2001,35525-547.
[8]A Lozano, G Storchi.Shortest viable path algorithm in multimodal networks [J]. Transportation Research Part A,2001, (35):225-241.
[9]KR Smilowitz, A Atamtiirk, CF Daganzo.Deferred item and vehicle muting within integrated networks [J]. Transportation Research E,2003,39(4):305-323.
[10]M Park. Capacity modeling for multimodal freight transportation networks [D]. Irvine:University of California,2005.
[11]TS Chang.Best routes selection in international intermodal networks [J]. Computers & Operations Research,2008,35(9):2877-2891.
[12]Y Gao, YC Chiu. Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems[C]. Thel4th of Intelligent Transportation Systems (ITSC) Washington, DC,2011:728-733.
[13]Y Deng, H Tong.Dynamic Shortest Path Algorithm in Stochastic Traffic Networks Using PSO Based on Fluid Neural Network [J]. Journal of Intelligent Learning Systems and Applications,2011, (3): 11-16.
[14]JJ Jarvis, OM Martinez. A sensitivity analysis of multicommodity network flows[J]. Transportation Science,1977,11(4):299-306.
[15]TG Crainic, M Florian, JE Leal.A multimode multiproduct network assignment model for strategic planning of freight flows [J]. Transportation Science,1990,24(1):25-39.
[16]CJ Eatough, SC Brich, MJ Demetsky. A methodology for statewide intermodal freight transportation planning [M]. Virginia:Virginia Transportation Research Council,1998.
[17]T.Aykin.Lagrangian Relaxation Based Approaches to Capacitated Hub-and-Spoke Network Design Problem [J].European Journal of Operational Research,1994,79(3):501-523.
[18]TG Crainic, JM Rousseau.Multicommodity, multimode freight transportation:a general modeling and algorithmic framework for the service network design problem [J]. Transportation Research Part B: Methodological,1986,20(3):225-242.
[19]M Minoux.Network synthesis and optimum network design problems:models, solution methods and applications [J]. Networks,1989,19(3):313-360.
[20]LK Nozick, EK Morlok.A model for medium-term operations planning in an intermodal rail-truck service [J]. Transportation Research Part A:Policy and Practice,1997,31(2):91-107.
[21]SJ Jeong, CG Lee, JH Bookbinder.The European freight railway system as a hub-and-spoke network [J]. Transportation Research Part A:Policy and Practice,2007,41(6):523-536.
[22]CC Lin, SH Chen.An integral constrained generalized hub-and-spoke network design problem[J]. Transportation Research Part E:Logistics and Transportation Review,2008,44(6):986-1003.
[23]J Andersen,M Christiansen,TG Crainic.Branch-and-price for service network design with asset management constraints[J].Transportation Science,2011,45(1):33-39.
[24]MB Pedersen,TG Crainic.Models and tabu search metaheuristics for service network design with asset-balance requirements[J].Transportation Science,2009,43(2):159-177.
[25]N Teypaz,S Schrenk,VD Cung.A decomposition scheme for large-scale Service Network Design with asset management[J]. Transportation Research Part E:Logistics and Transportation Review,2010, 46(1):156-170.
[26]M Yaghini, R Akhavan. Multicommodity network design problem in rai freight transportation planning[C].the 8th of international conference on traffic and transportition studies Changsha, China, 2012:728-739.
[27]JR Current,CS ReVelle,JL Cohon.The hierarchical network design problem [J].European Journal of Operational Research,1986,27(1):57-66.
[28]TG. Crainic,G Laporte.Planning models for freight transportation[J]. European journal of Operation research,1997,97(3):409-438.
[29]AEM Cohn.Composite-variable modeling for large-scale problems in transportation and logistics[D]. Cambridge:Massachusetts Institute of Technology,2002.
[30]AP Armacost, C Barnhart. Composite variable formulations for express shipment service network design [J]. Transportation Science,2002,36(1):1-20.
[31]CC Lin, SH Chen.The hierarchical network design problem for time-definite express common carriers [J]. Transportation Research Part B,2003,38(3):271-283.
[32]TG Crainic.Service network design in freight transportation [J]. European Journal of Operational Research,2000,122(2):272-288.
[33]LC Dall'Orto, TG Crainic, JE Leal,WB Powell.The single-node dynamic service scheduling and dispatching problem[J]. European Journal of Operational Research,2006,170(1):1-23.
[34]E.D Zhu.Scheduled Service Network Design for Integrated Planning of Rail Freight Transportation[D]. Canada:Universite de Montreal,2011.
[35]WB Powell,Y Sheffi.Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry[J]. Operations Research,1989,37(1):12-29.
[36]D Kim,C Barnhart,K Ware.Multimodal express package delivery:a service network design application[J]. Transportation Science,1990,33(4):391-407.
[37]K Budenbender,T Grunert.A hybrid tabu search/branch and bound algorithm for the direct flight network design problem[J]. Transportation Science,2000,34(4):364-380.
[38]MF Lai, HK Lo.Ferry service network design:optimal fleet size, routing, and scheduling [J]. Transportation Research Part A:Policy and Practice,2004,38(4):305-328.
[39]RK Cheung, WB Powell.An algorithm for multistage dynamic network with random arc capacities, with an application to dynamic fleet management [J]. Operation Research,1996,44(6):951-963.
[40]A Nicholson, ZP Du.Degradable transportation systems:an integrated equilibrium model [J]. Transportation Research Part B,1997,31(3):209-224.
[41]GA Godfrey, WB Powell.An adaptive dynamic programming algorithm for dynamic fleet management: Single period travel times [J]. Transportation Science,2002,36(1):21-39.
[42]MGH Bell,C Cassir.Risk-averse user equilibrium traffic assignment:an application of game theory[J]. Transportation Research Part B,2002,36(8):671-681.
[43]BK Thapalia,TG Crainic, M Kaut, SW Wallace.Single-commodity network design with random edge capacities[J]. European Journal of Operational Research,2012,220(2):394-403.
[44]Krishna C.Jha, Ravindra K. Ahuja, Guvenc. New approaches for solving the block-to-train assignment problem[J]. Networks,2008,51(1):48-62.
[45]A.A. Assad. A Class of Train-Scheduling Problems[J]. Transportation Science,1982,16(3):281-310.
[46]Harry N.Newton,Cynthia Barnhart, Pamela H.Vance.Constructing Railroad Blocking Plans to Minimize Handling Costs [J]. Transportation Science,1998,32(4):330-345.
[47]C Barnhart,H Jin,PH Vance.Railroad blocking:A network design application[J].Operations Research. 48(4):603-614.
[48]RK Ahuja,K.Jha,J Liu.Solving real-life railroad blocking problems[J].Interfaces,2007,37(5):404-419.
[49]M Yaghini, A Foroughi, B Nadjari. Solving railroad blocking problem using ant colony optimization algorithm [J]. Applied Mathematical Modelling,2011,35(12):5579-5591.
[50]M Yaghini, M Seyedabadi, MM Khoshraftar. A population-based algorithm for the railroad blocking problem[J]. Journal of Industrial Engineering International,2012,8(1):1-11.
[51]AA.Assad.Modelling of Rail Networks:toward A Routing/Makeup Model [J]. Transportation Research Part B,1980,14(1-2):101-114.
[52]T.G.Crainic, JA Ferland. A Tactical Planning Model for Rail Freight Transportation[J]. Transportation Science,1984,18(2):165-184.
[53]A Marin, J Salmeron. Tactical design of rail freight network. Part Ⅰ:Exact and heuristic methods[J]. European journal of operational research,1996,90(5):26-44.
[54]A Marin, J Salmeron. Tactical design of rail freight networks. Part Ⅱ:Local search methods with statistical analysis[J]. European journal of operational research,1996,94(1):43-53.
[55]朱顺应,王炜,邓卫.交通网络可靠度及其通路算法研究[J].中国公路学报,2000,13(1)：92-94.
[56]林柏梁,张运河,梁栋.优化多式联运问题的一种广义最短路方法研究[J].铁道学报,2006,28(4)：22-26.
[57]李军,魏航,刘凝子.一种求解时变网络下多式联运最短路的算法[J].中国管理科学,2006,14(4)：56-61.
[58]肖天国,符卓.基于遗传算法的联合运输路径优化[J]中国科技论文在线,2008,10：720-724.
[59]魏航.时变随机网络下有时间窗的有害物品运输路径选择研究[J].中国管理科学,2009,17(3)：93-100.
[60]马昌喜,广晓平,吴芳.发达运输网络环境下危险品公路运输路径决策[J].交通运输系统工程与信息,2009,9(4)：134-139.
[61]康凯,牛海姣,朱越杰.多式联运中运输方式与运输路径集成优化模型研究[J].计算机应用研究,2010,(5)：1672-1675.
[62]佟璐,聂磊,付慧伶.多式联运路径优化模型与方法研究[J].物流技术,2010,29(5)：57-60.
[63]刘杰,何世伟,宋瑞.基于运输方式备选集的多式联运动态路径优化研究[J].铁道学报,2011,33(10)：1-6.
[64]苏明.基于运输合理化理论的多式联运方案决策研究[D].长沙：中南大学,2011.
[65]王清斌,韩增霞,计明军.基于节点作业随机特征的集装箱多式联运路径优化[J].交通运输系统工程与信息,2011,11(6)：137-144.
[66]查伟雄,孙敬.基于模拟退火算法的危险货物道路运输路径优化双层规划模型[J].公路交通科技,2012,29(4)：101-106.
[67]李炳林.基于路网服务水平的路网容量研究[D].长沙：长沙理工大学,2008.
[68]彭宏勤,陈绍宽,刘爽.综合运输网络多方式分层分配模型研究[J].交通运输系统工程与信息,2009,9(6)：130-135.
[69]王保华,何世伟,宋瑞.综合运输体系下快捷货运网络流量分配优化模型及算法[J].铁道学报,2009,31(2)：12-16.
[70]申永生,何世伟,王保华.综合运输体系货运流量分配与网络综合优化[J].综合运输,2010,12：49-52.
[71]王保华.综合运输体系下快捷货物运输网络资源配置优化研究[D].北京：北京交通大学,2010.
[72]范东涛,吴明,李旭宏.基于虚拟滚动法的苏南地区综合运输结构优化分析[J].交通运输系统工程与信息,2011,11(1)：32-37.
[73]时岩.多式联运运输方式组合优化模型研究[J].科技信息,2011,14：131-132.
[74]周晓,张锦,张菲.基于变权的多目标物流网络货流分配方法[J].西南交通大学学报,2012,47(1)：151-157.
[75]雷中林.铁路路网系统运输能力理论与计算方法研究[D].北京：北京交通大学,2006.
[76]乔国会.铁路网车流优化分配模型研究与综合算例分析[D]J北京：北京交通大学,2008.
[77]苏顺虎,陈治亚,何世伟.基于服务水平的铁路货物运输网络能力计算方法[J].中国铁道科学,2009,30(2)：113-118.
[78]纪丽君,林柏梁,乔国会.基于多商品流模型的铁路网车流分配和径路优化模型[J].中国铁道科学,2011,32(03)：107-110.
[79]田亚明,林柏梁,纪丽君.基于多商品流和虚拟弧的铁路车流分配点-弧、弧-路模型研究[J].铁道学报,2011,4：7-12.
[80]赵钢.对开行铁路集装箱中转“五定”班列的思考[J].铁道货运,2005,9：18-21.
[81]郭菲.铁路集装箱物流中心之间集装箱班列运输组织研究[D].北京：北京交通大学,2008.
[82]王莹,李尔涛,刘军.基于服务网络设计的“五定”班列开行方案优化方法研究[J].物流技术,2009,28(2)：106-108.
[83]王艳玲,赵明估,郎茂祥.铁路物流中心及集装箱专办站间班列开行方案的研究[J].物流技术,2009,28(11)：95-98.
[84]柴甜甜,王慈光,杜连涛.集装箱中心站和专办站班列开行方案研究[J].铁道货运,2010,4：43-47.
[85]刘竹芃.京沪双层集装箱班列运输的研究与分析[J]中国铁路,2011,11：9-11.
[86]李种宇.我国铁路集装箱班列经营及货源组织的探讨[J].铁道货运,201 1,1：27-31.
[87]强丽霞,喻乐.客运专线本线运输产品设计与列车开行方案研究[J].北京交通大学学报,2008,32(03)：11-15.
[88]何婷,何世伟,黎浩东.铁路货物运输产品形式及其组织形态研究[J].物流技术,2009,(07)：23-25.
[89]李海鹰,蒋熙.敏捷化铁路货物运输产品开发方法研究[J].物流技术,2009,28(12)：27-29.
[90]金苗.旅客运输产品设计的理论与方法研究[D].西安：长安大学,2010.
[91]何婷.客货分线运输条件F铁路货运市场营销战略研究[D].北京：北京交通大学,2010.
[92]常湃.铁路物流中心间运输产品设计及运输组织优化研究[D].北京：北京交通大学,2011.
[93]张晓洁.铁路集装箱运输产品优化配置研究[D].北京：北京交通大学,2011.
[94]张璐.客货分线条件下的铁路快捷运输产品设计方法研究[J].物流技术,2012,31(1)：86-88.
[95]黄民,薛秀懿,刘卫华.始发直达列车开行方案的优化[J].中国铁道科学,1990,11(2)：99-102.
[96]林柏梁,朱松年,史耀德,何世伟.装车地直达列车编组计划的优化模型[J].1995,15(2)：108-114.
[97]熊琴.装车地直达列车编组计划近似优化研究[D].北京：北京交通大学,2006.
[98]曹学明,林柏梁,严贺祥.装车地直达列车开行方案优化模型[J].铁道学报,2006,28(4)：6-11.
[99]范振平,林柏梁,牛会想.装车地始发直达开行方案研究[J].物流技术,2007,27(6)：77-80.
[100]纪丽君.基于物流成本的装车地车流组织优化方法研究[J].北京：北京交通大学,2008.
[101]史峰,李致中,孙焰,胡建华.列车编组计划网络优化方法[J].铁道学报,1994,16(2)：74-79.
[102]查伟雄,熊桂林,张广.洲.列车编组计划模型及其计算策略[J].长沙铁道学院学报,2001,19(4)：27-30.
[103]梁栋,林柏梁.技术站分组列车编组计划的优化理论及模型研究[J].铁道学报,2006,28(3)：1-5.
[104]许红,马建军,龙昭.技术站单组列车编组方案模型与计算方法的研究[J].铁道学报,2006,28(3)：12-17.
[105]杨希流.关于铁路列车编组计划优化问题的探讨[J].铁道运输与经济,2009,31(10)：11-13.
[106]林柏梁,田亚明,王志美.基于最远站法则的列车编组计划优化双层规划模型[J].中国铁道科学,2011,32(5)：108-113.
[107]严余松,唐莉,严余伟,罗平.枢纽小运转列车0-1规划模型及其遗传算法[J].系统工程,2000,18(6)：67-70.
[108]严余松,朱松年,杜文.枢纽小运转列车运行组织的网络流优化模型[J].西南交通大学学报,2011,36(2)：117-120.
[109]徐行方,肖继龙.区段管内车流组织的优化[J].上海铁道大学学报,2000,21(12)：75-78,103.
[110]牛惠民,胡安洲.铁路枢纽车流组织的非线性0-1规划模型及算法[J].铁道学报,2011,23(3)：8-12.
[111]史峰,莫辉辉,黎新华,秦进.区段管内车流组织优化方法[J].交通工程学报,2003,3(2)：84-87.
[112]林柏梁,朱松年.路网上车流径路与列车编组计划的整体优化[J].铁道学报,1996,18(1)：1-7.
[113]李宵寅.基于不确定参数的列车编组计划与车流径路综合优化研究[D].成都：西南交通大学,2011.
[114]陈崇双,王慈光,薛锋,左大杰.货物列车编组计划国内外研究综述[J].铁道学报,2012,34(2)：8-20.
[115]陶维号.运输服务产品整体概念浅析[J].综合运输,1999,(7)：15-16.
[116]黄志刚,荣朝和.交通区位性能与大型铁路客站对交通资源的整合作用[J].铁道学报,2011,33(6)：8-11.
[117]蒋丽丽.开发与市场需求同步的铁路货运产品[J].铁道货运,2007,(3)：14-16.
[118]尹东.客货分线后我国东部地区铁路运输组织创新策略研究[D].北京：北京交通大学,2011.
[119]黄志鹏.客货分线条件下铁路货运产品的设计[D].兰州：兰州交通大学,2011.
[120]孙启鹏,吴群琪,张圣忠,邹海波.运输需求的本质及特征分析[J].综合运输,2007,8：17-20.
[121]郭玉华.中国铁路货运营销理论与发展[D].长沙：中南大学,2011.
[122]中永生.综合运输体系下货运服务网络设计优化问题的研究[D].北京：北京交通大学,2012.
[123]YS Shen,SW He,MR Mu.Traffic distribution model of freight service network based on integrated transport system[J]. Advances in Electric and Electronics Lecture Notes in Electrical Engineering, 2012,155:555-562.
[124]佟璐,聂磊,付慧伶.基于复杂列车服务网络的客流分配方法研究[J].铁道学报,2012,34(10)：7-15
[125]聂磊,胡小风,佟璐,付慧伶.基于旅客列车开行方案的客流分配方法研究[J].交通运输系统.工程与信息,2011,11(3)：87-92.
[126]杨浩.铁路运输组织学[M].北京：中国铁道出版社,2006.
[127]J Guelat, M Florian, TG Crainic.A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows[J]. Transportation Science,1990,24(1):25-39.
[128]BF Russ,T Yamada,J Castro,H Yasukawa.Optimising the design of multimodal freight transport network in indonesia[J]. Journal of the Eastern Asia Society for Transportation Studies,2005, 62894-2907.
[129]余震江.基于最短路径Dijkstra算法的铁路客运中转径路优化研究[D].重庆：重庆大学,2008.
[130]PE Hart, NJ Nilsson, B Raphael.A formal basis for the heuristic determination of minimum cost paths in graphs [J]. IEEE Transaction System. Science. And Cybernetics,1968, SSC-4(2):100-107.
[131]柯文德,陈珂,李家兰.一种基A*算法的轮式机器人路径规划方法[J].广东石油化工学院学报,2012,22(1)：35-38.
[132]郭强.基于改进A*算法的仿生机器鱼全局路径规划[J].西华大学学报(自然科学版),2011,30(3)：34-37,56.
[133]方伟华.基A*算法和图遍历的烟草物流VRP的研究[J].计算机技术与发展,2011,21(12)：63-65,69.
[134]李作纬,王德利,王明婷,王大生.A*算法在运输线路优化中的应用[J].山东交通学院学报,2006,14(1)：40-42.
[135]梁高明.面向城市交通网络的A*算法优化与应用[J].计算技术与自动化,2012,31(2)：86-89.
[136]焦李成,杜海峰,刘芳.免疫优化计算、学习与识别[M].北京：科学出版社,2006.
[137]刘杰,何世伟,宋瑞,蒋金亮.综合运输体系下的货运网络能力计算[J].吉林大学学报(工学版),2012,42(2)：334-338.
[138]黄友锐.智能优化算法及其应用[M].北京：国防工业出版社,2008.
[139]刘娇娇,黎浩东,何世伟.客货分线条件下铁路货运产品布局优化研究[J].综合运输,2011,3：73-76.
[140]张曙光.中国铁路运输组织理论创新与实践[M].北京：中国铁道出版社,2009.
[141]杜欣,牛永涛,韩宝明.基于节点重要度的客运专线旅客列车开行方案[J].北京交通大学学报,2010,34(6)：5-10.
[142]胡列格,程立勤.基于节点重要度交通区位布局法的城市群公路网布局研究[J].铁道科学与工程学报,2008,5(1)：87-90.
[143]黄志刚,荣朝和.交通区位性能与大型铁路客站对交通资源的整合作用[J].铁道学报,2011,33(6)：8-13.
[144]贾强,晏克非,张宝玉,刘军.基于节点重要度与交通区位的公路运输枢纽布局研究[J].山东交通科技,2008,4：4-9.
[145]叶芳,袁振洲,李明华,苑静蕾.考虑交通区位的物流配送中心选址模型及求解[J].物流科技,2009,9：21-24.
[146]刘淑媛,刘莹.基于城市空间结构和交通区位分析的轨道交通线网布局方法研究[J].经济研究导刊2013,184(2)：73-77.
[147]孙琦.基于铁路货物运输作业过程的点线能力协调问题研究[D].北京：北京交通大学,2010.
[148]雍龙泉.和声搜索算法研究进展[J].计算机系统及应用.2011,20(7)：244-248.
[149]赵再兴.基于改进和声搜索算法的车辆路径规划问题[D].沈阳：沈阳大学,2011.
[150]刘杰.基于和声搜索算法的快递配送路径优化研究[J].陕西理工学院学报(自然科学版)[J].2013,29(5)：44-48.
[151]刘志敏,王爱虎,余高辉.改进和声算法在产业集群物流选址中的应用[J].工业工程与管理,2011,12(2)：12-17.
[152]武磊,潘全科,桑红燕,潘玉霞.求解零空闲流水线调度问题的和声搜索算法[J].2009,15(10)：1960-1967.
[153]赖志柱.和声搜索算法优化多时间窗多式联运运输方案[J].计算机应用.2013,33(9)：2640-2642,2693.
[154]黎浩东,何世伟,景云,王烁.考虑不同满轴约束的编组站阶段计划配流优化[J].铁道学报,2012,34(7)：10-17.
[155]Lee KS, Geem ZW. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice [J]. Computer Methods in Applied Mechanics and Engineering, 2005,194(36-38):3902-3933;
[156]Geem ZW. Optimal cost design of water distribution networks using harmony search[J]. Engineering Optimization,2006,38(3):259-280.
[157]MEO'Kelly.the location of interacting hub facilities [J].Transportation Science,1986,20(2):92-106.
[158]ME O'kelly.A quadratic integer problem for the location of interacting hub facilicities [J]. European journal of Operation research,1987,32(3):393-404.
[159]JF Campbell.Integer programming formulations of discrete hub location problems[J]. European Journal of Operational Research,1994,72(2):387-405.
[160]H Yaman.Allocation strategies in hub networks [J]. European Journal of Operational Research,2011, 2011(211):442-451.
[161]AT Ernst,H Hamacher,H Jiang.Uncapacitated single and multiple allocation p-hub center problems[J]. Computers & Operations Research,2009,36(7):2230-2241.
[162]BY Kara,BC Tansel.On the single-assignment p-hub center problem[J]. European Journal of Operational Research,2000,125(3):648-655.
[163]H Calik, SA Alumur, BY Kara, OE Karasan. Karasan.A tabu-search based heuristic for the hub covering problem over incomplete hub networks [J]. Computers & Operations Research,2009, 36(12):3088-3096.
[164]何世伟.综合交通枢纽规划理论与方法[M].北京：人民交通出版社,2012.
[165]黎浩东,何世伟,宋瑞.列车编组计划和技术站布局的综合优化[J].北京交通大学学报,2010,34(6)：30-34,39.
[166]陈林.基于Logit模型的成渝通道交通选择行为研究[D].成都：西南交通大学,2013.
[167]刘振,周溪召.巢式Logit模型在交通方式选择行为中的应用[J].上海海事大学学报,2006,27(3)：66-70.
[168]帅斌,林渝钧,种鹏云.基于Logit模型的城市低碳交通分担率研究[J].武汉理工大学学报(交通科学与工程版),2012,1：74-77.
[169]王孝之.基于Rank Logit及融合数据的城际交通方式选择研究[D].大连：大连理工大学,2012.
[170]王孝之,赵胜川,闫祯祯.基于Rank Logit模型对城际交通分担率的计算方法研究[J].交通运输系统工程与信息,2012,12(2)：137-143.
[171]谢如鹤,邱祝强,李庆云Logit模型在广深铁路客流分担率估算中的应用[J].中国铁道科学,2006,27(3)：111-115.
[172]胡文君,周溪召.基于交叉巢式Logit的多用户多模式随机用户均衡模型[J].中国公路学报,2012,25(4)：133-140.
[173]温凯歌.基于Logit模型的动态交通分配研究[D].西安：西北工业大学,2006.
[174]刘杰,何世伟,宋瑞.基于社会经济效益最大化的轨道交通票价优化[J].吉林大学学报(工学版), 2011,41(5)：1268-1272.
[175]何宇强,毛保华,陈团生,杨静.高速客运专线客流分担率模型及其应用研究[J].铁道学报,2006,28(3)：18-21.
[176]郭玉华,黄治华,张晓东.我国铁路罐式集装箱运量分担率研究[J].铁道运输与经济,2010,32(6)：9-13.
[177]A Liier-Villagra,V MarianovA competitive hub location and pricing problem[J].European Journal of Operational Research,2013,231(3):734-744.
[178]金安.LOGIT模型参数估计方法研究[J].交通运输系统工程与信息,2004,4(1)：71-75.
[179]王雷,高扬.蚁群算法在Logit模型参数标定中的应用[J].广东技术师范学院学报(自然科学),2009,9：16-19.
[180]M. Yaghini, M.R. Akhavan Kazemzadeh. A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design [J].International Journal of Industrial Engineering & Production Research,2012,23(2):91-100.
[181]SP Brooks,BJT Morgan-Optimization by simulated annealing[J]. Science,1983,220(4598):671-680.
[182]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法[J].中国公路学报,2006,19(4)：123-126.
[183]邓爱民,毛超,周彦霆.带软时间窗的集配货一体化VRP改进模拟退火算法优化研究[J].系统工程理论与实践,2009,29(5)：186-192.
[184]张波,叶家玮,胡郁葱.模拟退火算法在路径优化问题中的应用[J].中国公路学报,2004,17(1)：79-81.
[185]林柏梁,田亚明,王志美.基于最远站法则的列车编组计划优化双层规划模型[J].中国铁道科学,2011,32(5)：108-113.
[186]林柏梁,朱松年.优化编组计划的非线性0-1规划模型及模拟退火算法[J].铁道学报,1994,16(2)：61-66.
[187]张嘉敏,韩宝明.铁路列车占用车站股道时序优化研究[J].交通运输系统工程与信息,2011,11(3)：110-107.
[188]杨进,徐猛,高自友.求解连续网络设计问题的模拟退火算法灵敏度分析[J].交通运输系统工程与信息,2009,9(3)：64-69.
[189]孙杨.城市轨道交通新线投入运营下常规公交线网优化调整方法研究[D].北京：北京交通大学,2012.
[190]黎浩东.铁路编组站鲁棒阶段计划编制及调整研究[D],北京：北京交通大学,2012.
[191]何世伟.既有繁忙干线铁路货运组织及集疏运技术的研究[R].北京：北京交通大学,2012.
[192]高洪仁.哈尔滨南站能力提高研究[D].成都：西南交通大学,2008.
[2]高小殉.铁路运输产品的物品属性及供给分析[J].兰州交通大学学报,2011,30(5)：85-88.
[3]J. Guelat, M.Florian, T.G Crainic. GA multimode multiproduct network assignment model for strategic planning of freight flows[J]. Transportation Science,1990,24(1):25-39.
[4]Reddy VR, Kasilingam R.G. Intermodal transportation considering transfer costs[C]. Proce--edings of the 1995 Global Trends Conference of the Academy of business Administration. Aruba,1995.
[5]RK Cheung, B Muralidharan.Dynamic routing for priority shipments in LTL service networks [J]. Transportation Science,2000,34(1):86-96.
[6]A Ziliaskopoulos, W Wardell.An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays [J]. European Journal of Operational Research,2000, 125(3):486-502.
[7]Cheng-Chang Lin.The freight routing problem of time-definite freight delivery common carriers [J]. Transportation Research Part B,,2001,35525-547.
[8]A Lozano, G Storchi.Shortest viable path algorithm in multimodal networks [J]. Transportation Research Part A,2001, (35):225-241.
[9]KR Smilowitz, A Atamtiirk, CF Daganzo.Deferred item and vehicle muting within integrated networks [J]. Transportation Research E,2003,39(4):305-323.
[10]M Park. Capacity modeling for multimodal freight transportation networks [D]. Irvine:University of California,2005.
[11]TS Chang.Best routes selection in international intermodal networks [J]. Computers & Operations Research,2008,35(9):2877-2891.
[12]Y Gao, YC Chiu. Hierarchical time-dependent shortest path algorithm for dynamic traffic assignment systems[C]. Thel4th of Intelligent Transportation Systems (ITSC) Washington, DC,2011:728-733.
[13]Y Deng, H Tong.Dynamic Shortest Path Algorithm in Stochastic Traffic Networks Using PSO Based on Fluid Neural Network [J]. Journal of Intelligent Learning Systems and Applications,2011, (3): 11-16.
[14]JJ Jarvis, OM Martinez. A sensitivity analysis of multicommodity network flows[J]. Transportation Science,1977,11(4):299-306.
[15]TG Crainic, M Florian, JE Leal.A multimode multiproduct network assignment model for strategic planning of freight flows [J]. Transportation Science,1990,24(1):25-39.
[16]CJ Eatough, SC Brich, MJ Demetsky. A methodology for statewide intermodal freight transportation planning [M]. Virginia:Virginia Transportation Research Council,1998.
[17]T.Aykin.Lagrangian Relaxation Based Approaches to Capacitated Hub-and-Spoke Network Design Problem [J].European Journal of Operational Research,1994,79(3):501-523.
[18]TG Crainic, JM Rousseau.Multicommodity, multimode freight transportation:a general modeling and algorithmic framework for the service network design problem [J]. Transportation Research Part B: Methodological,1986,20(3):225-242.
[19]M Minoux.Network synthesis and optimum network design problems:models, solution methods and applications [J]. Networks,1989,19(3):313-360.
[20]LK Nozick, EK Morlok.A model for medium-term operations planning in an intermodal rail-truck service [J]. Transportation Research Part A:Policy and Practice,1997,31(2):91-107.
[21]SJ Jeong, CG Lee, JH Bookbinder.The European freight railway system as a hub-and-spoke network [J]. Transportation Research Part A:Policy and Practice,2007,41(6):523-536.
[22]CC Lin, SH Chen.An integral constrained generalized hub-and-spoke network design problem[J]. Transportation Research Part E:Logistics and Transportation Review,2008,44(6):986-1003.
[23]J Andersen,M Christiansen,TG Crainic.Branch-and-price for service network design with asset management constraints[J].Transportation Science,2011,45(1):33-39.
[24]MB Pedersen,TG Crainic.Models and tabu search metaheuristics for service network design with asset-balance requirements[J].Transportation Science,2009,43(2):159-177.
[25]N Teypaz,S Schrenk,VD Cung.A decomposition scheme for large-scale Service Network Design with asset management[J]. Transportation Research Part E:Logistics and Transportation Review,2010, 46(1):156-170.
[26]M Yaghini, R Akhavan. Multicommodity network design problem in rai freight transportation planning[C].the 8th of international conference on traffic and transportition studies Changsha, China, 2012:728-739.
[27]JR Current,CS ReVelle,JL Cohon.The hierarchical network design problem [J].European Journal of Operational Research,1986,27(1):57-66.
[28]TG. Crainic,G Laporte.Planning models for freight transportation[J]. European journal of Operation research,1997,97(3):409-438.
[29]AEM Cohn.Composite-variable modeling for large-scale problems in transportation and logistics[D]. Cambridge:Massachusetts Institute of Technology,2002.
[30]AP Armacost, C Barnhart. Composite variable formulations for express shipment service network design [J]. Transportation Science,2002,36(1):1-20.
[31]CC Lin, SH Chen.The hierarchical network design problem for time-definite express common carriers [J]. Transportation Research Part B,2003,38(3):271-283.
[32]TG Crainic.Service network design in freight transportation [J]. European Journal of Operational Research,2000,122(2):272-288.
[33]LC Dall'Orto, TG Crainic, JE Leal,WB Powell.The single-node dynamic service scheduling and dispatching problem[J]. European Journal of Operational Research,2006,170(1):1-23.
[34]E.D Zhu.Scheduled Service Network Design for Integrated Planning of Rail Freight Transportation[D]. Canada:Universite de Montreal,2011.
[35]WB Powell,Y Sheffi.Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry[J]. Operations Research,1989,37(1):12-29.
[36]D Kim,C Barnhart,K Ware.Multimodal express package delivery:a service network design application[J]. Transportation Science,1990,33(4):391-407.
[37]K Budenbender,T Grunert.A hybrid tabu search/branch and bound algorithm for the direct flight network design problem[J]. Transportation Science,2000,34(4):364-380.
[38]MF Lai, HK Lo.Ferry service network design:optimal fleet size, routing, and scheduling [J]. Transportation Research Part A:Policy and Practice,2004,38(4):305-328.
[39]RK Cheung, WB Powell.An algorithm for multistage dynamic network with random arc capacities, with an application to dynamic fleet management [J]. Operation Research,1996,44(6):951-963.
[40]A Nicholson, ZP Du.Degradable transportation systems:an integrated equilibrium model [J]. Transportation Research Part B,1997,31(3):209-224.
[41]GA Godfrey, WB Powell.An adaptive dynamic programming algorithm for dynamic fleet management: Single period travel times [J]. Transportation Science,2002,36(1):21-39.
[42]MGH Bell,C Cassir.Risk-averse user equilibrium traffic assignment:an application of game theory[J]. Transportation Research Part B,2002,36(8):671-681.
[43]BK Thapalia,TG Crainic, M Kaut, SW Wallace.Single-commodity network design with random edge capacities[J]. European Journal of Operational Research,2012,220(2):394-403.
[44]Krishna C.Jha, Ravindra K. Ahuja, Guvenc. New approaches for solving the block-to-train assignment problem[J]. Networks,2008,51(1):48-62.
[45]A.A. Assad. A Class of Train-Scheduling Problems[J]. Transportation Science,1982,16(3):281-310.
[46]Harry N.Newton,Cynthia Barnhart, Pamela H.Vance.Constructing Railroad Blocking Plans to Minimize Handling Costs [J]. Transportation Science,1998,32(4):330-345.
[47]C Barnhart,H Jin,PH Vance.Railroad blocking:A network design application[J].Operations Research. 48(4):603-614.
[48]RK Ahuja,K.Jha,J Liu.Solving real-life railroad blocking problems[J].Interfaces,2007,37(5):404-419.
[49]M Yaghini, A Foroughi, B Nadjari. Solving railroad blocking problem using ant colony optimization algorithm [J]. Applied Mathematical Modelling,2011,35(12):5579-5591.
[50]M Yaghini, M Seyedabadi, MM Khoshraftar. A population-based algorithm for the railroad blocking problem[J]. Journal of Industrial Engineering International,2012,8(1):1-11.
[51]AA.Assad.Modelling of Rail Networks:toward A Routing/Makeup Model [J]. Transportation Research Part B,1980,14(1-2):101-114.
[52]T.G.Crainic, JA Ferland. A Tactical Planning Model for Rail Freight Transportation[J]. Transportation Science,1984,18(2):165-184.
[53]A Marin, J Salmeron. Tactical design of rail freight network. Part Ⅰ:Exact and heuristic methods[J]. European journal of operational research,1996,90(5):26-44.
[54]A Marin, J Salmeron. Tactical design of rail freight networks. Part Ⅱ:Local search methods with statistical analysis[J]. European journal of operational research,1996,94(1):43-53.
[55]朱顺应,王炜,邓卫.交通网络可靠度及其通路算法研究[J].中国公路学报,2000,13(1)：92-94.
[56]林柏梁,张运河,梁栋.优化多式联运问题的一种广义最短路方法研究[J].铁道学报,2006,28(4)：22-26.
[57]李军,魏航,刘凝子.一种求解时变网络下多式联运最短路的算法[J].中国管理科学,2006,14(4)：56-61.
[58]肖天国,符卓.基于遗传算法的联合运输路径优化[J]中国科技论文在线,2008,10：720-724.
[59]魏航.时变随机网络下有时间窗的有害物品运输路径选择研究[J].中国管理科学,2009,17(3)：93-100.
[60]马昌喜,广晓平,吴芳.发达运输网络环境下危险品公路运输路径决策[J].交通运输系统工程与信息,2009,9(4)：134-139.
[61]康凯,牛海姣,朱越杰.多式联运中运输方式与运输路径集成优化模型研究[J].计算机应用研究,2010,(5)：1672-1675.
[62]佟璐,聂磊,付慧伶.多式联运路径优化模型与方法研究[J].物流技术,2010,29(5)：57-60.
[63]刘杰,何世伟,宋瑞.基于运输方式备选集的多式联运动态路径优化研究[J].铁道学报,2011,33(10)：1-6.
[64]苏明.基于运输合理化理论的多式联运方案决策研究[D].长沙：中南大学,2011.
[65]王清斌,韩增霞,计明军.基于节点作业随机特征的集装箱多式联运路径优化[J].交通运输系统工程与信息,2011,11(6)：137-144.
[66]查伟雄,孙敬.基于模拟退火算法的危险货物道路运输路径优化双层规划模型[J].公路交通科技,2012,29(4)：101-106.
[67]李炳林.基于路网服务水平的路网容量研究[D].长沙：长沙理工大学,2008.
[68]彭宏勤,陈绍宽,刘爽.综合运输网络多方式分层分配模型研究[J].交通运输系统工程与信息,2009,9(6)：130-135.
[69]王保华,何世伟,宋瑞.综合运输体系下快捷货运网络流量分配优化模型及算法[J].铁道学报,2009,31(2)：12-16.
[70]申永生,何世伟,王保华.综合运输体系货运流量分配与网络综合优化[J].综合运输,2010,12：49-52.
[71]王保华.综合运输体系下快捷货物运输网络资源配置优化研究[D].北京：北京交通大学,2010.
[72]范东涛,吴明,李旭宏.基于虚拟滚动法的苏南地区综合运输结构优化分析[J].交通运输系统工程与信息,2011,11(1)：32-37.
[73]时岩.多式联运运输方式组合优化模型研究[J].科技信息,2011,14：131-132.
[74]周晓,张锦,张菲.基于变权的多目标物流网络货流分配方法[J].西南交通大学学报,2012,47(1)：151-157.
[75]雷中林.铁路路网系统运输能力理论与计算方法研究[D].北京：北京交通大学,2006.
[76]乔国会.铁路网车流优化分配模型研究与综合算例分析[D]J北京：北京交通大学,2008.
[77]苏顺虎,陈治亚,何世伟.基于服务水平的铁路货物运输网络能力计算方法[J].中国铁道科学,2009,30(2)：113-118.
[78]纪丽君,林柏梁,乔国会.基于多商品流模型的铁路网车流分配和径路优化模型[J].中国铁道科学,2011,32(03)：107-110.
[79]田亚明,林柏梁,纪丽君.基于多商品流和虚拟弧的铁路车流分配点-弧、弧-路模型研究[J].铁道学报,2011,4：7-12.
[80]赵钢.对开行铁路集装箱中转“五定”班列的思考[J].铁道货运,2005,9：18-21.
[81]郭菲.铁路集装箱物流中心之间集装箱班列运输组织研究[D].北京：北京交通大学,2008.
[82]王莹,李尔涛,刘军.基于服务网络设计的“五定”班列开行方案优化方法研究[J].物流技术,2009,28(2)：106-108.
[83]王艳玲,赵明估,郎茂祥.铁路物流中心及集装箱专办站间班列开行方案的研究[J].物流技术,2009,28(11)：95-98.
[84]柴甜甜,王慈光,杜连涛.集装箱中心站和专办站班列开行方案研究[J].铁道货运,2010,4：43-47.
[85]刘竹芃.京沪双层集装箱班列运输的研究与分析[J]中国铁路,2011,11：9-11.
[86]李种宇.我国铁路集装箱班列经营及货源组织的探讨[J].铁道货运,201 1,1：27-31.
[87]强丽霞,喻乐.客运专线本线运输产品设计与列车开行方案研究[J].北京交通大学学报,2008,32(03)：11-15.
[88]何婷,何世伟,黎浩东.铁路货物运输产品形式及其组织形态研究[J].物流技术,2009,(07)：23-25.
[89]李海鹰,蒋熙.敏捷化铁路货物运输产品开发方法研究[J].物流技术,2009,28(12)：27-29.
[90]金苗.旅客运输产品设计的理论与方法研究[D].西安：长安大学,2010.
[91]何婷.客货分线运输条件F铁路货运市场营销战略研究[D].北京：北京交通大学,2010.
[92]常湃.铁路物流中心间运输产品设计及运输组织优化研究[D].北京：北京交通大学,2011.
[93]张晓洁.铁路集装箱运输产品优化配置研究[D].北京：北京交通大学,2011.
[94]张璐.客货分线条件下的铁路快捷运输产品设计方法研究[J].物流技术,2012,31(1)：86-88.
[95]黄民,薛秀懿,刘卫华.始发直达列车开行方案的优化[J].中国铁道科学,1990,11(2)：99-102.
[96]林柏梁,朱松年,史耀德,何世伟.装车地直达列车编组计划的优化模型[J].1995,15(2)：108-114.
[97]熊琴.装车地直达列车编组计划近似优化研究[D].北京：北京交通大学,2006.
[98]曹学明,林柏梁,严贺祥.装车地直达列车开行方案优化模型[J].铁道学报,2006,28(4)：6-11.
[99]范振平,林柏梁,牛会想.装车地始发直达开行方案研究[J].物流技术,2007,27(6)：77-80.
[100]纪丽君.基于物流成本的装车地车流组织优化方法研究[J].北京：北京交通大学,2008.
[101]史峰,李致中,孙焰,胡建华.列车编组计划网络优化方法[J].铁道学报,1994,16(2)：74-79.
[102]查伟雄,熊桂林,张广.洲.列车编组计划模型及其计算策略[J].长沙铁道学院学报,2001,19(4)：27-30.
[103]梁栋,林柏梁.技术站分组列车编组计划的优化理论及模型研究[J].铁道学报,2006,28(3)：1-5.
[104]许红,马建军,龙昭.技术站单组列车编组方案模型与计算方法的研究[J].铁道学报,2006,28(3)：12-17.
[105]杨希流.关于铁路列车编组计划优化问题的探讨[J].铁道运输与经济,2009,31(10)：11-13.
[106]林柏梁,田亚明,王志美.基于最远站法则的列车编组计划优化双层规划模型[J].中国铁道科学,2011,32(5)：108-113.
[107]严余松,唐莉,严余伟,罗平.枢纽小运转列车0-1规划模型及其遗传算法[J].系统工程,2000,18(6)：67-70.
[108]严余松,朱松年,杜文.枢纽小运转列车运行组织的网络流优化模型[J].西南交通大学学报,2011,36(2)：117-120.
[109]徐行方,肖继龙.区段管内车流组织的优化[J].上海铁道大学学报,2000,21(12)：75-78,103.
[110]牛惠民,胡安洲.铁路枢纽车流组织的非线性0-1规划模型及算法[J].铁道学报,2011,23(3)：8-12.
[111]史峰,莫辉辉,黎新华,秦进.区段管内车流组织优化方法[J].交通工程学报,2003,3(2)：84-87.
[112]林柏梁,朱松年.路网上车流径路与列车编组计划的整体优化[J].铁道学报,1996,18(1)：1-7.
[113]李宵寅.基于不确定参数的列车编组计划与车流径路综合优化研究[D].成都：西南交通大学,2011.
[114]陈崇双,王慈光,薛锋,左大杰.货物列车编组计划国内外研究综述[J].铁道学报,2012,34(2)：8-20.
[115]陶维号.运输服务产品整体概念浅析[J].综合运输,1999,(7)：15-16.
[116]黄志刚,荣朝和.交通区位性能与大型铁路客站对交通资源的整合作用[J].铁道学报,2011,33(6)：8-11.
[117]蒋丽丽.开发与市场需求同步的铁路货运产品[J].铁道货运,2007,(3)：14-16.
[118]尹东.客货分线后我国东部地区铁路运输组织创新策略研究[D].北京：北京交通大学,2011.
[119]黄志鹏.客货分线条件下铁路货运产品的设计[D].兰州：兰州交通大学,2011.
[120]孙启鹏,吴群琪,张圣忠,邹海波.运输需求的本质及特征分析[J].综合运输,2007,8：17-20.
[121]郭玉华.中国铁路货运营销理论与发展[D].长沙：中南大学,2011.
[122]中永生.综合运输体系下货运服务网络设计优化问题的研究[D].北京：北京交通大学,2012.
[123]YS Shen,SW He,MR Mu.Traffic distribution model of freight service network based on integrated transport system[J]. Advances in Electric and Electronics Lecture Notes in Electrical Engineering, 2012,155:555-562.
[124]佟璐,聂磊,付慧伶.基于复杂列车服务网络的客流分配方法研究[J].铁道学报,2012,34(10)：7-15
[125]聂磊,胡小风,佟璐,付慧伶.基于旅客列车开行方案的客流分配方法研究[J].交通运输系统.工程与信息,2011,11(3)：87-92.
[126]杨浩.铁路运输组织学[M].北京：中国铁道出版社,2006.
[127]J Guelat, M Florian, TG Crainic.A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows[J]. Transportation Science,1990,24(1):25-39.
[128]BF Russ,T Yamada,J Castro,H Yasukawa.Optimising the design of multimodal freight transport network in indonesia[J]. Journal of the Eastern Asia Society for Transportation Studies,2005, 62894-2907.
[129]余震江.基于最短路径Dijkstra算法的铁路客运中转径路优化研究[D].重庆：重庆大学,2008.
[130]PE Hart, NJ Nilsson, B Raphael.A formal basis for the heuristic determination of minimum cost paths in graphs [J]. IEEE Transaction System. Science. And Cybernetics,1968, SSC-4(2):100-107.
[131]柯文德,陈珂,李家兰.一种基A*算法的轮式机器人路径规划方法[J].广东石油化工学院学报,2012,22(1)：35-38.
[132]郭强.基于改进A*算法的仿生机器鱼全局路径规划[J].西华大学学报(自然科学版),2011,30(3)：34-37,56.
[133]方伟华.基A*算法和图遍历的烟草物流VRP的研究[J].计算机技术与发展,2011,21(12)：63-65,69.
[134]李作纬,王德利,王明婷,王大生.A*算法在运输线路优化中的应用[J].山东交通学院学报,2006,14(1)：40-42.
[135]梁高明.面向城市交通网络的A*算法优化与应用[J].计算技术与自动化,2012,31(2)：86-89.
[136]焦李成,杜海峰,刘芳.免疫优化计算、学习与识别[M].北京：科学出版社,2006.
[137]刘杰,何世伟,宋瑞,蒋金亮.综合运输体系下的货运网络能力计算[J].吉林大学学报(工学版),2012,42(2)：334-338.
[138]黄友锐.智能优化算法及其应用[M].北京：国防工业出版社,2008.
[139]刘娇娇,黎浩东,何世伟.客货分线条件下铁路货运产品布局优化研究[J].综合运输,2011,3：73-76.
[140]张曙光.中国铁路运输组织理论创新与实践[M].北京：中国铁道出版社,2009.
[141]杜欣,牛永涛,韩宝明.基于节点重要度的客运专线旅客列车开行方案[J].北京交通大学学报,2010,34(6)：5-10.
[142]胡列格,程立勤.基于节点重要度交通区位布局法的城市群公路网布局研究[J].铁道科学与工程学报,2008,5(1)：87-90.
[143]黄志刚,荣朝和.交通区位性能与大型铁路客站对交通资源的整合作用[J].铁道学报,2011,33(6)：8-13.
[144]贾强,晏克非,张宝玉,刘军.基于节点重要度与交通区位的公路运输枢纽布局研究[J].山东交通科技,2008,4：4-9.
[145]叶芳,袁振洲,李明华,苑静蕾.考虑交通区位的物流配送中心选址模型及求解[J].物流科技,2009,9：21-24.
[146]刘淑媛,刘莹.基于城市空间结构和交通区位分析的轨道交通线网布局方法研究[J].经济研究导刊2013,184(2)：73-77.
[147]孙琦.基于铁路货物运输作业过程的点线能力协调问题研究[D].北京：北京交通大学,2010.
[148]雍龙泉.和声搜索算法研究进展[J].计算机系统及应用.2011,20(7)：244-248.
[149]赵再兴.基于改进和声搜索算法的车辆路径规划问题[D].沈阳：沈阳大学,2011.
[150]刘杰.基于和声搜索算法的快递配送路径优化研究[J].陕西理工学院学报(自然科学版)[J].2013,29(5)：44-48.
[151]刘志敏,王爱虎,余高辉.改进和声算法在产业集群物流选址中的应用[J].工业工程与管理,2011,12(2)：12-17.
[152]武磊,潘全科,桑红燕,潘玉霞.求解零空闲流水线调度问题的和声搜索算法[J].2009,15(10)：1960-1967.
[153]赖志柱.和声搜索算法优化多时间窗多式联运运输方案[J].计算机应用.2013,33(9)：2640-2642,2693.
[154]黎浩东,何世伟,景云,王烁.考虑不同满轴约束的编组站阶段计划配流优化[J].铁道学报,2012,34(7)：10-17.
[155]Lee KS, Geem ZW. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice [J]. Computer Methods in Applied Mechanics and Engineering, 2005,194(36-38):3902-3933;
[156]Geem ZW. Optimal cost design of water distribution networks using harmony search[J]. Engineering Optimization,2006,38(3):259-280.
[157]MEO'Kelly.the location of interacting hub facilities [J].Transportation Science,1986,20(2):92-106.
[158]ME O'kelly.A quadratic integer problem for the location of interacting hub facilicities [J]. European journal of Operation research,1987,32(3):393-404.
[159]JF Campbell.Integer programming formulations of discrete hub location problems[J]. European Journal of Operational Research,1994,72(2):387-405.
[160]H Yaman.Allocation strategies in hub networks [J]. European Journal of Operational Research,2011, 2011(211):442-451.
[161]AT Ernst,H Hamacher,H Jiang.Uncapacitated single and multiple allocation p-hub center problems[J]. Computers & Operations Research,2009,36(7):2230-2241.
[162]BY Kara,BC Tansel.On the single-assignment p-hub center problem[J]. European Journal of Operational Research,2000,125(3):648-655.
[163]H Calik, SA Alumur, BY Kara, OE Karasan. Karasan.A tabu-search based heuristic for the hub covering problem over incomplete hub networks [J]. Computers & Operations Research,2009, 36(12):3088-3096.
[164]何世伟.综合交通枢纽规划理论与方法[M].北京：人民交通出版社,2012.
[165]黎浩东,何世伟,宋瑞.列车编组计划和技术站布局的综合优化[J].北京交通大学学报,2010,34(6)：30-34,39.
[166]陈林.基于Logit模型的成渝通道交通选择行为研究[D].成都：西南交通大学,2013.
[167]刘振,周溪召.巢式Logit模型在交通方式选择行为中的应用[J].上海海事大学学报,2006,27(3)：66-70.
[168]帅斌,林渝钧,种鹏云.基于Logit模型的城市低碳交通分担率研究[J].武汉理工大学学报(交通科学与工程版),2012,1：74-77.
[169]王孝之.基于Rank Logit及融合数据的城际交通方式选择研究[D].大连：大连理工大学,2012.
[170]王孝之,赵胜川,闫祯祯.基于Rank Logit模型对城际交通分担率的计算方法研究[J].交通运输系统工程与信息,2012,12(2)：137-143.
[171]谢如鹤,邱祝强,李庆云Logit模型在广深铁路客流分担率估算中的应用[J].中国铁道科学,2006,27(3)：111-115.
[172]胡文君,周溪召.基于交叉巢式Logit的多用户多模式随机用户均衡模型[J].中国公路学报,2012,25(4)：133-140.
[173]温凯歌.基于Logit模型的动态交通分配研究[D].西安：西北工业大学,2006.
[174]刘杰,何世伟,宋瑞.基于社会经济效益最大化的轨道交通票价优化[J].吉林大学学报(工学版), 2011,41(5)：1268-1272.
[175]何宇强,毛保华,陈团生,杨静.高速客运专线客流分担率模型及其应用研究[J].铁道学报,2006,28(3)：18-21.
[176]郭玉华,黄治华,张晓东.我国铁路罐式集装箱运量分担率研究[J].铁道运输与经济,2010,32(6)：9-13.
[177]A Liier-Villagra,V MarianovA competitive hub location and pricing problem[J].European Journal of Operational Research,2013,231(3):734-744.
[178]金安.LOGIT模型参数估计方法研究[J].交通运输系统工程与信息,2004,4(1)：71-75.
[179]王雷,高扬.蚁群算法在Logit模型参数标定中的应用[J].广东技术师范学院学报(自然科学),2009,9：16-19.
[180]M. Yaghini, M.R. Akhavan Kazemzadeh. A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design [J].International Journal of Industrial Engineering & Production Research,2012,23(2):91-100.
[181]SP Brooks,BJT Morgan-Optimization by simulated annealing[J]. Science,1983,220(4598):671-680.
[182]胡大伟,朱志强,胡勇.车辆路径问题的模拟退火算法[J].中国公路学报,2006,19(4)：123-126.
[183]邓爱民,毛超,周彦霆.带软时间窗的集配货一体化VRP改进模拟退火算法优化研究[J].系统工程理论与实践,2009,29(5)：186-192.
[184]张波,叶家玮,胡郁葱.模拟退火算法在路径优化问题中的应用[J].中国公路学报,2004,17(1)：79-81.
[185]林柏梁,田亚明,王志美.基于最远站法则的列车编组计划优化双层规划模型[J].中国铁道科学,2011,32(5)：108-113.
[186]林柏梁,朱松年.优化编组计划的非线性0-1规划模型及模拟退火算法[J].铁道学报,1994,16(2)：61-66.
[187]张嘉敏,韩宝明.铁路列车占用车站股道时序优化研究[J].交通运输系统工程与信息,2011,11(3)：110-107.
[188]杨进,徐猛,高自友.求解连续网络设计问题的模拟退火算法灵敏度分析[J].交通运输系统工程与信息,2009,9(3)：64-69.
[189]孙杨.城市轨道交通新线投入运营下常规公交线网优化调整方法研究[D].北京：北京交通大学,2012.
[190]黎浩东.铁路编组站鲁棒阶段计划编制及调整研究[D],北京：北京交通大学,2012.
[191]何世伟.既有繁忙干线铁路货运组织及集疏运技术的研究[R].北京：北京交通大学,2012.
[192]高洪仁.哈尔滨南站能力提高研究[D].成都：西南交通大学,2008.