Bus transfer method based on bidirectional search and estimation function pruning mode

Abstract

The invention discloses a bus transfer method based on a bidirectional search and estimation function pruning mode. The bus transfer method includes the following steps: 1) according to a starting station and a terminal station transmitted from a client, a server performs calculation of a straightforward line and a special bus line, calculation of a one-time transfer line, calculation of one-timetransfer line having a segment of walking before transfer, calculation of two-time of transfer line, calculation of two-time of transfer line having a segment of walking before the first time of transfer, calculation of two-time of transfer line having a segment of walking before the second time of transfer, and calculation of two-time of transfer line having a segment of walking both before two times of transfer according to the following methods respectively; and 2) the server calculates the required time of the bus taking scheme available in the step 1 according to the starting station andthe terminal station transmitted from the client, and recommends the bus taking scheme with the least time consumption to a client. The bus transfer method based on a bidirectional search and estimation function pruning mode can improve the going-out efficiency of citizens.

Description

technical field [0001] The invention relates to the technical field of bus system transfer, in particular to a bus transfer method based on two-way search and pruning of evaluation functions. Background technique [0002] With the development of urbanization and modernization, public transportation has become a major livelihood issue that every developing city must face. For the increasingly complex bus lines, it is easy for citizens to take the wrong bus and wait for a long time; with a good transfer method, it can reduce the walking distance of citizens, shorten the waiting time, and reduce the time of taking a bus, etc., which greatly brings benefits to the citizens. It is convenient and saves travel time for citizens. The current bus transfer scheme generally uses breadth-first search (BFS) to get a bunch of results, and then uses Dijkstra algorithm to find K short circuits in turn, and then sorts the results; this method is low in efficiency and poor in performance, an...

AI Technical Summary

Problems solved by technology

The current bus transfer scheme generally uses breadth-first search (BFS) to get a bunch of results, and then uses Dijkstra algorithm to find K short circuits in turn, and then sorts the results; this method is low in efficiency and poor in performance, and has not been fully considered The autonomy requirements of the query cannot meet the user's various travel needs; in addition, this situation is limited by the calculation method, there are too many transfer plans, there is a lack of vehicle scheduling operation status, and the vehicle operation status cannot be captured in time, so it cannot be reasonably given A better alternative

Images