高速铁路客运产品设计中的客流分配理论与方法研究
|
摘要
客流分配理论是铁路客运产品设计的核心技术。在高速铁路大规模建设条件下,客运产品规划质量直接影响着新建铁路网的运营效益。在客运产品设计的不同阶段,即“宏观战略层”的客运产品结构优化,“中观策略层”的旅客列车开行方案优化,“微观操作层”的旅客列车运行图优化都与客流量有直接的关系,所以,在每个规划阶段建立合适的客流分配模型以及设计快速有效的客流分配算法对指导高速铁路客运产品优化设计有重要意义。
由于高速线客流与既有线客流的选择行为和特点不同,呈现出“时间需求敏感性、客流层次多样性、出行距离不均衡性、日客流高低峰明显性”等新特点,决定了高速线客运产品设计与既有线不同,是全新的系统工程。另外,在网络化的全新高速铁路客运产品规划中,客流分配方法需要适应网络优化的需求。除此之外,铁路客流分配又不同于道路交通流分配,需要针对铁路客流分配特点,进行客流分配理论与方法的研究。本论文以高速铁路运营网络为背景,从高速铁路客流特点出发,研究适合高速铁路客运产品设计中的客流分配理论与方法,研究工作主要有以下几个方面：
(1)旅客出行选择特性及客流分配问题研究。首先,根据铁路旅客出行选择特性,对高速铁路客运产品的不同层次内容进行分析,指出客运产品规划的主要问题。然后,重点对不同层次客流分配的影响因素进行研究,提出基于客流分配方法的高速铁路客运产品一体化规划流程。最后,根据博弈理论,建立多层次规划模型描述客运产品规划的企业效益与旅客效益间的Stackelberg博弈关系,其中,多层次规划模型的下层模型均为不同层次客运产品规划下的客流分配模型。
(2)高速铁路物理路网客流分配方法研究。合理路径集合生成是客流分配的基础,直接关系到客流分配算法的效率。本论文提出客流起讫点间的备选路径集合和合理路径集合的生成方法,采用混合遗传学算法进行物理节点间的K短路生成,即备选路径集合,在备选路径集合的基础上,根据多约束条件生成合理路径集合。在此研究基础上,研究铁路物理路网客流分配方法,建立基于合理出行路径集合的客流分配模型,并设计遗传算法对模型进行求解。最后,以京沪高速铁路相关物理路网为例进行客流分配,验证模型和算法的有效性。
(3)基于复杂列车服务网络的客流分配方法研究。首先对旅客列车开行方案形成的复杂列车服务网络属性及其构造方法进行研究,在分析多层次客流选择行为基础上,确定列车服务网络弧段阻抗。建立体现差异性服务水平需求的复杂列车服务网络客流分配模型,该模型以旅客出行效益最大化为目标,通过分别限制不同出行距离、不同层次旅客的换乘次数及换乘时间,设置旅客出行路径的多约束条件。设计由改进的蚁群算法和Frank-Wolfe算法构成的混合算法进行求解,为更加符合旅客的选择行为,按OD客流量、出行距离、优先级等规则进行流量加载。最后,以京沪高速铁路相关旅客列车开行方案为例进行客流分配,验证模型和算法的有效性。
(4)基于复杂列车时空服务网络的客流分配方法研究。首先对“微观操作层”客运产品设计的列车时空服务网络时空特性和构建方法进行了研究。在分析高速铁路旅客出行的时空特性及选择行为基础上,研究时空服务网络下的时空服务弧段阻抗。然后建立带有服务时间窗约束以及旅客差异性服务需求约束下的复杂列车时空服务网络客流分配模型,该模型考虑旅客出行路径的时间窗约束、差异性服务需求约束、换乘等多种约束条件。提出由时间窗搜索算法和改进的Dijkstra算法构成的组合算法求解旅客在列车时空服务网络中的合理路径集合,并设计基于时空服务网络合理出行路径集合的客流分配子算法。最后,以京沪高速铁路相关网络下的旅客列车运行图为初始化时空服务网络,进行客流分配,验证模型和算法的有效性。
Passenger flow assignment theory is the core technology of railway passenger transport product design. Under the context of large-scale construction of high-speed railway, the quality of high-speed railway passenger transport product planning directly affects the operation of national railway network and directly concerns the national economy as well as social service. Therefore, rational design of high-speed railway passenger transport products is significantly meaningful. Moreover, the three stages of passenger transport product design, namely passenger transport product structure design in the macro strategic level, the optimization of passenger train operation plan in the medium strategic level and the optimization of passenger train diagram in the micro-operation level, all have direct bearing on passenger flow volume, therefore, building proper passenger flow assignment model and designing rapid and effective passenger flow assignment algorithm in each planning stage have the practical application value in the development of planning and decision making system of high-speed railway passenger transport product operation.
As high-speed railway is brand new system project, high-speed railway passenger transport product design is different from that of the existing railway. Moreover, the choice behavior and characteristics of high-speed railway passenger flow, which turns out to be characteristic of sensitive time demand, diverse passenger flow tiers, uneven trip distances, distinct passenger flow peak periods and bottom periods and other aspects, is also different from that of the existing railway. In addition, in the brand new web based passenger transport product planning, passenger flow assignment need to be consistent with the requirement of brand new. Beyond that, as railway passenger flow assignment is different from road traffic flow assignment, it is necessary to study the theory and method of passenger flow assignment according to the characteristics of railway passenger flow assignment. Based on the high-speed rail network, this paper studies the passenger flow assignment theory and method appropriate for high-speed rail passenger transport product design, starting from the choice behavior of passengers and the features of high-speed railway passenger flow. The study covers the following aspects:
(1) Study on the planning of high-speed railway passenger transport products and the problem of Passenger flow assignment. Firstly, based on the study on the features of high-speed railway passenger trip, this paper analyzes the specific high-speed railway passenger transport products at different levels and points out the main problems of passenger transport product planning. The focus of study in this part is on the influencing factors of passenger flow assignment at different levels. Finally, this paper puts forward the planning process of high-speed railway passenger transport product integration based on passenger flow assignment and suggests building multi-level planning model to describe the Stackelberg game relationship between enterprise revenue and passenger benefit of passenger transport planning. Moreover, the models under multi-level planning model are the passenger flow assignment models of passenger transport product planning at different levels.
(2) Study on the high-speed railway passenger flow assignment method under physical network. Reasonable route choice set generation algorithm is the basis of passenger flow assignment and has direct bearing on the efficiency of passenger flow assignment algorithm. This paper puts forward the generation method of alternative path set and reasonable route choice set between the starting and ending points of the passenger flow. This paper adopts hybrid genetic algorithm for K short circuit generation between physical nodes, namely alternative path set, based on which to generate reasonable route choice set according to multiple constraint conditions. In the study on passenger flow assignment method based on railway physical network, it builds passenger flow assignment model based on reasonable trip route set and designs genetic algorithm to solve the model. Finally, taking relevant Beijing-Shanghai high speed railway network for example, this paper conducts passenger flow assignment and validates the effectiveness of the model and algorithm.
(3) Study on passenger flow assignment method based on complex train service network. This paper makes researches on the properties and its constructing method of complex train service network (CTSN) formed from passenger train plan. By analyzing multi-level passenger's choice behavior, the arc resistance of CTSN is determined. A passenger flow assignment model of CTSN reflecting different passenger's travel requirement is developed. The model takes maximum passenger travel utility as objective. The multi-constraint of passenger travel route is set by restricting the number of transfer times and transfer time for passengers with different travel distance and levels of consumption respectively. A hybrid algorithm consisting of improved ant colony and Frank-Wolfe algorithm is designed to solve the model. In order to match the choice of rail passenger behavior, passenger flow is assigned by several rules in terms of OD traffic, trip distance and priority. Finally, a case study on a partial network centered by Beijing-Shanghai high speed railway proves the effectiveness of the proposed model and algorithm.
(4) Study on the passenger flow assignment method based on complex train space-time service network. Firstly, this paper studies the features and construction methods of train space-time service network of passenger transport product design in the micro-operation level. This paper points out the space-time service arc cost of space-time service network, based on the analysis of the space-time features and choice behavior of high-speed railway passenger trip. After that, it builds passenger flow assignment model for complex train space-time network under the constraints of service time window and passenger flow demand difference which takes the constraint of time window of passenger's trip route, different service demand, transference and the like into account. It suggests solving the reasonable route choice set of passenger in train space-time service network with combinational algorithm composed of time window search algorithm and improved Dijkstra algorithm and designs subalgorithm of passenger flow assignment based on space-time network reasonable route choice set. At last, taking passenger train diagram under relevant Beijing-Shanghai high speed railway network as the initial space-time service network, it conducts passenger flow assignment and validates the effectiveness of the model and the algorithm.
由于高速线客流与既有线客流的选择行为和特点不同,呈现出“时间需求敏感性、客流层次多样性、出行距离不均衡性、日客流高低峰明显性”等新特点,决定了高速线客运产品设计与既有线不同,是全新的系统工程。另外,在网络化的全新高速铁路客运产品规划中,客流分配方法需要适应网络优化的需求。除此之外,铁路客流分配又不同于道路交通流分配,需要针对铁路客流分配特点,进行客流分配理论与方法的研究。本论文以高速铁路运营网络为背景,从高速铁路客流特点出发,研究适合高速铁路客运产品设计中的客流分配理论与方法,研究工作主要有以下几个方面：
(1)旅客出行选择特性及客流分配问题研究。首先,根据铁路旅客出行选择特性,对高速铁路客运产品的不同层次内容进行分析,指出客运产品规划的主要问题。然后,重点对不同层次客流分配的影响因素进行研究,提出基于客流分配方法的高速铁路客运产品一体化规划流程。最后,根据博弈理论,建立多层次规划模型描述客运产品规划的企业效益与旅客效益间的Stackelberg博弈关系,其中,多层次规划模型的下层模型均为不同层次客运产品规划下的客流分配模型。
(2)高速铁路物理路网客流分配方法研究。合理路径集合生成是客流分配的基础,直接关系到客流分配算法的效率。本论文提出客流起讫点间的备选路径集合和合理路径集合的生成方法,采用混合遗传学算法进行物理节点间的K短路生成,即备选路径集合,在备选路径集合的基础上,根据多约束条件生成合理路径集合。在此研究基础上,研究铁路物理路网客流分配方法,建立基于合理出行路径集合的客流分配模型,并设计遗传算法对模型进行求解。最后,以京沪高速铁路相关物理路网为例进行客流分配,验证模型和算法的有效性。
(3)基于复杂列车服务网络的客流分配方法研究。首先对旅客列车开行方案形成的复杂列车服务网络属性及其构造方法进行研究,在分析多层次客流选择行为基础上,确定列车服务网络弧段阻抗。建立体现差异性服务水平需求的复杂列车服务网络客流分配模型,该模型以旅客出行效益最大化为目标,通过分别限制不同出行距离、不同层次旅客的换乘次数及换乘时间,设置旅客出行路径的多约束条件。设计由改进的蚁群算法和Frank-Wolfe算法构成的混合算法进行求解,为更加符合旅客的选择行为,按OD客流量、出行距离、优先级等规则进行流量加载。最后,以京沪高速铁路相关旅客列车开行方案为例进行客流分配,验证模型和算法的有效性。
(4)基于复杂列车时空服务网络的客流分配方法研究。首先对“微观操作层”客运产品设计的列车时空服务网络时空特性和构建方法进行了研究。在分析高速铁路旅客出行的时空特性及选择行为基础上,研究时空服务网络下的时空服务弧段阻抗。然后建立带有服务时间窗约束以及旅客差异性服务需求约束下的复杂列车时空服务网络客流分配模型,该模型考虑旅客出行路径的时间窗约束、差异性服务需求约束、换乘等多种约束条件。提出由时间窗搜索算法和改进的Dijkstra算法构成的组合算法求解旅客在列车时空服务网络中的合理路径集合,并设计基于时空服务网络合理出行路径集合的客流分配子算法。最后,以京沪高速铁路相关网络下的旅客列车运行图为初始化时空服务网络,进行客流分配,验证模型和算法的有效性。
Passenger flow assignment theory is the core technology of railway passenger transport product design. Under the context of large-scale construction of high-speed railway, the quality of high-speed railway passenger transport product planning directly affects the operation of national railway network and directly concerns the national economy as well as social service. Therefore, rational design of high-speed railway passenger transport products is significantly meaningful. Moreover, the three stages of passenger transport product design, namely passenger transport product structure design in the macro strategic level, the optimization of passenger train operation plan in the medium strategic level and the optimization of passenger train diagram in the micro-operation level, all have direct bearing on passenger flow volume, therefore, building proper passenger flow assignment model and designing rapid and effective passenger flow assignment algorithm in each planning stage have the practical application value in the development of planning and decision making system of high-speed railway passenger transport product operation.
As high-speed railway is brand new system project, high-speed railway passenger transport product design is different from that of the existing railway. Moreover, the choice behavior and characteristics of high-speed railway passenger flow, which turns out to be characteristic of sensitive time demand, diverse passenger flow tiers, uneven trip distances, distinct passenger flow peak periods and bottom periods and other aspects, is also different from that of the existing railway. In addition, in the brand new web based passenger transport product planning, passenger flow assignment need to be consistent with the requirement of brand new. Beyond that, as railway passenger flow assignment is different from road traffic flow assignment, it is necessary to study the theory and method of passenger flow assignment according to the characteristics of railway passenger flow assignment. Based on the high-speed rail network, this paper studies the passenger flow assignment theory and method appropriate for high-speed rail passenger transport product design, starting from the choice behavior of passengers and the features of high-speed railway passenger flow. The study covers the following aspects:
(1) Study on the planning of high-speed railway passenger transport products and the problem of Passenger flow assignment. Firstly, based on the study on the features of high-speed railway passenger trip, this paper analyzes the specific high-speed railway passenger transport products at different levels and points out the main problems of passenger transport product planning. The focus of study in this part is on the influencing factors of passenger flow assignment at different levels. Finally, this paper puts forward the planning process of high-speed railway passenger transport product integration based on passenger flow assignment and suggests building multi-level planning model to describe the Stackelberg game relationship between enterprise revenue and passenger benefit of passenger transport planning. Moreover, the models under multi-level planning model are the passenger flow assignment models of passenger transport product planning at different levels.
(2) Study on the high-speed railway passenger flow assignment method under physical network. Reasonable route choice set generation algorithm is the basis of passenger flow assignment and has direct bearing on the efficiency of passenger flow assignment algorithm. This paper puts forward the generation method of alternative path set and reasonable route choice set between the starting and ending points of the passenger flow. This paper adopts hybrid genetic algorithm for K short circuit generation between physical nodes, namely alternative path set, based on which to generate reasonable route choice set according to multiple constraint conditions. In the study on passenger flow assignment method based on railway physical network, it builds passenger flow assignment model based on reasonable trip route set and designs genetic algorithm to solve the model. Finally, taking relevant Beijing-Shanghai high speed railway network for example, this paper conducts passenger flow assignment and validates the effectiveness of the model and algorithm.
(3) Study on passenger flow assignment method based on complex train service network. This paper makes researches on the properties and its constructing method of complex train service network (CTSN) formed from passenger train plan. By analyzing multi-level passenger's choice behavior, the arc resistance of CTSN is determined. A passenger flow assignment model of CTSN reflecting different passenger's travel requirement is developed. The model takes maximum passenger travel utility as objective. The multi-constraint of passenger travel route is set by restricting the number of transfer times and transfer time for passengers with different travel distance and levels of consumption respectively. A hybrid algorithm consisting of improved ant colony and Frank-Wolfe algorithm is designed to solve the model. In order to match the choice of rail passenger behavior, passenger flow is assigned by several rules in terms of OD traffic, trip distance and priority. Finally, a case study on a partial network centered by Beijing-Shanghai high speed railway proves the effectiveness of the proposed model and algorithm.
(4) Study on the passenger flow assignment method based on complex train space-time service network. Firstly, this paper studies the features and construction methods of train space-time service network of passenger transport product design in the micro-operation level. This paper points out the space-time service arc cost of space-time service network, based on the analysis of the space-time features and choice behavior of high-speed railway passenger trip. After that, it builds passenger flow assignment model for complex train space-time network under the constraints of service time window and passenger flow demand difference which takes the constraint of time window of passenger's trip route, different service demand, transference and the like into account. It suggests solving the reasonable route choice set of passenger in train space-time service network with combinational algorithm composed of time window search algorithm and improved Dijkstra algorithm and designs subalgorithm of passenger flow assignment based on space-time network reasonable route choice set. At last, taking passenger train diagram under relevant Beijing-Shanghai high speed railway network as the initial space-time service network, it conducts passenger flow assignment and validates the effectiveness of the model and the algorithm.
引文
[1]Beckmann M J, McGuire C B, Winsten C B. Studies in the economics of transportation. New Haven:Yale university Press.1956.120-158.
[2]Dial R.B. A probabilistic multi-path traffic assignment model which obviates the need for path enumeration.Transportation Research.1971.5 (2).83-111.
[3]Pierre Robillard, Claude Chriqui. Common bus lines.Transportation science.1975.9 (2). 115-112.
[4]Carlos F. Daganzo. On the traffic assignment problem with flow dependent costs—Ⅱ. Transportation science.1977.11 (6).439-441.
[5]Yosef Sheffi. Estimating choice probabilities among nested alternatives. Transportation Research Part B:Methodological.1979.13 (3).189-205.
[6]Hasselstrom, D. Public Transportation Planning-A Mathematical Programming Approach. In Doctoral Dissertation. University of Goteborg. Sweden.1982.6.89-159.
[7]Spiess H. Contributions'a la th'eorie et aux outils de planification de r'eseaux de transport urbain. Ph.D. thesis. D'epartement d'informatique et de recherche op'erationnelle. Centre de recherche sur les transports. Universit'e de Montr'eal.1984. Publication 382.
[8]S. Nguyen. Equilibriumtrafficassignment for large scale transit networks. European Journal of Operational Research.1988.37 (2).176-186.
[9]Spiess H. Florian M. Optimal Strategies: A New Assignment Model for Transit Networks.Trans.Res.1989.23 (B).83-102.
[10]De Cea. Fernandez E. Transit Assignment for Congested Public Transport System: An Equilibrium Model.Transportation Research.1993.27 (2).133-147.
[11]Wu J.H. Transit equilibrium assigment: a model and solution algorithms.Transportation Science.1994.28 (3).193-203.
[12]Sang Nguyen etc. Implicit enumeration of hyper paths in a Logit model for transit networks.Transportation Research.1998.32 (1).54-64.
[13]Pattnail S.B etc.Urban bus transit rout network design using genetic algorithm. Journal of Transportation Engineering.1998.124(4).368-375.
[14]Lam W.H.K., Z.Y. Gao,et al. A Stochastic User Equilibrium Assignment Model for Congested Transit Networks.Transportation Science.1999.33 (B).351-368.
[15]Claessens, M.T., van Dijk, N.M., Zwaneveld, P.J. Cost optimal allocation of passenger lines. European Journal of Operational Research.1998.110 (3).474-489.
[16]Yu-Hern Chang, Chung-Hsing Yeh, Ching-Cheng Shen. A multiobjective model for passenger train services planning: application to Taiwan's high-speed rail line.Transportation Science.2000.34 (2).91-106
[17]Chi-Kang LEE, Wen-jin HSIEH. A Demand Oriented Service Planning. Process[A]. The World Congress On Railway Research.2001.55-89.
[18]史峰.基于弹性需求的旅客列车开行方案优化研究.铁道学报.2008.30(3).1-6.
[19]Goossens, J.H.M. etc. A branch-and-cut approach for solving railway line-planning problems.Transportation Science.2004a.38 (3).379-393.
[20]Goossens, J.H.M. Models and algorithms for railway line planning problems. PhD thesis, University of Maastricht.2004b.46-97.
[21]Goossens, J.H.M. etc. Optimising halting station of passenger railway lines.2004c. http://arno.unimaas.nl/show.cgi?fid=803.
[22]Goossens, J.H.M., van Hoesel, C.P.M., Kroon, L.G. On solving multi-type railway line planning problems. European Journal of Operational Research.2005.168 (2).403-424.
[23]Scholl, S. Customer-oriented line planning. PhD thesis. University of Kaiserslautern. 2005.23-56.
[24]Schobel, A., Scholl, S.. Line planning with minimal transfers. In 5th Workshop on Algorithmic methods and Models for Optimization of Railways, number 06901 in Dagstuhl Seminar Proceedings,2006.
[25]Marc E. Pfetsch, Ralf Borndorfer. Routing in Line Planning for Public Transport. Berlin: ZIB Allgemein,2005.05-36.
[26]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. A path-based model for line planning in public transport. Berlin: ZIB Allgemein,2005.05-18.
[27]J.F. Guan, Hai Yang, S.C. Wirasinghe. Simultaneous optimization of transit line configuration and passenger line assignment. Transportation Research Part B.2006.40 (10).885-902.
[28]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. A Column-Generation Approach t-o Line Planning in Public Transport.Transportation Science.2007.41 (1).123-132.
[29]杨新苗.城市公交发展技术保障体系关键技术研究.南京：东南大学.2000.23-65.
[30]牟达.大连市快速公交规划及其效果评价.大连：大连理工大学.2006.20-44.
[31]汤可夫.公交客流分配与调度的遗传算法.大连：大连理工大学.2004.14-56.
[32]曹庆峰.公交均衡分配模型及其在EMME/2的应用研究.西安：长安大学.2007.34-39.
[33]张启人.公共交通大系统建模与优化.系统工程.1986.4(6).25-39.
[34]高岩.城市公交网络设计模型与算法研究.长沙：长沙理工大学.2007.15-39.
[35]魏恒.公交网络客流分配模型研究.北京工业大学学报.1990.16(4).35-39.
[36]刘清等.实现城市公交线网优化的数学模型和广义A*算法.系统工程理论与实践.1992.12(2).11-17.
[37]王志栋.公交线网优化模型的建立.大连铁道学院学报.1997.18(4).31-34.
[38]夏志浩,王胜奎等.用公交车站上下客数推算公交OD分布的方法.四川联合大学学报(工程科学版).19971.1(2).41-48.
[39]四兵锋等.城市公交网络均衡配流模型及算法的研究.公路交通科技.1998.15(3).41-44.
[40]四兵锋,高自友等.城市交通超级网络均衡配流模型与算法.公路交通科技.1998.(增刊)A01.67-71.
[41]高自友,宋一凡,四兵峰等.公交网络中基于弹性需求和能力限制条件下的SUE配流模型及算法.北方交通大学学报.2000.24(6).1-7.
[42]林柏梁,杨富社,李鹏等.基于出行费用最小化的公交网络优化模型.中国公路学报.1999.12(1).79-83.
[43]牛学勤,王炜等.基于最短路搜索的多路径公交客流分配模型研究.东南大学学报.2002.32(6).917-919.
[44]安健.BRT线网优化设计关键技术研究.北京：北京交通大学.2007.13-35.
[45]汤可夫.公交客流分配与调度的遗传算法.大连：大连理工大学硕士学位论文.2004.15-45.
[46]陈义华,吴红兵等.方式划分与路网配流联合模型.重庆大学学报(自然科学版).2005.28(10).99-103.
[47]于滨.城市公交系统模型与算法研究.大连：大连理工大学博士学位论文.2006.18-35.
[48]于滨,杨忠振等.公交线路发车频率优化的双层规划模型及其解法.吉林大学学报(工学版).2006.36(5).664-668.
[49]高岩.城市公交通网络设计模型与算法研究.长沙：长沙理工大学硕士学位论文.2007.22-36.
[50]孔繁玉,李献忠等.弹性需求下的轨道交通客流分配模型和算法.西安工程大学学报.2008.22(22).104-108.
[51]刘志谦,宋瑞等.基于时刻表的公交配流算法研究.重庆交通大学学报(自然科学版).2010.29(1).114-120.
[52]赵鹏,杨浩等.京沪高速铁路列车开行模式的研究.北京交通大学学报.2006.30(3).5-9.
[53]姚金娈.基于区域理论的京沪高速铁路开行方案研究.北京：北京交通大学.2010.22-34.
[54]黄鉴,彭其渊等.客运专线旅客列车开行方案研究.成都：西南交通大学(成都).2005.5-16.
[55]罗建.客运专线与既有线合理分工及协调优化研究.成都：西南交通大学(成都).2009.18-34.
[56]何宇强,张好智等.客运专线旅客列车开行方案的多目标双层规划模型.铁道学报.2006.28(5).6-10.
[57]曾鸣凯.客运专线旅客列车开行方案的客流分配方法.西南交通大学学报.2006.41(5).571-574.
[58]霍亮.铁路旅客乘车行为分析与客流分配研究.长沙：中南大学.2006.20-54.
[59]史峰,邓连波等.旅客列车开行方案的双层规划模型和算法.中国铁道科学.2007.28(3).110-116.
[60]邓连波,史峰等.客运专线相关旅客列车开行方案优化研究.长沙：中南大学.2007.11-36.
[61]聂磊,廉文彬.国外高速铁路运输组织方案特点分析.中国铁路.2008.548(2).74-78.
[62]史峰,周文梁等.基于弹性需求的旅客列车开行方案优化研究.铁道学报.2008.30(3).1-6.
[63]王慈光.用表上作业法求解编组站配流问题的研究.铁道学报.2002.24(4).1-5.
[64]薛峰.编组站调度系统配流协同优化理论与方法研究.长沙：西南交通大学.2009.13-24.
[65]马苏德·雅基尼.列车路径、编组计划与运行图复合优化的动态服务网络设计模型.北京：北京交通大学.2003.7-16.
[66]王慈光.编组站动态配流模型与算法研究.铁道学报.2004.26(1).1-6.
[67]营美英.基于MAS的列车编组计划与运行图的一体化优化方法研究.北京：北京交通大学.2006.5-18.
[68]薛锋,王慈光等.编组站配流相关问题分析.交通运输工程与信息学报.2008.6(4).29-33.
[69]薛锋,王慈光等.双向编组站静态配流的优化.西南交通大学学报.2008.43(2).159-164.
[70]荆世明,吴建波等.铁路编组站车流配流问题研究.铁道运输与经济.2008.30(1).83-86.
[71]景云.运用学习规则求解编组站静态配流问题的研究.铁道运输与经济.2010.32(1).22-26.
[72]中永生,何世伟等.免疫算法求解编组站阶段计划配流问题研究.铁道学报.2009.31(4).1-6.
[73]胡小风.混合铁路客运服务网络中多层次客流分配技术研究.北京：北京交通大学.2010.15-45.
[74]单杏花,周亮瑾,吕晓艳等.铁路旅客列车票额智能预分研究.中国铁道科学.2011.32(6).125-128.
[75]李栋.旅客列车编组与票额分配方法的优化改进.西南交通大学.四川.2008.12-23.
[76]佟璐,聂磊等.高速铁路客运产品规划的客流分配分析.综合运输.2011.381(9).56-60.
[77]刘宝碇.不确定规划及应用.北京：清华大学出版社.2003.15-20.
[78]胡必松.基于列车开行方案的服务网络构建及路径搜索技术研究与系统开发.北京交通大学(北京).2011.30-45.
[79]杨林.支持多模式的复合交通网络模型及关键技术研究.北京：中国地质大学.2008.17-30.
[80]徐中,李旭宏等.基于道路功能的分层交通分配方法研究.交通与计算机.2008.26(3).23-26.
[81]戴树贵,陈文兰等.一个求解K短路径实用算法.计算机工程与应用.2005.41(36).63-65.
[82]杨英俊,王轶萍等.基于遗传算法的城市客运出租汽车调度中心人员排班研究.公路交通科技.2010.27(7).142-146.
[83]雷中林.铁路区域调度车流优化调整问题的不确定性优化模型及遗传算法.2005年全国博十生学术论坛一交通运输工程学科.2005.520-525.
[84]马炫.求解k条最优路径问题的遗传算法.计算机工程及应用.2006.42(12).100-109.
[85]徐凯,朱征宇等.改进遗传算法对带服务时间约束的弧路径问题的求解.微处理机.2010.31(5).58-62.
[86]孙艳丰,William H. K. Lam等.基于遗传算法的城市交通运输网络优化问题研究.系统工程理论与实践.2000.20(7).94-98.
[87]王琦,孙竹梅等.基于遗传算法的城市交通优化分配.电力学报.2009.24(2).113-116.
[88]龚峻峰,余志等.一种基于路段惩罚法的合理路径集生成算法.公路交通科技.2009.26(9).107-111.
[89]何方国,齐欢等.有约束的随机最短路问题模型及算法.武汉理工大学学报(交通科学与工程版).2008.32(6).1125-1128.
[90]刘剑锋,孙福亮等.城市轨道交通乘客路径选择模型及算法.交通运输系统工程与信息.2009.9(2).81-86.
[91]王华,季令等.我国铁路客运合理路径选择的研究.上海铁道大学学报.1999.9(4).20-25.
[92]过秀成,吕慎等.基于合作竞争类OD联合方式划分轨道客流分配模型研究.中国公路学报.2000.13(4).91-94.
[93]程涛.供应商选择问题的不确定优化模型及算法.兰州交通大学学报.2007.26(4).21-24.
[94]赵文辉.车辆路径问题模型及算法研究.铁道运输与经济.2008.30(4).83-86.
[95]雷中林.供应商选择问题的不确定性优化模型.物流技术.2006.63(5).52-54.
[96]雷中林,何世伟等.铁路空车调配问题的随机机会约束模型及遗传算法.铁道学报.2005.27(5).1-5.
[97]王保华,何世伟等.综合运输体系下快捷货运网络流量分配优化模型及算法.铁道学报.2009.31(2).12-16.
[98]雷中林.铁路路网系统运输能力理论与计算方法研究.北京：北京交通大学.2006.3245.
[99]何世伟,宋瑞,戴新鎏等.路网运输能力及计算方法的研究.铁道学报.2003.25(2).5-9.
[100]苏顺虎.基于服务水平的铁路货物运输网络能力计算方法.中国铁道科学.2009.30(2).113-118.
[101]Goldberg D E. Genetic Algorithms in search, Optimization and Machine Learn-ing. MA:Addison-Wesley.1989.45-56.
[102]佟璐,聂磊等.基于运输组织模式导向的旅客列车开行方案模型研究.大连交通大学学报.2011.32(3).12-16.
[103]M.Cepeda, R.Cominetti, M.Florian. A frequency-based assignment model for congested transit networks with strict capacity constraints characterization and computation of equilibria.Transportation Research Part B.2006.40(6).437-459.
[104]Ziyou Gao, Huijun Sun, Lian Long Shan,et al. A continuous equilibrium network design model and algorithm for transit systems. Transportation Research Part B.2004. 38 (3).235-250.
[105]L. Nie, D.B. Fei, S.D. Zhou, H.L. Fu, L. Tong. Key Issues on Train Line Planning for Beijing-Shanghai High Speed Railway. Rail Transportation Division.2010 Joint Rail Conference. Urbana, Illinois:ASME Press.2010.435-440.
[106]聂磊,胡小风,佟璐,付慧伶等.基于旅客列车开行方案的客流分配方法研究.交通运输系统工程与信息.2011.11(3).87-92.
[107]李永亮.基于蚁群算法的公交出行方案研究.北京：北京交通大学.2008.34-42.
[108]李宁.基于蚁群算法的动态交通分配及路径诱导研究.长沙：长沙理工大学.2008.35-46.
[109]丁洁冰.基于SP调查的客运专线旅客乘车选择行为研究.北京：北京交通大学.2009.16-24.
[110]史峰,付印平等.拥挤网络中的OD矩阵估计模型与算法.长沙铁道学院学报.2011.19(4).21-26.
[111]史峰,邓连波等.铁路旅客乘车行为的层次分析.铁道科学与工程学报.2007.4(3).79-82.
[112]史峰,邓连波等.铁路旅客乘车选择行为及其效用.中国铁道科学.2007.28(6).117-121.
[113]史峰,马钧培等.客运中转路径的换乘模型及算法.铁道学报.1999.21(5).1-4.
[114]陆化普,黄海军等.交通规划理论研究前沿.北京：清华大学出版社.2005.45-50.
[115]黄海军.城市交通网络平衡分析理论与实践.北京：人民交通出版社.1994.80-96.
[116]毛保华,曾会欣等著.交通规划模型及其应用.北京：中国铁道出版社.1999.67-85.
[117]刘灿齐.现代交通规划学.北京：人民交通出版社.2001.100-115.
[118]刘好德,杨晓光等.基于改进遗传算法的公交线网络优化设计研究.计算机工程与应用.2007.43(8).10-13.
[119]冯树民,陈洪仁等.公共交通客流分配方法研究.哈尔滨建筑大学学报.2002.35(5).127-130.
[120]周刚,王炜等.地铁线路客流分配方法与算法研究.广东公路交通.2001.35(4).32-35.
[121]侯立文.一种基于蚂蚁算法的交通分配方法.上海交通大学学报.2001.35(10).1240-1245.
[122]何宇强,毛保华等.高速客运专线客流分担率模型及其应用研究.铁道学报.2006.28(3).18-21.
[123]甄静.京沪铁路客流规律分析.中国铁道科学.2002.23(2).122-126.
[124]张敖木翰,钟仰晋等.基于蚁群算法的公交线网规划研究.交通标准化.2008.23(13).168-172.
[125]张敖木翰.基于蚁群算法的城市公交线网优化设计研究.北京交通大学(北京).2008.15-35.
[126]郭瑾.高速铁路综合枢纽换乘条件评价及应用研究.北京：北京交通大学.2011.55-63.
[127]Agostino Nuzzolo, Francesco Russo, Umberto Crisalli. A Doubly Dynamic Schedule-based Assignment Model for Transit Networks. Transportation Science.2001. 35(3).268-285.
[128]Markus Friedrich, Gerd Schleupen,Michael Moltenbrey, Hans-Joachim Bungartz. A parallel Implementation of a Schedule-Based Transit Assignment Algorithm for Large Networks. In: ASIM 2005-18th Symposium on Simulation Technique.Erlangen.2005.110-115.
[129]Friedrich, M. Multi-Day Dynamic Transit Assignment. Proceedings of Conference on Schedule-based dynamic transit modeling SBDTM. Ischia. Italy.2005.128-132.
[130]Friedrich, M., Wekeck, S. A schedule-based Transit Assignment Model addressing the passengers'Choice among competing Connections, Proceedings of Conference, The Schedule-Based approach in Dynamic Transit Modeling: Theory and Applications, Ischina.2002.159-173.
[131]Natale Papola, Francesco Filippi, Guido Gentile, Lorenzo Meschini, Schedule-Based Transit Assignment: A new dynamic equilibrium model with vehicle capacity constraints.Operations Research.2009.46(10).1-26.
[132]Giuseppe Bellei, Guido Gentile, Lorenzo Meschini, Natale Papola, A demand model with departure time choice for within-day dynamic traffic assignment. European Journal of Operational Research.2006.175(3).1557-1576.
[133]Diego Klabjan, Ellis L. Johnson, Geoge L. Nemhauser, Eric Gelman, Srini Ramaswamy. Airline Crew Scheduling with Time Windows and Plane-Count Constraints.Transportation Science.2002.36(3).337-348.
[134]秦旭彦.基于仿真的动态交通分配模型研究及实现.北京：清华大学.2008.16-35.
[135]高自友,任华玲等.城市动态交通流分配模型与算法.北京：人民交通出版社.2005.35-48.
[136]陆化普,黄海军等.交通规划理论研究前沿.北京：清华大学出版社.2005.46-65.
[137]黄海军.城市交通网络平衡分析理论与实践.北京：人民交通出版社.1994.30-58.
[138]毛保华,曾会欣等著.交通规划模型及其应用.北京：中国铁道出版社.1999.22-36.
[139]查伟雄,熊贵林等.铁路旅客OD矩阵推算模型及算法设计.系统工程.2004.22(12).82-86.
[2]Dial R.B. A probabilistic multi-path traffic assignment model which obviates the need for path enumeration.Transportation Research.1971.5 (2).83-111.
[3]Pierre Robillard, Claude Chriqui. Common bus lines.Transportation science.1975.9 (2). 115-112.
[4]Carlos F. Daganzo. On the traffic assignment problem with flow dependent costs—Ⅱ. Transportation science.1977.11 (6).439-441.
[5]Yosef Sheffi. Estimating choice probabilities among nested alternatives. Transportation Research Part B:Methodological.1979.13 (3).189-205.
[6]Hasselstrom, D. Public Transportation Planning-A Mathematical Programming Approach. In Doctoral Dissertation. University of Goteborg. Sweden.1982.6.89-159.
[7]Spiess H. Contributions'a la th'eorie et aux outils de planification de r'eseaux de transport urbain. Ph.D. thesis. D'epartement d'informatique et de recherche op'erationnelle. Centre de recherche sur les transports. Universit'e de Montr'eal.1984. Publication 382.
[8]S. Nguyen. Equilibriumtrafficassignment for large scale transit networks. European Journal of Operational Research.1988.37 (2).176-186.
[9]Spiess H. Florian M. Optimal Strategies: A New Assignment Model for Transit Networks.Trans.Res.1989.23 (B).83-102.
[10]De Cea. Fernandez E. Transit Assignment for Congested Public Transport System: An Equilibrium Model.Transportation Research.1993.27 (2).133-147.
[11]Wu J.H. Transit equilibrium assigment: a model and solution algorithms.Transportation Science.1994.28 (3).193-203.
[12]Sang Nguyen etc. Implicit enumeration of hyper paths in a Logit model for transit networks.Transportation Research.1998.32 (1).54-64.
[13]Pattnail S.B etc.Urban bus transit rout network design using genetic algorithm. Journal of Transportation Engineering.1998.124(4).368-375.
[14]Lam W.H.K., Z.Y. Gao,et al. A Stochastic User Equilibrium Assignment Model for Congested Transit Networks.Transportation Science.1999.33 (B).351-368.
[15]Claessens, M.T., van Dijk, N.M., Zwaneveld, P.J. Cost optimal allocation of passenger lines. European Journal of Operational Research.1998.110 (3).474-489.
[16]Yu-Hern Chang, Chung-Hsing Yeh, Ching-Cheng Shen. A multiobjective model for passenger train services planning: application to Taiwan's high-speed rail line.Transportation Science.2000.34 (2).91-106
[17]Chi-Kang LEE, Wen-jin HSIEH. A Demand Oriented Service Planning. Process[A]. The World Congress On Railway Research.2001.55-89.
[18]史峰.基于弹性需求的旅客列车开行方案优化研究.铁道学报.2008.30(3).1-6.
[19]Goossens, J.H.M. etc. A branch-and-cut approach for solving railway line-planning problems.Transportation Science.2004a.38 (3).379-393.
[20]Goossens, J.H.M. Models and algorithms for railway line planning problems. PhD thesis, University of Maastricht.2004b.46-97.
[21]Goossens, J.H.M. etc. Optimising halting station of passenger railway lines.2004c. http://arno.unimaas.nl/show.cgi?fid=803.
[22]Goossens, J.H.M., van Hoesel, C.P.M., Kroon, L.G. On solving multi-type railway line planning problems. European Journal of Operational Research.2005.168 (2).403-424.
[23]Scholl, S. Customer-oriented line planning. PhD thesis. University of Kaiserslautern. 2005.23-56.
[24]Schobel, A., Scholl, S.. Line planning with minimal transfers. In 5th Workshop on Algorithmic methods and Models for Optimization of Railways, number 06901 in Dagstuhl Seminar Proceedings,2006.
[25]Marc E. Pfetsch, Ralf Borndorfer. Routing in Line Planning for Public Transport. Berlin: ZIB Allgemein,2005.05-36.
[26]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. A path-based model for line planning in public transport. Berlin: ZIB Allgemein,2005.05-18.
[27]J.F. Guan, Hai Yang, S.C. Wirasinghe. Simultaneous optimization of transit line configuration and passenger line assignment. Transportation Research Part B.2006.40 (10).885-902.
[28]Ralf Borndorfer, Martin Grotschel, Marc E. Pfetsch. A Column-Generation Approach t-o Line Planning in Public Transport.Transportation Science.2007.41 (1).123-132.
[29]杨新苗.城市公交发展技术保障体系关键技术研究.南京：东南大学.2000.23-65.
[30]牟达.大连市快速公交规划及其效果评价.大连：大连理工大学.2006.20-44.
[31]汤可夫.公交客流分配与调度的遗传算法.大连：大连理工大学.2004.14-56.
[32]曹庆峰.公交均衡分配模型及其在EMME/2的应用研究.西安：长安大学.2007.34-39.
[33]张启人.公共交通大系统建模与优化.系统工程.1986.4(6).25-39.
[34]高岩.城市公交网络设计模型与算法研究.长沙：长沙理工大学.2007.15-39.
[35]魏恒.公交网络客流分配模型研究.北京工业大学学报.1990.16(4).35-39.
[36]刘清等.实现城市公交线网优化的数学模型和广义A*算法.系统工程理论与实践.1992.12(2).11-17.
[37]王志栋.公交线网优化模型的建立.大连铁道学院学报.1997.18(4).31-34.
[38]夏志浩,王胜奎等.用公交车站上下客数推算公交OD分布的方法.四川联合大学学报(工程科学版).19971.1(2).41-48.
[39]四兵锋等.城市公交网络均衡配流模型及算法的研究.公路交通科技.1998.15(3).41-44.
[40]四兵锋,高自友等.城市交通超级网络均衡配流模型与算法.公路交通科技.1998.(增刊)A01.67-71.
[41]高自友,宋一凡,四兵峰等.公交网络中基于弹性需求和能力限制条件下的SUE配流模型及算法.北方交通大学学报.2000.24(6).1-7.
[42]林柏梁,杨富社,李鹏等.基于出行费用最小化的公交网络优化模型.中国公路学报.1999.12(1).79-83.
[43]牛学勤,王炜等.基于最短路搜索的多路径公交客流分配模型研究.东南大学学报.2002.32(6).917-919.
[44]安健.BRT线网优化设计关键技术研究.北京：北京交通大学.2007.13-35.
[45]汤可夫.公交客流分配与调度的遗传算法.大连：大连理工大学硕士学位论文.2004.15-45.
[46]陈义华,吴红兵等.方式划分与路网配流联合模型.重庆大学学报(自然科学版).2005.28(10).99-103.
[47]于滨.城市公交系统模型与算法研究.大连：大连理工大学博士学位论文.2006.18-35.
[48]于滨,杨忠振等.公交线路发车频率优化的双层规划模型及其解法.吉林大学学报(工学版).2006.36(5).664-668.
[49]高岩.城市公交通网络设计模型与算法研究.长沙：长沙理工大学硕士学位论文.2007.22-36.
[50]孔繁玉,李献忠等.弹性需求下的轨道交通客流分配模型和算法.西安工程大学学报.2008.22(22).104-108.
[51]刘志谦,宋瑞等.基于时刻表的公交配流算法研究.重庆交通大学学报(自然科学版).2010.29(1).114-120.
[52]赵鹏,杨浩等.京沪高速铁路列车开行模式的研究.北京交通大学学报.2006.30(3).5-9.
[53]姚金娈.基于区域理论的京沪高速铁路开行方案研究.北京：北京交通大学.2010.22-34.
[54]黄鉴,彭其渊等.客运专线旅客列车开行方案研究.成都：西南交通大学(成都).2005.5-16.
[55]罗建.客运专线与既有线合理分工及协调优化研究.成都：西南交通大学(成都).2009.18-34.
[56]何宇强,张好智等.客运专线旅客列车开行方案的多目标双层规划模型.铁道学报.2006.28(5).6-10.
[57]曾鸣凯.客运专线旅客列车开行方案的客流分配方法.西南交通大学学报.2006.41(5).571-574.
[58]霍亮.铁路旅客乘车行为分析与客流分配研究.长沙：中南大学.2006.20-54.
[59]史峰,邓连波等.旅客列车开行方案的双层规划模型和算法.中国铁道科学.2007.28(3).110-116.
[60]邓连波,史峰等.客运专线相关旅客列车开行方案优化研究.长沙：中南大学.2007.11-36.
[61]聂磊,廉文彬.国外高速铁路运输组织方案特点分析.中国铁路.2008.548(2).74-78.
[62]史峰,周文梁等.基于弹性需求的旅客列车开行方案优化研究.铁道学报.2008.30(3).1-6.
[63]王慈光.用表上作业法求解编组站配流问题的研究.铁道学报.2002.24(4).1-5.
[64]薛峰.编组站调度系统配流协同优化理论与方法研究.长沙：西南交通大学.2009.13-24.
[65]马苏德·雅基尼.列车路径、编组计划与运行图复合优化的动态服务网络设计模型.北京：北京交通大学.2003.7-16.
[66]王慈光.编组站动态配流模型与算法研究.铁道学报.2004.26(1).1-6.
[67]营美英.基于MAS的列车编组计划与运行图的一体化优化方法研究.北京：北京交通大学.2006.5-18.
[68]薛锋,王慈光等.编组站配流相关问题分析.交通运输工程与信息学报.2008.6(4).29-33.
[69]薛锋,王慈光等.双向编组站静态配流的优化.西南交通大学学报.2008.43(2).159-164.
[70]荆世明,吴建波等.铁路编组站车流配流问题研究.铁道运输与经济.2008.30(1).83-86.
[71]景云.运用学习规则求解编组站静态配流问题的研究.铁道运输与经济.2010.32(1).22-26.
[72]中永生,何世伟等.免疫算法求解编组站阶段计划配流问题研究.铁道学报.2009.31(4).1-6.
[73]胡小风.混合铁路客运服务网络中多层次客流分配技术研究.北京：北京交通大学.2010.15-45.
[74]单杏花,周亮瑾,吕晓艳等.铁路旅客列车票额智能预分研究.中国铁道科学.2011.32(6).125-128.
[75]李栋.旅客列车编组与票额分配方法的优化改进.西南交通大学.四川.2008.12-23.
[76]佟璐,聂磊等.高速铁路客运产品规划的客流分配分析.综合运输.2011.381(9).56-60.
[77]刘宝碇.不确定规划及应用.北京：清华大学出版社.2003.15-20.
[78]胡必松.基于列车开行方案的服务网络构建及路径搜索技术研究与系统开发.北京交通大学(北京).2011.30-45.
[79]杨林.支持多模式的复合交通网络模型及关键技术研究.北京：中国地质大学.2008.17-30.
[80]徐中,李旭宏等.基于道路功能的分层交通分配方法研究.交通与计算机.2008.26(3).23-26.
[81]戴树贵,陈文兰等.一个求解K短路径实用算法.计算机工程与应用.2005.41(36).63-65.
[82]杨英俊,王轶萍等.基于遗传算法的城市客运出租汽车调度中心人员排班研究.公路交通科技.2010.27(7).142-146.
[83]雷中林.铁路区域调度车流优化调整问题的不确定性优化模型及遗传算法.2005年全国博十生学术论坛一交通运输工程学科.2005.520-525.
[84]马炫.求解k条最优路径问题的遗传算法.计算机工程及应用.2006.42(12).100-109.
[85]徐凯,朱征宇等.改进遗传算法对带服务时间约束的弧路径问题的求解.微处理机.2010.31(5).58-62.
[86]孙艳丰,William H. K. Lam等.基于遗传算法的城市交通运输网络优化问题研究.系统工程理论与实践.2000.20(7).94-98.
[87]王琦,孙竹梅等.基于遗传算法的城市交通优化分配.电力学报.2009.24(2).113-116.
[88]龚峻峰,余志等.一种基于路段惩罚法的合理路径集生成算法.公路交通科技.2009.26(9).107-111.
[89]何方国,齐欢等.有约束的随机最短路问题模型及算法.武汉理工大学学报(交通科学与工程版).2008.32(6).1125-1128.
[90]刘剑锋,孙福亮等.城市轨道交通乘客路径选择模型及算法.交通运输系统工程与信息.2009.9(2).81-86.
[91]王华,季令等.我国铁路客运合理路径选择的研究.上海铁道大学学报.1999.9(4).20-25.
[92]过秀成,吕慎等.基于合作竞争类OD联合方式划分轨道客流分配模型研究.中国公路学报.2000.13(4).91-94.
[93]程涛.供应商选择问题的不确定优化模型及算法.兰州交通大学学报.2007.26(4).21-24.
[94]赵文辉.车辆路径问题模型及算法研究.铁道运输与经济.2008.30(4).83-86.
[95]雷中林.供应商选择问题的不确定性优化模型.物流技术.2006.63(5).52-54.
[96]雷中林,何世伟等.铁路空车调配问题的随机机会约束模型及遗传算法.铁道学报.2005.27(5).1-5.
[97]王保华,何世伟等.综合运输体系下快捷货运网络流量分配优化模型及算法.铁道学报.2009.31(2).12-16.
[98]雷中林.铁路路网系统运输能力理论与计算方法研究.北京：北京交通大学.2006.3245.
[99]何世伟,宋瑞,戴新鎏等.路网运输能力及计算方法的研究.铁道学报.2003.25(2).5-9.
[100]苏顺虎.基于服务水平的铁路货物运输网络能力计算方法.中国铁道科学.2009.30(2).113-118.
[101]Goldberg D E. Genetic Algorithms in search, Optimization and Machine Learn-ing. MA:Addison-Wesley.1989.45-56.
[102]佟璐,聂磊等.基于运输组织模式导向的旅客列车开行方案模型研究.大连交通大学学报.2011.32(3).12-16.
[103]M.Cepeda, R.Cominetti, M.Florian. A frequency-based assignment model for congested transit networks with strict capacity constraints characterization and computation of equilibria.Transportation Research Part B.2006.40(6).437-459.
[104]Ziyou Gao, Huijun Sun, Lian Long Shan,et al. A continuous equilibrium network design model and algorithm for transit systems. Transportation Research Part B.2004. 38 (3).235-250.
[105]L. Nie, D.B. Fei, S.D. Zhou, H.L. Fu, L. Tong. Key Issues on Train Line Planning for Beijing-Shanghai High Speed Railway. Rail Transportation Division.2010 Joint Rail Conference. Urbana, Illinois:ASME Press.2010.435-440.
[106]聂磊,胡小风,佟璐,付慧伶等.基于旅客列车开行方案的客流分配方法研究.交通运输系统工程与信息.2011.11(3).87-92.
[107]李永亮.基于蚁群算法的公交出行方案研究.北京：北京交通大学.2008.34-42.
[108]李宁.基于蚁群算法的动态交通分配及路径诱导研究.长沙：长沙理工大学.2008.35-46.
[109]丁洁冰.基于SP调查的客运专线旅客乘车选择行为研究.北京：北京交通大学.2009.16-24.
[110]史峰,付印平等.拥挤网络中的OD矩阵估计模型与算法.长沙铁道学院学报.2011.19(4).21-26.
[111]史峰,邓连波等.铁路旅客乘车行为的层次分析.铁道科学与工程学报.2007.4(3).79-82.
[112]史峰,邓连波等.铁路旅客乘车选择行为及其效用.中国铁道科学.2007.28(6).117-121.
[113]史峰,马钧培等.客运中转路径的换乘模型及算法.铁道学报.1999.21(5).1-4.
[114]陆化普,黄海军等.交通规划理论研究前沿.北京：清华大学出版社.2005.45-50.
[115]黄海军.城市交通网络平衡分析理论与实践.北京：人民交通出版社.1994.80-96.
[116]毛保华,曾会欣等著.交通规划模型及其应用.北京：中国铁道出版社.1999.67-85.
[117]刘灿齐.现代交通规划学.北京：人民交通出版社.2001.100-115.
[118]刘好德,杨晓光等.基于改进遗传算法的公交线网络优化设计研究.计算机工程与应用.2007.43(8).10-13.
[119]冯树民,陈洪仁等.公共交通客流分配方法研究.哈尔滨建筑大学学报.2002.35(5).127-130.
[120]周刚,王炜等.地铁线路客流分配方法与算法研究.广东公路交通.2001.35(4).32-35.
[121]侯立文.一种基于蚂蚁算法的交通分配方法.上海交通大学学报.2001.35(10).1240-1245.
[122]何宇强,毛保华等.高速客运专线客流分担率模型及其应用研究.铁道学报.2006.28(3).18-21.
[123]甄静.京沪铁路客流规律分析.中国铁道科学.2002.23(2).122-126.
[124]张敖木翰,钟仰晋等.基于蚁群算法的公交线网规划研究.交通标准化.2008.23(13).168-172.
[125]张敖木翰.基于蚁群算法的城市公交线网优化设计研究.北京交通大学(北京).2008.15-35.
[126]郭瑾.高速铁路综合枢纽换乘条件评价及应用研究.北京：北京交通大学.2011.55-63.
[127]Agostino Nuzzolo, Francesco Russo, Umberto Crisalli. A Doubly Dynamic Schedule-based Assignment Model for Transit Networks. Transportation Science.2001. 35(3).268-285.
[128]Markus Friedrich, Gerd Schleupen,Michael Moltenbrey, Hans-Joachim Bungartz. A parallel Implementation of a Schedule-Based Transit Assignment Algorithm for Large Networks. In: ASIM 2005-18th Symposium on Simulation Technique.Erlangen.2005.110-115.
[129]Friedrich, M. Multi-Day Dynamic Transit Assignment. Proceedings of Conference on Schedule-based dynamic transit modeling SBDTM. Ischia. Italy.2005.128-132.
[130]Friedrich, M., Wekeck, S. A schedule-based Transit Assignment Model addressing the passengers'Choice among competing Connections, Proceedings of Conference, The Schedule-Based approach in Dynamic Transit Modeling: Theory and Applications, Ischina.2002.159-173.
[131]Natale Papola, Francesco Filippi, Guido Gentile, Lorenzo Meschini, Schedule-Based Transit Assignment: A new dynamic equilibrium model with vehicle capacity constraints.Operations Research.2009.46(10).1-26.
[132]Giuseppe Bellei, Guido Gentile, Lorenzo Meschini, Natale Papola, A demand model with departure time choice for within-day dynamic traffic assignment. European Journal of Operational Research.2006.175(3).1557-1576.
[133]Diego Klabjan, Ellis L. Johnson, Geoge L. Nemhauser, Eric Gelman, Srini Ramaswamy. Airline Crew Scheduling with Time Windows and Plane-Count Constraints.Transportation Science.2002.36(3).337-348.
[134]秦旭彦.基于仿真的动态交通分配模型研究及实现.北京：清华大学.2008.16-35.
[135]高自友,任华玲等.城市动态交通流分配模型与算法.北京：人民交通出版社.2005.35-48.
[136]陆化普,黄海军等.交通规划理论研究前沿.北京：清华大学出版社.2005.46-65.
[137]黄海军.城市交通网络平衡分析理论与实践.北京：人民交通出版社.1994.30-58.
[138]毛保华,曾会欣等著.交通规划模型及其应用.北京：中国铁道出版社.1999.22-36.
[139]查伟雄,熊贵林等.铁路旅客OD矩阵推算模型及算法设计.系统工程.2004.22(12).82-86.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |