综合快捷货运服务网络运输能力计算方法研究
|
摘要
快捷货运服务网络的构建及其运输能力的确定作为综合运输体系下货运研究的重要问题,受到越来越多从事货运工作的管理人员和研究人员的关注。鉴于现有成果并未系统地研究综合运输体系下以“快捷化”运输理念为主导的货运服务网络运输能力相关问题,本论文着重对综合运输体系下快捷货运(本论文简称为综合快捷货运)服务网络运输能力计算模型及其算法进行了研究,所做的工作主要包括以下七个部分：
1.围绕综合快捷货运的发展趋势,阐述了综合快捷货运服务网络运输能力确定相关问题研究现状,分析了综合快捷货运服务网络运输能力计算的必要性。
2.提出了综合货运物理网络和服务网络的概念,以及综合快捷货运服务网络的类型,以此为基础提出综合快捷货运服务网络运输能力的概念及构成,结合综合快捷货运服务网络运输能力构成部分的具体定义,分析了综合快捷货运服务网络运输能力的影响因素。
3.分析了长途综合快捷货运服务网络运输能力计算方法,给出长途综合快捷货运服务网络的表示方法及其枢纽节点内部转运联弧处理方法,将交通工程学上的OD矩阵推算方法应用到长途综合快捷货运服务网络运输能力计算中,提出基于关键联弧装载单元流量与其运输能力偏差值最小的极大似然估计算法,确定了快捷货运量OD矩阵的增广系数,进而得到综合快捷货运服务网络的运输能力OD矩阵,采用算例对所提出的模型算法进行了验证。
4.分析了区域综合快捷货运服务网络运输能力计算方法,给出时效性区域综合快捷货运服务网络的表示方法,提出了区域综合快捷货运服务网络上某OD对间K最短时空路径搜寻的“两阶段标号法”,结合改进Logit模型的时空路径快捷货物流量分配算法,提出基于K最短时空路径的时效性区域综合快捷货运服务网络运输能力的计算模型及算法,采用算例对所提出的模型算法进行了验证。
5.确定了面向不同决策主体的综合快捷货运服务网络的运输能力。针对货运策略制订者,研究给出了不同运达时间限制条件下综合快捷货运服务网络最大有效运输能力、潜在运输能力的计算方法；针对货主和货运商,从货主选择货运商、货运商制订自身运输策略(基于最小运输费用的路径流量分配)角度出发建立综合快捷货运服务网络经济运输能力计算的双层规划模型,上层为货主选择货运商的快捷货运需求量平衡分配不等式,下层为以货运商、第三方承运人运输费用最小为目标的快捷货物流量分配模型,并采用算例对所提出的模型算法进行了验证。
6.研究了考虑运达时间可靠性约束的综合快捷货运服务网络运输能力计算方法。针对快捷货物运输过程中,服务路段载运单元行程时间、快捷货物停留等待时间、枢纽节点内快捷货物转运作业时间为随机值的情况,提出带随机变量和约束条件的综合快捷货运服务网络的运输能力计算模型。设计了一个混合智能求解算法——在遗传算法中嵌入蒙特卡洛模拟法,结合算例验证了算法的效率并得出相应结论。
7.采用中铁快运公铁联运的行邮服务网络进行实例验证,体现研究的实用价值及意义。
As the key research topic of multimodal transportation system, structure and shipping capacity of express shipment service network have attached many attentions of both the mangers and the researchers of the multimodal commodity transportation. For the reason that there are no systematic researches on the shipping capacity of multimodal service network for express shipment under the idea of "express shipment", this thesis works on the computational techniques of multimodal service network capacity for express shipment. The main work includes the following interrelate parts:
1. Along with the trend of multimodal express shipment, current situation as well as the necessity of computing capacity of multimodal service network for express shipment are reviewed and depicted.
2. Concepts and classifies of multimodal service network for express shipment are proposed. Based on them, detail concepts as well as the constitution of the multimodal service network capacity for express shipment are put forward, including the analysis of the impact factor and simple measures of the service network capacity.
3. Computational technique of multimodal long-haul service network capacity for express shipment is analyzed. Topology representation and transshipment link in hub point of multimodal long-haul service network for express shipment are put forward firstly. Then, with OD matrix estimation method in Traffic Engineering, the multimodal long-haul service network capacity matrix is determined. During that, the Maximum Likelihood Estimation on the difference between the container flow and its carrying capacity on the key service link are used to determine the increase factor of express shipment matrix which is used to calculate the capacity matrix. A numerical case is used to verify the proposed mathematical model and the solution algorithm.
4. Computational technique of multimodal regional service network capacity for express shipment is analyzed. Topology representation of multimodal time-defined regional service network for express shipment is given out. In this process, the concepts, i.e. the physical route and the time-space path on multimodal time-defined regional service network are addressed. Based on the concepts of physical route and time-space path, a "two stages labeling" algorithm is proposed to search the K shortest time-space path between an OD pair. As the K shortest time-space path algorithm has been proposed, the computational method of multimodal time-defined regional service network capacity for express shipment is formulated as well. A numerical case is used to verify the proposed model and the solution algorithm.
5. Computational techniques of multimodal service network capacity for express shipments with various decision individuals are studied. For policy constituter of commodity shipment, the maximal effective capacity and potential capacity of multimodal service network for express shipments versus different defined delivery time are determined; for the shipper and the carrier, standing on the point that the shippers choosing the carriers, while the carriers making up their own shipping strategies, the mathematical models for economic capacity of multimodal service network for express shipments are formulated, these two models are integrated with a bi-level programming. The upper programming cares about the process of the shippers' choosing the carriers. On the other hand, the lower programming is the express shipment flow assignment model on the physical routes of the carriers and the logistics service provider (LSP). A numerical case is used to verify the proposed mathematical model and the solution algorithm.
6. Computational technique of multimodal service network capacity for express shipments with reliability constraints of defined delivery time is researched. For the reason that during the commodity shipping process, the running time on service link of carrying unit, waiting time, transfer time in hub point of express commodities are all uncertain. The mathematical model for multimodal service network capacity computation for express shipments with stochastic variables and constraints is formulated. A hybrid intelligent algorithm (HIA) in which Monte Carlo simulation is combined with genetic algorithm (GA) is put forward to solve the proposed model. A numerical case is used to verify the conclusions and the efficiency of solution algorithm.
7. Service network of highway-railway transportation for luggage and mail shipping of China Railway Co., Ltd. is taken as a real example to verify the studies in this thesis, which embodies application value and significance of this thesis.
1.围绕综合快捷货运的发展趋势,阐述了综合快捷货运服务网络运输能力确定相关问题研究现状,分析了综合快捷货运服务网络运输能力计算的必要性。
2.提出了综合货运物理网络和服务网络的概念,以及综合快捷货运服务网络的类型,以此为基础提出综合快捷货运服务网络运输能力的概念及构成,结合综合快捷货运服务网络运输能力构成部分的具体定义,分析了综合快捷货运服务网络运输能力的影响因素。
3.分析了长途综合快捷货运服务网络运输能力计算方法,给出长途综合快捷货运服务网络的表示方法及其枢纽节点内部转运联弧处理方法,将交通工程学上的OD矩阵推算方法应用到长途综合快捷货运服务网络运输能力计算中,提出基于关键联弧装载单元流量与其运输能力偏差值最小的极大似然估计算法,确定了快捷货运量OD矩阵的增广系数,进而得到综合快捷货运服务网络的运输能力OD矩阵,采用算例对所提出的模型算法进行了验证。
4.分析了区域综合快捷货运服务网络运输能力计算方法,给出时效性区域综合快捷货运服务网络的表示方法,提出了区域综合快捷货运服务网络上某OD对间K最短时空路径搜寻的“两阶段标号法”,结合改进Logit模型的时空路径快捷货物流量分配算法,提出基于K最短时空路径的时效性区域综合快捷货运服务网络运输能力的计算模型及算法,采用算例对所提出的模型算法进行了验证。
5.确定了面向不同决策主体的综合快捷货运服务网络的运输能力。针对货运策略制订者,研究给出了不同运达时间限制条件下综合快捷货运服务网络最大有效运输能力、潜在运输能力的计算方法；针对货主和货运商,从货主选择货运商、货运商制订自身运输策略(基于最小运输费用的路径流量分配)角度出发建立综合快捷货运服务网络经济运输能力计算的双层规划模型,上层为货主选择货运商的快捷货运需求量平衡分配不等式,下层为以货运商、第三方承运人运输费用最小为目标的快捷货物流量分配模型,并采用算例对所提出的模型算法进行了验证。
6.研究了考虑运达时间可靠性约束的综合快捷货运服务网络运输能力计算方法。针对快捷货物运输过程中,服务路段载运单元行程时间、快捷货物停留等待时间、枢纽节点内快捷货物转运作业时间为随机值的情况,提出带随机变量和约束条件的综合快捷货运服务网络的运输能力计算模型。设计了一个混合智能求解算法——在遗传算法中嵌入蒙特卡洛模拟法,结合算例验证了算法的效率并得出相应结论。
7.采用中铁快运公铁联运的行邮服务网络进行实例验证,体现研究的实用价值及意义。
As the key research topic of multimodal transportation system, structure and shipping capacity of express shipment service network have attached many attentions of both the mangers and the researchers of the multimodal commodity transportation. For the reason that there are no systematic researches on the shipping capacity of multimodal service network for express shipment under the idea of "express shipment", this thesis works on the computational techniques of multimodal service network capacity for express shipment. The main work includes the following interrelate parts:
1. Along with the trend of multimodal express shipment, current situation as well as the necessity of computing capacity of multimodal service network for express shipment are reviewed and depicted.
2. Concepts and classifies of multimodal service network for express shipment are proposed. Based on them, detail concepts as well as the constitution of the multimodal service network capacity for express shipment are put forward, including the analysis of the impact factor and simple measures of the service network capacity.
3. Computational technique of multimodal long-haul service network capacity for express shipment is analyzed. Topology representation and transshipment link in hub point of multimodal long-haul service network for express shipment are put forward firstly. Then, with OD matrix estimation method in Traffic Engineering, the multimodal long-haul service network capacity matrix is determined. During that, the Maximum Likelihood Estimation on the difference between the container flow and its carrying capacity on the key service link are used to determine the increase factor of express shipment matrix which is used to calculate the capacity matrix. A numerical case is used to verify the proposed mathematical model and the solution algorithm.
4. Computational technique of multimodal regional service network capacity for express shipment is analyzed. Topology representation of multimodal time-defined regional service network for express shipment is given out. In this process, the concepts, i.e. the physical route and the time-space path on multimodal time-defined regional service network are addressed. Based on the concepts of physical route and time-space path, a "two stages labeling" algorithm is proposed to search the K shortest time-space path between an OD pair. As the K shortest time-space path algorithm has been proposed, the computational method of multimodal time-defined regional service network capacity for express shipment is formulated as well. A numerical case is used to verify the proposed model and the solution algorithm.
5. Computational techniques of multimodal service network capacity for express shipments with various decision individuals are studied. For policy constituter of commodity shipment, the maximal effective capacity and potential capacity of multimodal service network for express shipments versus different defined delivery time are determined; for the shipper and the carrier, standing on the point that the shippers choosing the carriers, while the carriers making up their own shipping strategies, the mathematical models for economic capacity of multimodal service network for express shipments are formulated, these two models are integrated with a bi-level programming. The upper programming cares about the process of the shippers' choosing the carriers. On the other hand, the lower programming is the express shipment flow assignment model on the physical routes of the carriers and the logistics service provider (LSP). A numerical case is used to verify the proposed mathematical model and the solution algorithm.
6. Computational technique of multimodal service network capacity for express shipments with reliability constraints of defined delivery time is researched. For the reason that during the commodity shipping process, the running time on service link of carrying unit, waiting time, transfer time in hub point of express commodities are all uncertain. The mathematical model for multimodal service network capacity computation for express shipments with stochastic variables and constraints is formulated. A hybrid intelligent algorithm (HIA) in which Monte Carlo simulation is combined with genetic algorithm (GA) is put forward to solve the proposed model. A numerical case is used to verify the conclusions and the efficiency of solution algorithm.
7. Service network of highway-railway transportation for luggage and mail shipping of China Railway Co., Ltd. is taken as a real example to verify the studies in this thesis, which embodies application value and significance of this thesis.
引文
[1]权磊磊.综合运输体系下快捷货运系统网络运输能力计算方法研究[D].硕士学位论文,北京：北京交通大学,2009.6.
[2]Chestler L., Overnight air express:spatial pattern, competition and the future of small package delivery service[J]. Transportation Quarterly,1985,39:59-71.
[3]Dejax P.J., Crainic T.G., A review of empty flows and fleet management models in freight transportation[J]. Transportation Science,1987,21(4):227-247.
[4]Eckstein J., Sheffi Y., Optimization of group line-haul operations for motor carriers using twin trailers[J]. Transportation research record,1987,1120:12-23.
[5]Gehring H., Menschner K., Meyer M., A computer-based heuristic for packing pooled shipment containers[J]. European Journal of Operational research,1990,44:277-288.
[6]Guelat J. Florian M., Graninic T.G.., A multimode multiproduct network assignment model for strategic planning of freight flows[J]. Transportation Science,1990,24(1):25-39.
[7]Roy J., Crainic T.G.., Improving intercity freight routing with a tactical planning model[J]. Interfaces,1992,22(3):31-44.
[8]Crainic T.G., Roy J., Design of regular intercity driver routes for the LTL motor carrier industry[J].Transportation Science,1992,26(4):280-295.
[9]Crainic T.G, Laporte G, Planning models for freight transportation[J]. European journal of Operation research,1997,409-438.
[10]Crainic T.G, Laporte G, Fleet management and logistics[M]. Kluwer Academic Publishers, Norwell, MA,1998:57-93.
[11]Bianco L., Bella A.L., Freight transport planning and logistics[M]. Springer-Verlag, Berlin, 1988.
[12]Godfey G.A., Powell W.B., An adaptive dynamic programming algorithm for dynamic fleet management II:Single period travel times[J]. Transportation Science,2002a,36(1):21-39.
[13]Crainic T.G, Gendreau M., Freight exchanges and carrier operations:Issues, Models, and Tools [R]. Technical Report, Centre de recherche sur les transports, Universite de Montreal, Montreal, QC, Canada,2002b.
[14]Barnhart C., Hane C.A., Vance P.H., Using branch-and-price-and-cut to solve origin destination integer multicommodity flow problems[J]. Operation Research,2000a,48(2):318-326.
[15]Tsamboulas D., Vrenken H., Lekka A.M., Assessment of a transport policy potential for intermodal mode shift on a European scale[J]. Transportation Research Part A:Policy and Practice,2007,41,(8):715-733.
[16]Janic M., An assessment of the performance of the European long intermodal freight trains (LIFTS)[J]. Transportation Research Part A:Policy and Practice,2008,42(10):1326-1339.
[17]郭小碚.加拿大多式联运的发展与启示[J].综合运输,1996,(4)：36-38.
[18]孙全欣,刘作义,朱晓宁.快速货物运输量预测与分析[J].北方交通大学学报,1999,23(5)：105-109.
[19]吴守荣.山东省公路货物运输系统管理研究[J].系统工程理论与实践,1999,11：135-141.
[20]申月,苏顺虎,胡思继.城际间快捷货物运输系统的探索[D],北京交通大学学报,2001,25(2)：62-64.
[21]李夏苗,朱晓立,胡思继.货物运输快捷性、准时性的经济分析[J].交通运输工程学报,2001,1(4)：101-105.
[22]李夏苗,胡思继,朱晓宁.直达输送货物的送达速度和准时性的调查研究[J].北方交通大学学报,2002,26(2)：103-106.
[23]彭大衡,吴健雄.中国公路货物运输发展研究[J].湖南大学学报,2003,17(4)：55-58.
[24]徐鼓平.道路快速货运的理论探索[J].交通企业管理,2005,(5)：22-23
[25]杨松发.论我国公路快速货运系统的发展模式[D].北京工业大学硕士学位论文,北京：2001年6月.
[26]鲍香台,李旭宏,何杰.公路快速货运系统发展现状及政策建议[J].东南大学学报(自然版),2003,33(6)：182-787.
[27]徐亚华.发展汽车快速货运的策略研究[D].长安大学硕士学位论文,2001.6.
[28]杨浩.我国铁路快速货物运输发展的现状与展望[J].北方交通大学学报,2000,24(12)：20-24.
[29]李珺,钟雁,李冠成.关于快速货物运输产品策略的探讨[D].铁路货运,1998,(5)：4-6.
[30]钟雁,乔颖丽.确定铁路快速货物运输目标市场[J].北京交通大学学报,2000,24(3)：118-121.
[31]张巍,魏然,匡敏.青藏铁路格拉段建立综合货运体系的研究[J].铁道运输与经济,2009,31(6)：81-83.
[32]Ahuja, R.K., Magnanti T.L., Orlin J.B., Network Flows[M]. Prentice Hall, New Jersey,1993.
[33]Magnanti TL, Wong RT., Network design and transportation planning:models and algorithms[J]. Transportation Science,1984;18(1):1-55.
[34]Bodin L., Golden B., Assad A., Ball M., Routing and Scheduling of vehicles [M],2001.
[35]Leung J.M., Magnanti T.L., Singhal V., Routing in point-to-point delivery system:formulation and solution heuristic[J]. Transportation Science,1990,24(4):245-260.
[36]Minoux M., Network synthesis and optimum network design problems:models, solution methods and applications[J]. Networks,1989,19:313-60.
[37]Powell WB., A local improvement heuristic for the design of less-than-truckload motor carrier networks[J]. Transportation Science,1986,20(4):246-357.
[38]Powell W.B., Warren B., Sheffi Y., Yosef E., Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry [J]. Operations Research, 1989,37(1):12-29.
[39]Braklow J.W., Graham W.W., Interactive optimization improves service and performance for yellow freight system. Interface,1992,22(1):147-172.
[40]Kuby M.J., Gray R.G., The hub network design problem with stopovers and feeders:the case of federal express[J]. Transportation Research Part:A,1993,27:1-12.
[41]Lin C.C., Chen S.H., The hierarchical network design problem for time-define express common carriers[J]. Transportation Research Part B,2003.40:1-13.
[42]Lin C.C., The freight routing problem of time-definite freight delivery common carriers[J]. Transportation Research Part B,2001,35:525-547.
[43]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.
[44]Andersen J., Crainic T.G., Christiansen M., Service network design with management and coordination of multiple fleets[J]. European Journal of Operational Research,2009,193 (2): 377-389.
[45]Lin C.C., Lin D.Y., Melanie M., Price planning for time-definite less-than-truckload freight services[J]. Transportation Research Part E:Logistics and Transportation Review,2009,45(4): 525-537.
[46]Lin C.C., Lee S.C., The competition game on hub network design[J]. Transportation Research Part B:Methodological, In Press, Corrected Proof, Available online 4 October 2009.
[47]Aykin T., Networking polices for hub-and-spoke systems with application to the air transportation system[J]. Transportation Science,1995,29(3),201-221.
[48]Barnhart C., Schneur R.R., Air network design for express shipment service[J]. Operation Research,1996,44(6):852-863.
[49]Bryan D.L., O'Kelly M.E., Hub-and-spoke network in air transportation:and analytical review, Journal of Regional Science,1999,39(2):275-295.
[50]Buedenbender K., Griinert 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.
[51]Lin C.C., Lin Y.J., Lin D.Y., The economic effects of center-to-center directs on hub-and-spoke networks for air express common carriers[J]. Transportation Research Part B:Methodological, 2004,38(3)271-283.
[52]Yan S., Lai C.H., Chen C.H., A short-term flight scheduling model for international express package delivery[J]. Journal of Air Transport Management,2005,11(6):368-374.
[53]Cheung R.K.M., Powell W.B., An algorithm for multistage dynamic network with random arc capacities, with an application to dynamic fleet management[J]. Operation research,1996a, 44(6):951-963.
[54]Chouman M., Crainic T.G., Gendron B.A., Cutting-plane algorithm based on cutset inequalities for multicommodity capacitated fixed charge network design[R]. Technical Report CRT-2003-16, Centre de recherche sur les transports, Universitede Montreal, Montreal, QC, Canada; 2003.
[55]Crainic T.G., Rousseau J.M., Multicommodity, multimode freight transportation:a general modelling and algorithmic framework for the service network design problem[J]. Transportation Research Part B:Methodological,1986,20:225-42.
[56]Crainic T.G., Service Network design in freight transportation[J]. European Journal of Operational Research,2000,122(2):272-288.
[57]Current J.R., Revelle C.S., Cohon J.L., The hierarchical network design problem[J], European Journal of Operational Research,1986,27:57-66.
[58]Dall'Orto L.C., Crainic T.G.., Leal J.E., Powell W.B., The single-node dynamic service scheduling and dispatching problem[J]. European Journal of Operational Research, 2006,170:1-23.
[59]Duan P., An integrated modelling Framework for intermodal freight operations in hub cities[M]. Northwestern University, Evanston, Illinois, USA,2006.
[60]Farvodden J.M., Powell W.B., Subgradient method for the service network design problem[J].
Transportation Science,1994,28(3):256-272.
[61]Gendron B., Crainic T.G., Relaxations for multicommodity network design problems[M].. Publication CRT-965, Centre de recherche sur les transports, Universite de Montreal, Montreal, QC, Canada; 1994.
[62]Hang D., Dynamic routing problems with service time windows[D]. Hong Kong University of Science and Technology, Hong Kong,2000.
[63]Kim D., Barnhart C., Ware K., Reinhardt G., Multimodal express package delivery:a service network design application[J]. Transportation Science,1999,33(4):391-407.
[64]Jarvis J.J., Mejia de Martinez O., A sensitivity analysis of multicommodity network flows[J]. Transportation Science,1977,11(4):299-306.
[65]Campbell J.F., Hub location for time definite transportation[J]. Computers& Operations Research,2009,36(12):3107-3116.
[66]Lin C.C., Che S.H., An integral constrained generalized hub-and-spoke network design problem[J]. Transportation Research Part E:Logistics and Transportation Review,2008,44(6): 986-1003.
[67]Xu W., He S., Song, R. Li J., Hub Location& Service Frequency Determination for the Rail and Truck Freight Transportation Network[C]. The 88th Annual Meeting of Transportation Research Board, Washington, DC, America, January 11-15,2009.
[68]Lin C.C., The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services [J]. International Journal of Production Economics,2010,123(1):20-30.
[69]高自友,张好智,孙会君.城市交通网络设计问题中双层规划模型、方法及应用[J].交通运输系统工程与信息,2004,4(1)：35-44.
[70]秦进.多商品物流网络设计相关优化模型及算法研[D],湖南长沙：中南大学,2006.
[71]董晓岩.基于始发能力最大化的快运企业运输方案的设计与研究[D],北京：北京交通大学,2004.
[72]韩世莲,李旭宏,刘新旺.物流运输网络模糊最短路径的偏好解[J].交通运输工程学报,2005,5(2)：122-26
[73]沈睿.铁路行包快运服务网络设计理论与方法研究[D].北京交通大学,北京,2006.
[74]沈睿,刘军,季常煦.货物运输服务网络设计频度模型的研究[J].北京交通大学学报,2006,30(6)：36-40.
[75]王保华,何世伟,宋瑞,申永生.综合运输体系下快捷货运网络流量分配优化模型及算法[J].铁道学报,2009,31(2)：12-16.
[76]武云霞,何世伟.综合快捷货运服务网络结构影响因素分析[J].物流科技,2009,32(8)：29-33.
[77]Transportation Research Board, Highway Capacity Manual,2000[M]. WASHINGTON, D.C., USA:Federal Transit Administration in Cooperation with the Transit Development Corporation, 2000.
[78]Asakura Y., Maximum capacity of road network constrained by user equilibrium conditions[C]. Paper presented at the 24th Annual Conference of the UTSQ 1992.
[79]Ferrari P., Road pricing and network equilibrium[J]. Transportation Research Part B,1995,29: 357-372.
[80]Wong S.C., Yang H., Reserve capacity for a signal controlled road network[J]. Transportation Research Part B,1997,31:397-402.
[81]Yang H., Bell M.GH., A capacity paradox in network design and how to avoid it[J]. Transportation Research A,1998b,32:539-545.
[82]Yang H., Bell M.GH., Meng Q., Modelling the capacity and level of service of urban transportation networks[J]. Transportation Research Part B,2000,34:255-275.
[83]Chiou S.W., Reserve capacity of signal-controlled road network[J]. Applied Mathematics and Computation,2007,190(2):1602-1611.
[84]Zhu J.S., Zhang N., Modeling Road Network Capacity and Service Level under Variable Demand Pattern[J]. Systems Engineering-Theory& Practice,2008,28(6):170-176.
[85]Ubbels B., Verhoef E.T., Governmental competition in road charging and capacity choice[J]. Regional Science and Urban Economics,2008,38(2):174-190.
[86]Federal Railroad Administration, Rail Planning Manual[S]. FRA, U.S. Department of Transportation, WASHINGTON, D.C., USA,1977.
[87]Clark D.B., An examination of railroad capacity and its implications for rail-highway intermodal transportation[D]. The university of Tennessee, Knoxville, USA,1995.
[88]Fransoo J.C., Bertrand J.W.M., An aggregate capacity estimation model for the evaluation of railroad passing constructions[J]. Transportation Research Part A:Policy and Practice,2000,34, (1):35-49.
[89]Martinelli D.R., Teng H., Optimization of railway operations using neural networks[J]. Transportation Research,1996,4C:33-49,.
[90]Yuan J., Hansen I.A., Optimizing capacity utilization of stations by estimating knock-on train delays[J]. Transportation Research Part B:Methodological,2007,41(2):202-217.
[91]Gibson S., Allocation of capacity in the rail industry[J]. Utilities Policy,2003,11(1):39-42.
[92]Huisman T., Boucherie R.J., Van Dijk N.M., A solvable queuing network model for railway networks and its validation and applications for the Netherlands[J]. European Journal of Operational Research,2002,142(1):30-51
[93]Abril M., Barber F., Ingolotti L., Salido M.A., Tormos P., Lova A., An assessment of railway capacity[J]. Transportation Research Part E:Logistics and Transportation Review,2008,44(5): 774-806.
[94]Fransoo J.C., Bertrand J.W.M., An aggregate capacity estimation model for the evaluation of railroad passing constructions[J]. Transportation Research Part A:Policy and Practice, Volume 2000,34 (1):35-49.
[95]Harrod S., Capacity factors of a mixed speed railway network[J]. Transportation Research Part E:Logistics and Transportation Review,2009,45(5):830-841.
[96]Gendron B., Crainic TG., Bounding procedures for multicommodity capacitated network design problems[D]. Publication CRT-96-06, Centre de recherche sur les transports, Universite de Montreal, Montreal, QC, Canada,1996.
[97]Morlok E.K., Riddle S.M., Estimating the Capacity of Freight Transportation Systems:A Model and Its Application in Transport Planning and Logistics[J]. Transportation Research Record, 1999,1653(NAS-NRC),1-8.
[98]Park M., Capacity modelling for multimodal freight transportation networks[D]. Dissertation of PH.D. University of California, Irvine.2005.
[99]Crainic T.G., Kim K.H., Intermodal transportation. In:C. Barnhart[M]. G. Laporte (Eds.), Transportation, Handbooks in Operations Research and Management Science (Chapter 8), 2007,14:467-537.
[100]Caramia M., Dell'Olmo P., Gentili M., Mirchandani P.B. Delivery itineraries and distribution capacity of a freight network with time slots[J]. Computers& Operations Research,2007,34(6): 1585-1600.
[101]Lin C.C., The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services[J]. International Journal of Production Economics,2010,123(1):20-30.
[102]Chen A., Yang H., Lo H.K., Tang W.H., A Capacity Related Reliability For Transportation Network [J]. Journal of Advance Transportation,1999, No.2:183-200.
[103]Chen A., Yang H., Lo H.K., Tang W.H., Capacity reliability of a road network:an assessment methodology and numerical results [J]. Transportation Research Part-B,2002,36:225-252.
[104]Cho D.J., Morlork E.K., Chen Z.L., Efficient Algorithms for Measuring the Reliability of Transportation Network System Capacity[R]. Working Paper of the University of Pennsylvania, 2002, Philadelphia.
[105]Chang D.J., Extending transportation system capacity flexibility model[D]. University of Pennsylvania, Pennsylvania, USA,2003.
[106]Cho D.J., Three papers on measuring the reliability and flexibility of transportation system capacity[D]. University of Pennsylvania, Pennsylvania, USA,2002.
[107]Feitelson E., Salomon I., The implications of Different Network Flexibility for Spatial Strudures[J]. Transportation Research Part A,2000,34:459-479.
[108]Lin Y.K., Reliability of a computer network in case capacity weight varying with arcs, nodes and types of commodity[J]. Reliability Engineering& System Safety,2007,92(5):646-652.
[109]Lin Y.K., Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths[J]. Computers& Operations Research,2009,36 (4): 1050-1063.
[110]Xu W., He S., Song R., Li J., Reliability based assignment in stochastic-flow freight network[J]. Applied Mathematics and Computation,2009,211 (1):85-94.
[111]张亚平,裴玉龙.道路通行能力研究现状及发展综述[J].交通运输工程学报,2002,2,(2)：94-97.
[112]牛惠民,胡安洲.铁路枢纽愈能资源合理利用的多目标优化模型[J].系统工程学报,2000,15(2)：119-123.
[113]张超.铁路枢纽运输能力计算方法研究[D].北京：北方交通大学,2002.
[114]胡安洲,杨浩.关于铁路运输问题的系列研究[J].铁道经济研究,1994,(1).
[115]胡思继.列车运行组织及通过能力理论[M].北京：中国铁道出版社,1993.
[116]施其洲.铁路网运输系统运输能力与车流路径模型[J].铁道学报,1996,18(4)：1-9.
[117]何世伟,宋瑞,戴新鎏,杨永凯,雷中林.路网运输能力及计算方法的研究[J].铁道学报,2003,25(2)：5-9.
[118]雷中林.铁路路网运输能力计算方法研究[D].北京：北方交通大学,2006.
[119]雷中林,何世伟.铁路路网系统运输能力灵活性研究[J].铁道学报,2009,31,(1)：26-30.
[120]李红艳,陈治亚,何世伟,许旺土.公铁联运货运网络潜在运能分析[J].铁道学报,2009,31(1)：20-25.
[121]许旺土,何世伟,何必胜.综合运输货运服务网络运输能力及影响因素[J].综合运输,2009,(6)：64-68.
[122]苏顺虎,陈治亚,何世伟,王保华.基于服务水平的铁路货物运输网络能力计算方法[J].中国铁道科学,2009,30,(2)：113-118.
[123]周怀惠.综合运输体系下快捷货运网络系统服务水平评价指标体系研究[D].硕士学位论文,北京：北京交通大学,2009.6.
[124]Schonberger J., Operational Freight Carrier Planning:Basic concepts, operation models and advanced mimetic algorithms [M]. Springer Press,2005.
[125]安路生.中国铁路运输新实践[M].北京：中国铁道出版社,2009.
[126]Lin, C.C., The load planning of time-define freight delivery common carriers[J]. Transportation Planning Quarterly,1998,27(3):371-406.
[127]陈秀华,林正章.一般化轴幅式网路问题设计与应用[D].博士学位论文,中国台湾：国立成功大学,2005.
[128]吴群琪,孙启鹏.综合运输规划理论的基点[J].交通运输工程学报,2006,6(3)：122-126.
[129]王庆云.交通运输发展理论与实践[M].中国科学技术出版社.北京.2005.
[130]Ge Y.E., Zhang H.M., Lam W.H.K., Network reserve capacity under influence of traveler information[J]. Journal of Transportation Engineering,2003, (5):262-270.
[131]Park M., Regan A., Capacity modeling in transportation:A multimodal perspective[J]. Transportation Research Record:Journal of the Transportation Research Board,2005,1906: 97-104.
[132]Morlok E.K., Chang D.J., Measuring Capacity Flexibility of a transportation system[C].88th Annual Meeting Preprint CD-ROM, Transportation Research Board, January 11-15,2004, Washington, D.C., USA.
[133]Kasikitwiwat P., Capacity reliability and capacity flexibility of a transportation network[D]. Utah State University, Logan, Utah,2004.
[134]Willumsen L.G., Estimation of an OD matrix from traffic counts-a review[D]. Institute of Transport Studies, University of Leeds, Working Paper 99,1978.
[135]VanderZijpp N.J., Dynamic origin-destination matrix estimation from traffic counts and automated vehicle identification data[J]. Transportation Research Record:Journal of the Transportation Research Board,1997,1607:87-94.
[136]Fabien M., Optimal Network Estimation of Origin-Destination Flow from Link Data[C].88th . Annual Meeting Preprint CD-ROM, Transportation Research Board, Washington, D.C., USA. 2009,1.
[137]Ortuzar J. D., Willumsen L.G., Modeling Transport[M]. John Wiley Press, USA,2005.
[138]Dheenadayalu L., Wolshon Y.B., Wilmot C., Analysis of link capacity estimation methods for urban planning models[J]. Journal of Transportation Engineering,2004,130:268-275.
[139]Ben-Akiva M., Bergman M.J., Daly A.J., Ramaswamy R., Modelling inter-urban route choice behaviour[C]. In:Proceedings Ninth International Symposium on Transportation and Traffic Theory. VNU Science Press, Utrecht,1984; pp.299-330.
[140]Dial R.B., Bicriterion traffic equilibrium:T2 mode, algorithm, software overview[J].
Transportation Research Record, Transportation Research Board,2000,1725:54-62.
[141]Tong C.O., Richardson A.J., Estimation of time-dependent origin-destination matrices for transit networks[J]. Journal of Advanced Transportation,1984,18:145-161.
[142]Yen J.Y., Finding the k shortest loopless paths in a network[J]. Management Science,1971.17: 712-16.
[143]Katoh N., Ibaraki T., Mine H., An efficient algorithm for k shortest simple paths[J]. Networks 1982,12:411-27.
[144]Fox B.L., Data structures and computer science techniques in operations research[J]. Operations Research,1978,26:686-717.
[145]Eppstein D., Finding the k shortest paths[J]. SIAM Journal of Computing,1998,28:652-73. Swersey AJ, Ballard W. Scheduling school buses. Management Science 1984; 30:844-53.
[146]Chen Y.L., Chin Y.H. The quickest path problem[J]. Computers& Operations Research 1990; 17:153-61.
[147]Yang H.H., Chen Y.L. Finding K shortest looping paths in a traffic-light network[J]. Computers & Operations Research,2005,32:571-81.
[148]Desrochers M., Desrosiers J., Solomon M.M., A new optimization algorithm for the vehicle routing problem with time windows[J]. Operations Research,1992,40:342-54.
[149]Chen Y.L., Yang H.H, Shortest paths in traffic-light networks[J]. Transportation Research Part B,2000,34:241-53.
[150]Chen Y.L., Yang H.H., Finding the first K shortest paths in a time-window network[J]. Computers& Operations Research,2004,31:499-513.
[151]Balakrishnan N., Simple heuristics for the vehicle routing problem with soft time windows[J]. 1993,44:279-87.
[152]Solomon M., Desrosiers J., Time window constrained routing and scheduling problems:a survey[J]. Transactions of Science,1988,22:1-13.
[153]VanderZijpp N.J., Fiorenzo C.S., Path enumeration by finding the constrained K-shortest paths[J]. Transportation Research Part B,2005,35:545-63.
[154]Chen G, Ansari N., Finding a least hop(s) path subject to multiple additive constraints[J]. Computer Communication,2006,29:392-401.
[155]Tong, C.O., WongS.C., Poon M.H., Tan M.C., A schedule based dynamic transit network model-recent advances and prospective future research[J]. Journal of Advanced Transportation, 2001,35 (2):175-195.
[156]Huang R., Peng Z., Schedule-based path finding algorithms for transit trip planning systems[J]. Journal of Transportation Research Board:Transportation Research Record,2002,1783: 142-148.
[157]Friedrich M., Hofsaβ I., Wekeck S., Timetable-based transit assignment using branch& bound[C]. In Proceedings of "80th Annual of Transportation Research Board, Washington D.C., USA,2001.
[158]Xu W., He S., Song R., Chaudhry S.S., Finding the K shortest paths in a schedule-based transit network[J]. Computers& Operations Research,2010, doi:10.1016/j.cor.2010.02.005.
[159]Jan Riezebos J., van Wenzel W.,K-Shortest routing of trains on shunting yards[J]. OR Spectrum,2009,31 (4):745-758.
[160]Fredman M.L., Tarjan R.E., Fibonacci heaps and their uses in improved network optimization algorithms[J]. JACM,1987,34:596-615.
[161]Dijkstra E.W., A note on two problems in connection with graphs[J]. Numerical Mathematics, 1959,1:269-71.
[162]Cormen T.H., Leiserson C.E., Rivest R.L., Introduction to Algorithms[M]. MIT Press, Cambridge, MA,1990.
[163]牛新奇,潘荫荣,胡幼华.(K≤3)条渐次短路径搜索算法的研究[J].计算机工程与应用,2005,22,51-53.
[164]牛新奇,潘荫荣.轨道交通系统中清分算法的研究[J].计算机时代,2005(2)：17-21
[165]贺振欢.城市道路交通路径选择模拟系统及模型体系研究[D].北方交通大学,2003.
[166]Agrawal B.B., An Analytical Shipper-Carrier Freight Assignment Model Using a Variational Inequality Approach [D]. Northwestern University, Evanston, Illinois, USA,2006.
[167]Beuthe M., Degrandsarta F., Geertsb J-F., Jourquin B., External costs of the Belgian interurban freight traffic:a network analysis of their internalization [J]. Transportation Research Part D: Transport and Environment,2002 7(4):285-301.
[168]Chen H.K., Hsueh C.F., A model and an algorithm for the dynamic user-optimal route choice problem. Transportation Research Part-B 1998 32(3):219-234.
[169]黄红选,韩继业.数学规划[M].北京：清华大学出版社,2006.3.
[170]甘应爱,等,运筹学[M].北京：清华大学出版社,2002.6.
[171]Bell M.G.H., Iida Y., Transportation Network Analysis[M]. New York:John Wiley and Sons Press,1997.
[172]刘海旭,卜雷,蒲云.随机路网的行程时间可靠性[J].土木工程学报,2004,37(8)：102-105.
[173]Asakura Y., Rehability Measures of all Origin and Destination Pair in a Deteriorated Road Network with Variable Flows[A]. Bell M. G. H. Eds.. Transportation Networks:Recent Methodological Advances l C J, Oxford:Pergamon Press.1998:273-288.
[174]Du P., Nieholson A.J. Degradable Transportation Systems:Sensitivity and Reliability Analysis[J]. Transportation Research Part B,1997,31(3):225-23.
[175]陈坤,于雷.基于对数正态和分布的路径行程时间可靠性模型[J].北京交通大学学报,2009,33(3)：36-39.
[176]干宏程,汪睛,范炳全.基于宏观交通流模型的行程时间预测[J].上海理工大学学报,2008,30(5)：409-413.
[177]张勇.考虑路段关联失效的路网行程时间可靠性估计[J].土木工程学报,2008,41(8)：87-92.
[178]Doulliez P., Jamoulle J., Transportation networks with random arc capacities[J], Operations Research,1972,3:45-60.
[179]Asakura Y., Kashiwadani M., Road network reliability caused by daily fluctuation of traffic flow[C]. In:Proceeding of the 19th PTRC Summer Annual Meeting, Brighton,1991:73-74.
[180]Liu B., Theory and Practice of Uncertain Programming[M]. Physica-Verlag, Heidelberg,2002.
[181]Liu B., Uncertainty theory:An introduction to its axiomatic foundations[M]. Berlin: Springer-Verlag,2004.
[182]Chaudhry S.S., Varano M.W., Xu L., Systems Research, Genetic Algorithms and Information Systems[J]. Syst. Res.& Behav. Sci.2000,17:149-162.
[183]Jiang Y., Xu L., Wang H., Wang H., Influencing factors for predicting financial performance based on genetic algorithms[J]. Syst. Res.& Behav. Sci. Published Online:Mar 9 2009 4:53AM, DOI:10.1002/sres.967.
[184]盛骤等.概率论[M].浙江：浙江大学出版社,2003.
[185]Lynda T., Chrisment C., Mohand B., Multiple Query Evaluation Based on Enhanced Genetic Algorithm[J]. Inform. Process. Manage.39 (2003) 215-231.
[186]中铁快运股份有限公司网站.http://www.cre.cn/creweb/cms/web/indexl.jsp [EWEB].
[187]中铁快运信息网.http://www.cre114.com/index-114.htm [EWEB].
[188]中华人民共和国国家邮政局.行邮专列运邮组织方案[S].2004.
[2]Chestler L., Overnight air express:spatial pattern, competition and the future of small package delivery service[J]. Transportation Quarterly,1985,39:59-71.
[3]Dejax P.J., Crainic T.G., A review of empty flows and fleet management models in freight transportation[J]. Transportation Science,1987,21(4):227-247.
[4]Eckstein J., Sheffi Y., Optimization of group line-haul operations for motor carriers using twin trailers[J]. Transportation research record,1987,1120:12-23.
[5]Gehring H., Menschner K., Meyer M., A computer-based heuristic for packing pooled shipment containers[J]. European Journal of Operational research,1990,44:277-288.
[6]Guelat J. Florian M., Graninic T.G.., A multimode multiproduct network assignment model for strategic planning of freight flows[J]. Transportation Science,1990,24(1):25-39.
[7]Roy J., Crainic T.G.., Improving intercity freight routing with a tactical planning model[J]. Interfaces,1992,22(3):31-44.
[8]Crainic T.G., Roy J., Design of regular intercity driver routes for the LTL motor carrier industry[J].Transportation Science,1992,26(4):280-295.
[9]Crainic T.G, Laporte G, Planning models for freight transportation[J]. European journal of Operation research,1997,409-438.
[10]Crainic T.G, Laporte G, Fleet management and logistics[M]. Kluwer Academic Publishers, Norwell, MA,1998:57-93.
[11]Bianco L., Bella A.L., Freight transport planning and logistics[M]. Springer-Verlag, Berlin, 1988.
[12]Godfey G.A., Powell W.B., An adaptive dynamic programming algorithm for dynamic fleet management II:Single period travel times[J]. Transportation Science,2002a,36(1):21-39.
[13]Crainic T.G, Gendreau M., Freight exchanges and carrier operations:Issues, Models, and Tools [R]. Technical Report, Centre de recherche sur les transports, Universite de Montreal, Montreal, QC, Canada,2002b.
[14]Barnhart C., Hane C.A., Vance P.H., Using branch-and-price-and-cut to solve origin destination integer multicommodity flow problems[J]. Operation Research,2000a,48(2):318-326.
[15]Tsamboulas D., Vrenken H., Lekka A.M., Assessment of a transport policy potential for intermodal mode shift on a European scale[J]. Transportation Research Part A:Policy and Practice,2007,41,(8):715-733.
[16]Janic M., An assessment of the performance of the European long intermodal freight trains (LIFTS)[J]. Transportation Research Part A:Policy and Practice,2008,42(10):1326-1339.
[17]郭小碚.加拿大多式联运的发展与启示[J].综合运输,1996,(4)：36-38.
[18]孙全欣,刘作义,朱晓宁.快速货物运输量预测与分析[J].北方交通大学学报,1999,23(5)：105-109.
[19]吴守荣.山东省公路货物运输系统管理研究[J].系统工程理论与实践,1999,11：135-141.
[20]申月,苏顺虎,胡思继.城际间快捷货物运输系统的探索[D],北京交通大学学报,2001,25(2)：62-64.
[21]李夏苗,朱晓立,胡思继.货物运输快捷性、准时性的经济分析[J].交通运输工程学报,2001,1(4)：101-105.
[22]李夏苗,胡思继,朱晓宁.直达输送货物的送达速度和准时性的调查研究[J].北方交通大学学报,2002,26(2)：103-106.
[23]彭大衡,吴健雄.中国公路货物运输发展研究[J].湖南大学学报,2003,17(4)：55-58.
[24]徐鼓平.道路快速货运的理论探索[J].交通企业管理,2005,(5)：22-23
[25]杨松发.论我国公路快速货运系统的发展模式[D].北京工业大学硕士学位论文,北京：2001年6月.
[26]鲍香台,李旭宏,何杰.公路快速货运系统发展现状及政策建议[J].东南大学学报(自然版),2003,33(6)：182-787.
[27]徐亚华.发展汽车快速货运的策略研究[D].长安大学硕士学位论文,2001.6.
[28]杨浩.我国铁路快速货物运输发展的现状与展望[J].北方交通大学学报,2000,24(12)：20-24.
[29]李珺,钟雁,李冠成.关于快速货物运输产品策略的探讨[D].铁路货运,1998,(5)：4-6.
[30]钟雁,乔颖丽.确定铁路快速货物运输目标市场[J].北京交通大学学报,2000,24(3)：118-121.
[31]张巍,魏然,匡敏.青藏铁路格拉段建立综合货运体系的研究[J].铁道运输与经济,2009,31(6)：81-83.
[32]Ahuja, R.K., Magnanti T.L., Orlin J.B., Network Flows[M]. Prentice Hall, New Jersey,1993.
[33]Magnanti TL, Wong RT., Network design and transportation planning:models and algorithms[J]. Transportation Science,1984;18(1):1-55.
[34]Bodin L., Golden B., Assad A., Ball M., Routing and Scheduling of vehicles [M],2001.
[35]Leung J.M., Magnanti T.L., Singhal V., Routing in point-to-point delivery system:formulation and solution heuristic[J]. Transportation Science,1990,24(4):245-260.
[36]Minoux M., Network synthesis and optimum network design problems:models, solution methods and applications[J]. Networks,1989,19:313-60.
[37]Powell WB., A local improvement heuristic for the design of less-than-truckload motor carrier networks[J]. Transportation Science,1986,20(4):246-357.
[38]Powell W.B., Warren B., Sheffi Y., Yosef E., Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry [J]. Operations Research, 1989,37(1):12-29.
[39]Braklow J.W., Graham W.W., Interactive optimization improves service and performance for yellow freight system. Interface,1992,22(1):147-172.
[40]Kuby M.J., Gray R.G., The hub network design problem with stopovers and feeders:the case of federal express[J]. Transportation Research Part:A,1993,27:1-12.
[41]Lin C.C., Chen S.H., The hierarchical network design problem for time-define express common carriers[J]. Transportation Research Part B,2003.40:1-13.
[42]Lin C.C., The freight routing problem of time-definite freight delivery common carriers[J]. Transportation Research Part B,2001,35:525-547.
[43]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.
[44]Andersen J., Crainic T.G., Christiansen M., Service network design with management and coordination of multiple fleets[J]. European Journal of Operational Research,2009,193 (2): 377-389.
[45]Lin C.C., Lin D.Y., Melanie M., Price planning for time-definite less-than-truckload freight services[J]. Transportation Research Part E:Logistics and Transportation Review,2009,45(4): 525-537.
[46]Lin C.C., Lee S.C., The competition game on hub network design[J]. Transportation Research Part B:Methodological, In Press, Corrected Proof, Available online 4 October 2009.
[47]Aykin T., Networking polices for hub-and-spoke systems with application to the air transportation system[J]. Transportation Science,1995,29(3),201-221.
[48]Barnhart C., Schneur R.R., Air network design for express shipment service[J]. Operation Research,1996,44(6):852-863.
[49]Bryan D.L., O'Kelly M.E., Hub-and-spoke network in air transportation:and analytical review, Journal of Regional Science,1999,39(2):275-295.
[50]Buedenbender K., Griinert 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.
[51]Lin C.C., Lin Y.J., Lin D.Y., The economic effects of center-to-center directs on hub-and-spoke networks for air express common carriers[J]. Transportation Research Part B:Methodological, 2004,38(3)271-283.
[52]Yan S., Lai C.H., Chen C.H., A short-term flight scheduling model for international express package delivery[J]. Journal of Air Transport Management,2005,11(6):368-374.
[53]Cheung R.K.M., Powell W.B., An algorithm for multistage dynamic network with random arc capacities, with an application to dynamic fleet management[J]. Operation research,1996a, 44(6):951-963.
[54]Chouman M., Crainic T.G., Gendron B.A., Cutting-plane algorithm based on cutset inequalities for multicommodity capacitated fixed charge network design[R]. Technical Report CRT-2003-16, Centre de recherche sur les transports, Universitede Montreal, Montreal, QC, Canada; 2003.
[55]Crainic T.G., Rousseau J.M., Multicommodity, multimode freight transportation:a general modelling and algorithmic framework for the service network design problem[J]. Transportation Research Part B:Methodological,1986,20:225-42.
[56]Crainic T.G., Service Network design in freight transportation[J]. European Journal of Operational Research,2000,122(2):272-288.
[57]Current J.R., Revelle C.S., Cohon J.L., The hierarchical network design problem[J], European Journal of Operational Research,1986,27:57-66.
[58]Dall'Orto L.C., Crainic T.G.., Leal J.E., Powell W.B., The single-node dynamic service scheduling and dispatching problem[J]. European Journal of Operational Research, 2006,170:1-23.
[59]Duan P., An integrated modelling Framework for intermodal freight operations in hub cities[M]. Northwestern University, Evanston, Illinois, USA,2006.
[60]Farvodden J.M., Powell W.B., Subgradient method for the service network design problem[J].
Transportation Science,1994,28(3):256-272.
[61]Gendron B., Crainic T.G., Relaxations for multicommodity network design problems[M].. Publication CRT-965, Centre de recherche sur les transports, Universite de Montreal, Montreal, QC, Canada; 1994.
[62]Hang D., Dynamic routing problems with service time windows[D]. Hong Kong University of Science and Technology, Hong Kong,2000.
[63]Kim D., Barnhart C., Ware K., Reinhardt G., Multimodal express package delivery:a service network design application[J]. Transportation Science,1999,33(4):391-407.
[64]Jarvis J.J., Mejia de Martinez O., A sensitivity analysis of multicommodity network flows[J]. Transportation Science,1977,11(4):299-306.
[65]Campbell J.F., Hub location for time definite transportation[J]. Computers& Operations Research,2009,36(12):3107-3116.
[66]Lin C.C., Che S.H., An integral constrained generalized hub-and-spoke network design problem[J]. Transportation Research Part E:Logistics and Transportation Review,2008,44(6): 986-1003.
[67]Xu W., He S., Song, R. Li J., Hub Location& Service Frequency Determination for the Rail and Truck Freight Transportation Network[C]. The 88th Annual Meeting of Transportation Research Board, Washington, DC, America, January 11-15,2009.
[68]Lin C.C., The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services [J]. International Journal of Production Economics,2010,123(1):20-30.
[69]高自友,张好智,孙会君.城市交通网络设计问题中双层规划模型、方法及应用[J].交通运输系统工程与信息,2004,4(1)：35-44.
[70]秦进.多商品物流网络设计相关优化模型及算法研[D],湖南长沙：中南大学,2006.
[71]董晓岩.基于始发能力最大化的快运企业运输方案的设计与研究[D],北京：北京交通大学,2004.
[72]韩世莲,李旭宏,刘新旺.物流运输网络模糊最短路径的偏好解[J].交通运输工程学报,2005,5(2)：122-26
[73]沈睿.铁路行包快运服务网络设计理论与方法研究[D].北京交通大学,北京,2006.
[74]沈睿,刘军,季常煦.货物运输服务网络设计频度模型的研究[J].北京交通大学学报,2006,30(6)：36-40.
[75]王保华,何世伟,宋瑞,申永生.综合运输体系下快捷货运网络流量分配优化模型及算法[J].铁道学报,2009,31(2)：12-16.
[76]武云霞,何世伟.综合快捷货运服务网络结构影响因素分析[J].物流科技,2009,32(8)：29-33.
[77]Transportation Research Board, Highway Capacity Manual,2000[M]. WASHINGTON, D.C., USA:Federal Transit Administration in Cooperation with the Transit Development Corporation, 2000.
[78]Asakura Y., Maximum capacity of road network constrained by user equilibrium conditions[C]. Paper presented at the 24th Annual Conference of the UTSQ 1992.
[79]Ferrari P., Road pricing and network equilibrium[J]. Transportation Research Part B,1995,29: 357-372.
[80]Wong S.C., Yang H., Reserve capacity for a signal controlled road network[J]. Transportation Research Part B,1997,31:397-402.
[81]Yang H., Bell M.GH., A capacity paradox in network design and how to avoid it[J]. Transportation Research A,1998b,32:539-545.
[82]Yang H., Bell M.GH., Meng Q., Modelling the capacity and level of service of urban transportation networks[J]. Transportation Research Part B,2000,34:255-275.
[83]Chiou S.W., Reserve capacity of signal-controlled road network[J]. Applied Mathematics and Computation,2007,190(2):1602-1611.
[84]Zhu J.S., Zhang N., Modeling Road Network Capacity and Service Level under Variable Demand Pattern[J]. Systems Engineering-Theory& Practice,2008,28(6):170-176.
[85]Ubbels B., Verhoef E.T., Governmental competition in road charging and capacity choice[J]. Regional Science and Urban Economics,2008,38(2):174-190.
[86]Federal Railroad Administration, Rail Planning Manual[S]. FRA, U.S. Department of Transportation, WASHINGTON, D.C., USA,1977.
[87]Clark D.B., An examination of railroad capacity and its implications for rail-highway intermodal transportation[D]. The university of Tennessee, Knoxville, USA,1995.
[88]Fransoo J.C., Bertrand J.W.M., An aggregate capacity estimation model for the evaluation of railroad passing constructions[J]. Transportation Research Part A:Policy and Practice,2000,34, (1):35-49.
[89]Martinelli D.R., Teng H., Optimization of railway operations using neural networks[J]. Transportation Research,1996,4C:33-49,.
[90]Yuan J., Hansen I.A., Optimizing capacity utilization of stations by estimating knock-on train delays[J]. Transportation Research Part B:Methodological,2007,41(2):202-217.
[91]Gibson S., Allocation of capacity in the rail industry[J]. Utilities Policy,2003,11(1):39-42.
[92]Huisman T., Boucherie R.J., Van Dijk N.M., A solvable queuing network model for railway networks and its validation and applications for the Netherlands[J]. European Journal of Operational Research,2002,142(1):30-51
[93]Abril M., Barber F., Ingolotti L., Salido M.A., Tormos P., Lova A., An assessment of railway capacity[J]. Transportation Research Part E:Logistics and Transportation Review,2008,44(5): 774-806.
[94]Fransoo J.C., Bertrand J.W.M., An aggregate capacity estimation model for the evaluation of railroad passing constructions[J]. Transportation Research Part A:Policy and Practice, Volume 2000,34 (1):35-49.
[95]Harrod S., Capacity factors of a mixed speed railway network[J]. Transportation Research Part E:Logistics and Transportation Review,2009,45(5):830-841.
[96]Gendron B., Crainic TG., Bounding procedures for multicommodity capacitated network design problems[D]. Publication CRT-96-06, Centre de recherche sur les transports, Universite de Montreal, Montreal, QC, Canada,1996.
[97]Morlok E.K., Riddle S.M., Estimating the Capacity of Freight Transportation Systems:A Model and Its Application in Transport Planning and Logistics[J]. Transportation Research Record, 1999,1653(NAS-NRC),1-8.
[98]Park M., Capacity modelling for multimodal freight transportation networks[D]. Dissertation of PH.D. University of California, Irvine.2005.
[99]Crainic T.G., Kim K.H., Intermodal transportation. In:C. Barnhart[M]. G. Laporte (Eds.), Transportation, Handbooks in Operations Research and Management Science (Chapter 8), 2007,14:467-537.
[100]Caramia M., Dell'Olmo P., Gentili M., Mirchandani P.B. Delivery itineraries and distribution capacity of a freight network with time slots[J]. Computers& Operations Research,2007,34(6): 1585-1600.
[101]Lin C.C., The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services[J]. International Journal of Production Economics,2010,123(1):20-30.
[102]Chen A., Yang H., Lo H.K., Tang W.H., A Capacity Related Reliability For Transportation Network [J]. Journal of Advance Transportation,1999, No.2:183-200.
[103]Chen A., Yang H., Lo H.K., Tang W.H., Capacity reliability of a road network:an assessment methodology and numerical results [J]. Transportation Research Part-B,2002,36:225-252.
[104]Cho D.J., Morlork E.K., Chen Z.L., Efficient Algorithms for Measuring the Reliability of Transportation Network System Capacity[R]. Working Paper of the University of Pennsylvania, 2002, Philadelphia.
[105]Chang D.J., Extending transportation system capacity flexibility model[D]. University of Pennsylvania, Pennsylvania, USA,2003.
[106]Cho D.J., Three papers on measuring the reliability and flexibility of transportation system capacity[D]. University of Pennsylvania, Pennsylvania, USA,2002.
[107]Feitelson E., Salomon I., The implications of Different Network Flexibility for Spatial Strudures[J]. Transportation Research Part A,2000,34:459-479.
[108]Lin Y.K., Reliability of a computer network in case capacity weight varying with arcs, nodes and types of commodity[J]. Reliability Engineering& System Safety,2007,92(5):646-652.
[109]Lin Y.K., Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths[J]. Computers& Operations Research,2009,36 (4): 1050-1063.
[110]Xu W., He S., Song R., Li J., Reliability based assignment in stochastic-flow freight network[J]. Applied Mathematics and Computation,2009,211 (1):85-94.
[111]张亚平,裴玉龙.道路通行能力研究现状及发展综述[J].交通运输工程学报,2002,2,(2)：94-97.
[112]牛惠民,胡安洲.铁路枢纽愈能资源合理利用的多目标优化模型[J].系统工程学报,2000,15(2)：119-123.
[113]张超.铁路枢纽运输能力计算方法研究[D].北京：北方交通大学,2002.
[114]胡安洲,杨浩.关于铁路运输问题的系列研究[J].铁道经济研究,1994,(1).
[115]胡思继.列车运行组织及通过能力理论[M].北京：中国铁道出版社,1993.
[116]施其洲.铁路网运输系统运输能力与车流路径模型[J].铁道学报,1996,18(4)：1-9.
[117]何世伟,宋瑞,戴新鎏,杨永凯,雷中林.路网运输能力及计算方法的研究[J].铁道学报,2003,25(2)：5-9.
[118]雷中林.铁路路网运输能力计算方法研究[D].北京：北方交通大学,2006.
[119]雷中林,何世伟.铁路路网系统运输能力灵活性研究[J].铁道学报,2009,31,(1)：26-30.
[120]李红艳,陈治亚,何世伟,许旺土.公铁联运货运网络潜在运能分析[J].铁道学报,2009,31(1)：20-25.
[121]许旺土,何世伟,何必胜.综合运输货运服务网络运输能力及影响因素[J].综合运输,2009,(6)：64-68.
[122]苏顺虎,陈治亚,何世伟,王保华.基于服务水平的铁路货物运输网络能力计算方法[J].中国铁道科学,2009,30,(2)：113-118.
[123]周怀惠.综合运输体系下快捷货运网络系统服务水平评价指标体系研究[D].硕士学位论文,北京：北京交通大学,2009.6.
[124]Schonberger J., Operational Freight Carrier Planning:Basic concepts, operation models and advanced mimetic algorithms [M]. Springer Press,2005.
[125]安路生.中国铁路运输新实践[M].北京：中国铁道出版社,2009.
[126]Lin, C.C., The load planning of time-define freight delivery common carriers[J]. Transportation Planning Quarterly,1998,27(3):371-406.
[127]陈秀华,林正章.一般化轴幅式网路问题设计与应用[D].博士学位论文,中国台湾：国立成功大学,2005.
[128]吴群琪,孙启鹏.综合运输规划理论的基点[J].交通运输工程学报,2006,6(3)：122-126.
[129]王庆云.交通运输发展理论与实践[M].中国科学技术出版社.北京.2005.
[130]Ge Y.E., Zhang H.M., Lam W.H.K., Network reserve capacity under influence of traveler information[J]. Journal of Transportation Engineering,2003, (5):262-270.
[131]Park M., Regan A., Capacity modeling in transportation:A multimodal perspective[J]. Transportation Research Record:Journal of the Transportation Research Board,2005,1906: 97-104.
[132]Morlok E.K., Chang D.J., Measuring Capacity Flexibility of a transportation system[C].88th Annual Meeting Preprint CD-ROM, Transportation Research Board, January 11-15,2004, Washington, D.C., USA.
[133]Kasikitwiwat P., Capacity reliability and capacity flexibility of a transportation network[D]. Utah State University, Logan, Utah,2004.
[134]Willumsen L.G., Estimation of an OD matrix from traffic counts-a review[D]. Institute of Transport Studies, University of Leeds, Working Paper 99,1978.
[135]VanderZijpp N.J., Dynamic origin-destination matrix estimation from traffic counts and automated vehicle identification data[J]. Transportation Research Record:Journal of the Transportation Research Board,1997,1607:87-94.
[136]Fabien M., Optimal Network Estimation of Origin-Destination Flow from Link Data[C].88th . Annual Meeting Preprint CD-ROM, Transportation Research Board, Washington, D.C., USA. 2009,1.
[137]Ortuzar J. D., Willumsen L.G., Modeling Transport[M]. John Wiley Press, USA,2005.
[138]Dheenadayalu L., Wolshon Y.B., Wilmot C., Analysis of link capacity estimation methods for urban planning models[J]. Journal of Transportation Engineering,2004,130:268-275.
[139]Ben-Akiva M., Bergman M.J., Daly A.J., Ramaswamy R., Modelling inter-urban route choice behaviour[C]. In:Proceedings Ninth International Symposium on Transportation and Traffic Theory. VNU Science Press, Utrecht,1984; pp.299-330.
[140]Dial R.B., Bicriterion traffic equilibrium:T2 mode, algorithm, software overview[J].
Transportation Research Record, Transportation Research Board,2000,1725:54-62.
[141]Tong C.O., Richardson A.J., Estimation of time-dependent origin-destination matrices for transit networks[J]. Journal of Advanced Transportation,1984,18:145-161.
[142]Yen J.Y., Finding the k shortest loopless paths in a network[J]. Management Science,1971.17: 712-16.
[143]Katoh N., Ibaraki T., Mine H., An efficient algorithm for k shortest simple paths[J]. Networks 1982,12:411-27.
[144]Fox B.L., Data structures and computer science techniques in operations research[J]. Operations Research,1978,26:686-717.
[145]Eppstein D., Finding the k shortest paths[J]. SIAM Journal of Computing,1998,28:652-73. Swersey AJ, Ballard W. Scheduling school buses. Management Science 1984; 30:844-53.
[146]Chen Y.L., Chin Y.H. The quickest path problem[J]. Computers& Operations Research 1990; 17:153-61.
[147]Yang H.H., Chen Y.L. Finding K shortest looping paths in a traffic-light network[J]. Computers & Operations Research,2005,32:571-81.
[148]Desrochers M., Desrosiers J., Solomon M.M., A new optimization algorithm for the vehicle routing problem with time windows[J]. Operations Research,1992,40:342-54.
[149]Chen Y.L., Yang H.H, Shortest paths in traffic-light networks[J]. Transportation Research Part B,2000,34:241-53.
[150]Chen Y.L., Yang H.H., Finding the first K shortest paths in a time-window network[J]. Computers& Operations Research,2004,31:499-513.
[151]Balakrishnan N., Simple heuristics for the vehicle routing problem with soft time windows[J]. 1993,44:279-87.
[152]Solomon M., Desrosiers J., Time window constrained routing and scheduling problems:a survey[J]. Transactions of Science,1988,22:1-13.
[153]VanderZijpp N.J., Fiorenzo C.S., Path enumeration by finding the constrained K-shortest paths[J]. Transportation Research Part B,2005,35:545-63.
[154]Chen G, Ansari N., Finding a least hop(s) path subject to multiple additive constraints[J]. Computer Communication,2006,29:392-401.
[155]Tong, C.O., WongS.C., Poon M.H., Tan M.C., A schedule based dynamic transit network model-recent advances and prospective future research[J]. Journal of Advanced Transportation, 2001,35 (2):175-195.
[156]Huang R., Peng Z., Schedule-based path finding algorithms for transit trip planning systems[J]. Journal of Transportation Research Board:Transportation Research Record,2002,1783: 142-148.
[157]Friedrich M., Hofsaβ I., Wekeck S., Timetable-based transit assignment using branch& bound[C]. In Proceedings of "80th Annual of Transportation Research Board, Washington D.C., USA,2001.
[158]Xu W., He S., Song R., Chaudhry S.S., Finding the K shortest paths in a schedule-based transit network[J]. Computers& Operations Research,2010, doi:10.1016/j.cor.2010.02.005.
[159]Jan Riezebos J., van Wenzel W.,K-Shortest routing of trains on shunting yards[J]. OR Spectrum,2009,31 (4):745-758.
[160]Fredman M.L., Tarjan R.E., Fibonacci heaps and their uses in improved network optimization algorithms[J]. JACM,1987,34:596-615.
[161]Dijkstra E.W., A note on two problems in connection with graphs[J]. Numerical Mathematics, 1959,1:269-71.
[162]Cormen T.H., Leiserson C.E., Rivest R.L., Introduction to Algorithms[M]. MIT Press, Cambridge, MA,1990.
[163]牛新奇,潘荫荣,胡幼华.(K≤3)条渐次短路径搜索算法的研究[J].计算机工程与应用,2005,22,51-53.
[164]牛新奇,潘荫荣.轨道交通系统中清分算法的研究[J].计算机时代,2005(2)：17-21
[165]贺振欢.城市道路交通路径选择模拟系统及模型体系研究[D].北方交通大学,2003.
[166]Agrawal B.B., An Analytical Shipper-Carrier Freight Assignment Model Using a Variational Inequality Approach [D]. Northwestern University, Evanston, Illinois, USA,2006.
[167]Beuthe M., Degrandsarta F., Geertsb J-F., Jourquin B., External costs of the Belgian interurban freight traffic:a network analysis of their internalization [J]. Transportation Research Part D: Transport and Environment,2002 7(4):285-301.
[168]Chen H.K., Hsueh C.F., A model and an algorithm for the dynamic user-optimal route choice problem. Transportation Research Part-B 1998 32(3):219-234.
[169]黄红选,韩继业.数学规划[M].北京：清华大学出版社,2006.3.
[170]甘应爱,等,运筹学[M].北京：清华大学出版社,2002.6.
[171]Bell M.G.H., Iida Y., Transportation Network Analysis[M]. New York:John Wiley and Sons Press,1997.
[172]刘海旭,卜雷,蒲云.随机路网的行程时间可靠性[J].土木工程学报,2004,37(8)：102-105.
[173]Asakura Y., Rehability Measures of all Origin and Destination Pair in a Deteriorated Road Network with Variable Flows[A]. Bell M. G. H. Eds.. Transportation Networks:Recent Methodological Advances l C J, Oxford:Pergamon Press.1998:273-288.
[174]Du P., Nieholson A.J. Degradable Transportation Systems:Sensitivity and Reliability Analysis[J]. Transportation Research Part B,1997,31(3):225-23.
[175]陈坤,于雷.基于对数正态和分布的路径行程时间可靠性模型[J].北京交通大学学报,2009,33(3)：36-39.
[176]干宏程,汪睛,范炳全.基于宏观交通流模型的行程时间预测[J].上海理工大学学报,2008,30(5)：409-413.
[177]张勇.考虑路段关联失效的路网行程时间可靠性估计[J].土木工程学报,2008,41(8)：87-92.
[178]Doulliez P., Jamoulle J., Transportation networks with random arc capacities[J], Operations Research,1972,3:45-60.
[179]Asakura Y., Kashiwadani M., Road network reliability caused by daily fluctuation of traffic flow[C]. In:Proceeding of the 19th PTRC Summer Annual Meeting, Brighton,1991:73-74.
[180]Liu B., Theory and Practice of Uncertain Programming[M]. Physica-Verlag, Heidelberg,2002.
[181]Liu B., Uncertainty theory:An introduction to its axiomatic foundations[M]. Berlin: Springer-Verlag,2004.
[182]Chaudhry S.S., Varano M.W., Xu L., Systems Research, Genetic Algorithms and Information Systems[J]. Syst. Res.& Behav. Sci.2000,17:149-162.
[183]Jiang Y., Xu L., Wang H., Wang H., Influencing factors for predicting financial performance based on genetic algorithms[J]. Syst. Res.& Behav. Sci. Published Online:Mar 9 2009 4:53AM, DOI:10.1002/sres.967.
[184]盛骤等.概率论[M].浙江：浙江大学出版社,2003.
[185]Lynda T., Chrisment C., Mohand B., Multiple Query Evaluation Based on Enhanced Genetic Algorithm[J]. Inform. Process. Manage.39 (2003) 215-231.
[186]中铁快运股份有限公司网站.http://www.cre.cn/creweb/cms/web/indexl.jsp [EWEB].
[187]中铁快运信息网.http://www.cre114.com/index-114.htm [EWEB].
[188]中华人民共和国国家邮政局.行邮专列运邮组织方案[S].2004.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |