A dynamic reliability measurement method for urban road network operation based on random graph

Abstract

This invention discloses a dynamic measurement method for the operational reliability of urban road networks based on random graphs, comprising the following steps: Step 1: Constructing a graph model of the road network based on the connection structure of the urban road traffic network; Step 2: Measuring the operational reliability of road network units at time t based on travel time parameters; Step 3: Searching for the minimum road set of all OD pairs in the road network; Step 4: Calculating the comprehensive importance index of all OD pairs to obtain the set of k-OD pairs affecting the operation of the road network; Step 5: Measuring the operational reliability of OD pairs at time t based on a series-parallel model; Step 6: Calculating the importance influence coefficient of OD pairs to measure the operational reliability of the road network at time t. This invention can measure the operational reliability of urban road traffic networks in real time, helping managers identify congested areas and carry out early warning and prevention work.

Description

Technical Field

[0001] This invention relates to a dynamic measurement method for the operational reliability of urban road networks based on random graphs, belonging to the field of intelligent transportation. Background Technology

[0002] With rapid economic development, urban residents' travel demands are gradually increasing, leading to higher expectations for the high-quality and reliable transportation services provided by road networks. Measuring the reliability of road network operation allows us to understand whether the current network capacity and service level can meet the growing travel needs of residents. This provides a theoretical basis for the operation, management, and optimization of the road network, enabling it to offer more reliable transportation services to travelers.

[0003] Road network operational reliability refers to the ability of a road network to provide effective services to travelers at a certain service level. Measuring it is essentially measuring the probability that the road network can guarantee smooth passage for travelers. To achieve this goal, scholars have conducted extensive research on measurement methods. However, existing methods still have the following problems when measuring in actual road networks: First, traditional methods often measure the reliability of road network operation within a fixed time period, ignoring the random and dynamic evolution of road network operation; second, due to the complexity of actual road networks, traditional methods often use simplified road networks and randomly select OD pairs to represent the entire road network, resulting in significant discrepancies with actual road network operation and easily leading to inaccurate measurement results. Therefore, it is necessary to establish a dynamic and more accurate method for measuring road network operational reliability. Summary of the Invention

[0004] The purpose of this invention is to provide a dynamic measurement method for road network operational reliability based on random graphs. By acquiring static road network structure data and dynamic traffic data, a graph model of the dataset and road network is established. The reliability of road network units is measured based on the data at time t. Then, a model for measuring road network operational reliability is established by calculating the importance coefficient of OD pairs. Finally, the goal of dynamically measuring road network operational reliability is achieved by collecting data at the next time step.

[0005] To achieve the above research objectives, the present invention provides the following technical solution:

[0006] Step 1: Based on the connection structure of the urban road traffic network, construct a graph model of the road network;

[0007] Step 2: Measure the operational reliability of the road network unit at time t based on the travel time parameter;

[0008] Step 3: Search for the minimum set of all OD pairs in the road network;

[0009] Step 4: Calculate the comprehensive importance index of all OD pairs to obtain the set of k-OD pairs that affect the operation of the road network;

[0010] Step 5: Measure the operational reliability of the OD pair at time t based on the series-parallel model;

[0011] Step 6: Calculate the importance influence coefficient of the OD pair to measure the operational reliability of the road network at time t.

[0012] Furthermore, the specific steps of constructing the graph model of the road network in step 1 are as follows: Intersections in the road network are abstracted as nodes, and road segments are abstracted as edges, establishing a graph model of the road network as shown in the following expression:

[0013] G = (V, E)

[0014] In the formula, G represents the network graph of the road network; V represents the set of nodes; and E represents the set of edges.

[0015] Furthermore, the specific process for establishing the operational reliability measurement model of the road network unit at time t based on the travel time parameter in step 2 is as follows:

[0016] Step 2.1: Measure the operational reliability of road segment e at time t, expressed as:

[0017]

[0018] In the formula, R e (t) represents the operational reliability of road segment e at time t; TT 95％，e TT represents 95% of the travel time for all vehicles on road segment e; min，e TT represents the minimum travel time for vehicles on road segment e; max，e Indicates the maximum travel time for vehicles on road segment e; l e Indicates the length of road segment e; s min，e This indicates the minimum speed limit for vehicles on road segment e;

[0019] Step 2.2: Measure the operational reliability of intersection v at time t, expressed as:

[0020]

[0021] In the formula, R v (t) represents the operational reliability of intersection v at time t; R e′ (t) represents the operational reliability of road segment e′ connected to intersection v at time t; q e′ This represents the traffic flow of road segment e′ connected to intersection v at time t.

[0022] Furthermore, in step 3, considering that not every connected path in the road network will be selected by travelers, the search is performed to find the minimum set of paths that satisfy the threshold among all OD pairs in the road network. The specific process is as follows:

[0023] Step 3.1: Input the adjacency matrix A(G) of the road network. The expression for the element in the i-th row and j-th column of the matrix is:

[0024]

[0025] In the formula, (v i v j )∈e represents the intersection v i and v j They are directly connected, l ij Indicates the intersection v i and v j The length of the road segment between them; Indicates the intersection v i and v j They are not directly connected;

[0026] Step 3.2: Traverse all OD pairs in the road network. For any OD pair, calculate the length of all paths between the OD pairs based on Dijkstra's algorithm, and select the paths whose lengths are less than or equal to α·l. min The set of paths is taken as the minimum path set of the OD pair; where α is the path extension coefficient, α∈[1.3, 1.5].

[0027] Furthermore, step 4 involves calculating the comprehensive importance index of OD pairs to determine the set of k-OD pairs that affect the operation of the road network. The specific process is as follows:

[0028] Step 4.1: Calculate the physical property parameters of the OD pair, expressed as:

[0029]

[0030] In the formula, I1 represents the total number of intersections in the OD pair; I2 represents the total number of road segments in the OD pair; I3 represents the average path length of the OD pair; v represents the intersection in the OD pair; e represents the road segment in the OD pair; p represents the path in the OD pair; and h represents the number of paths in the minimum road set of the OD pair.

[0031] Step 4.2: Calculate the topological property index of the OD pair, expressed as:

[0032]

[0033] In the formula, I4 represents the total intersection degree of the OD pair; I5 represents the total intersection centrality of the OD pair; and I6 represents the total intersection betweenness of the OD pair. This indicates the number of road segments in an OD pair that point from intersection v to other intersections; This represents the number of road segments in the OD pair that point to intersection v from other intersections; d(v i v j ) represents the intersection v in the OD pair i to the intersection v j Shortest path distance; n i，j (v a ) represents the intersection v in the OD pair i and v j The shortest path between them via the intersection v a The number of; n i，j Indicates the intersection v in the OD pair i and v j The total number of shortest paths between them;

[0034] Step 4.3: Calculate the dynamic characteristic index of the OD pair, expressed as:

[0035]

[0036] In the formula, I7 represents the total traffic flow of the OD pair; q e (t) represents the traffic flow on road segment e;

[0037] Step 4.4: Calculate the weights of the indicators, expressed as:

[0038]

[0039] In the formula, λ i Indicator I i The weights; I′ i Represents the standardized I i ;cv i Indicator I i coefficient of variation; Indicator I i The mean; σ i Indicator I i The standard deviation of; i = 1, 2, ..., 7;

[0040] Step 4.5: Calculate the overall importance index of OD, the expression is:

[0041] I od =∑(λ i ·I i )

[0042] In the formula, I od Indicates the importance of OD; λ i Indicator I i The weights;

[0043] Step 4.6: Sort all OD pairs in descending order of importance, and select the top k OD pairs to form a set of k-OD pairs.

[0044] Furthermore, the specific process for measuring the operational reliability of the OD pair at time t based on the series-parallel model described in step 5 is as follows:

[0045]

[0046] In the formula, R p (t) represents the operational reliability of road segment p at time t; R od (t) represents the operational reliability of the OD pair at time t; R v (t) represents the operational reliability of intersection v at time t; R e (t) represents the operational reliability of road segment e at time t.

[0047] Furthermore, step 6, which involves calculating the importance influence coefficient of each OD pair in the k-OD pair set to measure the operational reliability of the road network at time t, follows this process:

[0048]

[0049] In the formula, R G (t) represents the operational reliability of road network G at time t; ρ od R represents the importance weight of OD; od (t) represents the operational reliability of OD at time t; I od The importance of an OD pair is indicated by k; k represents the total number of OD pairs in the k-OD pair set.

[0050] Compared to existing technologies, this invention focuses on the impact of the importance of OD pairs on road network operation, as well as the issue of real-time and dynamic measurement of road network operation reliability. This helps managers identify congested areas in the road network and promptly carry out early warning and prevention work, and also helps provide real-time and dynamic traffic guidance information for travel. At the same time, by determining the composition of k-OD pairs affecting the road network through relevant indicators of random graphs, the accuracy of measurement can be improved. Attached Figure Description

[0051] Figure 1 A flowchart of a dynamic measurement method for the operational reliability of urban road networks based on random graphs;

[0052] Figure 2 This is a flowchart of the algorithm for searching the minimum road set among all OD pairs in a road network. Detailed Implementation

[0053] The technical solution of the present invention will be described in detail below through embodiments. These embodiments are implemented based on the technical solution of the present invention and provide a detailed implementation process; however, the scope of protection of the present invention is not limited to the following embodiments.

[0054] In one embodiment, such as Figure 1 As shown, this invention is a dynamic measurement method for the operational reliability of urban road networks based on random graphs, specifically including the following steps:

[0055] Step 1: Based on the connection structure of the urban road network, construct an urban road network diagram model, as detailed below:

[0056] Step 1.1: Select a city's road network and collect basic static data such as road segment number, road segment length, number of lanes per segment, road segment grade, and intersection number.

[0057] Step 1.2: Abstract the intersections in the actual road network as nodes, and the road segments as edges, to establish a graph model of the road network as shown in the following expression:

[0058] G = (V, E)

[0059] In the formula, G represents the network graph of the road network; V represents the set of nodes; and E represents the set of edges.

[0060] Step 2: After determining the road network, establish a simulation model of the road network in the SUMO simulation software. Load traffic flow onto the model, with the traffic flow changes referencing the actual traffic flow changes from off-peak to peak hours. The simulation duration is 10 hours. Divide the road network traffic flow data and travel time data at 15-minute intervals to obtain the dataset used. Based on the dataset, calculate the TT (Travel Time Tolerance) for each road segment. 95％，e TT min，e and TT max，e .

[0061] Step 3: Establish an operational reliability measurement model for the road network unit at time t based on the travel time parameter. The specific process is as follows:

[0062] Step 3.1: Measure the operational reliability of road segment e at time t, expressed as:

[0063]

[0064] In the formula, R e (t) represents the operational reliability of road segment e at time t; TT 95％，e TT represents 95% of the travel time for all vehicles on road segment e; min，e TT represents the minimum travel time for vehicles on road segment e; max，e Indicates the maximum travel time for vehicles on road segment e; l eIndicates the length of road segment e; s min，e This indicates the minimum speed limit for vehicles on road segment e.

[0065] Step 3.2: Measure the operational reliability of intersection v at time t, expressed as:

[0066]

[0067] In the formula, R v (t) represents the operational reliability of intersection v at time t; R e′ (t) represents the operational reliability of road segment e′ connected to intersection v at time t; q e′ This represents the traffic flow of road segment e′ connected to intersection v at time t.

[0068] Step 4: Considering that not every connected path in the road network will be chosen by travelers, search for the smallest set of paths among all OD pairs in the road network that satisfies a threshold, such as... Figure 2 As shown, the specific process is as follows:

[0069] Step 4.1: Input the adjacency matrix A(G) of the road network. The expression for the element in the i-th row and j-th column of the matrix is:

[0070]

[0071] In the formula, (v i v j )∈e represents the intersection v i and v j They are directly connected, l ij Indicates the intersection v i and v j The length of the road segment between them; Indicates the intersection v i and v j They are not directly connected.

[0072] Step 4.2: Traverse all OD pairs in the road network. For any OD pair, calculate the length of all paths between the OD pairs based on Dijkstra's algorithm, and select the paths whose lengths are less than or equal to α·l. min The set of paths is taken as the minimum path set of the OD pair; where α is the path extension coefficient, α∈[1.3, 1.5].

[0073] Step 5: Calculate the comprehensive importance index of all OD pairs to determine the set of k-OD pairs that affect the operation of the road network. The specific process is as follows:

[0074] Step 5.1: Determine the relevant indicators reflecting the importance of OD, as shown in Table 1.

[0075] Table 1 Importance Indicators of OD Pairs

[0076]

[0077] Step 5.2: Calculate the physical property parameters of the OD pair, expressed as:

[0078]

[0079] In the formula, I1 represents the total number of intersections in the OD pair; I2 represents the total number of road segments in the OD pair; I3 represents the average path length of the OD pair; v represents the intersection in the OD pair; e represents the road segment in the OD pair; p represents the path in the OD pair; and h represents the number of paths in the minimum road set of the OD pair.

[0080] Step 5.3: Calculate the topological property index of the OD pair, expressed as:

[0081]

[0082] In the formula, I4 represents the total intersection degree of the OD pair; I5 represents the total intersection centrality of the OD pair; and I6 represents the total intersection betweenness of the OD pair. This indicates the number of road segments in an OD pair that point from intersection v to other intersections; This represents the number of road segments in the OD pair that point to intersection v from other intersections; d(v i v j ) represents the intersection v in the OD pair i to the intersection v j Shortest path distance; n i，j (v a ) represents the intersection v in the OD pair i and v j The shortest path between them via the intersection v a The number of; n i，j Indicates the intersection v in the OD pair i and v j The total number of shortest paths between them.

[0083] Step 5.4: Calculate the dynamic characteristic index of the OD pair, the expression is:

[0084]

[0085] In the formula, I7 represents the total traffic flow of the OD pair; q e (t) represents the traffic flow on road segment e.

[0086] Step 5.5: Calculate the weights of the above indicators, expressed as:

[0087]

[0088] In the formula, λ i Indicator I i The weights; I′ i Represents the standardized I i ;cv i Indicator I i coefficient of variation; Indicator I i The mean; σ i Indicator I i The standard deviation of i; i = 1, 2, ..., 7.

[0089] Step 5.6: Calculate the overall importance index of OD, the expression is:

[0090] I od =∑(λ i ·I i )

[0091] In the formula, I od This indicates the importance of OD.

[0092] Step 5.7: Sort all OD pairs in descending order of importance, and select the top k OD pairs to form a set of k-OD pairs.

[0093] Step 6: Measure the operational reliability of the OD pair at time t based on the series-parallel model. The specific process is as follows:

[0094]

[0095] In the formula, R p (t) represents the operational reliability of road segment p at time t; R od (t) represents the operational reliability of the OD pair at time t; R v (t) represents the operational reliability of intersection v at time t; R e (t) represents the operational reliability of road segment e at time t.

[0096] Step 7: Calculate the importance influence coefficient of each OD pair in the k-OD pair set to measure the operational reliability of the road network at time t. The specific process is as follows:

[0097]

[0098] In the formula, R G (t) represents the operational reliability of road network G at time t; ρ od R represents the importance weight of OD; od (t) represents the operational reliability of OD at time t; I od The importance of an OD pair is indicated by k; k represents the total number of OD pairs in the k-OD pair set.

[0099] After measuring the operational reliability of the road network at time t, traffic data from the next time period can be used to measure the operational reliability of the road network at time t+1, thus achieving the purpose of dynamic measurement.

[0100] This invention focuses on the impact of OD (Original Direction) importance on road network operation, as well as the issue of real-time and dynamic measurement of road network operation reliability. It helps managers identify congested areas of the road network and promptly carry out early warning and prevention work, and also helps to provide real-time and dynamic traffic guidance information for travel.

[0101] In one embodiment, the present invention also discloses a dynamic measurement system for the operational reliability of urban road networks based on random graphs, comprising:

[0102] The road network graph model building module is used to build a graph model of the road network based on the connection structure of the urban road traffic network.

[0103] The operational reliability measurement module of the road network unit is used to measure the operational reliability of the road network unit at time t based on the travel time parameter;

[0104] The minimum path set search module for OD pairs is used to search for the minimum path set of all OD pairs in the road network;

[0105] The k-OD pair set acquisition module is used to obtain the set of k-OD pairs that affect the operation of the road network based on the comprehensive index of the importance of all OD pairs;

[0106] The OD pair operational reliability measurement module is used to measure the operational reliability of the OD pair at time t based on the series-parallel model.

[0107] The road network operation reliability measurement module is used to calculate the importance influence coefficient of OD pairs and measure the operation reliability of the road network at time t.

[0108] The technical solution of the above-mentioned dynamic measurement system for urban road network operation reliability based on random graphs is similar to the aforementioned method, and will not be repeated here.

[0109] Based on the same technical solution, the present invention also discloses a computer-readable storage medium storing one or more programs, wherein the one or more programs include instructions that, when executed by a computing device, cause the computing device to perform the above-described dynamic measurement method for urban road network operation reliability based on random graphs.

[0110] Based on the same technical solution, the present invention also discloses an electronic device, including one or more processors, one or more memories, and one or more programs, wherein the one or more programs are stored in the one or more memories and configured to be executed by the one or more processors, and the one or more programs include instructions for executing the above-described dynamic measurement method for urban road network operation reliability based on random graphs.

[0111] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0112] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0113] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0114] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0115] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in the present invention should be included within the scope of protection of the present invention.

Claims

1. A dynamic method for measuring reliability of urban road network operation based on random graph, characterized in that, The method includes the following steps: Step 1: Based on the connection structure of the urban road traffic network, construct a graph model of the road network; Step 2: Measure based on travel time parameter The operational reliability of the time instant road network element; Step 3: Search for the minimum set of all OD pairs in the road network; Step 4: Calculate the comprehensive importance index of all OD pairs to obtain the set of k-OD pairs that affect the operation of the road network; Step 5: Measure based on series-parallel model Operational reliability of the OD pair at the moment Step 6: Calculate the importance influence coefficient of k-OD pair, measure the running reliability of the road network at the moment The specific steps for constructing the graph model of the road network in step 1 are as follows: Intersections in the road network are abstracted as nodes, and road segments are abstracted as edges, establishing a graph model of the road network as shown in the following expression: ， In the formula, G represents the network graph of the road network; V represents the set of nodes; and E represents the set of edges. Step 4 involves calculating the comprehensive importance index of OD pairs to determine the set of k-OD pairs that affect the operation of the road network. The specific process is as follows: Step 4.1: Calculate the physical property parameters of the OD pair, expressed as: ， In the formula, Indicates the total number of intersections for OD pairs; Indicates the total number of road segments in the OD pair; Indicates the average path length of the OD pair; Indicates the intersection in an OD pair; Indicates the road segment in the OD pair; Indicates the path in an OD pair; This represents the number of paths in the minimum path set of an OD pair; Step 4.2: Calculate the topological property index of the OD pair, expressed as: ， In the formula, Indicates the total intersection degree of the OD pair; Indicates the total intersection centrality of OD pairs; This represents the total intersection betweenness number of the OD pair; Indicates the intersection in the OD pair The number of road segments leading to other intersections; This indicates that other intersections in the OD pair point to the intersection. The number of road segments; Indicates the intersection in the OD pair to the intersection The shortest path distance; Indicates the intersection in the OD pair and The shortest path between them via intersections The number of; Indicates the intersection in the OD pair and The total number of shortest paths between them; Step 4.3: Calculate the dynamic characteristic index of the OD pair, expressed as: ， In the formula, This indicates the total traffic flow of the OD pair; This indicates the traffic flow on road segment e; Step 4.4: Calculate the weights of the indicators, expressed as: ， In the formula, Indicators The weights; Represents the standardized ; Indicators coefficient of variation; Indicators The mean; Indicators Standard deviation; ; Step 4.5: Calculate the overall importance index of OD, the expression is: ， In the formula, Indicates the importance of OD; Indicators The weights; Step 4.6: Sort all OD pairs in descending order of importance, and select the top k OD pairs to form a set of k-OD pairs.

2. The method for dynamically measuring the operational reliability of urban road networks based on random graphs according to claim 1, characterized in that, The specific process for establishing the operational reliability measurement model of the road network unit at time t based on the travel time parameter in step 2 is as follows: Step 2.1: Measure the operational reliability of road segment e at time t, expressed as: ， In the formula, This represents the operational reliability of road segment e at time t; This represents 95% of the travel time for all vehicles on road segment e; This indicates the minimum travel time for vehicles on road segment e; This indicates the maximum travel time for vehicles on road segment e; Indicates the length of road segment e; This indicates the minimum speed limit for vehicles on road segment e; Step 2.2: Measure the intersection at time t The operational reliability is expressed as: ， In the formula, Indicates the intersection at time t Operational reliability; Represents time t and the intersection Connecting road sections Operational reliability; Represents time t and the intersection Connecting road sections Traffic volume.

3. The method for dynamically measuring the operational reliability of urban road networks based on random graphs according to claim 1, characterized in that, Step 3 involves searching for the minimum set of all OD pairs in the road network. The specific process is as follows: Step 3.1: Input the adjacency matrix of the road network The first in the matrix Line number The expression for the column element is: ， In the formula, Indicates an intersection and They are directly connected. Indicates an intersection and The length of the road segment between them; Indicates an intersection and They are not directly connected; Step 3.2: Traverse all OD pairs in the road network. For any OD pair, calculate the length of all paths between that OD pair based on Dijkstra's algorithm, and select the paths whose lengths are less than or equal to... The set of paths is taken as the minimum path set of the OD pair; where, This is the path extension coefficient.

4. The method for dynamically measuring the operational reliability of urban road networks based on random graphs according to claim 1, characterized in that, Step 5, which measures the operational reliability of the OD pair at time t based on the series-parallel model, specifically involves the following process: ， In the formula, This represents the operational reliability of road segment p at time t; This indicates the operational reliability of the OD pair at time t; This represents the operational reliability of intersection v at time t; This represents the operational reliability of road segment e at time t.

5. The method for dynamically measuring the operational reliability of urban road networks based on random graphs according to claim 1, characterized in that, Step 6 involves calculating the importance influence coefficient of each OD pair in the k-OD pair set to measure the operational reliability of the road network at time t. The specific process is as follows: ， In the formula, This represents the operational reliability of road network G at time t; This indicates the importance weight of OD; express OD at any given time affects operational reliability; Indicates the importance of OD pairs; This represents the total number of OD pairs in the k-OD pair set.

6. A dynamic measurement system for the operational reliability of urban road networks based on random graphs, applying the method as described in any one of claims 1 to 5, characterized in that, include: The road network graph model building module is used to build a graph model of the road network based on the connection structure of the urban road traffic network. The operational reliability measurement module of the road network unit is used to measure based on travel time parameters. Operational reliability of the time-based road network unit; The minimum path set search module for OD pairs is used to search for the minimum path set of all OD pairs in the road network; The k-OD pair set acquisition module is used to obtain the set of k-OD pairs that affect the operation of the road network based on the comprehensive index of the importance of all OD pairs; The operational reliability measurement module for OD pairs is used to measure based on a series-parallel model. The operational reliability of the OD pair at any given time; The road network operational reliability measurement module is used to calculate the importance impact coefficient of k-OD pairs and measure... The operational reliability of the time-based road network.

7. A computer-readable storage medium storing one or more programs, said one or more programs comprising instructions, characterized in that, When the instruction is executed by the computing device, it causes the computing device to perform the method as described in any one of claims 1 to 5.

8. An electronic device, characterized in that, It includes one or more processors, one or more memories, and one or more programs, wherein the one or more programs are stored in the one or more memories and configured to be executed by the one or more processors, and the one or more programs include instructions for performing the method as described in any one of claims 1 to 5.

Images