Research On The Optimal Route Algorithm Of Urban Public Transportation Network

Urban public transportation is an important part of the whole urban transportation system,its development is advantageous to improve people’s living standard, and it is of great significance to social economic activities and urban life.The level of development of urban public transportation is an important symbol of urban modernization,but also the best way to solve the traffic congestion problem in cities.Optimal path selection based on transit network is an important aspect of urban public transport to guarantee public transport priority.In this paper, the bus data of GTFS file is used to establish the public transport network,and the optimal bus route can quickly be calculated after the starting stop and the destination determined.Mainly to complete the following:Firstly, Google GTFS files and its data storage structure are analysised.In order to establish public transport network,data is conversed to generate the shape of bus route, and bus stops added to each shape.Then computing the optimal bus route; Secondly, searching and storing transfer points, if there is no direct route from start stop to the destination,just access the data of a small part of the entire bus network by finding transfer points in a certain range.It improve the computational efficiency of feasible bus routes;In addition, calculating bus routes through the bus stop, so that bus routes information of the bus stop can be quickly accessed.Finally,after determining the start and end bus stops in the transit network,calculate possible routes between them,the best bus route through the least possible number of bus stops.Whether need to transfer firstly considerd when calculating feasible transit routes set,calculating transfer routes if there is no direct route.Because most of the passengers will be able to arrival destination by at most once transfer.So we only consider the case of arrival directly,or through once or twice transfer when calculating feasible paths.