用户名: 密码: 验证码:
基于停靠时间的城市公共交通网络均衡客流分配模型研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
本文首先通过对国内外学者对公共交通网络的研究进行了深入的研究和分析,包括公交停靠时间、公交网络均衡客流分配以及公交网络设计等方面,指出了这些研究的不足之处:公交停靠时间的研究没有反映公交车在公交站台停靠时间由乘客上车时间和下车时间两者之中最大值确定这一特点;公交网络均衡客流分配,没有考虑公交停靠时间对乘客出行行为、对均衡客流分配的影响,事实上,在许多城市由于上下车乘客数量很大,导致公交车停靠时间增加,进而也对乘客的出行路线选择产生影响。
     针对这些问题,本文主要做的研究包括:第一,在实际调查统计的基础上对公交停靠时间进行了研究,根据采集的数据提出了公交停靠时间的新的非线性模型,并给出了公交车在港湾式公交停靠站停靠时间的定义,包括公交车服务时间和公交车在港湾式公交站的无障碍行驶时间,进而给出公交车在港湾式公交停靠站停留时间的数学模型;第二,根据公交车在公交站停靠时间的研究结果,给出了基于公交停靠时间的公交网络均衡客流分配模型。针对公交网络均衡客流分配问题,本文首先给出了基于公交停靠时间的网络结构,并提出基于公交停靠时间的公交网络均衡定义。在此基础上,提出了城市公交网络均衡条件下的性质,进而得到网络均衡的等价最小化模型。利用提出的改进最优出行策略算法来求解基于公交停靠时间的公交网络的乘客出行选择问题,以及求解等价最优模型的连续平均算法(MSA)和加权连续平均算法(MSWA);第三,提出了有能力约束的公交网络均衡客流分配模型。模型是基于公交停靠时间的公交网络均衡客流分配模型提出的,引入“有效频率”这个概念并通过构建双层网络模型来解决有能力约束情况的公交网络均衡客流分配问题;第四,基于公交停靠时间的公交网络均衡客流模型在城市公共交通网络设计的应用研究。针对许多大型城市公交车公共交通系统和地铁公共交通系统两个系统整合性和集成性差的现象,本文提出新的基于公交停靠时间的公交网络均衡客流模型的城市公共交通网络模型---中心辐射型网络模型,通过在地铁站点附近建设枢纽站来提高公共交通效率,以及提高两个公共交通系统的整合性和集成性,最后使用混合遗传算法求解该模型。
Though the analysis of the public transport network, including bus dwell time, theassignment of equlibrium passenger, the bus network and bus network design, and we pointout the inadequacies of these studies firstly: the research of bus dwell time research does notrespond to the characteristics that the bus dwell time in the bus station determined by thelarger value between the passengers to boarding time and alighting time; the assignment ofequlibrium passenger flow bus network did not consider the boarding and alighting behaviorof passengers on the assignment of equlibrium passenger flow, in fact, in many cities becauseof the huge number of boarding and alighting passengers, the bus dwell time is large enoughto impact the passengers choose of travel route; urban transit network design, most of theexisting model focuses on the re-design the entire public transportation network, or a large-scale adjustments to the public transport network, these models have a prominent contributionto the theory. However, these models have certain deficiencies in practical application. Tosolve these problems, the paper mainly do research include: based on the practical survey ofbus dwell time, new nonlinear model of the new bus dwell time are presented firstly, and thedefinition of bus dwell time in bus bay is given which include bus service hours and the traveltime of bus travelling in the bus bay; secondly, according to the study result of bus dwell time,the model of transit assignment of bus network equilibrium are proposed. For the problem oftransit assignment of bus network equilibrium, the paper gives the bus stop time-basednetwork structure firstly, and proposes public transit network equilibrium definition based onbus dwell time. Then the characterization of the transit network equilibrium conditions, andthe equivalent of the network equilibrium minimization model are proposed. To solve thepresented model, improvement optimal strategy algorithm is proposed, as well to solvecontinuous equivalent continuous of minimization model, average optimal model algorithm(MSA) and weighted average algorithm (MSWA) are proposed; Thirdly, one model of transitassignment of bus network equilibrium with capacity constraint are presented. The model istransit assignment of bus network equilibrium based on the bus dwell time, which introducethe concept of "effective frequency" and build a two-layer network model to transitassignment of bus network equilibrium with capacity constraint; Forthly, we proposed a newmodel to design of the new public transport network. The hub-and-spoke network designmodel is introduced firstly, and a new hub-and-spoke network model are proposed based onimproving the integration of the two public transportation network systems: bus publictransportation network system and metro public transportation system secondly. We use theuse the hybrid genetic algorithm to solve the model finally.
引文
[1] Levison, H. S. Analyzing Transit Travel Time Performance. In Transportation ResearchRecord: Journal of the Transportation Research Board, No.915, TRB, NationalResearch Council, Washington, D.C.,1983, pp.1-6.
    [2] Guenthner, R. P., K. C. Sinha. Modeling Bus Delays due to Passenger Boardings andAlightings. In Transportation Research Record: Journal of the Transportation ResearchBoard, No.915, TRB, National Research Council, Washington, D.C.,1983, pp.7-13.
    [3] Rajbhandari, R., S. I. Chien, J. R. Daniel. Estimation of Bus Dwell Times with AutomaticPassenger Counter Information. In Transportation Research Record: Journal of theTransportation Research Board, No.2101, TRB, National Research Council,Washington, D.C.,2003, pp.120-127.
    [4]郭四玲,韦艳芳,时伟等.公交停靠时间的统计分析[J].广西师范大学学报:自然科学版,2006,124(2):5—10.
    [5] Dial, R. B. Transit Pathfinder Algorithms. Highway Research Record, Vol.205,1967, pp.67-85.
    [6] Fearnside, K., D. P. Draper. Public Transport Assignment--A New Approach. TrafficEngineering Control, Vol.12,1971, pp.298-299.
    [7] Le Clercq, F. A Public Transport Assignment Model. Traffic Engineering Control, Vol.13,1972, pp.91-96.
    [8]Chriqui, C., P. Robillard. Common Bus Lines. Transportation Science, Vol.9,1975, pp.115-121.
    [9]De Cea, J., E. Fernández. Transit Assignment for Congested Public Transport Systems: AnEquilibrium Model. Transportation Science, Vol.27,1993, pp.183-200.
    [10]De Cea, J., E. Fernández. Transit Assignment to Minimal Routes: An Efficient NewAlgorithm. Traffic Engineering and Control, Vol.12,1993, pp.250-267.
    [11]Lam, W. H. K., Z. Y. Gao, K. S. Chan, H. Yang. A Stochastic User EquilibriumAssignment Model for Congested Transit Networks. Transportation Research Part B,Vol.33,1999, pp.351-368.
    [12]Spiess, H., M. Florian. Optimal Strategies: A New Assignment Model for TransitNetworks. Transportation Research Part B, Vol.23B, No.2,1989, pp.83-102.
    [13]Nguyen, S., S. Pallottino. Equilibrium Traffic Assignment for Large Scale TransitNetworks. European Journal of Operational Research, Vol.37,1988, pp.176-186.
    [14]Comineti, R., J. Correa. Common-Lines and Passenger Assignment in Congested TransitNetworks. Transportation Science, Vol.35, No.3,2001, pp.250-267.
    [15]Cepeda, M., R. Cominetti, M. Florian. A Frequency-Based Assignment Model forCongested Transit Networks with Strict Capacity Constraints: Characterization andComputation of Equlibria. Transportation Research Part B, Vol.40,2006, pp.437-459.
    [16]Larrain, H., J. C. Mu oz. Public Transit Corridor Assignment Assuming Congestion Dueto Passenger Boarding and Alight. Network and Spatial Economics, Vol.8,2008, pp.241-256.
    [17]Szeto, W. Y., Y. Jiang, K. I. Wong, M. Solayappan. Reliability-Based Stochastic TransitAssignment with Capacity Constraints: Formulation and Solution Method.Transportation Research Part C,2011.
    [18]Patz.Die richtige Auswahl von Verkehrslinien bei gro en Stra enbahnnetzen.Verkehrstechnik50/51.
    [19]C.E. Mandl. Evaluation and optimization of urban public transportation networks[J].European Journal of Operational Research,1979,5:396–404.
    [20]G. Newell. Some issues related to the optimal design of bus routes[J]. TransportationScience,1979,13:20–35.
    [21]A. Ceder, N.H. Wilson. Bus network design[J]. Transportation Research,1986,20B:331–344.
    [22]M. Hadi Baaj, Hani S. Mahmassani. Hybrid route generation heuristic algorithm for thedesign of transit networks[J].Transportation Research Part C: Emerging Technologies,1995.2,3(1):31-50.
    [23]Mao-Chang. A design methodology for bus transit route networks withcoordinatedoperations: Shih[D], The University of Texas at Austin,1994.
    [24]Hélène Dufourd,Michel Gendreau,Gilbert Laporte.Locating a transit line using tabusearch[J]Location Science,1996,4(1):1-19.
    [25]S.B. Pattnaik, S. Mohan and V.M. Tom, Urban bus transit network design usinggenetic algorithm, Journal of Transportation Engineering,1998,124(4):368–375.
    [26]Petrelli. A transit network design model for urban areas[C],UrbanTransport X: UrbanTransport and the Environment in the21st Century,2004,16:163-172.
    [27]Tom V.M., Mohan. Transit route network design using frequency coded geneticalgorithm[J], Journal of Transportation Engineering,2003,129(2):186-195.
    [28]W. Fan, R.B. Machemehl. Optimal transit route network design problem with variabletransit demand: genetic algorithm approach[J], Journal of Transportation Engineering,2006,132(1):40–51.
    [29]A.T. Murray. A coverage model for improving public transit system accessibility andexpanding access[J], Annals of Operations Research2003,123:143–156.
    [30] Y. Lee, V.R. Vuchic. Transit network design with variable demand[J], Journal ofTransportation Engineerin,2005,131(1):1–10.
    [31]杨兆升.城市公共交通网络的优化研究[J],汽车技术,1985,5:54-60.
    [32]张启人,熊桂林.公共交通大系统建模与优化[J].系统工程,1986,4(6):25-39.
    [33]刘清,衷仁保,朱志勇,谢磊.实现城市公交线网优化的数学模型和广义A*算法[J].系统工程理论与实践,1992,2:11-17.
    [34]韩印,李维斌,李晓峰.城市公交线网调整优化PSO算法[J].中国公路学报,1999,12(3):100-104.
    [35]韩印,杨晓光.一种新的公交网络非线性双层优化模型的提出及其求解算法[J].交通与计算机,2005,23(4):11-14.
    [36]林柏梁,杨富社,李鹏.基于出行费用最小化的公交网络优化模型[J].中国公路学报,1999,12(1):79-83.
    [37]陈洪仁,冯树民.分层限制的公交线网优化模型[J].哈尔滨建筑大学学报,2001,34(5):113-115.
    [38]王炜,刘新苗,陈学武.城市公共交通系统规划方法与管理技术[M],科学出版社,2002.2,77-97.
    [39]Quentin K. Wan,Hong K. Lo. A Mixed Integer Formulation for Multiple-Route TransitNetwork Design[J], Journal of Mathematical Modelling and Algorithms,2003.12,2(4):299-308.
    [40]白子建,赵淑芝,田振中.公共交通网络优化的禁忌算法设计与实现[J].吉林大学学报(工学版),2006,36(3):340-344.
    [41]胡启洲,邓卫,田新现.基于四维消耗的公交线网优化模型及蚁群算法[J].东南大学学报(自然科学版),2008,38(2):304-308.
    [42]Spiess H. Contributions a la theorie at aux outils de planification des reseaux de transporturbain. Ph.D. thesis, Universite DE Montreal.1984.
    [43]Marshall, L., Levinson, H., Lennon, L.,&Cheng, C.(1990). Bus Service Times andCapacities in Manhattan, Transportation Research Record1266, Transportation ResearchBoard, Washinngton D.C.189-196.
    [44]Milkovits, M. N.(2008). Modeling the Factors Affecting Bus Stop Dwell Time: Use ofAutomatic Passenger Counting, Automatic Fare Counting, and Automatic VehicleLocation Data. Transportation Research Record: Journal of the Transportation ResearchBoard,2072, pp125-130.
    [44]Mushule, N. K.(2012). Bus Bay Performance and its Influence on the capacity of RoadNetwrok in Dar Es Salaam. American Journal of Engineering and Applied Sciences, pp107-113.
    [45]TCQSM.(2003). Transit Capacity and Quality of Service Manual.2nd Edn.Transportation Research Board, Washington D.C., ISBN-10:0309087767.
    [46]TCRP Report113.(n.d.). Uses of archives AVL-APC data to improve transitperformance and management. Tranportation Research Board, Washinton, DC.
    [47]York, I.(1993). Factors Affecting Bus-Stop Times. Project Report PR2. TransportResearch Laboratory, Crowthorne, United Kingdom
    [48]Lim, R., M. L. C. San. Land Transport Masterplan. Singapore Land Transport Authority,2008.
    [49]Ceder, A. Public Transit Planning and Operation. Butterworth-Heinemann, Oxford,2007.
    [50] Wu, J. H., M. Florian, P. Marcotte. Transit Equilibrium Assignment: A Model andSolution Algorithms. Transportation Science, Vol.28,1994, pp.193-203.
    [51]Gendreau, M. Etude approfondie d’un modele d’equilibre pour1’affectataion depassagers dans les reseaux de transports en commun. Publication364, Centre Recherchesur les transports, Univ. de Montreal.1984.
    [52]Newll, G. Some issues relating to the optimal design of bus routes[J]. TransportationScience, Vol.131979,20-35.
    [53]Ceder, A., N. Wilson. Bus network design[J]. Transportation Research Part B, Vol.208,1986, pp.331-334.
    [54] O'Kelly, M.E., The location of interacting hub facilities[J]. Transportation Science1986a.Vol (20),92-106.
    [55]O'Kelly, M.E., Activity levels at hub facilities in interacting networks[J]. GeographicalAnalysis1986b. Vol (18),343-356.
    [56] Gelareh, S., Nickel, S.,. A benders decomposition algorithm for single allocation hublocation problem. Transportation Science2007. Vol (20),92-106.
    [57] Nickel, S., Schobel, A., Sonneborn, T., Hub Location Problems in Urban TrafficNetworks. Mathematics Methods and Optimization in Transportation Systems. KluwerAcademic Publishers.2001.
    [58] Gelareh, S., Nickel, S., Multi-period Public Transport Planning: A Model and GreedyNeighborhood Heuristic Approaches. Tech. Rep. Department of Optimization,Fraunhofer Institute for Industrial Mathematics (ITWM), D67663Kaiserslautern,Germany.2008.
    [59] Gelareh, S., Nickel, S.,. Hub location problems in transportation networks.Transportation Research Part E.2011, Vol (47),1092-1111.
    [60]刘好德,杨晓光.基于路线优选的公交线网优化设计方法研究[J].交通与计算机,2007,25(2):14-18
    [61]林丽娜,郑应文.嫁接遗传算法在城市公交线网优化中的应用[J].中南大学学报(自然科学版),2007,第38卷增刊1:619-623
    [62]于滨,杨永志,杨忠振,靳廉洁.基于直达客流密度最大的公交线网优化[J].哈尔滨工业大学学报,2009,41(2):205-207
    [63]葛亮,王炜,杨明,邓卫.基于站点的公交网络配流实用模型与算法研究[J].公路交通科技,2004.10,21(10):105-108.
    [64]吴稼豪.网络设计理论在城市公共交通中的应用[J].上海机械学院学报,1988,10(2):89-96.
    [65]单连龙,高自友.公交系统随机平衡网络设计模型及求解算法[J].中国管理科学,2001.12,9(1):41-49.
    [66]任华玲,高自友.动态公交网络设计的双层规划模型及算法研究[J].系统工程理论与实践,2007,5:82-89
    [67]周晶,徐晏.弹性需求随机用户平衡分配模型及其应用[J].系统工程学报,2001,16(2):88—94.
    [68]四兵锋,高自友.城市公交网络均衡配流模型及算法的研究[J].公路交通科技,1998,15(3):41—45.
    [69]单连龙,高自友.公交系统随机平衡网络设计模型及求解算法[J].中国管理科学,2001,9(2):41—50.
    [70]宋一凡,高自友.能力限制条件下的公交平衡配流模型和求解算法[J],1999,21(5):10—14.
    [71]高自友,任华玲,林兴强.拥挤条件下公交系统的拟动态均衡配流模型[J].交通运输系统工程与信息,2002,2(2):38—45.
    [72]单连龙,高自友.城市公交系统连续平衡网络设计的双层规划模型及求解算法[J].系统工程理论与实践,2000(7):85—93.
    [73]陈国良,王熙法,庄镇泉等,遗传算法及其应用1996,北京人民邮电出版社.
    [74]曾国隼,丁春玲,并行遗传算法分析[J].计算机工程,2001.27(9):53-55.
    [75]杨兆升.交通运输系统规划——有关理论与方法[M].人民交通出版社,1997:78.
    [76]任刚.交通管理措施下的交通分配模型与算法[M].东南大学出版社,2007:21.
    [77]郭立夫.运筹学[M].吉林科学技术出版社,1998,2(1):284.
    [78]殷剑宏,吴开亚.图论及其算法[M].中国科学技术大学出版社,2003.
    [79]黄溅华.公共汽车实时调度方法与模型研究[D].北方交通大学博士学位论文,2000:41-42.
    [80]李忠范,高文森.数理统计与随机过程[M].长春:吉林大学出版社,2000:176-178.
    [81]彭晗,韩秀华,田振中,秦朝举.公交IC卡数据处理的换乘矩阵构造方法研究[J].交通与计算机,2007,25(137):32-34.
    [82]杨明,曲大义,王炜,邓卫.城市土地利用与交通需求相关关系模型研究[J].公路交通科技,2002,19(1):72-75.
    [83]孙爱充.公交客流预测方法研究[J].城市交通,1999(6):32
    [84]沈未,陆化普.基于可持续发展的城市交通结构优化模型与应用[J].中南中南公路工程,2005.3,30(1):150-153.
    [85]姜华平,陈海泳.城市公交客运量的预测模型研究[J].统计与决策,2005.6:30-32.
    [86]马良河,刘信斌,廖大庆.城市公交线路网络图的最短路与乘车路线问题[J].数学的实践与认识,2004.7,34(6):38-44.
    [87]吴稼豪,赵永昌,王春祥.公共交通网络路径算法[J].系统工程,1987.1,5(1):53-59
    [88]王莉,李文权.公共交通系统最佳路径算法[J].东南大学学报(自然科学版),2004.3,34(2):264-267
    [89]张国伍,钱大琳.公共交通线路网多条最短路径算法[J].系统工程理论与实践,1992.7,第4期:22-26
    [90]蔺焕泉.公交乘车最优线路的数学模型与算法[J].长春大学学报,2008.6,18(3):20-23.
    [91]闫小勇,牛学勤.公交网络多路径选择启发式算法研究[J].城市交通,2005.8,3(3):23-26.
    [92]何胜学,范炳全,严凌.公交网络最优路径的一种改进求解算法[J].上海理工大学学报,2006,28(1):63-67
    [93]王咏梅,朱胜华,胡福乔.城市交通网络中的最优路径搜索的树修剪算法[J].交通与计算机,2003,21(5):46-51.
    [94]何胜学,范炳全.公交网络最优路径求解算法[J].交通运输系统工程与信息学报,2007.3,5(1)22-27
    [95]王祖祥,高成修,周安宁.公交最短路算法与公交路径集生成技术[J].系统工程,1993,11(4):37-43.
    [96]李彬,杨超,杨佩昆.公交最短路径算法与网络通达性指标的计算[J].同济大学学报,1997,25(6):651-655.
    [97]伍雁鹏,彭小奇,李仁明.公交网络最优路径求解算法的回溯实现[J].湖南农业大学学报(自然科学版),2008.6,34(3):379-382.
    [98]李曙光,苏彦民.基于GIS的城市公交路网最优路线算法研究[J].中国公路学报,2003,16(3):83-86.
    [99]苏爱华,施法中.公交网络换乘问题的一种实现[J].工程图学学报,2005(4):56-59.
    [100]向万里,刘洪升.城市公交网络出行路径选择的计算机算法研究[J].兰州交通大学学报:自然科学版,2006,25(1):122-124.
    [101]徐立华.求解最短路问题的一个计算机算法[J].系统工程,1989,7(5):46-51.
    [102]李维斌.汽车运输工程学[M].人民交通出版社,1999:132,138.
    [103]钱大琳,孙艳丰.离散非平衡公交网络优化模型及其求解算法[J].北方交通大学学报,2001,25(2):58-61.
    [104]胡启洲,常玉林.城市公交线网多目标优化的建模及其求解[J].江苏大学学报(自然科学版),2003,24(6):88-90.
    [105]李默涵.城市公交线网优化方法的应用研究[J].辽东学院学报,2005,12(47):10-14.
    [106]邬开俊,郑丽英,王铁君,张春岭.基于蚁群算法的城市公交线网模型优化方法研究[J].兰州交通大学学报(自然科学版),2007,26(4):4-6
    [107]于滨,杨忠振,程春田.并行蚁群算法在公交线网优化中应用[J],大连理工大学学报,2007,47(2):211-214[17]刘好德,杨晓光.基于路线优选的公交线网优化设计方法研究[J].交通与计算机,2007,25(2):14-18
    [108]林丽娜,郑应文.嫁接遗传算法在城市公交线网优化中的应用[J].中南大学学报(自然科学版),2007,第38卷增刊1:619-623
    [109]于滨,杨永志,杨忠振,靳廉洁.基于直达客流密度最大的公交线网优化[J].哈尔滨工业大学学报,2009,41(2):205-207
    [110]葛亮,王炜,杨明,邓卫.基于站点的公交网络配流实用模型与算法研究[J].公路交通科技,2004.10,21(10):105-108.
    [111]吴稼豪.网络设计理论在城市公共交通中的应用[J].上海机械学院学报,1988,10(2):89-96.
    [112]单连龙,高自友.公交系统随机平衡网络设计模型及求解算法[J].中国管理科学,2001.12,9(1):41-49.
    [113]任华玲,高自友.动态公交网络设计的双层规划模型及算法研究[J].系统工程理论与实践,2007,5:82-89

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700