城市公交网络设计与优化方法研究
|
摘要
本文针对以往公交网络设计与优化方法的不足之处,综合运用运筹学、交通工程学、应用统计学等理论与方法对公交网络设计与优化模型和方法进行深入研究。
针对以往公交客流数据调查和预测方法的缺陷,对调查方法和预测方法进行改进,构建了利用公交IC卡数据生成公交站点OD的算法,确立了基于环保约束的城市小汽车容量预测方法,采用马尔可夫链法预测公交分担率,改进了重力模型的阻抗确定方法,揭示了不同公交供给策略下的公交需求变化机制;针对以往设计方法计算量过大和设计过程需要经验判断等缺点,构建了基于受力分析法的直达公交网络设计算法,提出以投入成本最小为目标的换乘公交网络设计算法;针对我国居民公交出行特性,建立基于我国公交用户出行策略公交路径选择模型和客流加载算法;为完善公交网络评价体系,确立单条线路合理性评价指标,构建公交网络通达性的评价指标。针对现状公交网络不足之处,提出基于软件TransCAD的公交网络优化简易方法。
With the fast development of China’s economy, as well as the rapid progress of urbanization, the number of vehicle owners is increasing rapidly. One consequence of this fact is the serious urban traffic congestion, which greatly affects the daily life of urban residents, hinders social and economic development, and increasingly deteriorates urban ecological environment. Compared with individual traffic, public transportation is advantageous in terms of resource consumption, environmental protection, transportation efficiency, and transportation costs. These advantages make problems regarding public transportation development the primary concern in urban traffic system. So far, such problems are still very conspicuous, including lack of unified planning in infrastructure of most urban public transportation facilities; poor quality of transit service, causing a low share rate of bus transit; general deficit of public transportation enterprises and lack of scientific and reasonable financial compensation mechanism. To this end, it is hoped that formulation of a scientific and rational planning of public transportation will guide the sustainable development of the system. As the core of such planning, the reasonableness of urban public transportation network design and optimization will directly influence the operability and rationality of such planning.
Researches at home and abroad on network design and optimization of urban public transportation have provided a lot of valuable experience,but there are still some disadvantages: Network design of urban transit is often optimized for a single target,without taking into account other optimization goals; In particular, it is difficult to meet the requirements of line overlap factor and network coverage. Even taking into account the multiple objectives, with each objective function weighted, the final weighing still needs further research. A majority of methods need enormous calculation. For example, there are too many variables to be solved in the application of heuristic algorithm on network design; Besides, repeated trial calculations of network parameters are involved to achieve global optimum. In spite of the convenience for computation of heuristic algorithm, for large-scale network design, human intervention is still preferred to reduce the model calculation. A majority of methods need a combination of qualitative analysis and empirical judgments,can not achieve one-time automatic network design by computer; The methods of passenger flow assignment used before are not fully in line with Chinese commuters’habits; and can not reach a satisfactory assignment result when applied to China’s passenger flow assignment.
This paper,which aims to avoid the disadvantages of the key models and algorithms in transit network design and optimization,has the following research findings: Improving the traditional investigation methods on transportation and the previous passenger flow forecasting methods, with regards to the actual situation in China; researching a multi-objective public transportation network design against disadvantages including excessive calculation during transit path search and experience-required judgment in the design process; establishing a transit network assignment model based on analysis of the characteristics of Chinese commuters and researches on their commute strategy; improving the public transportation network evaluation system; proposing a TransCAD-based optimization method of public transportation network directed against the disadvantages in existing public transportation system.
The main findings are as follows:
First, according to data surveyed in Changchun, the bus arrival time is proved to be generally normal-distributed. Based on the fact that data is incomplete in IC card database, a new method is proposed---the OD of the bus passenger---based on IC Card data flow. Because the management measures of the urban cars greatly affect the passenger share of the public traffic, the car capacity forecast based on environmental constraints is proposed. When management measures of urban cars are got, the total public transport trips is predicted by using data provided by improved OD survey and Markov chain methods. Because of the past insufficient method to demarcate gravity model by using the space between the line centroid distance or the shortest distance between the centroid (or time) as the traffic impedance plot between the areas, we propose a traffic impedance determination method based on the internal road node. Through analysis of bus needs change based on different bus supply strategies, we conclude that regional transportation needs is consistent with population change.
Second, against the disadvantages of the past searching method of transit path which needed enormous calculations and because the design process required empirical judgments, the author proposed the direct cross-network design based on mechanical analysis of the transit path search algorithm, and on the basis of the direct transit network, rout connection design algorithms was proposed based on a reasonable path alternative.
Third, commuting strategies are brought forward on analysis of the features of Chinese commuters and according to the strategy the public transport route choice model which is station-based is established. The method of passenger flow assignment used before assumed that all passengers were able to be assignted into the traffic network, without considering the fact that some passengers gave up public transit because of long waiting time and over crowded buses. Based on this problem, a new concept---passenger expectation failed---is put forward, describing the effects of public transit service on commuters. According to the passenger’s behavior for the start bus stop, after analysing advantages and disadvantages of bus route choice model based on the ML model and choice model based on NL model, the paper introduces choice model based on collinear transit path and passenger loading algorithms.
Fourth, using non-linear factor to justify bus lines is one-sided, thus the author first proposed using the consistency of bus lines and passenger flow to describe whether the bus lines are in consistency with the passenger flow. The rationality of public transport network is then explored from the network communication, reaching two-pronged approach to explore, and a rationality evaluation index of the public transport network’s accessibility are proposed based on the data surveyed.
Finally, corresponding measures are proposed based on the deficiencies of passenger flow distribution models in TransCAD. TransCAD assignment model (AON) is used to allocate passenger flow on the public transit network to get the selection of minimum cost commute on the condition that all the passengers do not care about the crowded buses. Compared to this commute, unreasonable lines in the network are determined. A concept—line substitute degree—is proposed to describe the extent of the lines being replaced and to provide the basis for line removal because of excessive number of lines. For the connection of additional bus stations in blind sites, the concept of expanded bus stations is proposed to design the connecting of bus routs. By using the minimum total commute as the evaluation index, the optimization program is evaluated and the optimizing process by using TransCAD is briefly introduced.
This research will enrich the theory of system planning of urban public transport and improve methodology, which will provide scientific decision-making analysis for the implementation of special public transportation planning and traffic management.
针对以往公交客流数据调查和预测方法的缺陷,对调查方法和预测方法进行改进,构建了利用公交IC卡数据生成公交站点OD的算法,确立了基于环保约束的城市小汽车容量预测方法,采用马尔可夫链法预测公交分担率,改进了重力模型的阻抗确定方法,揭示了不同公交供给策略下的公交需求变化机制;针对以往设计方法计算量过大和设计过程需要经验判断等缺点,构建了基于受力分析法的直达公交网络设计算法,提出以投入成本最小为目标的换乘公交网络设计算法;针对我国居民公交出行特性,建立基于我国公交用户出行策略公交路径选择模型和客流加载算法;为完善公交网络评价体系,确立单条线路合理性评价指标,构建公交网络通达性的评价指标。针对现状公交网络不足之处,提出基于软件TransCAD的公交网络优化简易方法。
With the fast development of China’s economy, as well as the rapid progress of urbanization, the number of vehicle owners is increasing rapidly. One consequence of this fact is the serious urban traffic congestion, which greatly affects the daily life of urban residents, hinders social and economic development, and increasingly deteriorates urban ecological environment. Compared with individual traffic, public transportation is advantageous in terms of resource consumption, environmental protection, transportation efficiency, and transportation costs. These advantages make problems regarding public transportation development the primary concern in urban traffic system. So far, such problems are still very conspicuous, including lack of unified planning in infrastructure of most urban public transportation facilities; poor quality of transit service, causing a low share rate of bus transit; general deficit of public transportation enterprises and lack of scientific and reasonable financial compensation mechanism. To this end, it is hoped that formulation of a scientific and rational planning of public transportation will guide the sustainable development of the system. As the core of such planning, the reasonableness of urban public transportation network design and optimization will directly influence the operability and rationality of such planning.
Researches at home and abroad on network design and optimization of urban public transportation have provided a lot of valuable experience,but there are still some disadvantages: Network design of urban transit is often optimized for a single target,without taking into account other optimization goals; In particular, it is difficult to meet the requirements of line overlap factor and network coverage. Even taking into account the multiple objectives, with each objective function weighted, the final weighing still needs further research. A majority of methods need enormous calculation. For example, there are too many variables to be solved in the application of heuristic algorithm on network design; Besides, repeated trial calculations of network parameters are involved to achieve global optimum. In spite of the convenience for computation of heuristic algorithm, for large-scale network design, human intervention is still preferred to reduce the model calculation. A majority of methods need a combination of qualitative analysis and empirical judgments,can not achieve one-time automatic network design by computer; The methods of passenger flow assignment used before are not fully in line with Chinese commuters’habits; and can not reach a satisfactory assignment result when applied to China’s passenger flow assignment.
This paper,which aims to avoid the disadvantages of the key models and algorithms in transit network design and optimization,has the following research findings: Improving the traditional investigation methods on transportation and the previous passenger flow forecasting methods, with regards to the actual situation in China; researching a multi-objective public transportation network design against disadvantages including excessive calculation during transit path search and experience-required judgment in the design process; establishing a transit network assignment model based on analysis of the characteristics of Chinese commuters and researches on their commute strategy; improving the public transportation network evaluation system; proposing a TransCAD-based optimization method of public transportation network directed against the disadvantages in existing public transportation system.
The main findings are as follows:
First, according to data surveyed in Changchun, the bus arrival time is proved to be generally normal-distributed. Based on the fact that data is incomplete in IC card database, a new method is proposed---the OD of the bus passenger---based on IC Card data flow. Because the management measures of the urban cars greatly affect the passenger share of the public traffic, the car capacity forecast based on environmental constraints is proposed. When management measures of urban cars are got, the total public transport trips is predicted by using data provided by improved OD survey and Markov chain methods. Because of the past insufficient method to demarcate gravity model by using the space between the line centroid distance or the shortest distance between the centroid (or time) as the traffic impedance plot between the areas, we propose a traffic impedance determination method based on the internal road node. Through analysis of bus needs change based on different bus supply strategies, we conclude that regional transportation needs is consistent with population change.
Second, against the disadvantages of the past searching method of transit path which needed enormous calculations and because the design process required empirical judgments, the author proposed the direct cross-network design based on mechanical analysis of the transit path search algorithm, and on the basis of the direct transit network, rout connection design algorithms was proposed based on a reasonable path alternative.
Third, commuting strategies are brought forward on analysis of the features of Chinese commuters and according to the strategy the public transport route choice model which is station-based is established. The method of passenger flow assignment used before assumed that all passengers were able to be assignted into the traffic network, without considering the fact that some passengers gave up public transit because of long waiting time and over crowded buses. Based on this problem, a new concept---passenger expectation failed---is put forward, describing the effects of public transit service on commuters. According to the passenger’s behavior for the start bus stop, after analysing advantages and disadvantages of bus route choice model based on the ML model and choice model based on NL model, the paper introduces choice model based on collinear transit path and passenger loading algorithms.
Fourth, using non-linear factor to justify bus lines is one-sided, thus the author first proposed using the consistency of bus lines and passenger flow to describe whether the bus lines are in consistency with the passenger flow. The rationality of public transport network is then explored from the network communication, reaching two-pronged approach to explore, and a rationality evaluation index of the public transport network’s accessibility are proposed based on the data surveyed.
Finally, corresponding measures are proposed based on the deficiencies of passenger flow distribution models in TransCAD. TransCAD assignment model (AON) is used to allocate passenger flow on the public transit network to get the selection of minimum cost commute on the condition that all the passengers do not care about the crowded buses. Compared to this commute, unreasonable lines in the network are determined. A concept—line substitute degree—is proposed to describe the extent of the lines being replaced and to provide the basis for line removal because of excessive number of lines. For the connection of additional bus stations in blind sites, the concept of expanded bus stations is proposed to design the connecting of bus routs. By using the minimum total commute as the evaluation index, the optimization program is evaluated and the optimizing process by using TransCAD is briefly introduced.
This research will enrich the theory of system planning of urban public transport and improve methodology, which will provide scientific decision-making analysis for the implementation of special public transportation planning and traffic management.
引文
[1]杨兆升.城市公共交通网络的优化研究[J],汽车技术,1985,5:54-60.
[2]张启人,熊桂林.公共交通大系统建模与优化[J].系统工程,1986,4(6):25-39.
[3]刘清,衷仁保,朱志勇,谢磊.实现城市公交线网优化的数学模型和广义A*算法.系统工程理论与实践,1992,2:11-17.
[4]韩印,李维斌,李晓峰.城市公交线网调整优化PSO算法[J].中国公路学报,1999,12(3):100-104.
[5]韩印,杨晓光.一种新的公交网络非线性双层优化模型的提出及其求解算法[J].交通与计算机,2005,23(4):11-14.
[6]林柏梁,杨富社,李鹏.基于出行费用最小化的公交网络优化模型[J].中国公路学报,1999,12(1):79-83.
[7]陈洪仁,冯树民.分层限制的公交线网优化模型[J].哈尔滨建筑大学学报,2001,34(5):113-115.
[8]王炜,刘新苗,陈学武.城市公共交通系统规划方法与管理技术[M],科学出版社,2002.2,77-97.
[9]Quentin K. Wan ,Hong K. Lo. A Mixed Integer Formulation for Multiple-Route Transit Network Design[J] , Journal of Mathematical Modelling and Algorithms, 2003.12,2(4):299-308.
[10]白子建,赵淑芝,田振中.公共交通网络优化的禁忌算法设计与实现[J].吉林大学学报(工学版),2006,36(3):340-344.
[11]胡启洲,邓卫,田新现.基于四维消耗的公交线网优化模型及蚁群算法[J].东南大学学报(自然科学版),2008,38(2):304-308
[12]钱大琳,孙艳丰.离散非平衡公交网络优化模型及其求解算法[J].北方交通大学学报,2001,25(2):58-61.
[13]胡启洲,常玉林.城市公交线网多目标优化的建模及其求解[J].江苏大学学报(自然科学版),2003,24(6):88-90.
[14]李默涵.城市公交线网优化方法的应用研究[J].辽东学院学报,2005,12(47):10-14.
[15]邬开俊,郑丽英,王铁君,张春岭.基于蚁群算法的城市公交线网模型优化方法研究[J].兰州交通大学学报(自然科学版),2007,26(4):4-6
[16]于滨,杨忠振,程春田.并行蚁群算法在公交线网优化中应用[J],大连理工大学学报,2007,47(2):211-214
[17]刘好德,杨晓光.基于路线优选的公交线网优化设计方法研究[J].交通与计算机,2007,25(2):14-18
[18]林丽娜,郑应文.嫁接遗传算法在城市公交线网优化中的应用[J].中南大学学报(自然科学版),2007,第38卷增刊1:619-623
[19]于滨,杨永志,杨忠振,靳廉洁.基于直达客流密度最大的公交线网优化[J].哈尔滨工业大学学报,2009,41(2):205-207
[20]葛亮,王炜,杨明,邓卫.基于站点的公交网络配流实用模型与算法研究[J].公路交通科技,2004.10,21(10):105-108.
[21]吴稼豪.网络设计理论在城市公共交通中的应用[J].上海机械学院学报,1988,10(2):89-96.
[22]单连龙,高自友.公交系统随机平衡网络设计模型及求解算法[J].中国管理科学, 2001.12,9(1):41-49.
[23]任华玲,高自友.动态公交网络设计的双层规划模型及算法研究[J].系统工程理论与实践,2007,5:82-89
[24]Patz.Die richtige Auswahl von Verkehrslinien bei gro?en Stra?enbahnnetzen. Verkehrstechnik 50/51.
[25]C.E. Mandl. Evaluation and optimization of urban public transportation networks[J]. European Journal of Operational Research, 1979,5: 396–404.
[26]G. Newell. Some issues related to the optimal design of bus routes[J]. Transportation Science, 1979,13: 20–35.
[27]A. Ceder, N.H. Wilson, Bus network design[J]. Transportation Research ,1986, 20B:331–344.
[28]M. Hadi Baaj, Hani S. Mahmassani. Hybrid route generation heuristic algorithm for the design of transit networks[J].Transportation Research Part C: Emerging Technologies, 1995.2, 3(1) : 31-50.
[29]Mao-Chang. A design methodology for bus transit route networks with coordinated operations : Shih[D], The University of Texas at Austin, 1994.
[30]Hélène Dufourd, Michel Gendreau, Gilbert Laporte .Locating a transit line using tabu search[J]Location Science, 1996, 4( 1-2): 1-19.
[31]S.B. Pattnaik, S. Mohan and V.M. Tom, Urban bus transit network design using genetic algorithm, Journal of Transportation Engineering,1998 ,124 (4) : 368–375.
[32]Petrelli. A transit network design model for urban areas[C] ,UrbanTransport X: Urban Transport and the Environment in the 21st Century,2004 ,16: 163-172.
[33]Tom V.M. ,Mohan, S..Transit route network design using frequency coded genetic algorithm[J], Journal of Transportation Engineering, 2003,129 (2): 186-195.
[34]W. Fan ,R.B. Machemehl, Optimal transit route network design problem with variable transit demand : genetic algorithm approach[J] , Journal of Transportation Engineering,2006,132(1): 40–51.
[35]A.T. Murray, A coverage model for improving public transit system accessibility and expanding access[J], Annals of Operations Research 2003, 123 ,143–156.
[36]Y. Lee , V.R. Vuchic. Transit network design with variable demand[J], Journal of Transportation Engineering,2005,131 (1): 1–10.
[37]Dial.R.B.. A probabilistic multipath traffic assignment algorithm which obviates path enumeration[J].Transportation Res.,1971,52:81-111.
[38]Sheffi.Y. and Powell. W.B.. An algorithm for the equilibrium assignment problem with random link Times[J].Networks 12(2), 1982:191–207.
[39]Sheffi.Y.. Urban Transportation Networks: Equilibrium Analysis with Mathematical programming Methods[M].Prentice-Hall,Englewood Cliffs, NJ.113, 1985.
[40]A. Last,S.E. Leak. Transept:a bus model[J]. Traffic Engineering and Control ,17(1976):14-20.
[41]S. Nguyen,S. Pallottino. Equilibrium traffic assignment for large scale transit networks[J]. European Journal of Operational Research ,37 (1988):176-186.
[42]S. Nguyen , S. Pallottino. Hyperpaths and shortest hyperpaths. In Combinatorial optimization(Edited by Simeone B.),volume 1403 of lecture notes in mathematics,Springer-Verlag, Berlin, 1989:258-271
[43]Heinz Spiess, Michael Florian .Optimal strategies: A new assignment model for transit networks[J].Transportation Research Part B: Methodological, 1989 .4, 23(2): 83-102
[44]J. De Cea, E. Fernández. Transit assignment for congested public transport system: an equilibrium model[J]. Transportation Science,27(1993): 133-147.
[45]S. Nguyen et al. Implicit enumeration of hyperpaths in a logit model for transit networks[J].Transportation science,1998,32(2):176-186.
[46]W.H.K. Lam, Z.Y. Gao, K.S. Chan and H. Yang . A stochastic user equilibrium assignment model for congested transit networks[J]. Transportation Research B, 33 (1999a):1-18.
[47]Otto Anker Nielsen.A stochastic transit assignment model considering differences in passengers utility functions[J].Transportation Research Part B: Methodological,2000.6,34(5):377-402.
[48]William H. K. Lam, Jing Zhou, Zhao-han Sheng. A capacity restraint transit assignment with elastic line frequency[J].Transportation Research Part B: Methodological,2002.12,36(10):919-938.
[49]Caliper Corporation. Travel Demand Modelling with TransCAD 4.7.[M].Newton, Massachusetts.2004.
[50]M. Cepeda, R. Cominetti, M. Florian. A frequency-based assignment model for congested transit networks with strict capacity constraints : characterization and computation of equilibria[J].Transportation Research Part B: Methodological,2006.7, 40(6):437-459.
[51]Lian-Ju Sun, Zi-You Gao. An equilibrium model for urban transit assignment based on game theory[J].European Journal of Operational Research, 2007.8, 181(1): 305-314.
[52]Younes Hamdouch , Siriphong Lawphongpanich.Schedule-based transit assignment model with travel strategies and capacity constraints[J]. Transportation Research Part B: Methodological, 2008.8, 42(7-8): 663-684.
[53]Jan-Dirk Schm?cker,Michael G.H. Bell, Fumitaka Kurauchi. A quasi-dynamic capacity constrained frequency-based transit assignment model[J]. Transportation Research Part B: Methodological,2008.12,42(10):925-945.
[54]Agachai Sumalee, Zhijia Tan, William H.K. Lam. Dynamic stochastic transit assignment with explicit seat allocation model[J]. Transportation Research Part B: Methodological,2009.9,43(8-9):895-912.
[55]Larry J., LeBlanc. Transit system network design[J].Transportation Research Part B: Methodological, 1988.10,22(5):383-390.
[56]Van Nes , Rob.Multiuser-class urban transit network design[J]. Transportation Research Record, 2003 ,1835: 25-33.
[57]杨兆升.交通运输系统规划——有关理论与方法[M].人民交通出版社,1997:78.
[58]任刚.交通管理措施下的交通分配模型与算法[M].东南大学出版社,2007:21.
[59]郭立夫.运筹学[M].吉林科学技术出版社,1998,2(1):284.
[60]殷剑宏,吴开亚.图论及其算法[M].中国科学技术大学出版社,2003.7:1
[61]黄溅华.公共汽车实时调度方法与模型研究[D].北方交通大学博士学位论文,2000:41-42.
[62]李忠范,高文森.数理统计与随机过程[M].长春:吉林大学出版社,2000:176-178.
[63]彭晗,韩秀华,田振中,秦朝举.公交IC卡数据处理的换乘矩阵构造方法研究[J].交通与计算机,2007,25(137):32-34.
[64]杨明,曲大义,王炜,邓卫.城市土地利用与交通需求相关关系模型研究[J].公路交通科技,2002,19(1):72-75.
[65]孙爱充.公交客流预测方法研究[J].城市交通,1999(6):32
[66]田振中.基于可持续发展的大城市客运交通结构研究[D].吉林大学硕士学位论文,2006.6.
[67]William H.K.Lam, Zhi-Chun Li, Hai-Jun Huang and S.C.Wong. The impact of stop-making and travel time reliability on commute mode[J]. Transportation Research Part B2006,40:709-730.
[68]沈未,陆化普.基于可持续发展的城市交通结构优化模型与应用[J].中南中南公路工程,2005.3,30(1):150-153.
[69]姜华平,陈海泳.城市公交客运量的预测模型研究[J].统计与决策,2005.6:30-32.
[70]谢辉.符合生态城市的城市客运交通结构研究[D].长沙理工大学硕士学位论文,2007.3:30.
[71]Frost M, Linneker B, Spence N. Energy Consumption Implications of Changing Work Travel in London, Brimingham and Manchester[J].Transportation Res, 1997,31A(1):1-19.
[72]王炜,徐吉谦,杨涛,李旭宏等.城市交通规划[M].东南大学出版社,1999:8.
[73]关宏志.非集计模型——交通行为分析的工具[M].人民交通出版社,2004.12:61-62.
[74]Florian M. An introduction to network models used in transportation planning[M]. In:Transpotation planning models (Eduted by M.Florian),Elsevier science publishersB.V.North Holland,Amsterdam. 1984,137-152.
[75]马良河,刘信斌,廖大庆.城市公交线路网络图的最短路与乘车路线问题[J].数学的实践与认识,2004.7,34(6):38-44.
[76]吴稼豪,赵永昌,王春祥.公共交通网络路径算法[J].系统工程,1987.1,5(1):53-59
[77]王莉,李文权.公共交通系统最佳路径算法[J].东南大学学报(自然科学版),2004.3,34(2):264-267
[78]张国伍,钱大琳.公共交通线路网多条最短路径算法[J].系统工程理论与实践,1992.7,第4期:22-26
[79]蔺焕泉.公交乘车最优线路的数学模型与算法[J].长春大学学报,2008.6,18(3):20-23
[80]闫小勇,牛学勤.公交网络多路径选择启发式算法研究[J].城市交通,2005.8,3(3):23-26.
[81]何胜学,范炳全,严凌.公交网络最优路径的一种改进求解算法[J].上海理工大学学报,2006,28(1):63-67
[82]王咏梅,朱胜华,胡福乔.城市交通网络中的最优路径搜索的树修剪算法[J].交通与计算机,2003,21(5):46-51.
[83]何胜学,范炳全.公交网络最优路径求解算法[J].交通运输系统工程与信息学报,2007.3,5(1)22-27
[84]王祖祥,高成修,周安宁.公交最短路算法与公交路径集生成技术[J].系统工程,1993,11(4):37-43.
[85]李彬,杨超,杨佩昆.公交最短路径算法与网络通达性指标的计算[J].同济大学学报,1997,25(6):651-655.
[86]伍雁鹏,彭小奇,李仁明.公交网络最优路径求解算法的回溯实现[J].湖南农业大学学报(自然科学版),2008.6,34(3):379-382.
[87]李曙光,苏彦民.基于GIS的城市公交路网最优路线算法研究[J].中国公路学报,2003,16(3):83-86.
[88]苏爱华,施法中.公交网络换乘问题的一种实现[J].工程图学学报,2005(4):56-59.
[89]向万里,刘洪升.城市公交网络出行路径选择的计算机算法研究[J].兰州交通大学学报:自然科学版,2006,25(1):122-124.
[90]徐立华.求解最短路问题的一个计算机算法[J].系统工程,1989,7(5):46-51.
[91]李维斌.汽车运输工程学[M].人民交通出版社,1999:132,138.
[2]张启人,熊桂林.公共交通大系统建模与优化[J].系统工程,1986,4(6):25-39.
[3]刘清,衷仁保,朱志勇,谢磊.实现城市公交线网优化的数学模型和广义A*算法.系统工程理论与实践,1992,2:11-17.
[4]韩印,李维斌,李晓峰.城市公交线网调整优化PSO算法[J].中国公路学报,1999,12(3):100-104.
[5]韩印,杨晓光.一种新的公交网络非线性双层优化模型的提出及其求解算法[J].交通与计算机,2005,23(4):11-14.
[6]林柏梁,杨富社,李鹏.基于出行费用最小化的公交网络优化模型[J].中国公路学报,1999,12(1):79-83.
[7]陈洪仁,冯树民.分层限制的公交线网优化模型[J].哈尔滨建筑大学学报,2001,34(5):113-115.
[8]王炜,刘新苗,陈学武.城市公共交通系统规划方法与管理技术[M],科学出版社,2002.2,77-97.
[9]Quentin K. Wan ,Hong K. Lo. A Mixed Integer Formulation for Multiple-Route Transit Network Design[J] , Journal of Mathematical Modelling and Algorithms, 2003.12,2(4):299-308.
[10]白子建,赵淑芝,田振中.公共交通网络优化的禁忌算法设计与实现[J].吉林大学学报(工学版),2006,36(3):340-344.
[11]胡启洲,邓卫,田新现.基于四维消耗的公交线网优化模型及蚁群算法[J].东南大学学报(自然科学版),2008,38(2):304-308
[12]钱大琳,孙艳丰.离散非平衡公交网络优化模型及其求解算法[J].北方交通大学学报,2001,25(2):58-61.
[13]胡启洲,常玉林.城市公交线网多目标优化的建模及其求解[J].江苏大学学报(自然科学版),2003,24(6):88-90.
[14]李默涵.城市公交线网优化方法的应用研究[J].辽东学院学报,2005,12(47):10-14.
[15]邬开俊,郑丽英,王铁君,张春岭.基于蚁群算法的城市公交线网模型优化方法研究[J].兰州交通大学学报(自然科学版),2007,26(4):4-6
[16]于滨,杨忠振,程春田.并行蚁群算法在公交线网优化中应用[J],大连理工大学学报,2007,47(2):211-214
[17]刘好德,杨晓光.基于路线优选的公交线网优化设计方法研究[J].交通与计算机,2007,25(2):14-18
[18]林丽娜,郑应文.嫁接遗传算法在城市公交线网优化中的应用[J].中南大学学报(自然科学版),2007,第38卷增刊1:619-623
[19]于滨,杨永志,杨忠振,靳廉洁.基于直达客流密度最大的公交线网优化[J].哈尔滨工业大学学报,2009,41(2):205-207
[20]葛亮,王炜,杨明,邓卫.基于站点的公交网络配流实用模型与算法研究[J].公路交通科技,2004.10,21(10):105-108.
[21]吴稼豪.网络设计理论在城市公共交通中的应用[J].上海机械学院学报,1988,10(2):89-96.
[22]单连龙,高自友.公交系统随机平衡网络设计模型及求解算法[J].中国管理科学, 2001.12,9(1):41-49.
[23]任华玲,高自友.动态公交网络设计的双层规划模型及算法研究[J].系统工程理论与实践,2007,5:82-89
[24]Patz.Die richtige Auswahl von Verkehrslinien bei gro?en Stra?enbahnnetzen. Verkehrstechnik 50/51.
[25]C.E. Mandl. Evaluation and optimization of urban public transportation networks[J]. European Journal of Operational Research, 1979,5: 396–404.
[26]G. Newell. Some issues related to the optimal design of bus routes[J]. Transportation Science, 1979,13: 20–35.
[27]A. Ceder, N.H. Wilson, Bus network design[J]. Transportation Research ,1986, 20B:331–344.
[28]M. Hadi Baaj, Hani S. Mahmassani. Hybrid route generation heuristic algorithm for the design of transit networks[J].Transportation Research Part C: Emerging Technologies, 1995.2, 3(1) : 31-50.
[29]Mao-Chang. A design methodology for bus transit route networks with coordinated operations : Shih[D], The University of Texas at Austin, 1994.
[30]Hélène Dufourd, Michel Gendreau, Gilbert Laporte .Locating a transit line using tabu search[J]Location Science, 1996, 4( 1-2): 1-19.
[31]S.B. Pattnaik, S. Mohan and V.M. Tom, Urban bus transit network design using genetic algorithm, Journal of Transportation Engineering,1998 ,124 (4) : 368–375.
[32]Petrelli. A transit network design model for urban areas[C] ,UrbanTransport X: Urban Transport and the Environment in the 21st Century,2004 ,16: 163-172.
[33]Tom V.M. ,Mohan, S..Transit route network design using frequency coded genetic algorithm[J], Journal of Transportation Engineering, 2003,129 (2): 186-195.
[34]W. Fan ,R.B. Machemehl, Optimal transit route network design problem with variable transit demand : genetic algorithm approach[J] , Journal of Transportation Engineering,2006,132(1): 40–51.
[35]A.T. Murray, A coverage model for improving public transit system accessibility and expanding access[J], Annals of Operations Research 2003, 123 ,143–156.
[36]Y. Lee , V.R. Vuchic. Transit network design with variable demand[J], Journal of Transportation Engineering,2005,131 (1): 1–10.
[37]Dial.R.B.. A probabilistic multipath traffic assignment algorithm which obviates path enumeration[J].Transportation Res.,1971,52:81-111.
[38]Sheffi.Y. and Powell. W.B.. An algorithm for the equilibrium assignment problem with random link Times[J].Networks 12(2), 1982:191–207.
[39]Sheffi.Y.. Urban Transportation Networks: Equilibrium Analysis with Mathematical programming Methods[M].Prentice-Hall,Englewood Cliffs, NJ.113, 1985.
[40]A. Last,S.E. Leak. Transept:a bus model[J]. Traffic Engineering and Control ,17(1976):14-20.
[41]S. Nguyen,S. Pallottino. Equilibrium traffic assignment for large scale transit networks[J]. European Journal of Operational Research ,37 (1988):176-186.
[42]S. Nguyen , S. Pallottino. Hyperpaths and shortest hyperpaths. In Combinatorial optimization(Edited by Simeone B.),volume 1403 of lecture notes in mathematics,Springer-Verlag, Berlin, 1989:258-271
[43]Heinz Spiess, Michael Florian .Optimal strategies: A new assignment model for transit networks[J].Transportation Research Part B: Methodological, 1989 .4, 23(2): 83-102
[44]J. De Cea, E. Fernández. Transit assignment for congested public transport system: an equilibrium model[J]. Transportation Science,27(1993): 133-147.
[45]S. Nguyen et al. Implicit enumeration of hyperpaths in a logit model for transit networks[J].Transportation science,1998,32(2):176-186.
[46]W.H.K. Lam, Z.Y. Gao, K.S. Chan and H. Yang . A stochastic user equilibrium assignment model for congested transit networks[J]. Transportation Research B, 33 (1999a):1-18.
[47]Otto Anker Nielsen.A stochastic transit assignment model considering differences in passengers utility functions[J].Transportation Research Part B: Methodological,2000.6,34(5):377-402.
[48]William H. K. Lam, Jing Zhou, Zhao-han Sheng. A capacity restraint transit assignment with elastic line frequency[J].Transportation Research Part B: Methodological,2002.12,36(10):919-938.
[49]Caliper Corporation. Travel Demand Modelling with TransCAD 4.7.[M].Newton, Massachusetts.2004.
[50]M. Cepeda, R. Cominetti, M. Florian. A frequency-based assignment model for congested transit networks with strict capacity constraints : characterization and computation of equilibria[J].Transportation Research Part B: Methodological,2006.7, 40(6):437-459.
[51]Lian-Ju Sun, Zi-You Gao. An equilibrium model for urban transit assignment based on game theory[J].European Journal of Operational Research, 2007.8, 181(1): 305-314.
[52]Younes Hamdouch , Siriphong Lawphongpanich.Schedule-based transit assignment model with travel strategies and capacity constraints[J]. Transportation Research Part B: Methodological, 2008.8, 42(7-8): 663-684.
[53]Jan-Dirk Schm?cker,Michael G.H. Bell, Fumitaka Kurauchi. A quasi-dynamic capacity constrained frequency-based transit assignment model[J]. Transportation Research Part B: Methodological,2008.12,42(10):925-945.
[54]Agachai Sumalee, Zhijia Tan, William H.K. Lam. Dynamic stochastic transit assignment with explicit seat allocation model[J]. Transportation Research Part B: Methodological,2009.9,43(8-9):895-912.
[55]Larry J., LeBlanc. Transit system network design[J].Transportation Research Part B: Methodological, 1988.10,22(5):383-390.
[56]Van Nes , Rob.Multiuser-class urban transit network design[J]. Transportation Research Record, 2003 ,1835: 25-33.
[57]杨兆升.交通运输系统规划——有关理论与方法[M].人民交通出版社,1997:78.
[58]任刚.交通管理措施下的交通分配模型与算法[M].东南大学出版社,2007:21.
[59]郭立夫.运筹学[M].吉林科学技术出版社,1998,2(1):284.
[60]殷剑宏,吴开亚.图论及其算法[M].中国科学技术大学出版社,2003.7:1
[61]黄溅华.公共汽车实时调度方法与模型研究[D].北方交通大学博士学位论文,2000:41-42.
[62]李忠范,高文森.数理统计与随机过程[M].长春:吉林大学出版社,2000:176-178.
[63]彭晗,韩秀华,田振中,秦朝举.公交IC卡数据处理的换乘矩阵构造方法研究[J].交通与计算机,2007,25(137):32-34.
[64]杨明,曲大义,王炜,邓卫.城市土地利用与交通需求相关关系模型研究[J].公路交通科技,2002,19(1):72-75.
[65]孙爱充.公交客流预测方法研究[J].城市交通,1999(6):32
[66]田振中.基于可持续发展的大城市客运交通结构研究[D].吉林大学硕士学位论文,2006.6.
[67]William H.K.Lam, Zhi-Chun Li, Hai-Jun Huang and S.C.Wong. The impact of stop-making and travel time reliability on commute mode[J]. Transportation Research Part B2006,40:709-730.
[68]沈未,陆化普.基于可持续发展的城市交通结构优化模型与应用[J].中南中南公路工程,2005.3,30(1):150-153.
[69]姜华平,陈海泳.城市公交客运量的预测模型研究[J].统计与决策,2005.6:30-32.
[70]谢辉.符合生态城市的城市客运交通结构研究[D].长沙理工大学硕士学位论文,2007.3:30.
[71]Frost M, Linneker B, Spence N. Energy Consumption Implications of Changing Work Travel in London, Brimingham and Manchester[J].Transportation Res, 1997,31A(1):1-19.
[72]王炜,徐吉谦,杨涛,李旭宏等.城市交通规划[M].东南大学出版社,1999:8.
[73]关宏志.非集计模型——交通行为分析的工具[M].人民交通出版社,2004.12:61-62.
[74]Florian M. An introduction to network models used in transportation planning[M]. In:Transpotation planning models (Eduted by M.Florian),Elsevier science publishersB.V.North Holland,Amsterdam. 1984,137-152.
[75]马良河,刘信斌,廖大庆.城市公交线路网络图的最短路与乘车路线问题[J].数学的实践与认识,2004.7,34(6):38-44.
[76]吴稼豪,赵永昌,王春祥.公共交通网络路径算法[J].系统工程,1987.1,5(1):53-59
[77]王莉,李文权.公共交通系统最佳路径算法[J].东南大学学报(自然科学版),2004.3,34(2):264-267
[78]张国伍,钱大琳.公共交通线路网多条最短路径算法[J].系统工程理论与实践,1992.7,第4期:22-26
[79]蔺焕泉.公交乘车最优线路的数学模型与算法[J].长春大学学报,2008.6,18(3):20-23
[80]闫小勇,牛学勤.公交网络多路径选择启发式算法研究[J].城市交通,2005.8,3(3):23-26.
[81]何胜学,范炳全,严凌.公交网络最优路径的一种改进求解算法[J].上海理工大学学报,2006,28(1):63-67
[82]王咏梅,朱胜华,胡福乔.城市交通网络中的最优路径搜索的树修剪算法[J].交通与计算机,2003,21(5):46-51.
[83]何胜学,范炳全.公交网络最优路径求解算法[J].交通运输系统工程与信息学报,2007.3,5(1)22-27
[84]王祖祥,高成修,周安宁.公交最短路算法与公交路径集生成技术[J].系统工程,1993,11(4):37-43.
[85]李彬,杨超,杨佩昆.公交最短路径算法与网络通达性指标的计算[J].同济大学学报,1997,25(6):651-655.
[86]伍雁鹏,彭小奇,李仁明.公交网络最优路径求解算法的回溯实现[J].湖南农业大学学报(自然科学版),2008.6,34(3):379-382.
[87]李曙光,苏彦民.基于GIS的城市公交路网最优路线算法研究[J].中国公路学报,2003,16(3):83-86.
[88]苏爱华,施法中.公交网络换乘问题的一种实现[J].工程图学学报,2005(4):56-59.
[89]向万里,刘洪升.城市公交网络出行路径选择的计算机算法研究[J].兰州交通大学学报:自然科学版,2006,25(1):122-124.
[90]徐立华.求解最短路问题的一个计算机算法[J].系统工程,1989,7(5):46-51.
[91]李维斌.汽车运输工程学[M].人民交通出版社,1999:132,138.