基于刷卡数据的民族节日期间公交线网优化

Optimization of Public Transportation Network During Ethnic Reglious Festivals Based on IC Card Data

为了缓解高原城市部分居民出行需求不能得到有效满足的问题,基于对公交车刷卡数据的挖掘,研究西藏民族宗教节日期间公交线网的优化问题.首先,基于公交IC卡和车载GPS数据,提出乘客上下车站点判断的方法;其次,根据计算的乘客上下车数据,构建站点之间的OD矩阵,判断现有线网与路网条件下公交系统客流发生与吸引量大的节点;然后,利用Dijkstra广义最短路算法,计算发生与吸引点之间的最优路径;以直达乘客量最大为优化目标构建0-1模型,对公交线网进行优化;最后选取民族宗教节日期间,公众出行较为集中的布达拉宫区域公交运营情况为研究对象,对该区域的公交线路始末站设置进行应用优化,缓解节日期间居民集中出行引发的出行难问题,特别是保障力求满足朝圣人群的出行需求,维持民族宗教节日期间正常的出行秩序.

In order to alleviate the problem that the travel needs of some residents in plateau cities cannot be effectively met,this paper uses public transit IC card transaction data to study the optimization of the bus network during Tibetan ethnic religious festivals.First,based on the bus IC card and GPS data,a method for judging the passenger boarding station is proposed.Secondly,according to the calculated passenger boarding and disembarking data,the OD matrix between the stations is constructed to determine the nodes of the public transportation system where the passenger flow occurs and attracts a large amount under the existing network and road network conditions.Then,using Dijkstra s generalized shortest path algorithm,this paper calculates the optimal path between occurrence and attraction points.Furthermore,a 0-1 model is constructed with the maximum number of direct passengers as the optimization goal to optimize the bus network.Finally,the bus operation situation in the Potala Palace area where public travel is concentrated during ethnic religious festivals is selected as the research object,and the settings of the bus lines in this area are optimized.To alleviate the difficulty of travel caused by concentrated travel of residents during the festival,the optimized bus lines can ensure that the travel needs of the pilgrims are met and the normal travel order during ethnic religious festivals is maintained.