基于公路交通量的最佳乘车方案研究与设计  

Research and Design of the Best Ride Scheme Based on Road Traffic Volume

作　　者：赵尔波 欧成富 姜宏生 游兴中 

机构地区：[1]长沙理工大学数学与统计学院,湖南 长沙

出　　处：《理论数学》2021年第6期1062-1066,共5页Pure Mathematics

摘　　要：本文主要研究城市的公交乘车方案问题,对于乘车方案,我们以最少换乘次数为主要目标,以最少乘车时间为第二目标,结合公路交通量对道路通行时间的影响,即路阻函数,选择出一个符合要求的最优公交乘车方案;对于方案的选择,我们采用对公交线路进行搜寻的办法,寻找经过起点与终点的公交线路的集合,并根据直达、一次换乘、两次换乘对这两个集合分别进行搜寻,得到可行的方案后计算每个方案花费的时间并进行比较,从而选出最佳的乘车方案。最后,我们以湖南省长沙市为例,结合不同时间段的公路交通量计算出5组出行线路的最佳乘车方案。This article mainly studies the problem of the bus ride schemes in a certain city. For riding schemes, we take the least transfer as the main goal, and the minimum time as the second goal, combined with the impact of highway traffic flow on road transit time—BPR (Bureau of Public Road) function, then select the optimal riding scheme that meets the requirements;for the choice of the strategy, we use the method of searching for bus routes, looking for the collection of bus routes passing through the starting point and ending point respectively. Then according to the direct, one-time transfer and two transfers, the two sets are searched separately, and the feasible plans are calcu-lated and the time spent on each plan is compared, so as to select the best riding scheme. Finally, we take Changsha City, Hunan Province as an example, combined with road traffic flow at different time periods to calculate the optimal riding scheme for 5 groups of travel routes.

关 键 词：最短路径 图论 路阻函数 

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