Bus arrival sequence discrimination method and system based on virtual path
By using a virtual path-based bus arrival order determination method, the scheduling conflict of multiple bus routes at shared stops is resolved, providing high-precision arrival order prediction, improving passenger experience and resource utilization efficiency, and alleviating platform congestion.
Patent Information
- Application Number
- CN202511290739.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-09-10
- Publication Date
- 2025-12-09
AI Technical Summary
In existing technologies, scheduling conflicts and resource competition among multiple bus routes at shared stops are common problems. Traditional scheduling methods are unable to cope with the fluctuations in arrival times under dynamic traffic conditions, resulting in a decline in passenger travel experience and low resource utilization efficiency, which weakens the attractiveness of public transportation.
A bus arrival order prediction method based on virtual paths is adopted. By screening target vehicles, dividing prediction areas, calculating travel time and projected vehicle positions, a vehicle distribution location scale is established, providing high-precision arrival order prediction.
It enables accurate determination of bus arrival order, reduces passenger waiting time, alleviates platform congestion, and improves waiting comfort and the service level of the public transportation system.
Smart Images
Figure CN121096136A_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of intelligent public transportation technology, and specifically relates to a method and system for determining the order of bus arrivals at stations based on virtual routes. Background Technology
[0002] With the surge in the number of cars, urban transportation is facing unprecedented pressure, and related social and environmental problems are emerging. The excessive number of private cars not only leads to a shortage of road resources but also causes urban transportation infrastructure to operate beyond its capacity. Particularly in first-tier cities and important economic regions, the rapid growth in traffic flow far exceeds the capacity of urban planning, resulting in severe traffic congestion.
[0003] Vigorously developing public transportation is one of the most important ways to solve the problem of "urban traffic congestion". Conventional buses are still the main body of public transportation systems in most Chinese cities. However, there are problems such as scheduling conflicts and resource competition among multiple bus routes at shared stops in urban public transportation systems. Traditional scheduling methods rely on static timetables, which are difficult to cope with the fluctuations in arrival time under dynamic traffic conditions. The inaccuracy of timetables leads to a decline in passenger travel experience, low efficiency of route resource utilization, and rising operating costs, which in turn weakens the attractiveness of public transportation services to urban travel demand and restricts the sustainable development of green transportation systems. Summary of the Invention
[0004] To address the aforementioned technical problems, this invention proposes a method and system for determining the bus arrival order based on virtual paths. This solves the problem of predicting the arrival order of vehicles on multiple routes and provides high-precision time-series prediction support for bus scheduling and passenger services.
[0005] To achieve the above objectives, the present invention adopts the following technical solution: A method for determining the bus arrival order based on virtual routes includes the following steps: Target vehicles are selected based on their location for order determination; The predicted area is divided based on whether the target vehicle's travel path passes through road intersections; If there are no road intersections in the predicted travel route, the total travel time of the bus to the station is calculated based on the distance of the target vehicle from the deceleration zone. If there are road intersections in the travel route, the travel time in the entry zone and the travel time in the stop zone are calculated separately, and the total travel time is determined by using the travel time in the entry zone and the travel time in the stop zone. By projecting target vehicles on different routes onto a virtual path, a vehicle distribution location scale based on total travel time is established, thus obtaining the arrival order of the target vehicles.
[0006] This invention also proposes a bus arrival order discrimination system based on virtual paths, including a filtering module, a partitioning module, a calculation module and a discrimination module; The filtering module is used to filter out target vehicles for order determination based on their location. The segmentation module is used to segment the predicted area based on whether the target vehicle's travel path passes through road intersections; The calculation module is used to calculate the total travel time of the bus to the station based on the length of the target vehicle from the deceleration zone if there are no road intersections in the predicted travel path; if there are road intersections in the travel path, the travel time in the entry zone and the travel time in the stop zone are calculated respectively, and the total travel time is determined by using the travel time in the entry zone and the travel time in the stop zone. The discrimination module is used to project target vehicles on different routes onto a virtual path, establish a vehicle distribution location scale based on the total travel time, and obtain the arrival order of the target vehicles.
[0007] The effects described in the invention are merely those of the embodiments, and not all the effects of the invention. One of the above technical solutions has the following advantages or beneficial effects: This invention proposes a method and system for determining the arrival order of buses based on virtual paths, belonging to the field of intelligent public transportation technology. The method includes the following steps: selecting target vehicles for order determination based on their location; dividing the prediction area based on whether the target vehicle's travel path passes through road intersections; if there are no road intersections in the prediction area's travel path, calculating the total travel time of the bus to the station based on the length of the target vehicle from the deceleration zone; if there are road intersections in the travel path, calculating the travel time in the entry zone and the travel time in the stop zone respectively, and using the travel time in the entry zone and the travel time in the stop zone to determine the total travel time; and establishing a vehicle distribution location scale based on the total travel time by projecting target vehicles from different routes onto the virtual path to obtain a representation of the arrival order of the target vehicles. The method also proposes a system for determining the arrival order of buses based on virtual paths. This invention maps the travel process of all buses within the prediction area to a virtual path, and realizes the projection of each bus onto the virtual path based on the length of its travel time. The order of vehicles in the virtual path can intuitively reflect the arrival order of the vehicles.
[0008] This invention uses electronic bus stop signs and other platform information display devices to publish the estimated arrival time and order of vehicles. This not only provides passengers with reliable and easy-to-understand arrival order information, but also effectively alleviates platform congestion, significantly shortens the average waiting time for passengers, solves problems such as blind, disorderly, and crowded boarding, improves waiting comfort, and thus enhances the overall service level of the public transportation system. Attached Figure Description
[0009] Figure 1 This is a flowchart of a bus entry order determination method based on virtual paths proposed in Embodiment 1 of the present invention; Figure 2 This is a schematic diagram of the predicted area division without road intersections in the path proposed in Embodiment 1 of the present invention; Figure 3 This is a schematic diagram of the stopping area and entry area when the path proposed in Embodiment 1 of the present invention includes road intersections; Figure 4 This is a schematic diagram of the actual distribution of buses proposed in Embodiment 1 of the present invention; Figure 5 This is a schematic diagram of the virtual route projection of the bus proposed in Embodiment 1 of the present invention; Figure 6 This is a schematic diagram of a bus entry order discrimination system based on virtual path proposed in Embodiment 2 of the present invention. Detailed Implementation
[0010] To clearly illustrate the technical features of this solution, the invention will be described in detail below through specific embodiments and in conjunction with the accompanying drawings. The following disclosure provides many different embodiments or examples for implementing different structures of the invention. To simplify the disclosure of the invention, components and arrangements of specific examples are described below. Furthermore, reference numerals and / or letters may be repeated in different examples. This repetition is for simplification and clarity and does not in itself indicate a relationship between the various embodiments and / or arrangements discussed. It should be noted that the components illustrated in the drawings are not necessarily drawn to scale. Descriptions of well-known components, processing techniques, and processes are omitted in this invention to avoid unnecessarily limiting the invention.
[0011] Example 1 Embodiment 1 of this invention proposes a method for determining the bus arrival order based on virtual paths, which solves the problem of difficulty in predicting the arrival order of vehicles on multiple routes in the prior art. Figure 1 This is a flowchart of a bus entry order determination method based on virtual path proposed in Embodiment 1 of the present invention.
[0012] In step S100, target vehicles for order determination are selected based on their location. The vehicle's GNSS data is collected by the deployed vehicle-mounted terminals. The vehicle's GNSS data is collected every... Data is uploaded to the server and stored in the database within seconds. The main data fields include the following: <Route ID, Vehicle ID, Most Recently Visited Station ID, Timestamp, Longitude, Latitude, Speed> When predicting the arrival order of buses, the vehicles located between the upstream station and the target station on the same route are selected as the first screening result based on the latitude and longitude coordinates of the vehicles. Because the distance between stops varies across different bus routes, prematurely including buses with long distances between stops can easily lead to prediction bias. Therefore, after the initial screening of vehicle targets, a distance threshold is used for a secondary screening. Based on the results of the initial screening, the distance from the target stop to its nearest upstream stop is calculated. Starting from the target station, each bus route is divided into... The threshold space is defined, and vehicle targets within the threshold range are extracted as the final research objects. The starting position of the threshold space is represented as a character. .
[0013] In step S200, the prediction area is divided according to whether the target vehicle's travel path passes through a road intersection.
[0014] The public transport network is represented as a directed graph. ;in, It is a set of nodes. It is an edge set; Each node in the diagram represents a road intersection and a bus stop; Each edge in It is a single directed road segment in the road network, with the direction originating from the source node. To the target node The road segment weight is ;so Represented as a triple: .
[0015] This invention identifies the target station based on the order of entry into the bus route. Upstream Station The range between them is defined as the effective range for vehicle order discrimination, and the prediction area is divided.
[0016] For specific bus routes, from upstream stations To the target site The bus route is represented as , path The nodes on the set are represented as: ; in, upstream site and target site The first intersection between upstream site and target site The second intersection between; upstream site and target site Between the first Intersection; Edges are represented as sets: ; in, upstream site and target site The first directed road segment between; upstream site and target site The second directional road segment between; upstream site and target site Between the first Directional road section.
[0017] The process of dividing the prediction area according to whether the target vehicle's travel path passes through a road intersection in this invention includes: If there are no road intersections in the path, the path from the target station to the upstream station is: ,in , ; in, Represents a path without intersections; For path objects; This is the length of the path without intersections; A set of path nodes; Figure 2 This is a schematic diagram of the predicted area division without road intersections in the path proposed in Embodiment 1 of the present invention.
[0018] If the path includes road intersections, the path from the target station to the upstream station is: ;in , ; in, For paths with intersections; by It consists of several continuous road segments; Indicates the first One section of road; Indicates the starting node; Indicates the endpoint node; Indicates the length of a road segment; This represents the set of all nodes along the path.
[0019] Furthermore, It is divided into an entry area and a stop area; the stop area is the path between the bus stop and the upstream intersection of the road segment where the bus stop is located; the entry area is the path location between the upstream bus stop and the upstream intersection of the road segment where the bus stop is located. The docking area is indicated as follows: ,in , ; in, Indicates the route to the stop area. This indicates the only section of road designated as a stop area; For the set of docking area nodes; The entry zone is indicated as follows: ,in , ; in, Indicates the route to the entry area; Indicates entering the zone One section of road; This represents the set of nodes in the entry zone. Figure 3 This is a schematic diagram of the stopping area and the entry area when the path proposed in Embodiment 1 of the present invention includes road intersections.
[0020] Traditional methods for predicting the arrival order of vehicles on multiple routes often suffer from errors due to complex road conditions (such as intersection signals and differences in road segments). This application addresses this issue by refining the prediction area into regions without intersections and regions containing intersections. The region containing intersections is further divided into entry and stopping areas, with differentiated travel time calculation processes designed for each region: In the entry area, where intersections have a significant impact, historical average vehicle speed and average intersection delay are combined to avoid the drawback of relying solely on historical data and ignoring signal control; in the stopping area without intersections, a combination of historical speed statistics and a uniform deceleration motion model is used, ensuring calculation accuracy while simplifying calculations for less complex road segments. This "regional, strategy-based" calculation method significantly reduces prediction errors caused by differences in road conditions. Compared with similar scenarios, the prediction accuracy of the arrival order of vehicles on multiple routes is significantly improved, providing a reliable timing basis for subsequent scheduling and service.
[0021] In step S300, if there are no road intersections in the predicted travel path, the total travel time of the bus to the station is calculated based on the length of the target vehicle from the deceleration zone. If there are road intersections in the travel path, the travel time in the entry zone and the travel time in the stop zone are calculated respectively, and the total travel time is determined by using the travel time in the entry zone and the travel time in the stop zone. This invention proposes methods for calculating travel time depending on whether the route includes intersections. If there are no road intersections in the travel route, the process of calculating the bus arrival time based on the distance of the target bus from the deceleration zone includes: Bus stop For the target vehicle's deceleration zone upon entering the station, calculate the distance to the bus stop based on the latitude and longitude coordinates from the latest GNSS data for buses. Then to and The size is used to determine; if This indicates that the bus has entered the deceleration zone. Assume that within this zone, the bus decelerates uniformly at a constant speed until it comes to a stop. The target vehicle's current speed is... Then the travel time of the target vehicle to the station for: ; if This indicates that the bus did not enter the deceleration zone before entering the station. Based on historical data, the average speed of the target vehicle before entering the deceleration zone was calculated: ; For the first One valid speed record, The total number of valid data; Travel time to the destination of the target vehicle Represented as: .
[0022] If there are road intersections in the driving route, the process of calculating the travel time to the entry area and the travel time to the stop area separately, and then using the travel time to the entry area and the travel time to the stop area to determine the total travel time includes: The road segment where the target vehicle is located in the route is represented as... , Based on the target vehicle's historical data for this road segment, the arithmetic mean of the target vehicle's effective driving speed is calculated. Distance from bus Distance of downstream intersection stop line The time it takes for the target vehicle to pass through this road segment. for: ; Obtained through traffic signal control systems The signal timing scheme for the downstream intersection is used to calculate the average delay time for the target vehicle to pass through the intersection. Specifically: ; in, Indicates the duration of the signal period; Indicates the percentage of time the light is green; , For the effective green light time; This indicates the flow rate ratio, which is the maximum number of vehicles that can pass through per unit time during a green light period; For vehicle arrival rate, The saturation flow rate; Therefore, the time it takes for the target vehicle to pass through this section of road. Represented as ; if The bus is on the road. travel time The calculation is based on the method described above, which adds the intersection delay time to the time it takes to pass through a road segment at the historical average speed.
[0023] If there are multiple intersections along the upcoming bus route, calculate the bus's route segments sequentially. Time at the next intersection .
[0024] Based on the travel time of the target vehicle on each road segment, calculate the destination of the target vehicle. starting point Total travel time for: ; side The length is Historical data shows that the target vehicle's historical average speed on this road section is Calculate the travel time of the target vehicle in the parking area. Specifically: ; calculate Total travel time to the destination vehicle for: .
[0025] This invention optimizes computational complexity while maintaining accuracy through dynamic region division and hierarchical calculation: for simple paths without intersections, historical average vehicle speed and deceleration models are used for rapid calculation, avoiding redundant intersection parameter calls; for complex paths with intersections, signal timing and delay calculations are introduced only in the entry area, while the stop area retains a simplified model. This approach of "refined calculation for complex areas and lightweight processing for simple areas" significantly improves the efficiency of calculating the travel time of a single vehicle, supporting the real-time prediction needs of high-density routes (such as more than 10 vehicles from multiple routes arriving at the same stop every 5 minutes), while adapting to the differentiated scenarios of different urban road networks (such as main roads and branch roads, dense intersection areas and open road sections).
[0026] In step S400, by projecting target vehicles on different routes onto the virtual path, a vehicle distribution location scale based on the total travel time is established to obtain the arrival order of the target vehicles.
[0027] The virtual path is defined as follows: Virtual routes are standardized abstractions of vehicle travel times across all routes, mapped to time segments. To indicate, among which For the shortest time, the corresponding virtual path endpoint , The longest duration corresponds to the starting point of the virtual path. .
[0028] In the virtual route, the current location of the bus is used to determine the destination. The distance between the buses is used to number them sequentially. ,in This indicates the vehicle closest to the finish line; the higher the number, the farther away from the finish line.
[0029] At this point, in the virtual path, each vehicle contains the following three attributes: First, Vehicle ID: Static identifier.
[0030] Second, real-time travel time: vehicle to destination The time required.
[0031] Third, location serial number: vehicle number - This reflects the order in which vehicles approach the finish line. have The bus route passes through the target stop. Starting from the threshold space To the target site The The line is represented as ,in , , using symbols Refers to the circuit Buses in the middle; in, For the first The complete route of the bus line; by It consists of several road sections; Indicates the first The first bus route One section of road; Indicates the starting node of the road segment; Indicates the end point of the road segment; Indicates the length of the road segment; Indicates the first A set of nodes for a bus route; Indicates the first The threshold spatial starting position of each bus route; Indicates the first The first bus route One intersection node; Indicates the target site.
[0032] The buses on the actual roads are projected onto the virtual path. The projection process is as follows: Calculate the following... The travel time of buses on the route will be the first Buses on this route The travel time is expressed as The number in the virtual path is ; Take the maximum value of the historical travel time statistics for all routes.
[0033] Figure 4 This is a schematic diagram of the actual distribution of buses proposed in Embodiment 1 of the present invention; bus routes ( - ) vehicles - They are distributed along different actual paths.
[0034] exist Of the bus routes, the first one... Buses on this route travel time The longest, numbered in the virtual path is , No. Buses on this route travel time The shortest, numbered in the virtual path is ; Figure 5 The vehicle proposed in Embodiment 1 of the present invention - The projection diagram of the virtual path shows that the projection position of each vehicle in the virtual path changes in real time as its travel time increases.
[0035] The projected position of a vehicle on the virtual path can directly reflect the vehicle's progress towards the destination, for buses. travel time The shorter the route, the earlier you arrive at the bus stop; the order of the numbers in the virtual route. - Indicates vehicle - Approaching the finish line The order in which the buses arrive at their destinations is the order in which they arrive at their destinations.
[0036] This order is dynamic and real-time; as the vehicle's travel time decreases, its projected position on the virtual path will move towards the destination. The order may change as the object is moved.
[0037] This invention standardizes the travel time of multiple routes through virtual paths, mapping vehicles on different physical paths to a unified time scale (shortest travel time corresponds to the destination, and longest travel time corresponds to the starting point), making the relative positions and order of vehicles across routes visible. This abstraction not only solves the problem of "difficulty in comparing order due to differences in route length and road conditions," but also dynamically updates the projected positions as vehicles travel (refreshing every 30 seconds), reflecting changes in order in real time. For example, if bus routes 3 and 5 travel on routes of different lengths, traditional methods make direct comparison difficult. However, the virtual path clearly shows "bus route 3 has 8 minutes remaining, and bus route 5 has 6 minutes remaining," thus determining that bus route 5 should enter the station first, achieving accurate global order determination.
[0038] In step S500, all vehicles in the fleet that arrive at the bus stop the fastest are selected for information dissemination. The disseminated information includes the order in which the buses arrive at the bus stop and the travel time of the buses.
[0039] Based on the predicted sorting results, vehicles with arrival time intervals less than or equal to [the specified value] will be considered. Buses arriving within a minute's time are grouped into the same fleet. If the arrival time interval between two adjacent buses exceeds [a certain number of minutes], [they are considered to be in the same fleet]. If the time interval is 1 minute, it is considered the boundary between two independent convoys (the former being the last car in the preceding convoy, and the latter being the first car in the following convoy). Each time information is released, only all vehicles in the convoy that arrives at the bus stop fastest are selected, and the information is released according to the order of vehicles within that convoy.
[0040] The dynamic information publishing method proposed in this invention mainly includes: electronic bus stop signs with text display information, broadcasting equipment with voice broadcasting function, and mobile phone terminals, which publish vehicle queuing information in real time.
[0041] The information released mainly includes: the order in which buses enter the station and the estimated time required for buses to enter the station, that is, the bus travel time calculated by this invention.
[0042] This invention uses electronic bus stop signs and other platform information display devices to publish the estimated arrival time and order of vehicles. This not only provides passengers with reliable and easy-to-understand arrival order information, but also effectively alleviates platform congestion, significantly shortens the average waiting time for passengers, solves problems such as blind, disorderly, and crowded boarding, improves waiting comfort, and thus enhances the overall service level of the public transportation system.
[0043] Example 2 Based on the bus arrival order determination method based on virtual path proposed in Embodiment 1 of this invention, Embodiment 2 of this invention proposes a bus arrival order determination system based on virtual path. Figure 6 This is a schematic diagram of a bus entry order discrimination system based on virtual path proposed in Embodiment 2 of the present invention. The system includes a filtering module, a division module, a calculation module and a discrimination module. The filtering module is used to filter target vehicles for order determination based on their location; The segmentation module is used to segment the predicted area based on whether the target vehicle's travel path passes through road intersections; The calculation module is used to calculate the total travel time of the bus to the station if there are no road intersections in the predicted travel path, based on the length of the target vehicle from the deceleration zone. If there are road intersections in the travel path, the module calculates the travel time in the entry zone and the travel time in the stop zone, and uses the travel time in the entry zone and the travel time in the stop zone to determine the total travel time. The discrimination module is used to project target vehicles on different routes onto a virtual path, establish a vehicle distribution location scale based on the total travel time, and obtain the arrival order of the target vehicles.
[0044] The filtering module process includes: selecting vehicles located between upstream stations and target stations on the same route based on the vehicle's latitude and longitude coordinates as the first filtering result; based on the first filtering result, taking the target station as the starting point, defining a threshold space based on the distance from the target station to its nearest upstream station, and extracting vehicles within this threshold space as target vehicles.
[0045] The process of implementing module division includes: The public transport network is represented as a directed graph. ; in, It is a set of nodes. It is an edge set; Each node in the diagram represents a road intersection and a bus stop; Each edge in It is a single directed road segment in the road network, with the direction originating from the source node. To the target node The road segment weight is ;so Represented as a triple: ; From upstream station To the target site The bus route is represented as , path The nodes on the set are represented as: ; in, upstream site and target site The first intersection between upstream site and target site The second intersection between; upstream site and target site Between the first Intersection; Edges are represented as sets: ; in, upstream site and target site The first directed road segment between; upstream site and target site The second directional road segment between; upstream site and target site Between the first Directional road section.
[0046] The process of dividing the prediction area based on whether the target vehicle's travel path passes through road intersections includes: If there are no road intersections in the path, the path from the target station to the upstream station is: ,in , ; in, Represents a path without intersections; For path objects; This is the length of the path without intersections; A set of path nodes; If the path includes road intersections, the path from the target station to the upstream station is: ;in , ; in, For paths with intersections; by It consists of several continuous road segments; Indicates the first One section of road; Indicates the starting node; Indicates the endpoint node; Indicates the length of a road segment; Represents the set of all nodes along the path; Will It is divided into an entry area and a stop area; the stop area is the path between the bus stop and the upstream intersection of the road segment where the bus stop is located; the entry area is the path location between the upstream bus stop and the upstream intersection of the road segment where the bus stop is located. The docking area is indicated as follows: ,in , ; in, Indicates the route to the stop area. This indicates the only section of road designated as a stop area; For the set of docking area nodes; The entry zone is indicated as follows: ,in , ; in, Indicates the route to the entry area; Indicates entering the zone One section of road; This represents the set of nodes in the entry zone.
[0047] The process of implementing the calculation module includes: If there are no road intersections in the driving route, the process of calculating the bus arrival time based on the distance of the target bus from the deceleration zone includes: Bus stop Assign a deceleration zone for the target vehicle entering the station, and calculate the distance between the target vehicle and the bus stop based on the vehicle's latitude and longitude. Then to and The size is used to determine; if The target vehicle's current speed is Then the travel time of the target vehicle to the station for: ; if Calculate the average speed of the target vehicle before entering the deceleration zone: ; For the first One valid speed record, The total number of valid data; Travel time to the destination of the target vehicle Represented as: .
[0048] If there are road intersections in the driving route, the process of calculating the travel time to the entry area and the travel time to the stop area separately, and then using the travel time to the entry area and the travel time to the stop area to determine the total travel time includes: The road segment where the target vehicle is located in the route is represented as... , Based on the target vehicle's historical data for this road segment, the arithmetic mean of the target vehicle's effective driving speed is calculated. Distance from bus Distance of downstream intersection stop line The time it takes for the target vehicle to pass through this road segment. for: ; Obtained through traffic signal control systems The signal timing scheme for the downstream intersection is used to calculate the average delay time for the target vehicle to pass through the intersection. Specifically: ; in, Indicates the duration of the signal period; Indicates the percentage of time the light is green; , For the effective green light time; This indicates the flow rate ratio, which is the maximum number of vehicles that can pass through per unit time during a green light period; For vehicle arrival rate, The saturation flow rate; Therefore, the time it takes for the target vehicle to pass through this section of road. Represented as ; Based on the travel time of the target vehicle on each road segment, calculate the destination of the target vehicle. starting point Total travel time for: ; side The length is The historical average speed of the target vehicle on this road section is Calculate the travel time of the target vehicle in the parking area. Specifically: ; calculate Total travel time to the destination vehicle for: .
[0049] The process of implementing the discrimination module includes: Virtual paths are used to map the total travel time to time segments, with 0 representing the shortest travel time, corresponding to the virtual path endpoint. ; The longest duration corresponds to the starting point of the virtual path. .
[0050] The process of projecting target vehicles from different routes onto a virtual path to establish a vehicle distribution location scale based on total travel time, and thus obtaining a representation of the arrival order of buses, includes: In the virtual path, the distance from the target vehicle's current location to the destination is considered. The distance is used to number the target vehicles sequentially. ,in Indicates the vehicle closest to the finish line; have The bus route passes through the target stop. Starting from the threshold space To the target site The The line is represented as ,in , , using symbols Refers to the circuit Buses in the middle; in, For the first The complete route of the bus line; by It consists of several road sections; Indicates the first The first bus route One section of road; Indicates the starting node of the road segment; Indicates the end point of the road segment; Indicates the length of the road segment; Indicates the first A set of nodes for a bus route; Indicates the first The threshold spatial starting position of each bus route; Indicates the first The first bus route One intersection node; Indicates the target site; Calculate separately The travel time of buses on the route will be the first Buses on this route The travel time is expressed as The number in the virtual path is ; Take the maximum value from the historical travel time statistics for all routes; exist Of the bus routes, the first one... Buses on this route travel time The longest, numbered in the virtual path is , No. Buses on this route travel time The shortest, numbered in the virtual path is ; the bus travel time The shorter the route, the earlier you arrive at the bus stop; the order of the numbers in the virtual route. - Indicates vehicle - Approaching the finish line The order in which the buses arrive at their destinations is the order in which they arrive at their destinations.
[0051] The system also includes a publishing module; the publishing module is used to select all vehicles in the fleet that arrive at the bus stop the fastest to publish information, including the order in which the buses arrive at the station and the bus travel time.
[0052] The present invention, embodiment 2, proposes a bus arrival order discrimination system based on virtual path, which solves the problem of difficulty in predicting the arrival order of vehicles on multiple routes and provides high-precision time-series prediction support for bus scheduling and passenger services.
[0053] The description of the relevant parts of the bus entry order discrimination system based on virtual path provided in Embodiment 2 of this application can be found in the detailed description of the corresponding parts of the bus entry order discrimination method based on virtual path provided in Embodiment 1 of this application, and will not be repeated here. It should be noted that, in this document, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that the elements inherent in a process, method, article, or apparatus that includes a list of elements are included. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element. Additionally, portions of the technical solutions provided in the embodiments of this application that are consistent with the implementation principles of corresponding technical solutions in the prior art have not been described in detail to avoid excessive elaboration.
[0054] While specific embodiments of the present invention have been described above in conjunction with the accompanying drawings, this is not intended to limit the scope of protection of the present invention. Those skilled in the art can make other modifications or variations based on the above description. It is neither necessary nor possible to exhaustively describe all embodiments here. Various modifications or variations that can be made by those skilled in the art without creative effort based on the technical solutions of the present invention are still within the scope of protection of the present invention.
Claims
1. A method for determining the bus arrival order based on virtual paths, characterized in that, Includes the following steps: Target vehicles are selected based on their location for order determination; The predicted area is divided based on whether the target vehicle's travel path passes through road intersections; If there are no road intersections in the predicted driving path, the total travel time of the bus to the station is calculated based on the length of the target vehicle from the deceleration zone at the station entrance. If there are road intersections in the driving route, calculate the travel time to the entry area and the travel time to the stop area separately, and use the travel time to the entry area and the travel time to the stop area to determine the total travel time; By projecting target vehicles on different routes onto a virtual path, a vehicle distribution location scale based on total travel time is established, thus obtaining the arrival order of the target vehicles.
2. The method for determining the bus arrival order based on virtual paths according to claim 1, characterized in that, The method also includes: selecting all vehicles in the fleet that arrive at the bus stop the fastest and publishing information, including the order in which the buses arrive at the station and the travel time of the buses.
3. The method for determining the bus arrival order based on virtual paths according to claim 1, characterized in that, The process of selecting target vehicles for order determination based on their location includes: Based on the vehicle's latitude and longitude coordinates, vehicles located between the upstream station and the target station on the same route are selected as the first screening result; Based on the results of one screening, starting from the target station, a threshold space is defined based on the distance from the target station to its nearest upstream station, and vehicles within this threshold space are extracted as target vehicles.
4. The method for determining the bus arrival order based on virtual paths according to claim 1, characterized in that, Before dividing the predicted area based on whether the target vehicle's travel path passes through road intersections, the following steps are also included: The public transport network is represented as a directed graph. ; in, It is a set of nodes. It is an edge set; Each node in the diagram represents a road intersection and a bus stop; Each edge in It is a single directed road segment in the road network, with the direction originating from the source node. To the target node The road segment weight is ;so Represented as a triple: ; From upstream station To the target site The bus route is represented as , path The nodes on the set are represented as: ； in, For upstream sites and target site The first intersection between For upstream sites and target site The second intersection between; For upstream sites and target site Between Intersection; Edges are represented as sets: ； in, For upstream sites and target site The first directed road segment between; For upstream sites and target site The second directional road segment between; For upstream sites and target site Between Directional road section.
5. The method for determining the bus arrival order based on virtual paths according to claim 4, characterized in that, The process of dividing the prediction area based on whether the target vehicle's travel path passes through road intersections includes: If there are no road intersections in the path, the path from the target station to the upstream station is: ,in , ; in, Represents a path without intersections; For path objects; This is the length of the path without intersections; A set of path nodes; If the path includes road intersections, the path from the target station to the upstream station is: ;in , ; in, For paths with intersections; by It consists of several continuous road segments; Indicates the first One section of road; Indicates the starting node; Indicates the endpoint node; Indicates the length of a road segment; Represents the set of all nodes along the path; Will It is divided into an entry area and a stop area; the stop area is the path between the bus stop and the upstream intersection of the road segment where the bus stop is located; the entry area is the path location between the upstream bus stop and the upstream intersection of the road segment where the bus stop is located. The docking area is indicated as follows: ,in , ; in, Indicates the route to the stop area. This indicates the only section of road designated as a stop area; For the set of docking area nodes; The entry zone is indicated as: ,in , ; in, Indicates the route to the entry area; Indicates entering the zone One section of road; This represents the set of nodes in the entry zone.
6. The method for determining the bus arrival order based on virtual paths according to claim 5, characterized in that, If there are no road intersections in the driving route, the process of calculating the bus arrival time based on the distance of the target bus from the deceleration zone includes: Bus stop Assign a deceleration zone for the target vehicle entering the station, and calculate the distance between the target vehicle and the bus stop based on the vehicle's latitude and longitude. Then to and The size is used to determine; if The target vehicle's current speed is Then the travel time of the target vehicle to the station for: ； if Calculate the average speed of the target vehicle before entering the deceleration zone: ； For the first One valid speed record, The total number of valid data; Travel time to the destination of the target vehicle Represented as: 。 7. The method for determining the bus arrival order based on virtual paths according to claim 6, characterized in that, If there are road intersections in the driving route, the process of calculating the travel time to the entry area and the travel time to the stop area separately, and then using the travel time to the entry area and the travel time to the stop area to determine the total travel time includes: The road segment where the target vehicle is located in the route is represented as... , Based on the target vehicle's historical data for this road segment, the arithmetic mean of the target vehicle's effective driving speed is calculated. Distance from bus Distance of downstream intersection stop line The time it takes for the target vehicle to pass through this road segment. for: ； Obtained through traffic signal control systems The signal timing scheme for the downstream intersection is used to calculate the average delay time for the target vehicle to pass through the intersection. Specifically: ； in, Indicates the duration of the signal period; Indicates the percentage of time the light is green; , For the effective green light time; This indicates the flow rate ratio, which is the maximum number of vehicles that can pass through per unit time during a green light period; For vehicle arrival rate, The saturation flow rate; Therefore, the time it takes for the target vehicle to pass through this section of road. Represented as ； Based on the travel time of the target vehicle on each road segment, calculate the destination of the target vehicle. starting point Total travel time for: ； side The length is The historical average speed of the target vehicle on this road section is Calculate the travel time of the target vehicle in the parking area. Specifically ； calculate Total travel time to the destination vehicle for: 。 8. The method for determining the bus arrival order based on virtual paths according to claim 1, characterized in that, The virtual path is used to map the total travel time to a timeline segment, with 0 representing the shortest travel time, corresponding to the virtual path endpoint. ; The longest duration corresponds to the starting point of the virtual path. .
9. The method for determining the bus arrival order based on virtual paths according to claim 8, characterized in that, The process of projecting target vehicles from different routes onto a virtual path to establish a vehicle distribution location scale based on total travel time, and thus obtaining a representation of the arrival order of buses, includes: In the virtual path, the distance from the target vehicle's current location to the destination is considered. The distance is used to number the target vehicles sequentially. ,in Indicates the vehicle closest to the finish line; have The bus route passes through the target stop. Starting from the threshold space To the target site The The line is represented as ,in , , using symbols Refers to the circuit Buses in the middle; in, For the first The complete route of the bus line; by It consists of several road sections; Indicates the first The first bus route One section of road; Indicates the starting node of the road segment; Indicates the end point of the road segment; Indicates the length of the road segment; Indicates the first A set of nodes for a bus route; Indicates the first The threshold spatial starting position of each bus route; Indicates the first The first bus route One intersection node; Indicates the target site; Calculate separately The travel time of buses on the route will be the first Buses on this route The travel time is expressed as The number in the virtual path is ; Take the maximum value from the historical travel time statistics for all routes; exist Of the bus routes, the first one... Buses on this route travel time The longest, numbered in the virtual path. , No. Buses on this route travel time The shortest, numbered in the virtual path is ; the bus travel time The shorter the route, the earlier you arrive at the bus stop; the order of the numbers in the virtual route. - Indicates vehicle - Approaching the finish line The order in which the buses arrive at their destinations is the order in which they arrive at their destinations.
10. A bus arrival order determination system based on virtual paths, characterized in that, It includes a filtering module, a partitioning module, a calculation module, and a discrimination module; The filtering module is used to filter out target vehicles for order determination based on their location. The segmentation module is used to segment the predicted area based on whether the target vehicle's travel path passes through road intersections; The calculation module is used to calculate the total travel time of the bus to the station based on the length of the target vehicle from the deceleration zone if there are no road intersections in the predicted travel path. If there are road intersections in the driving route, calculate the travel time to the entry area and the travel time to the stop area separately, and use the travel time to the entry area and the travel time to the stop area to determine the total travel time; The discrimination module is used to project target vehicles on different routes onto a virtual path, establish a vehicle distribution location scale based on the total travel time, and obtain the arrival order of the target vehicles.