Bus dispatching method and system based on demand-responsive public transportation

Abstract

The embodiment of the present invention discloses a bus dispatching method and system based on demand-responsive public transportation, the method comprising: step 1: collecting passengers' riding demands; step 2: obtaining bus information running near the passengers' departure place in real time; step 3: matching nearby buses, if the match is successful, dispatching the corresponding bus to adjust the driving route to pick up and drop off passengers; if the match fails, obtaining the current idle bus and position, using a preset person-vehicle matching model to match the passengers' riding demands and the distribution of idle buses, dispatching the corresponding bus to the passengers' departure place to pick up and drop off passengers, and notifying the passengers that after the passengers get on the bus, the bus travels to the passengers' destination according to the generated driving path. The present invention analyzes the real-time demand data of passengers and uses the preset person-vehicle matching model to intelligently dispatch and match buses to optimize resource allocation and improve service quality.

Description

Technical Field

[0001] The present invention relates to the field of information transportation, and in particular to a bus dispatching method and system based on demand-responsive public transportation. Background Art

[0002] Traditional public transportation systems often use fixed routes. This fixed mode may cause vehicle congestion during peak hours and empty vehicles during off-peak hours, resulting in a waste of resources and failure to meet the increasingly diverse travel needs of passengers. Therefore, how to improve the flexibility and responsiveness of public transportation services has become an urgent problem to be solved.

[0003] In recent years, demand-responsive public transportation, as an emerging transportation service model, has gradually attracted attention due to its flexibility and personalization. Compared with traditional public transportation, demand-responsive public transportation systems can dynamically adjust services according to the actual needs of passengers and achieve more efficient matching of people and vehicles. This method can not only improve the travel experience of passengers, but also effectively reduce operating costs and improve resource utilization efficiency. However, its operating efficiency and service quality are still constrained by modeling and solution methods.

[0004] Please refer to Figure 1 ,Traditional buses travel along fixed routes from A to B, and upstream vehicles are only allowed to match the demand passengers appearing downstream, e.g. Figure 1 The position of bus ① can only visit downstream stations a and b, while the demand of stations c and d can only be served by the next bus ②.

[0005] This service mode often results in a situation where a passenger arrives at a stop but the bus has just left, and the next bus cannot arrive at the current stop at the time required by the passenger, resulting in a series of problems such as a decrease in the number of service passengers, a high bus vacancy rate, and a waste of resources. In addition, existing algorithms mainly focus on static demand or fixed schedules, and there is little research on dynamic demand response and real-time adjustment capabilities.

[0006] Therefore, proposing an efficient demand-responsive bus scheduling method will help improve the flexibility and responsiveness of bus services. Summary of the invention

[0007] The technical problem to be solved by the embodiments of the present invention is to provide a bus scheduling method and system based on demand-responsive public transportation to optimize resource allocation and improve service quality.

[0008] In order to solve the above technical problems, an embodiment of the present invention proposes a bus scheduling method based on demand-responsive public transportation, comprising:

[0009] Step 1: Collect passengers' ride demands and obtain their departure and destination locations;

[0010] Step 2: Obtain the location, route, and estimated arrival time of buses near the passenger's departure location in real time;

[0011] Step 3: Use the preset person-vehicle matching model to match the nearby buses according to the passengers' travel needs. If the match is successful, dispatch the corresponding bus to adjust the route to pick up the passengers, and notify the passengers. After the passengers get on the bus, the bus continues to operate according to the adjusted route. If the match fails, obtain the current idle bus and position, use the preset person-vehicle matching model to match the passengers' travel needs and the distribution of idle buses, match the corresponding bus and generate the corresponding route, dispatch the corresponding bus to the passenger's departure point to pick up the passengers, and notify the passengers. After the passengers get on the bus, the bus travels to the passenger's destination according to the generated route.

[0012] Accordingly, an embodiment of the present invention further provides a bus dispatching system based on demand-responsive public transportation, comprising:

[0013] Passenger information collection module: collect passengers' riding needs and obtain passengers' departure and destination;

[0014] Public transportation information acquisition module: obtains the location, route, and estimated arrival time of buses near the passenger's departure location in real time, and obtains the current idle buses and their locations;

[0015] Passenger-vehicle matching module: The preset passenger-vehicle matching model is used to match the nearby buses according to the passengers' travel needs. If the match is successful, the corresponding bus is dispatched to adjust the route to pick up the passengers, and the passengers are notified. After the passengers get on the bus, the bus continues to operate according to the adjusted route; if the match fails, the preset passenger-vehicle matching model is used to match the passengers' travel needs and the distribution of idle buses. The corresponding bus is matched and the corresponding travel route is generated. The corresponding bus is dispatched to the passenger's departure point to pick up the passengers, and the passengers are notified. After the passengers get on the bus, the bus travels to the passenger's destination according to the generated travel route.

[0016] The beneficial effects of the present invention are as follows: the present invention combines the demand-responsive bus model of directly matching passengers with running buses and calling idle vehicle services, which can achieve significant improvements in flexibility and efficiency. Compared with the traditional demand-responsive bus model, this combined model has multiple advantages. First, by simultaneously utilizing buses on the way and idle vehicles, the system can respond to passengers' travel needs in real time, significantly reducing passengers' waiting time and improving travel convenience. Secondly, this model maximizes resource utilization, reduces the empty vehicle rate, and thus optimizes overall operational efficiency.

[0017] In addition, this mode of the present invention can not only handle the needs of more passengers during peak hours, but also effectively serve remote areas and ensure the coverage and accessibility of public transportation. The passenger experience is significantly improved, whether waiting at a fixed bus stop or being picked up by idle vehicles scheduled in real time, more travel options are provided. In short, the present invention effectively improves the response speed and flexibility of the public transportation system and meets the increasingly diverse travel needs of modern society. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] Figure 1 It is a schematic diagram of the passenger-vehicle matching mode in the traditional public transportation system.

[0019] Figure 2 is a schematic diagram of the first situation of the second mode of an embodiment of the present invention.

[0020] Figure 3 is a schematic diagram of the second situation of the second mode of the embodiment of the present invention.

[0021] Figure 4 It is a schematic diagram of the third situation of the second mode of an embodiment of the present invention.

[0022] Figure 5 It is a flow chart of a bus dispatching method based on demand-responsive public transportation according to an embodiment of the present invention.

[0023] Figure 6 It is a schematic diagram of the modeling and solving process of the preset human-vehicle matching model in an embodiment of the present invention. DETAILED DESCRIPTION

[0024] It should be noted that, in the absence of conflict, the embodiments in the present application and the features in the embodiments may be combined with each other. The present invention is further described in detail below in conjunction with the drawings and specific embodiments.

[0025] In the embodiments of the present invention, if there are directional indications (such as up, down, left, right, front, back, etc.), they are only used to explain the relative position relationship, movement status, etc. between the components under a certain specific posture (as shown in the accompanying drawings). If the specific posture changes, the directional indication will also change accordingly.

[0026] In addition, in the present invention, the descriptions of "first", "second", etc. are only used for descriptive purposes and cannot be understood as indicating or implying their relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" or "second" may explicitly or implicitly include at least one of the features.

[0027] Please refer to Figure 5 The bus dispatching method based on demand-responsive public transportation in an embodiment of the present invention includes steps 1 to 3.

[0028] Step 1: Collect passengers' ride demands and obtain their departure and destination locations (i.e., the starting and ending points of the passengers).

[0029] Step 2: Obtain in real time the location, route, and estimated arrival time of buses running near the passenger's departure location.

[0030] Step 3: Use the preset person-vehicle matching model to match the nearby buses according to the passengers' travel needs. If the match is successful, dispatch the corresponding bus to adjust the route to pick up the passengers, and notify the passengers. After the passengers get on the bus, the bus continues to operate according to the adjusted route. If the match fails, obtain the current idle bus and position, use the preset person-vehicle matching model to match the passengers' travel needs and the distribution of idle buses, match the corresponding bus and generate the corresponding route, dispatch the corresponding bus to the passenger's departure point to pick up the passengers, and notify the passengers. After the passengers get on the bus, the bus travels to the passenger's destination according to the generated route.

[0031] The present invention analyzes the real-time demand data of passengers and uses a preset passenger-vehicle matching model to intelligently dispatch and match buses to optimize resource allocation and improve service quality. The specific operation mode is as follows: Figure 2 to Figure 4 shown.

[0032] The first mode: Similar to the traditional bus service mode, the upstream vehicles on this line directly serve the downstream passengers.

[0033] The second mode: calling other idle vehicles to serve passengers on this route, which includes idle vehicles in three situations.

[0034] 1. On the route from A to B, when there is no demand for bus ① at stations a and b, and the time constraint of passengers at station c is met, bus ① is called to match passengers at the upstream station c. Please refer to Figure 2 .

[0035] 2. When there is no bus on route A to B that meets the needs of passengers at stop c, you can call buses on other routes that meet the constraints to provide cross-line services. For example, bus ③ on route C to D can be used to serve passengers at stop c. Please refer to Figure 3 .

[0036] 3. When there is no vehicle on the route from A to B that meets the needs of passengers at station c, you can call an idle bus ④ that meets the constraints to serve the passengers at station c. Please refer to Figure 4 .

[0037] For specific implementation, please refer to Figure 6 The modeling and solving method of the preset human-vehicle matching model of the present invention comprises the following steps:

[0038] S1: Define two modes of passengers served by upstream buses on this route + passengers served by other idle buses;

[0039] In the existing demand-responsive bus service model, only the upstream buses on the current route visit and serve the demand stations they own, and submit travel plans to the platform in an appointment-based manner. The platform arranges the best travel plans for drivers and passengers based on the travel information provided.

[0040] Taking into account the convenience of passengers' travel, the detour distance and time of bus drivers, on the basis of the existing mode of direct service of passengers by buses on this route, other idle buses are called to serve passengers, increasing the possibility of serving demand stations, thereby improving the flexibility and response speed of bus services. The following two service modes are defined:

[0041] Mode 1: Buses serving passengers upstream on the current route

[0042] In this mode, when the upstream bus on the running route is in motion, if there are passengers meeting the time constraints downstream, they can be matched according to the real-time passenger demand. Passengers submit travel requests through mobile applications or other systems, and the system automatically analyzes the current bus route, the passenger's starting point and destination.

[0043] Specific process:

[0044] Passenger Request: Passengers submit a ride request through a mobile app or other platform, entering their departure and destination locations.

[0045] Real-time analysis: The system uses algorithms to analyze the location, route, estimated arrival time, and other information of buses currently traveling nearby.

[0046] Matching decision: Based on the matching degree between passenger demand and bus route, the system selects the most suitable bus for service. If the bus route is close to the passenger demand, the bus will adjust the route to pick up the passenger.

[0047] Notify passengers: After a successful match, passengers will receive relevant information, including the boarding location, estimated arrival time, etc.

[0048] Actual ride: Passengers board the bus at the designated location and the bus continues to operate according to the adjusted route.

[0049] Mode 2: Other idle buses serving passengers

[0050] In this mode, when there is no bus that meets the time constraint upstream of the passenger demand station, the system will identify other idle buses except the upstream buses of the line and dispatch them to the passenger's departure location.

[0051] Specific process:

[0052] Passenger Request: Passengers submit a trip request through the app, entering their starting and ending points.

[0053] Idle vehicle identification: The system monitors the status of all operating vehicles in real time and identifies the current idle vehicles and their locations.

[0054] Dispatch decision: The system selects the appropriate idle vehicle for dispatch based on passenger demand and the distribution of idle vehicles. At this time, factors such as distance and estimated arrival time may be taken into consideration.

[0055] Vehicle dispatch: The dispatch system directs idle vehicles to the passenger's designated pick-up location, usually using a navigation system to guide the vehicle on the optimal route.

[0056] Notify passengers: Passengers will be notified when the vehicle arrives and can arrange their trip based on the vehicle's arrival time.

[0057] Actual ride: After the passengers get on the vehicle, the vehicle travels to the destination along the preset route.

[0058] S2: Build a human-vehicle matching model;

[0059] Objective Function

[0060] Maximize the number of passengers served by a demand-responsive bus:

[0061] (1)

[0062] Minimize the number of demand-responsive buses:

[0063] (2)

[0064] Constraints

[0065] (3)

[0066] Formula (3) indicates that each station is visited by at most one vehicle;

[0067] (4)

[0068] Formula (4) means that if the vehicle To be used, you must start from the starting point;

[0069] (5)

[0070] Formula (5) indicates that each vehicle The departure time should be equal to the start time;

[0071] ;

[0072] if , then there must be (6)

[0073] Formula (6) represents the compatibility constraints of path and time;

[0074] (7)

[0075] Formula (7) represents the vehicle Leave the site Time window constraints;

[0076] (8)

[0077] Formula (8) represents the site About the vehicle Flow balance constraints;

[0078] (9)

[0079] Formula (9) means that if the vehicle If it is used, it must return to the end point;

[0080] (10)

[0081] Formula (10) represents the vehicle A travel path will only be generated when it is used;

[0082] (11)

[0083] Formula (11) is the 0-1 constraint of the decision variable.

[0084] The description of each symbol is shown in Table 1.

[0085] The decision variables are shown in Table 2.

[0086]

[0087] S3: Design an algorithm to solve the passenger-vehicle matching problem of demand-responsive public transportation;

[0088] Design a passenger-vehicle matching algorithm to solve this problem. The first mode: match passengers with running buses. The second mode: match passengers with idle buses.

[0089] For any public transport and any site Number of passengers , when the two are matched, the vehicle The startup time is recorded as , each site The service time is recorded as , leave the site The time is recorded as , the vehicle moves from the forward node To the backward node The travel time is recorded as , site The maximum waiting time of passengers is recorded as .

[0090] The detailed process of the algorithm is as follows:

[0091] Step 1: Initialization. Including the bus status, and setting the virtual end point (0, 0) and the bus starting point and Site The impedance matrix is ​​composed of the link matrix, the passenger demand information of each station, the travel time between each node, and the maximum and minimum response time limits of the bus. The impedance matrix is ​​reflected by the travel time to ensure that the vehicle travels from the node To Node The travel time complies with the set limits.

[0092] Step 2: Main loop. In step 3, the two service modes are matched with each other.

[0093] For mode 1, traverse all possible buses in operation and obtain the bus route corresponding to the bus driven by the driver; traverse the set of passengers to be matched, and calculate the possible departure and arrival times of the passengers according to the route schedule adopted by the driver, as well as the estimated time for the bus to arrive at the passenger's starting point, and confirm whether this time is within the acceptable range of the passenger's departure time and expected arrival time. If all the above conditions are met, return the valid orders and unserved passengers.

[0094] For mode 2, traverse all idle buses and their service time periods and route information, traverse the passengers in need to try to match them with each idle bus, obtain the passenger's starting point and destination, as well as the expected departure time and arrival time. Compare the passenger's expected departure time with the idle time of the bus. If the idle time of the bus is before the passenger's expected departure time, and the bus can arrive at the destination before the passenger's expected arrival time, certain matching conditions are met. If all the above conditions are met, return the order and route after the idle bus matches the passenger.

[0095] Finally, all orders for running and idle buses are returned, and the algorithm ends.

[0096] The specific matching solution process of Mode 1 is shown in Table 3.

[0097]

[0098] The specific matching solution process of Mode 2 is shown in Table 4.

[0099] S4: optimal solution;

[0100] Use Python to call Or-tools to solve the above problem and find the optimal decision variables.

[0101] The bus dispatching system based on demand-responsive public transportation of the present invention comprises a passenger information collection module, a public transportation information acquisition module and a passenger-vehicle matching module.

[0102] Passenger information collection module: collect passengers' travel needs and obtain passengers' departure and destination.

[0103] Public transportation information acquisition module: obtains the location, route, and estimated arrival time of buses running near the passenger's departure point in real time, and obtains the current idle buses and their locations.

[0104] Passenger-vehicle matching module: The preset passenger-vehicle matching model is used to match the nearby buses according to the passengers' travel needs. If the match is successful, the corresponding bus is dispatched to adjust the route to pick up the passengers, and the passengers are notified. After the passengers get on the bus, the bus continues to operate according to the adjusted route; if the match fails, the preset passenger-vehicle matching model is used to match the passengers' travel needs and the distribution of idle buses. The corresponding bus is matched and the corresponding travel route is generated. The corresponding bus is dispatched to the passenger's departure point to pick up the passengers, and the passengers are notified. After the passengers get on the bus, the bus travels to the passenger's destination according to the generated travel route.

[0105] As an implementation method, the passenger-vehicle matching module matches the passenger with the running bus according to the following steps:

[0106] Traverse all nearby buses in operation and obtain the bus route corresponding to the bus driven by the driver; traverse the set of passengers to be matched, and calculate the passenger's expected departure time and arrival time, as well as the time when the bus is expected to arrive at the passenger's departure location based on the route schedule used by the driver, and confirm whether this time is within the acceptable range of the passenger's departure time and expected arrival time. If so, the match is successful.

[0107] The passenger-vehicle matching module matches passengers with idle buses according to the following steps:

[0108] Traverse all idle buses and their service time periods and route information, traverse the passengers in need to try to match them with each idle bus, obtain the passenger's departure location and destination as well as the expected departure time and arrival time; compare the passenger's expected departure time with the bus's idle time. If the bus's idle time is before the passenger's expected departure time and the bus can arrive at the destination before the passenger's expected arrival time, the match is completed, the corresponding bus is obtained, and the corresponding travel path is generated.

[0109] The present invention aims at the current problem of matching passengers with demand-responsive buses, and combines the demand-responsive bus mode of serving passengers with the upstream bus on this line and calling other idle buses to serve passengers, which can effectively improve flexibility and efficiency, thereby meeting the need to use the minimum number of buses to maximize the number of passengers served, fully dispatching buses on the road network, improving the matching degree of passengers with vehicles and reducing overall operating costs.

[0110] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A bus dispatching method based on demand-responsive public transportation, characterized in that: include: Step 1: Collect passengers' ride demands and obtain their departure and destination locations; Step 2: Obtain the location, route, and estimated arrival time of buses near the passenger's departure location in real time; Step 3: Use the preset passenger-vehicle matching model to match the nearby buses according to the passengers' riding needs. If the match is successful, dispatch the corresponding bus to adjust the route to pick up the passengers and notify the passengers. After the passengers get on the bus, the bus continues to operate according to the adjusted route; If the matching fails, the current idle bus and its location are obtained, and the preset person-vehicle matching model is used to match the passenger's riding demand and the distribution of idle buses. The corresponding bus is matched and the corresponding driving path is generated. The corresponding bus is dispatched to the passenger's departure location to pick up the passenger and notify the passenger. After the passenger gets on the bus, the bus travels to the passenger's destination according to the generated driving path; The objective function of the preset human-vehicle matching model includes: Maximize the number of passengers served by a demand-responsive bus: （1） Minimize the number of demand-responsive buses: （2） The constraints of the preset human-vehicle matching model include: （3） Formula (3) indicates that each station is visited by at most one vehicle; （4） Formula (4) means that if the vehicle To be used, you must start from the starting point; （5） Formula (5) indicates that each vehicle The departure time should be equal to the start time; （6） if , then there must be Formula (6) represents the compatibility constraints of path and time; （7） Formula (7) represents the vehicle Leave the site Time window constraints; （8） Formula (8) represents the site About the vehicle Flow balance constraints; （9） Formula (9) means that if the vehicle If it is used, it must return to the end point; （10） Formula (10) represents the vehicle A travel path will only be generated when it is used; （11） Formula (11) is the 0-1 constraint of the decision variable; in, represents the service mode set, V represents the bus set, O represents the bus starting point set, S represents the bus station set, d represents the bus virtual terminal, and the node set , P i Representation Node The forward node set, U i Representation Node The backward node set, A represents the edge set, t ij Representation Node To Node Time, t i Indicates the site The maximum waiting time for passengers, Indicates public transport The starting point, Indicates public transport The start time, Indicates public transport Leave the node Time, n i Indicates the site The number of passengers, Service time for the site; Decision variables Represented as: 0-1 variable, representing public transport vehicles Whether to use the slave node Go to Node If the bus Slave Node Go to Node ,but ,otherwise ; Decision variables Represented as: 0-1 variable, representing public transport vehicles Whether it is used; if the bus is used, then ,otherwise .

2. The bus dispatching method based on demand-responsive public transportation according to claim 1, characterized in that: In step 3, passengers are matched with running buses according to the following steps: Traverse all nearby buses in operation and obtain the bus route corresponding to the bus driven by the driver; traverse the set of passengers to be matched, and calculate the passenger's expected departure time and arrival time, as well as the time when the bus is expected to arrive at the passenger's departure location based on the route schedule used by the driver, and confirm whether this time is within the acceptable range of the passenger's departure time and expected arrival time. If so, the match is successful.

3. The bus dispatching method based on demand-responsive public transportation according to claim 1, characterized in that: In step 3, passengers are matched with free buses according to the following steps: Traverse all idle buses and their service time periods and route information, traverse the passengers in need to try to match them with each idle bus, obtain the passenger's departure location and destination as well as the expected departure time and arrival time; compare the passenger's expected departure time with the bus's idle time. If the bus's idle time is before the passenger's expected departure time and the bus can arrive at the destination before the passenger's expected arrival time, the match is completed, the corresponding bus is obtained, and the corresponding travel path is generated.

4. A bus dispatching system based on demand-responsive public transportation, characterized in that: include: Passenger information collection module: collect passengers' riding needs and obtain passengers' departure and destination; Public transportation information acquisition module: obtains the location, route, and estimated arrival time of buses near the passenger's departure location in real time, and obtains the current idle buses and their locations; The passenger-vehicle matching module uses the preset passenger-vehicle matching model to match the nearby buses according to the passengers' riding needs. If the match is successful, the corresponding bus is dispatched to adjust the route to pick up the passengers and notify the passengers. After the passengers get on the bus, the bus continues to operate according to the adjusted route. If the matching fails, the preset person-vehicle matching model is used to match the passenger's riding demand and the distribution of idle buses, the corresponding bus is matched and the corresponding driving route is generated, the corresponding bus is dispatched to the passenger's departure location to pick up the passenger, and the passenger is notified. After the passenger gets on the bus, the bus travels to the passenger's destination according to the generated driving route; The objective function of the preset human-vehicle matching model includes: Maximize the number of passengers served by a demand-responsive bus: （1） Minimize the number of demand-responsive buses: （2） The constraints of the preset human-vehicle matching model include: （3） Formula (3) indicates that each station is visited by at most one vehicle; （4） Formula (4) means that if the vehicle To be used, you must start from the starting point; （5） Formula (5) indicates that each vehicle The departure time should be equal to the start time; （6） if , then there must be Formula (6) represents the compatibility constraints of path and time; （7） Formula (7) represents the vehicle Leave the site Time window constraints; （8） Formula (8) represents the site About the vehicle Flow balance constraints; （9） Formula (9) means that if the vehicle If it is used, it must return to the end point; （10） Formula (10) represents the vehicle A travel path will only be generated when it is used; （11） Formula (11) is the 0-1 constraint of the decision variable; in, represents the service mode set, V represents the bus set, O represents the bus starting point set, S represents the bus station set, d represents the bus virtual terminal, and the node set , P i Representation Node The forward node set, U i Representation Node The backward node set, A represents the edge set, t ij Representation Node To Node Time, t i Indicates the site The maximum waiting time for passengers, Indicates public transport The starting point, Indicates public transport The start time, Indicates public transport Leave the node Time, n i Indicates the site The number of passengers, Service time for the site; Decision variables Represented as: 0-1 variable, representing public transport vehicles Whether to use the slave node Go to Node If the bus Slave Node Go to Node ,but ,otherwise ; Decision variables Represented as: 0-1 variable, representing public transport vehicles Whether it is used; if the bus is used, then ,otherwise .

5. The bus dispatching system based on demand-responsive public transportation as claimed in claim 4, characterized in that: The passenger-vehicle matching module matches passengers with running buses according to the following steps: Traverse all nearby buses in operation and obtain the bus route corresponding to the bus driven by the driver; traverse the set of passengers to be matched, and calculate the passenger's expected departure time and arrival time, as well as the time when the bus is expected to arrive at the passenger's departure location based on the route schedule used by the driver, and confirm whether this time is within the acceptable range of the passenger's departure time and expected arrival time. If so, the match is successful.

6. The bus dispatching system based on demand-responsive public transportation as claimed in claim 4, characterized in that: The passenger-vehicle matching module matches passengers with idle buses according to the following steps: Traverse all idle buses and their service time periods and route information, traverse the passengers in need to try to match them with each idle bus, obtain the passenger's departure location and destination as well as the expected departure time and arrival time; compare the passenger's expected departure time with the bus's idle time. If the bus's idle time is before the passenger's expected departure time and the bus can arrive at the destination before the passenger's expected arrival time, the match is completed, the corresponding bus is obtained, and the corresponding travel path is generated.

Images