基于换乘优化的公交区域调度  

Bus Regional Scheduling Based on Optimal Transfer

作　　者：颜建新[1] 李文权[1] 柏海舰[1] 

机构地区：[1]东南大学交通学院,南京210096

出　　处：《交通运输工程与信息学报》2010年第2期81-86,共6页Journal of Transportation Engineering and Information

基　　金：国家高技术研究发展计划(2007AA11Z210);"十一五"国家科技支撑计划(2006BAJ18B03)

摘　　要：我国传统的公交运营调度以线路调度为核心,所制定的行车时刻表只针对单一线路而非公交区域,未考虑乘客换乘的便利程度。本文首先根据公交换乘的特点,分析两条公交线路之间基于乘客总换乘等待时间最短的公交调度,建立相关模型;然后以所建模型为基础,结合公交站点换乘权重与线路换乘吸引度,设计相应的算法探讨基于换乘优化的公交区域调度方法,并运用一维搜索方法进行求解;最后结合具体实例,证明模型与算法的可行性。本文的研究为解决公交区域的协调调度提供了技术参考。Route scheduling is a core of the traditional traffic scheduling in our country, and the timetable setting aimed at a single route rather than a traffic region, taking little regard for the convenience of bus passenger transfer. Firstly, according to the characteristics of bus passenger transfer, this paper analyzed the bus scheduling between two routes based on the shortest transfer waiting time of passenger, and established a relative model; Secondly, based on the established model and combined with the transfer weight of the bus stops and attraction of bus routes , the author designed a relative algorithm to discuss the bus regional scheduling based on optimal tranfer, and using the one-dimensional search method to solve the algorithm ; Finally, proved the feasibility of the model and algorithm combined with a practical case of bus regional scheduling.

关 键 词：公交换乘 公交区域调度 换乘时间 一维搜索方法 

分 类 号：U491.122[交通运输工程—交通运输规划与管理]