Reliability assessment method for logistics transportation networks under maintenance cost constraints
By constructing a multi-state flow network model and a maximum flow algorithm, the reliability of the logistics transportation network under maintenance cost constraints is evaluated, solving the problem of service capability assessment of the logistics transportation network in an uncertain environment, and realizing the reliability assessment and state judgment of the network service capability.
Patent Information
- Application Number
- CN202311073585.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-08-24
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2043-08-24
AI Technical Summary
Existing technologies are insufficient to effectively assess and verify whether the service capacity of a logistics transportation network meets reliability requirements under constraints of limited maintenance resources, especially in assessing the resilience of a logistics transportation network under the influence of uncertain factors.
By constructing a multi-state flow network model, and using the maximum flow algorithm and capacity vector decomposition method, the reliability of the logistics transportation network under maintenance cost constraints is calculated, and the probability of restoring the network from a degraded state to the expected state is evaluated under the condition that the maintenance cost budget T is not exceeded.
It provides a method for assessing the reliability of logistics and transportation network service capabilities, gives criteria for judging service status under uncertain environments, and measures the resilience of network service capabilities under uncertain factors.
Smart Images

Figure CN117114531B_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of computer network technology and relates to a method for evaluating the reliability of logistics transportation networks under maintenance cost constraints. Background Technology
[0002] In reality, due to prolonged use and the existence of numerous uncertain events, the transportation facilities on each logistics route in a logistics transportation network may be affected to varying degrees. Therefore, the transportation capacity of each logistics route in the network is usually not fixed but random. Given this random property, in theoretical research, logistics transportation networks are often modeled as multi-state flow networks.
[0003] In a multi-state flow network model, each edge of the logistics transportation network has multiple capacity states (where capacity represents transportation service capability). When every edge is in its maximum capacity state, the entire logistics transportation network has its maximum transportation service capability, i.e., its maximum performance level. When some edges are in intermediate capacity states, the overall transportation service capability of the logistics transportation network will be lower than the maximum transportation service capability, i.e., its performance level will be lower than the maximum performance level. At this point, the logistics transportation network is said to be in a degraded state. Specifically, given a demand level d, when the logistics transportation network degrades to the point where it cannot provide sufficient capacity to meet demand level d, network maintenance is necessary, and restoring the network to a certain expected performance level through maintenance activities is crucial. Network maintenance activities usually involve corresponding costs; therefore, introducing maintenance costs and comprehensively considering economic benefits allows for a more comprehensive and reasonable evaluation of the service performance of the logistics transportation network. Typically, the costs for maintenance are always limited. Therefore, the reliability of a logistics transportation network under maintenance cost constraints refers to the ratio of the probability that, within the maintenance cost budget T, the network can be restored from a degraded state (where the network cannot successfully transport d units of demand from the supply location to the destination) to an expected state (where the network can successfully transport D units of demand from the supply location to the destination, where D is between d and the maximum transportation service capacity) to the probability that the network cannot meet the demand level d. This reliability index is denoted by R(d,D,T). This reliability index reflects the ability of a logistics transportation network to recover from a degraded state to an expected state under limited maintenance resource constraints, and is an important reference for measuring the resilience of a logistics transportation network under the influence of uncertain factors. Summary of the Invention
[0004] In view of this, the purpose of this invention is to provide a method for evaluating the reliability of logistics transportation networks under maintenance cost constraints, which is used to evaluate and verify whether the service capacity of logistics transportation networks meets reliability requirements under limited maintenance resource constraints.
[0005] To achieve the above objectives, the present invention provides the following technical solution:
[0006] A method for assessing the reliability of logistics transportation networks under maintenance cost constraints, comprising the following steps:
[0007] 1) Input basic data: Let G(V,E,W,B) represent the logistics transportation network, V={s,1,2,…,n,t} is the set of all nodes in the network, where s represents the supply location, t represents the destination, n represents the number of other nodes in the network excluding s and t, and E={e1,e2,…,e m Let} be the set of all edges in the network, m represent the total number of edges in the network, and e represent the total number of edges in the network. i Let C represent the i-th edge, 1≤i≤m, where m represents the total number of edges in the network. Let C1, C2, ..., Cn be the minimum cuts of the network. p Where p represents the number of minimal cuts, d represents the given capacity demand level of the logistics transportation network, and B = (b1, b2, ..., b) represents the vector of unit capacity maintenance costs for each edge. m ), where b i Representing edge e i The unit capacity maintenance cost is the cost required to increase the capacity state of an edge by one unit capacity through maintenance activities, 1≤i≤m, where m represents the total number of edges in the network, and the initial maximum capacity vector W = (W1,W2,…,W…). m ), where W i Representing edge e i The maximum capacity, 1≤i≤m, the capacity probability distribution of each edge, and the initial capacity vector space S=[L,U], where L=(L1,L2,…,L m )=(0,0,…,0) represents the minimum capacity vector in S, L i Representing edge e i The minimum capacity, U = (U1, U2, ..., U m U represents the maximum capacity vector. i Representing edge e i The maximum capacity is obviously U. i =W i 1≤i≤m, the expected state D that the network should reach after maintenance (i.e., the network can successfully transport D units of demanded goods from supply location s to destination t), where D≥d, and the maintenance cost budget T, expressed in R. (d,D,T)The reliability of a logistics transportation network under maintenance cost constraints is defined as the ratio of the probability that, within the maintenance cost budget T, the network will recover from a degraded state where it cannot meet demand level d (where a degraded state where it cannot meet demand level d means the network cannot successfully transport d units of goods demanded from supply location s to destination t) to an expected state where it can meet demand level D (where an expected state where it can meet demand level D means the network can successfully transport D units of goods demanded from supply location s to destination t) to the probability that the network cannot meet demand level d at all. This is expressed as MR. (d,D,T Let MR represent the probability that, without exceeding the maintenance cost budget T, the network will be restored from a degraded state that fails to meet demand level d to an expected state that meets demand level D through maintenance activities. (d,D,T ) = 0, UR d Let UR represent the probability that the network is in a degenerate state where it cannot meet the demand level d. d =0;
[0008] 2) Find a capacity vector in the capacity vector space S that does not satisfy the demand level d: use X = (x1, x2, ..., x...) m ) represents the network capacity vector, where x i Let X represent the capacity state of the i-th edge. If the logistics transportation network cannot transport d units of goods demand from the supply location s to the destination t under a certain capacity vector, then the capacity vector is called a capacity vector that does not meet the demand level d. Find a capacity vector X that does not meet the demand level d in the capacity vector space S according to the following steps:
[0009] ① Use the maximum flow algorithm to calculate the minimum cut C corresponding to the maximum flow of the network under the minimum capacity vector L. h (1≤h≤p), assume C h ={e h1 ,e h2 ,…,e hk}(1≤k≤m) contains k edges;
[0010] ②For all e hi ∈C h Let x hi =L i , 1≤i≤k, j=1, repeat the following steps k times: x hj =max{x j |sum+x j -L j <d,L j ≤x j ≤U j}, sum = sum + xhj -L j , j = j + 1;
[0011] ③ For the capacity vector X = (x1, x2, ..., x... m For all e hi ∈C h Let x i =x hi 1≤i≤k, for all Let x i =U i , 1≤i≤m;
[0012] 3) Decompose the capacity vector space:
[0013] Capacity vector X = (x1, x2, ..., x m Let Φ be the capacity vector found in step 2) that does not meet the demand level d, and let Φ = {e} i |x i i Where 1≤i≤m}={e k1 ,e k2 ,…,e kq}, ε=(ε1,ε2,…,ε m ), where ε i =x i , 1≤i≤m, E={e1,e2,…,e m Let} be the set of all edges in the network, where 1 ≤ i ≤ m, and each edge is represented by an integer e^(i-m). k1 ,e k2 ,…,e kq Decompose the capacity vector space S into q+1 disjoint subsets S', with the axis as the axis. 1 ,S 2 ,…,S q and S q+1 ,in
[0014] S 1 ={(x 1, x2,…,x m )|ε k1 <x k1 ≤U k1 ,L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1}};
[0015] S 2 ={(x 1, x2,…,x m )|L k1 ≤xk1 ≤ε k1 ,ε k2 <x k2 ≤U k2 ,L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 ,e k2}};
[0016] …
[0017] S q ={(x 1, x2,…,x m )|L i ≤x i ≤ε i When e i ∈{e k1 ,e k2 ,…,e kq-1},ε kq <x kq ≤U kq ,L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 ,e k2 ,…,e kq}};
[0018] S q+1 ={(x 1, x2,…,x m )|L i ≤x i ≤ε i When e i ∈{e k1 ,e k2 ,…,e kq},L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 ,e k2 ,…,e kq}};
[0019] Capacity vector space S and subset S 1 S 2 S q S q+1 The following relationship must be satisfied: S = S 1 ∪S 2 ∪...∪Sq ∪S q+1 and any two subsets are disjoint, the subset S q+1 has a property: that is, S q+1 any capacity vector X in does not satisfy the demand level d; let UR d =UR d +Pr(S q+1 ), where Pr(S q+1 ) is the probability of the capacity vector set S q+1 ;
[0020] 4) Determine qualified capacity vectors: Given a capacity vector X that does not meet the demand level d, if under the condition that the maintenance cost budget T is not exceeded, the network can be restored from the degraded state of X to the expected state that can meet the demand level D through maintenance activities, then X is called a qualified capacity vector; for each capacity vector X in S q+1 , calculate the capacity cap(C j ) of each minimal cut C of the network under the capacity vector X j , where 1≤j≤p, use Δx i to represent the capacity increment of edge e when the network is restored from the degraded state of X to the expected state that can meet the demand level D i , where 0≤Δx i ≤W i -x i , 1≤i≤m, the minimum total maintenance cost for restoring the network from the degraded state of X to the expected state that meets the demand level D is denoted as MMC(X), and MMC(X) is solved by the following mathematical model:
[0021]
[0022] If Cap(C j )<D and 1≤j≤p
[0023] 0≤Δx i ≤W i -x i 1≤i≤m
[0024] If MMC(X)≤T, then X is a qualified capacity vector, let MR (d,D,T) =MR (d,D,T) +Pr(X), where Pr(X) represents the probability of the capacity vector X;
[0025] 5) Continue solving for each subset: For each subset S 1 , S 2 , …, S qTreat it as a new capacity vector space S, and continue to step 2) to solve it until all subsets have been solved;
[0026] 6) Calculate the reliability of the logistics transportation network under maintenance cost constraints: The reliability of the logistics transportation network under maintenance cost constraints is R. (d,D,T) =MR (d,D,T) / UR d .
[0027] The beneficial effects of this invention are as follows: the technical solution provided by this invention can effectively evaluate the reliability level of logistics transportation network service capabilities under the constraints of limited maintenance resources, provide a basis for technicians to judge the service status of logistics transportation networks under uncertain environments, and at the same time, provide an important reference for measuring the service capability elasticity of logistics transportation networks under the influence of uncertain factors.
[0028] Other advantages, objectives, and features of the invention will be set forth in part in the description which follows, and in part will be apparent to those skilled in the art from the following examination, or may be learned from practice of the invention. The objectives and other advantages of the invention can be realized and obtained through the following description. Attached Figure Description
[0029] To make the objectives, technical solutions, and advantages of the present invention clearer, the preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings, wherein:
[0030] Figure 1 This is a flowchart of the method of the present invention;
[0031] Figure 2 This is a network diagram for a specific embodiment. Detailed Implementation
[0032] The following specific examples illustrate the implementation of the present invention. Those skilled in the art can easily understand other advantages and effects of the present invention from the content disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and various details in this specification can be modified or changed based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the illustrations provided in the following embodiments are only schematic representations of the basic concept of the present invention. Unless otherwise specified, the following embodiments and features can be combined with each other.
[0033] The accompanying drawings are for illustrative purposes only and are schematic diagrams, not actual pictures. They should not be construed as limiting the invention. To better illustrate the embodiments of the invention, some parts in the drawings may be omitted, enlarged, or reduced, and do not represent the actual product dimensions. It is understandable to those skilled in the art that some well-known structures and their descriptions may be omitted in the drawings.
[0034] In the accompanying drawings of the embodiments of the present invention, the same or similar reference numerals correspond to the same or similar components. In the description of the present invention, it should be understood that if terms such as "upper," "lower," "left," "right," "front," and "rear" indicate the orientation or positional relationship based on the orientation or positional relationship shown in the drawings, they are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, the terms used to describe positional relationships in the drawings are only for illustrative purposes and should not be construed as limiting the present invention. For those skilled in the art, the specific meaning of the above terms can be understood according to the specific circumstances.
[0035] This invention provides a method for reliability assessment of logistics transportation networks considering maintenance cost constraints, the flowchart of which is shown below. Figure 1 As shown, it includes the following steps:
[0036] 1) Enter basic data.
[0037] Let G(V,E,W,B) denote a logistics transportation network, where V = {s,1,2,…,n,t} is the set of all nodes in the network, where s represents the supply location, t represents the destination, and n represents the number of nodes in the network excluding s and t. E = {e1,e2,…,e...} m Let} be the set of all edges in the network, m represent the total number of edges in the network, and e represent the total number of edges in the network. i (1≤i≤m) represents the i-th edge, and all minimum cuts C1, C2, ..., Cn in the network. p Where p represents the number of minimal cuts, d represents the given capacity demand level of the logistics transportation network, and B = (b1, b2, ..., b) represents the vector of unit capacity maintenance costs for each edge. m ), where b i Representing edge e i The unit capacity maintenance cost is the cost required to increase the capacity state of an edge by one unit capacity through maintenance activities, where 1 ≤ i ≤ m, and the initial maximum capacity vector is W = (W1, W2, ..., W...). m ), where W i Representing edge e i The maximum capacity, 1≤i≤m, the capacity probability distribution of each edge, and the initial capacity vector space S=[L,U], where L=(L1,L2,…,L m)=(0,0,…,0) represents the minimum capacity vector in S, L i Representing edge e i The minimum capacity, U = (U1, U2, ..., U m U represents the maximum capacity vector. i Representing edge e i The maximum capacity is obviously U. i =W i 1≤i≤m, the expected state D that the network should reach after maintenance (i.e., the network can successfully transport D units of demanded goods from supply location s to destination t), where D≥d, and the maintenance cost budget T, expressed in R. (d,D,T) The reliability of a logistics transportation network under maintenance cost constraints is defined as the ratio of the probability that, within the maintenance cost budget T, the network will recover from a degraded state where it cannot meet demand level d (where a degraded state where it cannot meet demand level d means the network cannot successfully transport d units of goods demanded from supply location s to destination t) to an expected state where it can meet demand level D (where an expected state where it can meet demand level D means the network can successfully transport D units of goods demanded from supply location s to destination t) to the probability that the network cannot meet demand level d at all. This is expressed as MR. (d,D,T Let MR represent the probability that, without exceeding the maintenance cost budget T, the network will be restored from a degraded state that fails to meet demand level d to an expected state that meets demand level D through maintenance activities. (d,D,T ) = 0, UR d Let UR represent the probability that the network is in a degenerate state where it cannot meet the demand level d. d =0;
[0038] 2) Find a capacity vector in the capacity vector space S that does not satisfy the demand level d: use X = (x1, x2, ..., x...) m ) represents the network capacity vector, where x i Let X represent the capacity state of the i-th edge. If the logistics transportation network cannot transport d units of goods demand from the supply location s to the destination t under a certain capacity vector, then the capacity vector is called a capacity vector that does not meet the demand level d. Finding a capacity vector that does not meet the demand level d can be used to quickly separate all capacity vectors that do not meet the demand level d in the capacity vector space S. Find a capacity vector X that does not meet the demand level d in the capacity vector space S according to the following steps:
[0039] ① Use the maximum flow algorithm to calculate the minimum cut C corresponding to the maximum flow of the network under the minimum capacity vector L. h (1≤h≤p), assume C h ={e h1 ,eh2 ,…,e hk}(1≤k≤m) contains k edges;
[0040] ②For all e hi ∈C h Let x hi =L i , 1≤i≤k, j=1, repeat the following steps k times: x hj =max{x j |sum+x j -L j <d,L j ≤x j ≤U j}, sum = sum + x hj -L j , j = j + 1;
[0041] ③ For the capacity vector X = (x1, x2, ..., x... m For all e hi ∈C h Let x i =x hi , 1≤i≤k, for all Let x i =U i , 1≤i≤m;
[0042] 3) Decompose the capacity vector space:
[0043] Capacity vector X = (x1, x2, ..., x m Let Y be a capacity vector that does not meet the demand level d found in step 2). m If Y ≤ X, then the capacity vector Y is also a capacity vector that does not meet the demand level d. Based on this, let Φ = {e i |x i i Where 1≤i≤m}={e k1 ,e k2 ,…,e kq}, ε=(ε1,ε2,…,ε m ), where ε i =x i , 1≤i≤m, E={e1,e2,…,e m Let} be the set of all edges in the network, where 1 ≤ i ≤ m, and each edge is represented by an integer e^(i-m). k1 ,e k2 ,…,e kq Decompose the capacity vector space S into q+1 disjoint subsets S', with the axis as the axis.1 ,S 2 ,…,S q and S q+1 ,in
[0044] S 1 ={(x 1, x2,…,x m )|ε k1 <x k1 ≤U k1 ,L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1}};
[0045] S 2 ={(x 1, x2,…,x m )|L k1 ≤x k1 ≤ε k1 ,ε k2 <x k2 ≤U k2 ,L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 ,e k2}};
[0046] …
[0047] S q ={(x 1, x2,…,x m )|L i ≤x i ≤ε i When e i ∈{e k1 ,e k2 ,…,e kq-1},ε kq <x kq ≤U kq ,L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 ,e k2 ,…,e kq}};
[0048] S q+1 ={(x 1, x2,…,x m )|Li ≤x i ≤ε i When e i ∈{e k1 ,e k2 ,…,e kq},L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 ,e k2 ,…,e kq}};
[0049] Capacity vector space S and subset S 1 S 2 S q S q+1 The following relationship must be satisfied: S = S 1 ∪S 2 ∪...∪S q ∪S q+1 And any two subsets are disjoint, subset S q+1 There is a property: that is, for S q+1 For any capacity vector Y in S, Y≤X, therefore S q+1 No capacity vector in UR satisfies the demand level d; let UR d =UR d +Pr(S q+1 ),in It is a vector set S with capacity q+1 The probability, and They are subsets S q+1 The minimum capacity vector and the maximum capacity vector in the data. It is edge e i Capacity status is x i The probability of that time;
[0050] 4) Determining the qualified capacity vector: Given a capacity vector X that does not meet demand level d, if, under the condition of not exceeding the maintenance cost budget T, the network can be restored from the degraded state of X to the expected state that meets demand level D through maintenance activities, then X is called a qualified capacity vector; subset S q+1 Each capacity vector X in the dataset is a capacity vector that does not meet the demand level d. A subset S can be determined by verifying, one by one, whether the minimum total maintenance cost required to restore the network from the degenerate state of X to the expected state that meets the demand level D exceeds the maintenance cost budget T. q+1 The qualified capacity vector in the subset S is used to verify the subset S. q+1The process of determining whether a capacity vector X is a qualified capacity vector is as follows: calculate each minimal cut C of the network under the capacity vector X j with capacity cap(C j ), where 1≤j≤p, Δx i denotes the capacity increment of edge e when restoring the network from the degraded state of X to the expected state that can meet the demand level D i , where 0≤Δx i ≤W i -x i , 1≤i≤m, the minimum total maintenance cost for restoring the network from the degraded state of X to the expected state meeting the demand level D is denoted as MMC(X), and MMC(X) is solved by the following mathematical model:
[0051]
[0052] If Cap(C j )<D and 1≤j≤p
[0053] 0≤Δx i ≤W i -x i 1≤i≤m
[0054] If MMC(X)≤T, it indicates that the minimum total maintenance cost required to restore the network from the degraded state of X to the expected state meeting the demand level D does not exceed the maintenance cost budget T, that is, the capacity vector X is a qualified capacity vector, let MR (d,D,T) =
[0055] MR (d,D,T) +Pr(X), where represents the probability of the capacity vector X, is the probability when the capacity state of edge e i is x i ;
[0056] 5) Continue solving for each subset: regard each subset S 1 ,S 2 ,…,S q as a new capacity vector space S=[L,U] respectively, turn to step 2) to continue the solution until all subsets have been solved;
[0057] 6) Calculate the reliability of the logistics transportation network under the maintenance cost constraint: the reliability of the logistics transportation network under the maintenance cost constraint is R (d,D,T) =MR (d,D,T) / UR d .
[0058] The present invention will be described in detail below with reference to specific embodiments:
[0059] A specific implementation example Figure 2 As shown, an abstraction of a logistics transportation network yields... Figure 2 The network consists of 4 nodes and 6 transport edges, namely V = {s, 1, 2, t}, where nodes s and t represent the supply location and destination, respectively, E = {e1, e2, e3, e4, e5, e6}, and the maximum capacity vector of the network is W = (4, 3, 4, 1, 4, 4). Table 1 shows the capacity probability distribution and unit maintenance cost of each edge in the network. From Table 1, we can see that the initial capacity vector space S = [L, U] = [(0, 0, 0, 0, 0, 0), (3, 2, 1, 1, 1, 2)], and the unit capacity maintenance cost vector B = (3, 5, 4, 4, 5, 3).
[0060] Table 1. Capacity probability distribution and unit capacity maintenance cost of the transport edge.
[0061]
[0062]
[0063] The following calculation, using the method of this invention, calculates the ratio of the probability that the logistics transportation network, under the condition of not exceeding the maintenance cost budget T = 12, will recover from a degraded state (wherein the network cannot successfully transport d units of goods demanded from supply location s to destination t) to an expected state (wherein the network can successfully transport D units of goods demanded from supply location s to destination t) through maintenance activities to the probability that the network cannot meet the demand level d. This ratio represents the probability of the network remaining in a degraded state. In other words, the reliability R of the logistics transportation network under maintenance cost constraints is calculated. (3,4,12) .
[0064] According to the method steps of this invention, the solution process is as follows:
[0065] 1) Input basic data. The network has four minimum cuts: C1 = {e1, e5}, C2 = {e2, e3, e5}, C3 = {e1, e4, e6}, C4 = {e2, e6}. The given capacity requirement level is d = 3, the expected state is D = 4, the initial maximum capacity vector is W = (4, 3, 4, 1, 4, 4), the initial capacity vector space is S = [L, U] = [(0, 0, 0, 0, 0, 0), (3, 2, 1, 1, 1, 2)], the unit capacity maintenance cost vector is B = (3, 5, 4, 4, 5, 3), the maintenance cost budget constraint is T = 12, and MR... (d,D,T ) = 0, UR d=0.
[0066] 2) In the capacity vector space S=[L,U]=[(0,0,0,0,0,0),(3,2,1,1,1,2)], find a capacity vector that does not satisfy the demand level d=3: use X=(x1,x2,…,x m Let X represent the network's capacity vector. Find a capacity vector X in the capacity vector space S that does not satisfy the requirement level d = 3, according to the following steps:
[0067] ① The minimum cut corresponding to the maximum flow of the network under the minimum capacity vector L is calculated using the maximum flow algorithm. It is C2={e2,e3,e5}, which contains 3 edges and k=3;
[0068] ②For all e hi ∈C2, let x i =L i , that is, x2=0, x3=0, x5=0, sum=x1+x3+x5=0, j=1, x h2 =max{x2|sum+x2-L2} <d,L2≤x2≤U2}=max{x2|0+x2-0<3,0≤x2≤2}=2,sum=sum+x h2 -L2=0+2-0=2, j=j+1=1+1=2; x h3 =max{x3|sum+x3-L3} <d,L3≤x3≤U3}=max{x3|2+x3-0<3,0≤x3≤1}=0,sum=sum+x h3 -L3=2+0-0=2, j=j+1=2+1=3; x h5 =max{x5|sum+x5-L5} <d,L5≤x5≤U5}=max{x5|2+x5-0<3,0≤x5≤1}=0,sum=sum+x h5 -L5=2+0-0=2, j=j+1=3+1=4;
[0069] ③ For the capacity vector X = (x1, x2, ..., x... m For all e hi ∈C h Let x i =x hi That is, x2 = 2, x3 = 0, x5 = 0, for all Let x i =U i That is, x1 = 3, x4 = 1, x6 = 2, so a capacity vector that does not meet the demand level d = 3 is X = (3, 2, 0, 1, 0, 2);
[0070] 3) Decompose the capacity vector space:
[0071] The capacity vector X = (2,2,1,1,0,2) is a capacity vector found in step 2) that does not meet the demand level d = 3. Let Φ = {e i |x i i Where 1≤i≤6}={e1,e5}, ε=(2,2,1,1,0,2), the capacity vector space S is decomposed into 2+1 disjoint subsets S with e1 and e5 as axes respectively. 1 S 2 and S 3 S 1 =[(3,0,0,0,0,0),(3,2,1,1,1,2)],S 2 =[(0,0,0,0,1,0),(2,2,1,1,1,2)],S 3 =[(0,0,0,0,0,0),(2,2,1,1,0,2)], let UR d =UR d +Pr(S 3 = 0 + (0.05 + 0.10 + 0.25) * (0.10 + 0.30 + 0.60) * (0.10 + 0.90) * (0.10 + 0.90) * (0.10) * (0.05 + 0.25 + 0.70) = 0.04;
[0072] 4) Determine the qualified capacity vector: subset S 3 Each capacity vector X in [(0,0,0,0,0,0),(2,2,1,1,0,2)] is a capacity vector that does not meet the demand level d=3. The subset S can be determined by verifying, one by one, whether the minimum total maintenance cost required to restore the network from the degenerate state of X to the expected state that meets the demand level D=4 exceeds the maintenance cost budget T=12. 3 The qualified capacity vector in the subset S is used to verify the subset S. 3 The process of determining whether a capacity vector X = (2,2,1,1,0,2) is a qualified capacity vector is as follows: cap(C1) = 2 + 0 = 2, cap(C2) = 2 + 1 + 0 = 3, cap(C3) = 2 + 1 + 2 = 5, cap(C4) = 2 + 2 = 4, 0 ≤ Δx1 ≤ 3 - 2 = 1, 0 ≤ Δx2 ≤ 2 - 2 = 0, 0 ≤ Δx3 ≤ 1 - 1 = 0, 0 ≤ Δx4 ≤ 1 - 1 = 0, 0 ≤ Δx5 ≤ 1 - 0 = 1, 0 ≤ Δx6 ≤ 2 - 2 = 0. The minimum total maintenance cost to restore the network from the degraded state of X = (2,2,1,1,0,2) to the expected state that meets the demand level D = 4 is denoted as MMC(X). MMC(X) is solved using the following mathematical model:
[0073] min MMC(X)=3Δx1+5Δx2+4Δx3+4Δx4+5Δx5+3Δx6
[0074] Δx1+Δx5≥2
[0075] Δx2+Δx3+Δx5≥1
[0076] 0≤Δx1≤1
[0077] 0≤Δx2≤0
[0078] 0≤Δx3≤0
[0079] 0≤Δx4≤0
[0080] 0≤Δx5≤1
[0081] 0≤Δx6≤0
[0082] The calculation shows that MMC(X) = 8 ≤ T = 12, therefore the capacity vector X is a qualified capacity vector. Let MR (d,D,T) =MR (d,D,T) +Pr(X)=0+0.25*0.60*0.90*0.90*0.10*0.70=0.008505;
[0083] Similarly, the subset S can be verified. 3 = Other capacity vectors in [(0,0,0,0,0,0),(2,2,1,1,0,2)];
[0084] 5) Continue solving for each subset: Subset S 1 and S 2 Treat each as a new capacity vector space S = [L, U], and proceed to step 2) to continue the solution; using subset S 1 For example: Let S = S 1 =[L,U]=[(3,0,0,0,0,0),(3,2,1,1,1,2)];
[0085] Specifically:
[0086] 3) Decompose the capacity vector space:
[0087] The capacity vector X = (3, 2, 0, 1, 0, 2) is a capacity vector found in step 2) that does not meet the demand level d = 3. Let Φ = {e i |x i i Where 1≤i≤6}={e3,e5}, ε=(3,2,0,1,0,2), the capacity vector space S is decomposed into 2+1 disjoint subsets S with e3 and e5 as axes respectively. 1-1 S 1-2 and S 1-3 S 1-1 =[(3,0,1,0,0,0),(3,2,1,1,1,2)],S 1-2 =[(3,0,0,0,1,0),(3,2,0,1,1,2)],S 1-3 =[(3,0,0,0,0,0),(3,2,0,1,0,2)], let UR d =UR d +Pr(S 1-3 =0.04 + 0.60*1*0.10*1*0.10*1 = 0.046;
[0088] 4) Determine the qualified capacity vector: subset S 1-3 Each capacity vector X in [(3,0,0,0,0,0),(3,2,0,1,0,2)] is a capacity vector that does not meet the demand level d=3. The subset S can be determined by verifying, one by one, whether the minimum total maintenance cost required to restore the network from the degenerate state of X to the expected state that meets the demand level D=4 exceeds the maintenance cost budget T=12. 1-3 The qualified capacity vector in the subset S 1-3 After verifying all the capacity vectors in the matrix, MR can be obtained. (d,D,T) =MR (d,D,T) +0.003420 = 0.021075;
[0089] 5) Continue solving for each subset: Subset S 1-1 and S 1-2 Treat each as a new capacity vector space S = [L, U], and proceed to step 2) to continue the solution... (the solution process is the same as above);
[0090] When subset S 1 and S 2 After all are solved, UR can be obtained. d =0.388585, MR (d,D,T) =0.2618475;
[0091] 6) Calculate the reliability of the logistics transportation network under maintenance cost constraints: The reliability of the logistics transportation network under maintenance cost constraints is R. (d,D,T) =MR (d,D,T) / UR d =0.2618475 / 0.388585=0.6738487.
[0092] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the present invention, and all such modifications or substitutions should be covered within the scope of the claims of the present invention.
Claims
1. A method for assessing the reliability of logistics transportation networks under maintenance cost constraints, characterized by: The method includes the following steps: 1) Input basic data: Let G(V,E,W,B) represent the logistics transportation network, V={s,1,2,…,n,t} is the set of all nodes in the network, where s represents the supply location, t represents the destination, n represents the number of other nodes in the network excluding s and t, and E={e1,e2,…,e m Let} be the set of all edges in the network, m represent the total number of edges in the network, and e represent the total number of edges in the network. i Let C represent the i-th edge, 1≤i≤m, where m represents the total number of edges in the network. Let C1, C2, ..., Cn be the minimum cuts of the network. p Where p represents the number of minimum cuts, d represents the given capacity demand level of the logistics transportation network, and B = (b1, b2, ..., b) represents the vector of unit capacity maintenance costs for each edge. m ), where b i Representing edge e i The unit capacity maintenance cost is the cost required to increase the capacity state of an edge by one unit capacity through maintenance activities. The initial maximum capacity vector is W = (W1, W2, ..., W...). m ), where W i Representing edge e i The maximum capacity, the capacity probability distribution of each edge, and the initial capacity vector space S = [L, U], where L = (L1, L2, ..., L...). m )=(0,0,…,0) represents the minimum capacity vector in S, L i Representing edge e i The minimum capacity, U = (U1, U2, ..., U m U represents the maximum capacity vector. i Representing edge e i The maximum capacity is obviously U. i =W i The expected state D that the network should achieve after maintenance is that the network can successfully transport D units of the demand for goods from the supply location s to the destination t, where D ≥ d, and the maintenance cost budget is T, expressed as R. (d,D,T) The reliability of a logistics transportation network under maintenance cost constraints is defined as the ratio of the probability that the network will recover from a degraded state that cannot meet demand level d to an expected state that can meet demand level D through maintenance activities, provided that the maintenance cost budget T is not exceeded, to the probability that the network will remain in a degraded state that cannot meet demand level d. This is expressed as MR. (d,D,T Let MR represent the probability that, without exceeding the maintenance cost budget T, the network will be restored from a degraded state that fails to meet demand level d to an expected state that meets demand level D through maintenance activities. (d,D,T ) = 0, UR d Let UR represent the probability that the network is in a degenerate state where it cannot meet the demand level d. d =0; Among them, the degraded state that cannot meet the demand level d means that the network cannot successfully transport d units of the demand for goods from the supply location s to the destination t; the expected state that can meet the demand level D means that the network can successfully transport D units of the demand for goods from the supply location s to the destination t. 2) Find a capacity vector in the capacity vector space S that does not satisfy the demand level d: use X = (x1, x2, ..., x...) m ) represents the network capacity vector, where x i Let X represent the capacity state of the i-th edge. If the logistics transportation network cannot transport d units of goods demand from the supply location s to the destination t under a certain capacity vector, then the capacity vector is called a capacity vector that does not meet the demand level d. Find a capacity vector X that does not meet the demand level d in the capacity vector space S according to the following steps: ① Use the maximum flow algorithm to calculate the minimum cut C corresponding to the maximum flow of the network under the minimum capacity vector L. h , 1≤h≤p, assume C h ={e h1 ,e h2 ,…,e hk It contains k edges, where 1 ≤ k ≤ m; ②For all e hi ∈C h Let x hi =L i , 1≤i≤k, j=1, repeat the following steps k times: x hj =max{x j |sum+x j -L j <d,L j ≤x j ≤U j }, sum = sum + x hj -L j , j = j + 1; ③ For the capacity vector X = (x1, x2, ..., x... m For all e hi ∈C h Let x i =x hi 1≤i≤k, for all Let x i =U i ; 3) Decompose the capacity vector space: Capacity vector X = (x1, x2, ..., x m Let Φ be the capacity vector found in step 2) that does not meet the demand level d, and let Φ = {e} i |x i i }={e k1 ,e k2 ,…,e kq }, ε=(ε1,ε2,…,ε m ), where ε i =x i E = {e1, e2, ..., e} m Let} be the set of all edges in the network, denoted by e. k1 ,e k2 ,…,e kq Decompose the capacity vector space S into q+1 disjoint subsets S', with the axis as the axis. 1 ,S 2 ,…,S q and S q+1 ,in S 1 ={(x 1, x2,…,x m )|ε k1 <x k1 ≤U k1 ,L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 }}; S 2 ={(x 1, x2,…,x m )|L k1 ≤x k1 ≤ε k1 ,ε k2 <x k2 ≤U k2 ,L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 ,e k2 }}; … S q ={(x 1, x2,…,x m )|L i ≤x i ≤ε i When e i ∈{e k1 ,e k2 ,…,e kq-1 },ε kq <x kq ≤U kq ,L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 ,e k2 ,…,e kq }}; S q+1 ={(x 1, x2,…,x m )|L i ≤x i ≤ε i When e i ∈{e k1 ,e k2 ,…,e kq },L i ≤x i ≤U i When 1≤i≤m and e i ∈E\{e k1 ,e k2 ,…,e kq }}; Capacity vector space S and subset S 1 S 2 S q S q+1 The following relationship must be satisfied: S = S 1 ∪S 2 ∪...∪S q ∪S q+1 Furthermore, no two subsets overlap, and subset S q+1 There is a characteristic: namely S q+1 No capacity vector X in UR satisfies the required level d; let UR d =UR d +Pr(S q+1 ), where Pr(S) q+1 ) is a vector set with capacity S q+1 The probability of; 4) Determining the Qualified Capacity Vector: Given a capacity vector X that does not meet demand level d, if, under the condition of not exceeding the maintenance cost budget T, maintenance activities can restore the network from the degraded state of X to the expected state that meets demand level D, then X is called a qualified capacity vector; for S q+1 For each capacity vector X in the network, compute the minimum cut C of the network under capacity vector X. j Capacity cap(C) j ),in 1≤j≤p, use Δx i This indicates the edge e when the network is restored from the degenerate state of X to the expected state that can meet the demand level D. i The increase in capacity, where 0 ≤ Δx i ≤W i -x i Let MMC(X) be the minimum total maintenance cost to restore the network from its degraded state X to the expected state that meets demand level D. MMC(X) is solved using the following mathematical model: If Cap(C j )<D and 1≤j≤p 0≤Δx i ≤W i -x i If MMC(X) ≤ T, then X is a qualified capacity vector, let MR (d,D,T) =MR (d,D,T) +Pr(X), where Pr(X) represents the probability of the capacity vector X; 5) Continue solving for each subset: Solve for each subset S 1 ,S 2 ,…,S q Treat it as a new capacity vector space S, and continue to step 2) to solve it until all subsets have been solved; 6) Calculate the reliability of the logistics transportation network under maintenance cost constraints: The reliability of the logistics transportation network under maintenance cost constraints is R. (d,D,T) =MR (d,D,T) / UR d .
Citation Information
Patent Citations
Cloud computing network maintenance reliability analysis method
CN112181694A
Distribution network capacity reliability evaluation method with cost constraints
CN112184041A
