A bus passenger trip planning method based on multiple graphs

Abstract

The application discloses a bus passenger trip planning method based on a multiple graph, and steps of the method comprise the following steps: 1. obtaining an original bus network; 2. generating a direct link multiple graph based on the original bus network; 3. constructing a passenger super-path sub-network based on the multiple graph and passenger trip information; 4. recommending an optimal trip path to the passenger according to an optimal strategy distribution principle; and 5. tracking the passenger position in real time and dynamically adjusting the recommended trip path. The application can recommend more abundant trip path schemes from the passenger's perspective, give the passenger more free selection space, dynamically adjust the trip path scheme to a certain extent, adapt to the change of a traffic environment, thereby meeting the path selection under various environments, greatly simplifying the process of searching for a trip path, and improving the path search efficiency.

Description

Technical Field

[0001] This invention relates to the field of passenger travel route planning technology, and mainly to a public transport passenger travel planning method based on multigraphs. Background Technology

[0002] The increasingly mature internet technology and sophisticated equipment have provided broader opportunities for transportation development. Intelligent public transportation systems, as a product of the Internet of Things, utilize technologies such as GPS, wireless communication, and geographic information technology to achieve real-time dispatching and monitoring of buses. This greatly improves the flexibility of public transportation system operations and enhances service levels and quality. Currently, many intelligent public transportation products are available for passengers, such as the "8684 Bus" and "Car Arrives" apps. These apps allow users to check bus arrival times, travel plans, and recommended transfer routes.

[0003] However, the existing software still has the following shortcomings: ① The process of searching the passenger superpath subnetwork is complicated. Different passengers have their own corresponding network search and expansion processes, which takes a long time and increases the server load; ② It does not consider the route optimization when passengers are on the way and cannot adjust the route based on real-time information; ③ It considers too few passenger transfer points and only allows passengers to transfer within three times, which may not necessarily achieve the optimal travel, especially in complex environments. Summary of the Invention

[0004] To address the shortcomings of existing software, this invention proposes a multi-graph-based public transport passenger travel planning method. This method aims to provide passengers with optimal travel strategies based on predicted information, enabling them to choose the best travel option and dynamically adjust their routes in various scenarios. This significantly simplifies the process of searching for travel routes and improves route search efficiency.

[0005] To achieve the above-mentioned objectives, the present invention adopts the following technical solution:

[0006] The present invention provides a public transport passenger travel planning method based on multigraphs, characterized by the following steps:

[0007] Step 1. Obtaining the original bus network:

[0008] Let the set of all bus routes in the original bus network G=(R,A) be defined as L={l1,...,l k ,...,l K}, K represents the total number of bus routes, l k Let R represent the k-th bus route; the set of all bus stops is defined as R = {r1, ..., r2}. i ,...,rI}, where I represents the total number of bus stops, r i Let be the i-th bus stop; the set of all bus segments is defined as A = {a i,j |i,j=1,2,...,I;i≠j},a i,j Represents the i-th bus stop r i and the j-th bus stop r j Adjacent bus routes, and r i For bus route a i,j The starting point, r j For bus route a i,j The end point;

[0009] Define the k-th bus route l k The collection of bus stops passed in sequence is as follows Z k Indicates the k-th bus route l k The total number of bus stops passed through For the kth bus route l k At the z-th bus stop passed, let the k-th bus route be joined at some point T. k The zth bus stop The arrival interval between two adjacent buses is

[0010] Define the k-th bus route l k The bus routes that pass through in sequence are grouped as follows For the kth bus route l k After passing the (z-1)th bus stop and the z-th bus stop Let the (z-1)th adjacent bus segments be the bus routes connected at a certain time T, and let the kth bus route be connected to them. k In bus routes The runtime on is

[0011] Step 2. Based on the original bus network, construct a multigraph G′=(R,A′):

[0012] Define the route as passing through the i-th bus stop r i The bus routes are collected as follows T i Indicates after r i The total number of bus routes, l i,t For the process of r i The t-th bus route; definition l i,t Inner bus stop r i The subsequent bus stops are as follows in, For bus route l i,t Central bus stop r i The nth subsequent stop, where N represents the bus route l i,t Central bus station r i The total number of subsequent bus stops;

[0013] The i-th bus stop r i Starting from, with The direct route to the destination is denoted as Thus we obtain l i,t Inner bus stop r i The set of all direct routes from the starting point This leads to the information obtained after passing through the i-th bus stop r. i Bus route collection L i A collection of direct routes for all bus lines in China. Finally, we obtain the set of direct routes A′={A′1,...,A′} of bus routes passing through I bus stops. i ,...,A′ I}, thus forming a multigraph G′=(R,A′);

[0014] Let the direct route be reached at a certain time T. runtime Indicates the bus route at time T. i,t In the bus section runtime on Indicates the bus route at time T. i,t Passing through the dth bus stop and the (d+1)th bus stop The travel time of the (d+1)th adjacent bus segment;

[0015] Step 3. Obtain the originating station r of any passenger at the current time T. start Target site r end And based on the multigraph G′=(R,A′), the hyperpath subnetwork G″=(R″,A″) of the passenger is obtained:

[0016] In the multigraph G′, u is defined i For the passenger from the i-th bus stop r i Arrive at the target station r end Expected travel time, f i For the bus to reach the i-th stop r i The frequency of arrival;

[0017] Step 3.1. Initialization:

[0018] If the i-th bus stop ri For the target site r end This would allow them to expect a travel time of u. i =0, otherwise, let its expected travel time u i =∞, r i ∈R-{r end}; thereby initializing the passenger's expected travel time to all bus stops;

[0019] Initialize the arrival frequency of the bus to all bus stops to be 0;

[0020] Define the site being queried as r now and initialize r now =r end Define a set S of unqueried direct routes and initialize S = A′. end ;A′ end Indicates passing through the target site r end Let A″ be ​​the set of direct routes selected by the passenger, and initialize it with the set of direct routes of the bus route set. Define the set of bus stops selected by the passenger as R″, and initialize...

[0021] Step 3.2. Obtain the next road segment:

[0022] For the set S of unqueried direct routes, all direct routes are sorted in descending order according to the sum of the expected travel time and the travel time of passengers to their destination. The direct route with the smallest sum of travel time is then selected and denoted as . Right now Among them, u e Indicates the selected direct route. The endpoint r e Expected travel time to the destination station Indicates bus route l at time T w,m On the direct route runtime on Let r represent any direct road segment in set S, with its starting point being r. x The endpoint is r y u y Indicates direct route The endpoint r y To the target site r end Expected travel time Indicates bus route l at time T x,p On the direct route runtime;

[0023] r w Assigned to r now ,Will Assigned to S, where r w The selected direct route with the shortest total travel time. The starting point; A′ w For bus stops r w A collection of direct routes;

[0024] The direct route with the shortest total travel time. The endpoint r e ≠r start Then R″∪{r e Assigning the value to R″ will Assign the value to A″ and proceed to step 3.3; otherwise, proceed to step 3.4.

[0025] Step 3.3. Update the current bus stop r now Passengers' expected travel time and bus arrival frequency:

[0026] If passengers at the current bus stop expect their travel time Then Assign a value to u now , and will Assigned to f now Proceed to step 3.2;

[0027] Step 3.4. Output the hyperpath subnetwork G″=(R″,A″); where A″={A″ start ,...,A″ v ,...,A″ end}, A″ v For the superpath subnetwork, the route passes through the v-th bus stop r″ v The collection of direct routes, A″ start For passing through the starting station r start The collection of direct routes, A″ end For passing through the target site r end A collection of direct routes;

[0028] Step 4. Based on the searched hyperpath subnetwork G″=(R″,A″), solve for the passenger station selection probability and direct route selection probability according to the optimal strategy, and then recommend the travel path set Q according to the station selection probability and direct route selection probability:

[0029] Step 4.1. Initialization:

[0030] Define p v For the vth bus stop r″ v The optimal policy selection probability is calculated, and p is initialized. v =0,r″ v ∈R″-{r start}; Let the starting site rstart The optimal strategy selection probability p start Set to 1, i.e., p start =1;

[0031] definition For the ε-th bus route l ε The vth bus stop in China v Starting from the oth bus stop r″ o Direct route to the destination The optimal policy selection probability is determined, and initialization is performed.

[0032] Let B be the set of unupdated direct routes, and initialize B = {A″} start};

[0033] Step 4.2. Obtain the optimal strategy selection probability for each station and the optimal strategy selection probability for each direct route segment:

[0034] If the set of direct routes has not been updated Then proceed to step 4.3; otherwise, ... Assign to Will Assign a value to p o ; B∪{A″ o Assign the value to B, then jump to step 4.2; where p v For direct routes The starting point r″ v The probability of choosing the optimal strategy;

[0035] Step 4.3. Obtain recommended travel route Q:

[0036] Define q α Let α be the αth travel path, and in, This represents the t1th bus route. The starting point is the bus stop r start The destination is the j1th bus stop. Direct access route; Indicates the t-th h Bus routes The starting point is the j-th h-1 bus stops The endpoint is the j-th h bus stops Direct access route; Indicates the t-th H Bus routes The starting point is the j-th H-1 bus stop The final destination is the bus stop r endIf the route is a direct section, then the travel route q α Selection probability This yields the travel path set Q = {q1,...,q} α ,...,q β}, where β represents the passenger's journey from the originating station r start To the target site r end The total number of travel routes is calculated. The travel routes in the travel route set Q are sorted in descending order according to their selection probability, and the sorted recommended travel route set Q is output.

[0037] Step 5. Obtain the passenger's current location in real time and update the recommended travel route set. Q:

[0038] Step 5.1. Define the passenger transfer station as r new Match the passenger's current location with buses operating in the public transport network, and define the next bus stop for the matched bus as r. next ;

[0039] If the current location is at the ηth bus stop r of the matched bus... η At that point, r will be η Assigned to r new If the bus is not found, proceed to step 5.2; otherwise, find the next bus stop r for the matched bus. next Assigned to r new Proceed to step 5.2;

[0040] Step 5.2. Update the recommended travel route set. Q:

[0041] If r new ∈R″,r new ≠r end Then update the query time T and add the passenger transfer station r. new Assigned to r start Proceed to step 3;

[0042] like Then do not update the travel path set Q;

[0043] If r new ∈R″,r new =r end Then the recommendation will end.

[0044] The present invention provides an electronic device, including a memory and a processor, characterized in that the memory is used to store a program that supports the processor in executing the public transport passenger travel planning method, and the processor is configured to execute the program stored in the memory.

[0045] The present invention discloses a computer-readable storage medium storing a computer program, characterized in that the computer program, when executed by a processor, performs the steps of the public transport passenger travel planning method.

[0046] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0047] 1. This invention presents a hyperpath subnetwork search scheme based on multigraphs, which simplifies the constraints of searching for hyperpath subnetworks and expands the application of hyperpath subnetworks. Especially in complex urban public transport networks, where each passenger's origin and destination are different, finding the relevant hyperpath subnetwork from the vast public transport network is a complex task. The proposed highly aggregated direct route multigraph omits the process of expanding and merging the public transport network, enabling faster and more effective finding of hyperpath subnetworks associated with specific passengers, thereby shortening the path search time and improving the path search efficiency.

[0048] 2. This invention dynamically adjusts travel routes based on the passenger's real-time location, providing the best travel experience. After a passenger selects a specific travel route, the invention automatically identifies the passenger's location based on their real-time location, quickly updates public transportation information based on the current time, recalculates the travel route options for transfer stations along the selected route, adjusts the passenger's currently selected route, and provides the passenger with comprehensive travel route options based on transfer stations as starting points for selection. This ensures that the passenger's travel route is always optimized based on actual road conditions, shortening their travel time.

[0049] 3. This invention recommends travel routes to passengers based on an optimal strategy. Compared to existing travel apps that only consider travel time and the number of transfers as the basis for route recommendations, the optimal strategy-based route recommendation is more flexible, giving passengers more freedom of choice. Especially in situations with heavy urban traffic congestion, existing apps often recommend routes that take a long time, and routes with many transfers are not considered. The optimal strategy solution precisely addresses this problem, providing passengers with more route options in extreme situations, improving the service level of public transportation, and attracting more residents to choose public transportation. Attached Figure Description

[0050] Figure 1 This is a flowchart of a public transport passenger travel planning method based on multigraphs according to the present invention;

[0051] Figure 2 This is a schematic diagram of the original bus network of this invention;

[0052] Figure 3 This is a schematic diagram of multiple views of the direct route section of the present invention. Detailed Implementation

[0053] In this embodiment, a public transport passenger travel planning method based on multigraphs is specifically described as follows: Figure 1 As shown, the procedure is as follows:

[0054] Step 1. Obtaining the original bus network:

[0055] Let the set of all bus routes in the original bus network G=(R,A) be defined as L={l1,...,l k ,...,l K}, K represents the total number of bus routes, l k Let R represent the k-th bus route; the set of all bus stops is defined as R = {r1, ..., r2}. i ,...,r I}, where I represents the total number of bus stops, r i Let be the i-th bus stop; the set of all bus segments is defined as A = {a i,j |i,j=1,2,...,I;i≠j},a i,j Represents the i-th bus stop r i and the j-th bus stop r j Adjacent bus routes, and r i For bus route a i,j The starting point, r j For bus route a i,j The end point;

[0056] Define the k-th bus route l k The collection of bus stops passed in sequence is as follows Z k Indicates the k-th bus route l k The total number of bus stops passed through For the kth bus route l k At the z-th bus stop passed, let the k-th bus route be joined at some point T. k The zth bus stop The arrival interval between two adjacent buses is

[0057] Define the k-th bus route l k The bus routes that pass through in sequence are grouped as follows For the kth bus route l k After passing the (z-1)th bus stop and the z-th bus stop Let the (z-1)th adjacent bus segments be the bus routes connected at a certain time T, and let the kth bus route be connected to them. k In bus routes The runtime on is

[0058] Example diagram of the original bus network as follows Figure 2 As shown in the figure, the route is from its starting point to the bus stop r. 10 The complete route map shows ten bus stops, nine bus segments, and three bus routes, meaning the set of bus stops is R = {r1, r2, r3, r4, r5, r6, r7, r8, r9, r...}. 10 The set of bus routes is A = {a} 1,3 ,a 2,3 ,a 3,4 ,a 4,5 ,a 5,10 ,a 6,7 ,a 7,8 ,a 8,9 ,a 9,10 The set of bus stops is L = {l1, l2, l3}; where each specific bus route has a corresponding set of bus segments. Taking route l1 as an example, the set of bus segments it passes through is...

[0059] Step 2. Based on the original bus network, construct a multigraph G′=(R,A′):

[0060] Define the route as passing through the i-th bus stop r i The bus routes are collected as follows T i Indicates after r i The total number of bus routes, l i,t For the process of r i The t-th bus route; definition l i,t Inner bus stop r i The subsequent bus stops are as follows in, For bus route l i,t Central bus station r i The nth subsequent stop, where N represents the bus route l i,t Central bus station r i The total number of subsequent bus stops;

[0061] The i-th bus stop r i Starting from, with The direct route to the destination is denoted as Thus we obtain l i,t Inner bus stop r iThe set of all direct routes from the starting point This leads to the information obtained after passing through the i-th bus stop r. i Bus route collection L i A collection of direct routes for all bus lines in China. Finally, we obtain the set of direct routes A′={A′1,...,A′} of bus routes passing through I bus stops. i ,...,A′ I This forms a multigraph G′=(R,A′), constructed as follows: Figure 3 As shown, Figure 3 Taking bus route l1 as an example, this demonstrates the process of obtaining a multigraph of direct routes. Starting from the first bus stop r1, there is a set of direct routes. Similarly, the set of direct routes starting from the third bus stop r3 is: The set of direct routes starting from the 4th bus stop r4 is: The set of direct routes starting from the 5th bus stop r5 is

[0062] Let the direct route be reached at a certain time T. runtime Indicates the bus route at time T. i,t In the bus section runtime on Indicates the bus route at time T. i,t Passing through the dth bus stop and the (d+1)th bus stop The travel time of the (d+1)th adjacent bus segment;

[0063] Step 3. Obtain the originating station r of any passenger at the current time T. start Target site r end And based on the multigraph G′=(R,A′), the hyperpath subnetwork G″=(R″,A″) of the passenger is obtained:

[0064] In a multigraph G′, u is defined i For passengers from the i-th bus stop r i Arrive at the target station r end Expected travel time, f i For the bus to reach the i-th stop r i The frequency of arrival;

[0065] Step 3.1. Initialization:

[0066] If the i-th bus stop r i For the target site r endThis would allow them to expect a travel time of u. i =0, otherwise, let its expected travel time u i =∞, r i ∈R-{r end}; thus initializing the passengers' expected travel time to all bus stops;

[0067] Initialize the arrival frequency of the bus to all bus stops to be 0;

[0068] Define the site being queried as r now and initialize r now =r end Define a set S of unqueried direct routes and initialize S = A′. end ;A′ end Indicates passing through the target site r end Let A″ be ​​the set of direct routes selected by passengers, and initialize it with the set of direct routes of the bus route set. Define the set of bus stops selected by passengers as R″, and initialize...

[0069] Step 3.2. Obtain the next road segment:

[0070] For the set S of unqueried direct routes, all direct routes are sorted in descending order according to the sum of the expected travel time and the travel time of passengers to their destination. The direct route with the smallest sum of travel time is then selected and denoted as . Right now Among them, u e Indicates the selected direct route. The endpoint r e Expected travel time to the destination station Indicates bus route l at time T w,m On the direct route runtime on Let r represent any direct road segment in set S, with its starting point being r. x The endpoint is r y u y Indicates direct route The endpoint r y To the target site r end Expected travel time Indicates bus route l at time T x,p On the direct route runtime;

[0071] r w Assigned to r now This updates the current query site r. now ,Will The value is assigned to S, thereby updating the set S of unqueried direct routes, where r w The selected direct route with the shortest total travel time. The starting point; A′ w For bus stops r w A collection of direct routes;

[0072] The direct route with the shortest total travel time. The endpoint r e ≠r start Then R″∪{r e The value is assigned to R″, thereby updating the set of bus stops R″ selected by the passenger. Assign the value to A″ to update the set of direct routes A″ selected by the passenger, and proceed to step 3.3; otherwise, proceed to step 3.4.

[0073] Step 3.3. Update the current bus stop r now Passengers' expected travel time and bus arrival frequency:

[0074] If passengers at the current bus stop expect their travel time Then Assign a value to u now This updates the current bus stop r. now Expected travel time u now , and will Assigned to f now This updates the bus arrival time at the current bus stop, r. now Arrival frequency f now Proceed to step 3.2;

[0075] Step 3.4. Output the hyperpath subnetwork G″=(R″,A″); where A″={A″ start ,...,A″ v ,...,A″ end}, A″ v For the superpath subnetwork, the route passes through the v-th bus stop r″ v The collection of direct routes, A″ start For passing through the starting station r start The collection of direct routes, A″ end For passing through the target site r end A collection of direct routes;

[0076] Step 4. Based on the searched hyperpath subnetwork G″=(R″,A″), solve for the passenger station selection probability and direct route selection probability according to the optimal strategy, and then recommend the travel path set Q according to the station selection probability and direct route selection probability:

[0077] Step 4.1. Initialization:

[0078] Define p v For the vth bus stop r″ v The optimal policy selection probability is calculated, and p is initialized. v =0,r″ v ∈R″-{r start}; Let the starting site r start The optimal strategy selection probability p start Set to 1, i.e., p start =1;

[0079] definition For the ε-th bus route l ε The vth bus stop in China v Starting from the oth bus stop r″ o Direct route to the destination The optimal policy selection probability is determined, and initialization is performed.

[0080] Let B be the set of unupdated direct routes, and initialize B = {A″} start};

[0081] Step 4.2. Obtain the optimal strategy selection probability for each station and the optimal strategy selection probability for each direct route segment:

[0082] If the set of direct routes has not been updated Then proceed to step 4.3; otherwise, ... Assign to This will update the direct routes. Optimal strategy selection probability Will Assign a value to p o This will update the direct routes. The endpoint r″ o The optimal strategy selection probability p o ; B∪{A″ o Assign the value to B to update the unupdated set of direct road segments B, and jump to step 4.2; where p v For direct routes The starting point r″ v The probability of choosing the optimal strategy;

[0083] Step 4.3. Obtain recommended travel route Q:

[0084] Define q α Let α be the αth travel path, and in, This represents the t1th bus route. The starting point is the bus stop r startThe destination is the j1th bus stop. Direct access route; Indicates the t-th h Bus routes The starting point is the j-th h-1 bus stops The endpoint is the j-th h bus stops Direct access route; Indicates the t-th H Bus routes The starting point is the j-th H-1 bus stop The final destination is the bus stop r end If the route is a direct section, then the travel route q α Selection probability This yields the travel path set Q = {q1,...,q} α ,...,q β}, where β represents the passenger's journey from the originating station r start To the target site r end The total number of travel routes is calculated. The travel routes in the travel route set Q are sorted in descending order according to their selection probability, and the sorted recommended travel route set Q is output.

[0085] Step 5. Obtain the passenger's current location in real time and update the recommended travel route set. Q:

[0086] Step 5.1. Define the passenger transfer station as r new Match the passenger's current location with buses operating in the public transport network, and define the next bus stop for the matched bus as r. next ;

[0087] If the current location is at the ηth bus stop r of the matched bus... η At that point, r will be η Assigned to r new If the bus is not found, proceed to step 5.2; otherwise, find the next bus stop r for the matched bus. next Assigned to r new Proceed to step 5.2;

[0088] Step 5.2. Update the recommended travel route set. Q:

[0089] If r new ∈R″,r new ≠r end Then update the query time T and add the passenger transfer station r. new Assigned to r start Proceed to step 3;

[0090] like Then do not update the travel path set Q;

[0091] If r new ∈R″,r new =r end Then the recommendation will end.

[0092] In this embodiment, an electronic device includes a memory and a processor. The memory stores a program that supports the processor in executing the above-described public transport passenger travel planning method, and the processor is configured to execute the program stored in the memory.

[0093] In this embodiment, a computer-readable storage medium stores a computer program, which, when run by a processor, executes the steps of the above-described public transport passenger travel planning method.

Claims

1. A public transport passenger travel planning method based on multigraphs, characterized in that, Includes the following steps: Step 1. Obtaining the original bus network: Let the set of all bus routes in the original bus network G=(R,A) be defined as L={l1,...,l k ,...,l K }, K represents the total number of bus routes, l k Let R represent the k-th bus route; the set of all bus stops is defined as R = {r1, ..., r2}. i ,...,r I }, where I represents the total number of bus stops, r i Let be the i-th bus stop; the set of all bus segments is defined as A = {a i,j |i,j=1,2,...,I;i≠j},a i,j Represents the i-th bus stop r i and the j-th bus stop r j Adjacent bus routes, and r i For bus route a i,j The starting point, r j For bus route a i,j The end point; Define the k-th bus route l k The collection of bus stops passed in sequence is as follows Z k Indicates the k-th bus route l k The total number of bus stops passed through For the kth bus route l k At the z-th bus stop passed, let the k-th bus route be joined at some point T. k The zth bus stop The arrival interval between two adjacent buses is Define the k-th bus route l k The bus routes that pass through in sequence are grouped as follows For the kth bus route l k After passing the (z-1)th bus stop and the z-th bus stop Let the (z-1)th adjacent bus segments be the bus routes connected at a certain time T, and let the kth bus route be connected to them. k In bus routes The runtime on is Step 2. Based on the original bus network, construct a multigraph G′=(R,A′): Define the route as passing through the i-th bus stop r i The bus routes are collected as follows T i Indicates after r i The total number of bus routes, l i,t For the process of r i The t-th bus route; definition l i,t Inner bus stop r i The subsequent bus stops are as follows in, For bus route l i,t Central bus station r i The nth subsequent stop, where N represents the bus route l i,t Central bus station r i The total number of subsequent bus stops; The i-th bus stop r i Starting from, with The direct route to the destination is denoted as Thus we obtain l i,t Inner bus stop r i The set of all direct routes from the starting point This leads to the information obtained after passing through the i-th bus stop r. i Bus route collection L i A collection of direct routes for all bus lines in China. Finally, we obtain the set of direct routes A′={A′1,...,A′} of bus routes passing through I bus stops. i ,...,A′ I }, thus forming a multigraph G′=(R,A′); Let the direct route be reached at a certain time T. runtime Indicates the bus route at time T. i,t In the bus section runtime on Indicates the bus route at time T. i,t Passing through the dth bus stop and the (d+1)th bus stop The travel time of the (d+1)th adjacent bus segment; Step 3. Obtain the originating station r of any passenger at the current time T. start Target site r end And based on the multigraph G′=(R,A′), the hyperpath subnetwork G″=(R″,A″) of the passenger is obtained: In the multigraph G′, u is defined i For the passenger from the i-th bus stop r i Arrive at the target station r end Expected travel time, f i For the bus to reach the i-th stop r i The frequency of arrival; Step 3.

1. Initialization: If the i-th bus stop r i For the target site r end This would allow them to expect a travel time of u. i =0, otherwise, let its expected travel time u i =∞, r i ∈R-{r end }; thereby initializing the passenger's expected travel time to all bus stops; Initialize the arrival frequency of the bus to all bus stops to be 0; Define the site being queried as r now and initialize r now =r end Define a set S of unqueried direct routes and initialize S = A′. end ;A′ end Indicates passing through the target site r end Let A″ be ​​the set of direct routes selected by the passenger, and initialize it with the set of direct routes of the bus route set. Define the set of bus stops selected by the passenger as R″, and initialize... Step 3.

2. Obtain the next road segment: For the set S of unqueried direct routes, all direct routes are sorted in descending order according to the sum of the expected travel time and the travel time of passengers to their destination. The direct route with the smallest sum of travel time is then selected and denoted as . Right now Among them, u e Indicates the selected direct route. The endpoint r e Expected travel time to the destination station Indicates bus route l at time T w,m On the direct route runtime on Let r represent any direct road segment in set S, with its starting point being r. x The endpoint is r y u y Indicates direct route The endpoint r y To the target site r end Expected travel time Indicates bus route l at time T x,p On the direct route runtime; r w Assigned to r now ,Will Assigned to S, where r w The selected direct route with the shortest total travel time. The starting point; A′ w For bus stops r w A collection of direct routes; The direct route with the shortest total travel time. The endpoint r e ≠r start Then R″∪{r e Assigning the value to R″ will Assign the value to A″ and proceed to step 3.3; otherwise, proceed to step 3.

4. Step 3.

3. Update the current bus stop r now Passengers' expected travel time and bus arrival frequency: If passengers at the current bus stop expect their travel time Then Assign a value to u now , and will Assigned to f now Proceed to step 3.2; Step 3.

4. Output the hyperpath subnetwork G″=(R″,A″); where A″={A″ start ,...,A″ v ,...,A″ end }, A″ v For the superpath subnetwork, the route passes through the v-th bus stop r″ v The collection of direct routes, A″ start For passing through the starting station r start The collection of direct routes, A″ end For passing through the target site r end A collection of direct routes; Step 4. Based on the searched hyperpath subnetwork G″=(R″,A″), solve for the passenger station selection probability and direct route selection probability according to the optimal strategy, and then recommend the travel path set Q according to the station selection probability and direct route selection probability: Step 4.

1. Initialization: Define p v For the vth bus stop r″ v The optimal policy selection probability is calculated, and p is initialized. v =0,r″ v ∈R″-{r start }; Let the starting site r start The optimal strategy selection probability p start Set to 1, i.e., p start =1; definition For the ε-th bus route l ε The vth bus stop in China v Starting from the oth bus stop r″ o Direct route to the destination The optimal policy selection probability is determined, and initialization is performed. Let B be the set of unupdated direct routes, and initialize B = {A″} start }; Step 4.

2. Obtain the optimal strategy selection probability for each station and the optimal strategy selection probability for each direct route segment: If the set of direct routes has not been updated Then proceed to step 4.3; otherwise, ... Assign to Will Assign a value to p o ; B∪{A″ o Assign the value to B, then jump to step 4.2; where p v For direct routes The starting point r″ v The probability of choosing the optimal strategy; Step 4.

3. Obtain recommended travel route Q: Define q α Let α be the αth travel path, and in, This represents the t1th bus route. The starting point is the bus stop r start The destination is the j1th bus stop. Direct access route; Indicates the t-th h Bus routes The starting point is the j-th h-1 bus stops The endpoint is the j-th h bus stops Direct access route; Indicates the t-th H Bus routes The starting point is the j-th H-1 bus stop The final destination is the bus stop r end If the route is a direct section, then the travel route q α Selection probability This yields the travel path set Q = {q1,...,q} α ,...,q β }, where β represents the passenger's journey from the originating station r start To the target site r end The total number of travel routes is calculated. The travel routes in the travel route set Q are sorted in descending order according to their selection probability, and the sorted recommended travel route set Q is output. Step 5. Obtain the passenger's current location in real time and update the recommended travel route set. Q: Step 5.

1. Define the passenger transfer station as r new Match the passenger's current location with buses operating in the public transport network, and define the next bus stop for the matched bus as r. next ; If the current location is at the ηth bus stop r of the matched bus... η At that point, r will be η Assigned to r new If the bus is not found, proceed to step 5.2; otherwise, find the next bus stop r for the matched bus. next Assigned to r new Proceed to step 5.2; Step 5.

2. Update the recommended travel route set. Q: If r new ∈R″,r new ≠r end Then update the query time T and add the passenger transfer station r. new Assigned to r start Proceed to step 3; like Then do not update the travel path set Q; If r new ∈R″,r new =r end Then the recommendation will end.

2. An electronic device, comprising a memory and a processor, characterized in that, The memory is used to store a program that supports a processor in executing the method of claim 1, the processor being configured to execute the program stored in the memory.

3. A computer-readable storage medium storing a computer program, characterized in that, The computer program is executed by the processor to perform the steps of the method of claim 1.

Images