A quick bus line selection algorithm based on self-adapted backbone network

Abstract

The invention provides a self-adapting backbone net based fast public transportation route selection algorithm, which mainly applies to the field of city bus or subway route search, and can solve the problem that the prior bus route search and selection algorithm does not support multiple transfers and the search time is too long. The invention proposes the self-adapting backbone net constructiontechnology, which comprises the following steps: first a self-adapting backbone net in a public transportation network is constructed and then feasible route combinations between any two stops are chosen according to the following principles in order: firstly, if a direct route exists between the two stops, backbone net passing is not necessary; secondly, if no direct routes exist between the twostops, transfers are needed among backbone stops with as few transfer times as possible; thirdly, the optimal route combinations are then selected from all feasible route combinations according to different traveling demands of passengers.

Description

1. Technical field [0001] Providing accurate, timely and optimized bus line information services for the masses is an important measure to facilitate the lives of the masses, improve the operating efficiency of the bus network, and enhance the image of the city. To provide this kind of service, it is necessary to design a reasonable bus route selection algorithm. The bus route is fixed, and there are many factors that people have to consider and each has its own emphasis, such as the minimum number of transfers, distance, cost, time, etc. In view of this, the selection algorithm considers various factors comprehensively, designs a reasonable travel plan according to the request of the queryer, and provides the optimal plan under various factors for selection. 2. Background technology [0002] Literature [1] demonstrates that: passengers' choice of bus lines is affected by many factors, among which "number of transfers" is the primary factor. Literature [1] gives a question...

AI Technical Summary

Problems solved by technology

Dijkstra's algorithm is a single-source shortest path algorithm in the network graph, and Floyd's algorithm is a multi-source shortest path algorithm. The time complexity required to realize the bus line selection of any two stations is O(|V| 2 ), O(|V| 3 ), and it does not meet the preferred goal of "minimum number of transfers", and it is difficult to meet the actual needs of the inquirer

At the same time, when the number of sites is many, tens of thousands, the high time complexity also makes the query time far from the real-time query desired by the queryer.

In order to achieve the goal of "minimum number of transfers", the improved Dijkstra algorithm and Floyd algorithm are currently used, but only one transfer is supported. If one transfer cannot be reached, the query will fail

Images