Multimodal transport network cascade failure model construction method based on hypergraph
By building a multi-layer hypernetwork, the cascade failure in the multimodal transport network is solved, and the problem of difficult to predict cascade failure in the existing technology is achieved, more accurate analysis and management is achieved, and transportation efficiency and robustness are improved.
Patent Information
- Application Number
- CN202411019023.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-29
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2044-07-29
AI Technical Summary
The existing multimodal transport network model is difficult to effectively analyze and solve the problem of cascade failure. The traditional simple graph model cannot accurately represent complex multivariate relationships and interdependence, resulting in difficult prediction and management of cascade failure propagation.
Using a multimodal transport network cascade failure model based on hypergraphs, by building a multi-layer hypernetwork, simulating the cascade effect caused by site failure, calculating node capacity and load, performing single-layer and multi-layer load redistribution, and updating the adjacency matrix. Express the relationship between complex sites and modes of transportation.
It realizes a more accurate analysis and prediction of cascade failure propagation process, improves transportation efficiency and network management flexibility, and helps design a more robust multimodal transport network that is in line with practical application conditions.
Smart Images

Figure CN118966337A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of complex transportation networks, and more specifically to a method for constructing a multimodal transport network cascading failure model based on a hypergraph. Background Art
[0002] With the development of science and technology, the study of complex systems has increasingly focused on multi-dimensional and multi-level network structures. Traditional network models usually only consider simple graphs, in which nodes can only be connected by edges. However, this simple graph model will show great limitations when faced with some more complex network systems. Hypergraphs can better represent multivariate relationships and are one of the ways to solve this limitation. Hypergraph theory is an emerging research method that has been widely used to analyze and model various complex systems, such as social networks, information networks, and transportation networks.
[0003] Intermodal transport is an important concept in modern transportation systems. It refers to the transportation of goods or passengers through multiple modes of transportation (such as roads, railways, waterways, and aviation) to improve transportation efficiency, reduce costs, and reduce environmental impact, providing strong support for the economic and social development of cities. However, despite the many conveniences brought by the intermodal transport network, its complexity and fragility are also becoming increasingly apparent. In reality, the failure of a site in the intermodal transport network may have a chain reaction on the entire network, leading to the occurrence of cascading failures. For example, when a city is hit by heavy rain, freight, water transport, and aviation will be affected. At this time, the transportation of goods stops entering the city, and the affected goods are transported to other accessible cities instead. However, the warehouses in a city have capacity, which leads to the need for excess goods to continue to be transported to other cities, resulting in the spread of cascading failures in the intermodal transport network. Summary of the invention
[0004] In order to overcome the shortcomings of the prior art, the present invention proposes a multimodal transport network cascading failure model based on a hypergraph, hoping to abstract the multimodal transport network into a multi-layer hypernetwork based on hypergraph theory, which can more deeply analyze and solve the problem of cascading failure of multimodal transport networks in reality, thereby helping to improve transportation efficiency and the flexibility of network management.
[0005] The present invention adopts the following technical solutions to solve the above technical problems:
[0006] The method for constructing a multimodal transport network cascading failure model based on a hypergraph of the present invention is characterized in that it comprises the following steps:
[0007] Step 1. Construct a multimodal transport super network H = {H 1 , H 2 , H 3}, where H 1 represents the first-level railway supernetwork, H 2 represents the second-layer air transport super network, H 3 represents the third-layer water transport super network; let the site set of the target area be denoted as V = {v1,v2,...,v j ,...,v n}, where v j represents the jth site, and n represents the total number of sites;
[0008] Step 2. Calculate the capacity and load of the hypergraph network nodes at different layers in the target area;
[0009] Step 3: Simulate the cascading effect caused by site failure in a hypergraph-based multimodal transport network;
[0010] Step 3.1. Construct the adjacency matrix A of the i-th layer hypernetwork at time t+1 i , if there is a jth site v in the i-th layer supernetwork j , then let A i The element at row j and column j in Otherwise, let
[0011] Step 3.2. Initialize j to any number between 1 and n;
[0012] Step 3.3. Initialize and define the failure site as the xth node v in the super network x ;
[0013] Step 3.4. Initialize i=1;
[0014] Step 3.5. If A i The element at row x and column x in This means that there is an x-th node v in the i-th layer hypernetwork. x , and execute step 3.6; otherwise, after assigning i+1 to i, if i>3, output the multimodal transport super network at time t and end the process; otherwise, return to execute step 3.5;
[0015] Step 3.6. For the xth node v x The i-th layer super network performs single-layer failure load redistribution;
[0016] Step 3.7. Traverse the remaining capacity of each station in all layer super networks at time t+1. If there is a remaining capacity ≤ 0, it means that there is a failed station in the corresponding layer super network, and execute step 3.8. If there is no remaining capacity ≤ 0, output the multimodal transport super network at time t and end the process;
[0017] Step 3.8. Store the layer number, site number, and remaining capacity of all failed sites in the order of site number into the single-layer failed site set V sin And update the adjacency matrix of the corresponding layer hypernetwork;
[0018] Step 3.9. Traverse the single-layer failure site set V sin For each failed site in:
[0019] Determine the xth failed site v in the i-th layer super network at time t+1 x Residual capacity of sites in different layers of hypernetwork Are both ≤0? If yes, then perform the single-layer super network site load redistribution in step 3.6; otherwise, perform the multi-layer super network site load redistribution;
[0020] Step 3.10. For the single-layer failure site set V sin After traversing each failed site in , assign t+1 to t and jump to step 3.7 to execute sequentially.
[0021] The method for constructing a multimodal transport network cascading failure model based on a hypergraph according to the present invention is also characterized in that step 2 comprises the following steps:
[0022] Step 2.1. Define the current time as t, and initialize t = 0;
[0023] Step 2.2. Obtain the load of each station in each layer of the multimodal transport hypernetwork at time t based on the traffic data of the target area in, Indicates that there is a j-th site v in the i-th layer supernetwork j The load at time t; if there is no j-th site v in the i-th layer super network j , then let
[0024] Step 2.2. Based on the maximum capacity data of the target area, obtain the maximum capacity of each station in each layer of the multimodal transport hypernetwork in, represents the jth site v in the i-th layer supernetwork j The maximum capacity of; if there is no j-th site v in the i-th layer super network j , then let
[0025] Step 2.3. Use equation (1) to calculate the jth site v in the i-th layer supernetwork j Remaining capacity at time t+1
[0026]
[0027] Step 2.4. Use formula (2) to calculate the jth site v in the i-th layer super network j The load at time t+1
[0028]
[0029] In formula (2), is assigned to the jth site v in the i-th layer supernetwork j of load.
[0030] The step 3.6 comprises the following steps:
[0031] Step 3.6.1. Let i = 1;
[0032] Step 3.6.2. Hyperedge set E in the hypernetwork at level i i Find the xth node v in x The included hyperedge set And by the hyperedge set All the different non-failed nodes contained in each hyperedge in constitute the xth node v of the i-th layer hypernetwork x Neighboring site set Neighboring Site Collection The sites in the are used as load redistribution sites;
[0033] Step 3.6.3. Calculate the adjacent node set using formula (3) The pth load redistribution site v p The load added at time t+1
[0034]
[0035] In formula (3), represents the pth load redistribution site v in the i-th layer supernetwork p The remaining capacity at time t; represents the xth site v in the i-th layer supernetwork x The load at time t;
[0036] Step 3.6.4. Add the xth node v in the i-th layer hypernetwork x The load at time t Assign to neighboring node set Therefore, the pth load redistribution site v is calculated using formula (4): p The total load after being distributed to the load at time t+1
[0037]
[0038] Step 3.6.5. Calculate the pth load redistribution site v using equation (2) p The remaining capacity after being allocated to the load at time t+1
[0039] Step 3.6.6. Assign i+1 to i. If i>3, execute step 3.7. Otherwise, return to execute step 3.6.2.
[0040] The multi-layer super network site load redistribution in step 3.9 includes the following steps:
[0041] Step a. The hyperedge set E in the hypernetwork at the i-th level i Find the xth failed site v in x The included hyperedge set And by the hyperedge set All the different non-failed nodes contained in each hyperedge in constitute the x-th failed site v of the i-th layer hypernetwork x The set of adjacent nodes and adjacent site sets The sites in the are used as load redistribution sites;
[0042] Step b. Determine the x-th failed site v in the two layers of supernetworks except the i-th layer supernetwork at time t+1 x Residual capacity of sites in different layers of hypernetwork Is it greater than 0? If so, the remaining capacity The xth failed site v in the other layer super network greater than 0 x The xth failed site v that joins the i-th layer supernetwork x The set of related nodes and the relevant node set The sites in the list are used as load redistribution sites, otherwise, they are not included;
[0043] Step c. Calculate the adjacent node set using formula (5) The pth site v in the i-th layer supernetwork p and related node sets The xth failed site v in the sth layer supernetwork x The load assigned at time t+1
[0044]
[0045] In formula (5), S represents the layer number of the super network in the load redistribution site, P represents the sequence number of the load redistribution site, represents the Pth load redistribution site v assigned to the Sth layer super networkP Load; Represents the set of adjacent nodes The pth site v in the i-th layer supernetwork p The remaining capacity at time t; Represents a set of related nodes The xth load redistribution site v in the sth layer super network x The remaining capacity at time t;
[0046] Step d. Replace the x-th failed site v in the i-th layer super network x The load at time t+1 is distributed to the set of adjacent nodes and related node sets Then, using formula (6), we can get the Pth load redistribution site v in the Sth layer super network: P The total load after being distributed to the load at time t+1
[0047]
[0048] Step e. Calculate the Pth load redistribution site v in the Sth layer super network using formula (2): P The remaining capacity after being allocated to the load at time t+1
[0049] An electronic device of the present invention includes a memory and a processor, wherein the memory is used to store a program that supports the processor to execute the construction method, and the processor is configured to execute the program stored in the memory.
[0050] The present invention provides a computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and the computer program executes the steps of constructing the method when executed by a processor.
[0051] Compared with the prior art, the beneficial effects of the present invention are as follows:
[0052] 1. The present invention uses hypergraph theory and takes advantage of the fact that hypergraphs can not only represent the complex relationships between multiple nodes but also effectively represent the hyperedge relationships between multiple nodes to construct a multimodal transport network, making the model more in line with the complex connections between multimodal transport network sites, transport routes, and transport modes in reality.
[0053] 2. The present invention combines hypergraph theory to more accurately express the complex interactions and interdependencies between different modes of transport, transport routes, and stations in a real multimodal transport system. The propagation of cascading failures will start from the failure site and spread along the interactions and dependencies between different modes of transport, transport routes, and stations, making the cascading failure model more in line with actual conditions.
[0054] 3. The present invention combines hypergraph theory with the way failures propagate in real multimodal transport networks and proposes a new cascading failure model. After a site fails, the load is not only transported to adjacent sites, but also to sites of other modes of transport in the same area, which is in line with reality and can more accurately analyze and predict how failures propagate in multimodal transport networks, which is in line with practical applications.
[0055] 4. After the present invention is run, by analyzing the post-failure images, the key sites of the multimodal transport network can be found, the robustness of the multimodal transport network can be explored, and a more robust multimodal transport network can be designed, which has a reference significance for the planning of the multimodal transport network. BRIEF DESCRIPTION OF THE DRAWINGS
[0056] Figure 1 . Schematic diagram of a single layer and overall network of the multimodal transport super network of the present invention;
[0057] Figure 2 . Schematic diagram of the site failure cascading failure model of the present invention. DETAILED DESCRIPTION
[0058] In this embodiment, a method for constructing a multimodal transport network cascading failure model based on a hypergraph is proposed. A cascading failure model of a multimodal transport hypernetwork is proposed. The multimodal transport network is abstracted into a multi-layer hypernetwork based on the hypergraph theory, so that the problem of cascading failure of the multimodal transport network in reality can be analyzed and solved more deeply, and it is helpful to improve the transportation efficiency and the flexibility of network management, and provide theoretical support and practical guidance for the design and optimization of multimodal transport networks in the real world. Specifically, the method includes the following steps:
[0059] Step 1. Construct a multimodal transport super network H = {H 1 , H 2 , H 3}, where H 1 represents the first-level railway supernetwork, H 2 represents the second-layer air transport super network, H 3 represents the third-layer water transport super network; let the site set of the target area be denoted as V = {v1,v2,...,v j ,...,v n}, where v j represents the jth site, n represents the total number of sites, and the schematic diagrams of the single-layer hypernetwork and the full-layer hypernetwork are as follows: Figure 1 As shown, Figure 1 The first three figures are schematic diagrams of the hypergraph network of a single transportation mode, and the last figure is a schematic diagram of the hypernetwork of all layers. Each circle in the figure is a hyperedge, representing a transportation route in a certain transportation mode.
[0060] Step 2. Calculate the capacity and load of hypergraph network nodes at different layers in the target area;
[0061] Step 2.1. Define the current time as t, and initialize t = 0;
[0062] Step 2.2. Obtain the load of each station in each layer of the multimodal transport hypernetwork at time t based on the traffic data of the target area in, Indicates that there is a j-th site v in the i-th layer supernetwork j The load at time t; if there is no j-th site v in the i-th layer super network j , then let
[0063] Step 2.2. Based on the maximum capacity data of the target area, obtain the maximum capacity of each station in each layer of the multimodal transport hypernetwork in, represents the jth site v in the i-th layer supernetwork j The maximum capacity of; if there is no j-th site v in the i-th layer super network j , then let
[0064] Step 2.3. Use equation (1) to calculate the jth site v in the i-th layer supernetwork j Remaining capacity at time t+1
[0065]
[0066] Step 2.4. Use formula (2) to calculate the jth site v in the i-th layer super network j The load at time t+1
[0067]
[0068] In formula (2), is assigned to the jth site v in the i-th layer supernetwork j of load.
[0069] Step 3: Figure 2 As shown, the cascading effects caused by station failures in a hypergraph-based multimodal transport network are simulated;
[0070] Step 3.1. Construct the adjacency matrix A of the i-th layer hypernetwork at time t+1 i , if there is a jth site v in the i-th layer supernetwork j , then let A i The element at row j and column j in Otherwise, let
[0071] Step 3.2. Initialize j to any number between 1 and n;
[0072] Step 3.3. Initialize and define the failure site as the xth node v in the super network x ;
[0073] Step 3.4. Initialize i=1;
[0074] Step 3.5. If The element at row x and column x in This means that there is an x-th node v in the i-th layer hypernetwork. x , there is a possibility of cascading failure, and execute step 3.6. Otherwise, after assigning i+1 to i, if i>3, output the multimodal transport super network at time t and end the process; otherwise, return to execute step 3.5.
[0075] Step 3.6. For the xth node v x The i-th layer super network performs single-layer failure load redistribution;
[0076] Step 3.6.1. Let i = 1;
[0077] Step 3.6.2. Hyperedge set E in the hypernetwork at level i i Find the xth node v in x The included hyperedge set And by the hyperedge set All the different non-failed nodes contained in each hyperedge in constitute the xth node v of the i-th layer hypernetwork x Neighboring site set Neighboring Site Collection The sites in the first round are used as load redistribution sites. x Failure is a three-layer super network that contains site v x All of them fail, and the failure cannot propagate between layers. Therefore, it is equivalent to x Each layer of the hypernetwork performs a site v x Load redistribution after failure.
[0078] Step 3.6.3. Calculate the adjacent node set using formula (3) The pth load redistribution site v p The load added at time t+1
[0079]
[0080] In formula (3), represents the pth load redistribution site v in the i-th layer supernetwork p The remaining capacity at time t;
[0081] Step 3.6.4. Add the xth node v in the i-th layer hypernetwork x The load at time t Assign to neighboring node set Therefore, the pth load redistribution site v is calculated using formula (4): p The total load after being distributed to the load at time t+1
[0082]
[0083] Step 3.6.5. Calculate the pth load redistribution site v using equation (2) p The remaining capacity after being allocated to the load at time t+1
[0084] Step 3.6.6. Assign i+1 to i. If i>3, execute step 3.7. Otherwise, return to execute step 3.6.2.
[0085] Step 3.7. Traverse the remaining capacity of each station in all layer super networks at time t+1. If there is a remaining capacity ≤ 0, it means that there is a failed station in the corresponding layer super network, and execute step 3.8. If there is no remaining capacity ≤ 0, it means that there is no failed station in the corresponding layer super network, and the failure has not propagated. Output the multimodal transport super network at time t and end the process;
[0086] Step 3.8. Store the layer number, site number, and remaining capacity of all failed sites in the order of site number into the single-layer failed site set V sin And update the adjacency matrix of the corresponding layer hypernetwork;
[0087] Step 3.9. Traverse the single-layer failure site set V sin For each failed site in:
[0088] Determine the xth failed site v in the i-th layer super network at time t+1 x Residual capacity of sites in different layers of hypernetwork Are they all ≤ 0? If so, execute step 3.6 for single-layer super network site load redistribution. Otherwise, execute steps 3.10 to 3.14 for multi-layer super network site load redistribution. Where i- represents the super network of other layers except layer i. This step is to determine the single-layer failure site V in this round of failure propagation. sin Whether failures of sites in the set can be propagated between tiers.
[0089] Step 3.10. The hyperedge set E of the hypernetwork at level i i Find the xth failed site v in x The included hyperedge set And by the hyperedge set All the different non-failed nodes contained in each hyperedge in constitute the x-th failed site v of the i-th layer hypernetwork x The set of adjacent nodes and adjacent site sets The sites in the are used as load redistribution sites;
[0090] Step 3.11. Determine the x-th failed site v in the two layers of supernetworks except the i-th layer supernetwork at time t+1 x Residual capacity of sites in different layers of hypernetwork Is it greater than 0? If so, the remaining capacity The xth failed site v in the other layer super network greater than 0 x The xth failed site v that joins the i-th layer supernetwork x The set of related nodes and the relevant node set The sites in the list are used as load redistribution sites, otherwise, they are not included;
[0091] Step 3.12. Calculate the adjacent node set using formula (5) The pth v in the i-th layer hypernetwork p and related node sets The xth failed site v in the sth layer supernetwork x The load assigned at time t+1
[0092]
[0093] In formula (5), S represents the layer number of the super network in the load redistribution site, P represents the sequence number of the load redistribution site, represents the Pth load redistribution site v assigned to the Sth layer super network P Load; Represents the set of adjacent nodes The pth site v in the i-th layer supernetwork p The remaining capacity at time t; Represents a set of related nodes The xth load redistribution site v in the sth layer super network x The remaining capacity at time t;
[0094] In formula (5), S represents the set of neighboring sites and related node sets The layer numbers of different layers of the hypernetwork, P represents the set of neighboring sites and related node sets The serial numbers of different sites in Indicates that it is assigned to the neighboring site set and related node sets The Pth site v in the Sth layer supernetwork in p of load.
[0095] Step 3.13. Replace the x-th failed site v in the i-th layer supernetwork x The load at time t+1 is distributed to the set of adjacent nodes and related node sets Then, using formula (6), we can get the Pth load redistribution site v in the Sth layer super network: P The total load after being distributed to the load at time t+1
[0096]
[0097] Step 3.14. Use equation (2) to calculate the Pth load redistribution site v in the Sth layer super network P The remaining capacity after being allocated to the load at time t+1
[0098] Step 3.15. For the single-layer failure site set V sin After traversing each failed site in , assign t+1 to t and jump to step 3.7 to execute sequentially.
[0099] In this embodiment, an electronic device includes a memory and a processor, wherein the memory is used to store a program that supports the processor to execute the above method, and the processor is configured to execute the program stored in the memory.
[0100] In this embodiment, a computer-readable storage medium stores a computer program on the computer-readable storage medium, and the computer program executes the steps of the above method when executed by a processor.
[0101] In summary, in order to study the propagation of cascading failures in multimodal transport networks, the present invention uses the hypergraph theory. In a hypergraph, an edge can connect multiple nodes. This edge is called a "hyperedge". A hyperedge can represent the complex connections between multiple nodes. This feature enables the hypergraph to more accurately reflect the many-to-many relationship in a complex system. Therefore, the hypergraph-based model can more accurately capture the association between different stations and different transportation modes in the multimodal transport network, thereby better analyzing and predicting the occurrence and propagation of cascading failures.
[0102] The model not only provides a new solution to the cascading failure problem of the multimodal transport network, but also provides managers with a new perspective to help them better understand and manage the operation of the multimodal transport network. By studying the propagation law of cascading failures in multi-layer hypernetworks, managers can formulate response strategies in a timely manner, improve transportation efficiency and network management flexibility, and thus ensure the safe and stable operation of the multimodal transport network.
Claims
1. A method for constructing a cascading failure model of a multimodal transport network based on a hypergraph, characterized in that: The steps include: Step 1. Construct a multimodal transport super network H = {H 1 , H 2 , H 3 }, where H 1 represents the first-level railway supernetwork, H 2 represents the second-layer air transport super network, H 3 represents the third-layer water transport super network; let the site set of the target area be denoted as V = {v1,v2,...,v j ,...,v n }, where v j represents the jth site, and n represents the total number of sites; Step 2. Calculate the capacity and load of hypergraph network nodes at different layers in the target area; Step 3: Simulate the cascading effect caused by site failure in the multimodal transport network based on the hypergraph; Step 3.
1. Construct the adjacency matrix A of the i-th layer hypernetwork at time t+1 i , if there is a jth site v in the i-th layer supernetwork j , then let A i The element at row j and column j in Otherwise, let Step 3.
2. Initialize j to any number between 1 and n; Step 3.
3. Initialize and define the failure site as the xth node v in the super network x ; Step 3.
4. Initialize i=1; Step 3.
5. If A i The element at row x and column x in This means that there is an x-th node v in the i-th layer hypernetwork. x , and execute step 3.6; otherwise, after assigning i+1 to i, if i>3, output the multimodal transport super network at time t and end the process; otherwise, return to execute step 3.5; Step 3.
6. For the xth node v x The i-th layer super network performs single-layer failure load redistribution; Step 3.
7. Traverse the remaining capacity of each station in all layer super networks at time t+1. If there is a remaining capacity ≤ 0, it means that there is a failed station in the corresponding layer super network, and execute step 3.
8. If there is no remaining capacity ≤ 0, output the multimodal transport super network at time t and end the process; Step 3.
8. Store the layer number, site number, and remaining capacity of all failed sites in the order of site number into the single-layer failed site set V sin And update the adjacency matrix of the corresponding layer hypernetwork; Step 3.
9. Traverse the single-layer failure site set V sin For each failed site in: Determine the xth failed site v in the i-th layer super network at time t+1 x Residual capacity of sites in different layers of hypernetwork Are both ≤0? If yes, then perform the single-layer super network site load redistribution in step 3.6; otherwise, perform the multi-layer super network site load redistribution; Step 3.
10. For the single-layer failure site set V sin After traversing each failed site in , assign t+1 to t and jump to step 3.7 to execute sequentially.
2. The method for constructing a multimodal transport network cascading failure model based on a hypergraph according to claim 1, characterized in that: The step 2 comprises the following steps: Step 2.
1. Define the current time as t, and initialize t = 0; Step 2.
2. Obtain the load of each station in each layer of the multimodal transport hypernetwork at time t based on the traffic data of the target area in, Indicates that there is a j-th site v in the i-th layer supernetwork j The load at time t; if there is no j-th site v in the i-th layer super network j , then let Step 2.
2. Based on the maximum capacity data of the target area, obtain the maximum capacity of each station in each layer of the multimodal transport hypernetwork in, represents the jth site v in the i-th layer supernetwork j The maximum capacity of; if there is no j-th site v in the i-th layer super network j , then let Step 2.
3. Use equation (1) to calculate the jth site v in the i-th layer supernetwork j Remaining capacity at time t+1 Step 2.
4. Use formula (2) to calculate the jth site v in the i-th layer super network j The load at time t+1 In formula (2), is assigned to the jth site v in the i-th layer supernetwork j of load.
3. The method for constructing a hypergraph-based multimodal transport network cascading failure model according to claim 2, characterized in that: The step 3.6 comprises the following steps: Step 3.6.
1. Let i = 1; Step 3.6.
2. Hyperedge set E in the hypernetwork at level i i Find the xth node v in x The included hyperedge set And by the hyperedge set All the different non-failed nodes contained in each hyperedge in constitute the xth node v of the i-th layer hypernetwork x Neighboring site set Neighboring Site Collection The sites in the are used as load redistribution sites; Step 3.6.
3. Calculate the adjacent node set using formula (3) The pth load redistribution site v p The load added at time t+1 In formula (3), represents the pth load redistribution site v in the i-th layer supernetwork p The remaining capacity at time t; represents the xth site v in the i-th layer supernetwork x The load at time t; Step 3.6.
4. Add the xth node v in the i-th layer hypernetwork x The load at time t Assign to neighboring node set Therefore, the pth load redistribution site v is calculated using formula (4): p The total load after being distributed to the load at time t+1 Step 3.6.
5. Calculate the pth load redistribution site v using equation (2) p The remaining capacity after being allocated to the load at time t+1 Step 3.6.
6. Assign i+1 to i. If i>3, execute step 3.
7. Otherwise, return to execute step 3.6.
2.
4. The method for constructing a multimodal transport network cascading failure model based on a hypergraph according to claim 3, characterized in that: The multi-layer super network site load redistribution in step 3.9 includes the following steps: Step a. The hyperedge set E in the hypernetwork at the i-th level i Find the xth failed site v in x The included hyperedge set And by the hyperedge set All the different non-failed nodes contained in each hyperedge in constitute the x-th failed site v of the i-th layer hypernetwork x The set of adjacent nodes and adjacent site sets The sites in the are used as load redistribution sites; Step b. Determine the x-th failed site v in the two layers of supernetworks except the i-th layer supernetwork at time t+1 x Residual capacity of sites in different layers of hypernetwork Is it greater than 0? If so, the remaining capacity The xth failed site v in the other layer super network greater than 0 x The xth failed site v that joins the i-th layer supernetwork x The set of related nodes and the relevant node set The sites in the list are used as load redistribution sites, otherwise, they are not included; Step c. Calculate the adjacent node set using formula (5) The pth site v in the i-th layer supernetwork p and related node sets The xth failed site v in the sth layer supernetwork x The load assigned at time t+1 In formula (5), S represents the layer number of the super network in the load redistribution site, P represents the sequence number of the load redistribution site, represents the Pth load redistribution site v assigned to the Sth layer super network P Load; Represents the set of adjacent nodes The pth site v in the i-th layer supernetwork p The remaining capacity at time t; Represents a set of related nodes The xth load redistribution site v in the sth layer super network x The remaining capacity at time t; Step d. Replace the x-th failed site v in the i-th layer super network x The load at time t+1 is distributed to the set of adjacent nodes and related node sets Then, using formula (6), we can get the Pth load redistribution site v in the Sth layer super network: P The total load after being distributed to the load at time t+1 Step e. Calculate the Pth load redistribution site v in the Sth layer super network using formula (2): P The remaining capacity after being allocated to the load at time t+1 5. An electronic device, comprising a memory and a processor, characterized in that: The memory is used to store a program that supports a processor to execute the construction method described in any one of claims 1 to 4, and the processor is configured to execute the program stored in the memory.
6. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of constructing the method described in any one of claims 1 to 4 are executed.
Citation Information
Patent Citations
Urban rail transit network cascade failure modeling method
CN113158456A
Reasoning with rules in a multiple inheritance semantic network with exceptions
US5802508A
Multi-modal hypergraph-based click prediction
WO2023024017A1
Measurement method for delay propagation in multi-level handling hypernetwork of automated container terminal
WO2023082763A1
Cited By
High-speed light-load railway freight logistics method and system based on Internet of Things and big data
CN119963080A
