A resource planning configuration method, system and electronic device

Abstract

The specification discloses a resource planning configuration method, system and electronic equipment, which can take into account various constraint conditions, meet multiple requirements, and make resource planning more reasonable and efficient. The method comprises the following steps: obtaining storage environment information in a target planning area, calculating and determining the space cost of multiple storage warehouses in the target planning area according to the storage environment information; obtaining demand information in the target planning area, determining the time cost of multiple requirements in the target planning area according to the demand information; and according to the time cost of multiple storage warehouses and the time cost of multiple requirements, sequentially allocating corresponding storage warehouses to multiple requirements to generate a configuration scheme. The system comprises an area information acquisition module, a space cost calculation module, a time cost calculation module and a planning configuration module. The processor in the electronic equipment executes a program to realize the resource planning configuration method.

Description

Technical Field

[0001] This invention relates to the field of engineering planning data processing technology, specifically to a resource planning and allocation method, system, and electronic device. Background Technology

[0002] In daily life and production, the safe and rational planning and allocation of storage resources is essential. In many cases, resource planning and allocation only considers a few constraints such as time and economic costs for specific needs. However, in actual production and life applications, it is necessary to consider a variety of complex constraints and simultaneously meet multiple needs. For example, emergency resource allocation for disasters and epidemics requires consideration of safety factors and actual geographical environmental factors in addition to time and economic costs. Resource allocation under complex needs such as military support requires consideration of geographical conditions, transportation conditions, safety factors, time costs, and the level of protection, while also comprehensively planning and allocating resources to meet various different needs. Faced with such complex scenarios, some related technologies can only selectively select a few key conditions for constraint, and the effects of multiple constraints are simply linearly superimposed. The resulting configuration scheme is not closely related to actual environmental factors, cannot scientifically fit the actual application scenario, and has poor practical application results. Summary of the Invention

[0003] In view of this, the embodiments of this specification provide a resource planning and configuration method, system and electronic device that can generate configuration schemes that comprehensively take into account multiple constraints, closely relate to the actual environment and meet multiple needs, making resource planning and utilization more rational and efficient.

[0004] In a first aspect, embodiments of this specification provide a resource planning and allocation method, the method comprising:

[0005] Obtain storage environment information within the target planning area, including storage warehouse information, transportation condition information, and security factor information;

[0006] The space cost of multiple storage warehouses in the target planning area is calculated and determined based on the storage environment information.

[0007] Obtain demand information in the target planning area, and determine the time cost of multiple demands in the target planning area based on the demand information;

[0008] Based on the time cost of the various storage repositories and the time cost of the various requirements, corresponding storage repositories are allocated to the various requirements in sequence to generate a configuration scheme.

[0009] Optionally, the space cost of multiple storage warehouses in the target planning area is calculated and determined based on the storage environment information, including:

[0010] Based on the storage warehouse information and the transportation condition information, an equivalent model is performed on the transportation conditions within the target planning area to determine the equivalent transportation height of multiple storage warehouses;

[0011] Based on the storage warehouse information and the security factor information, equivalent modeling is performed on multiple threat sources within the target planning area to determine the security equivalence height of multiple storage warehouses;

[0012] The space cost is calculated and determined based on the transport equivalent height and the safety equivalent height:

[0013]

[0014] in, Let ΔH represent the space cost of the i-th storage warehouse. i This represents the transport equivalent height of the i-th storage warehouse. This represents the security equivalent height of the i-th storage warehouse.

[0015] Optionally, the storage warehouse information includes the location information of multiple storage warehouses, and the transportation condition information includes road type and road vector;

[0016] Based on the storage warehouse information and the transportation condition information, an equivalent model is performed on the transportation conditions within the target planning area to determine the equivalent transportation height of multiple storage warehouses, including:

[0017] Determine the transport condition parameter K based on the road type. Type ;

[0018] The equivalent factor K of the transportation conditions is calculated and determined based on the aforementioned transportation condition parameters. Tra :

[0019]

[0020]

[0021] in, This represents the equivalent height of the target planning area. The average elevation of the target planning area is represented by τ, which is a constant.

[0022] The shortest distance to the road vector is determined based on the location information of the multiple storage warehouses, and the transportation condition equivalence factor K is used as a reference. Tra The equivalent height for transportation is determined by calculating the shortest distance:

[0023]

[0024] Where, ΔH i Let represent the transport equivalent height of the i-th storage warehouse, and dis(i) represent the shortest distance between the i-th storage warehouse and the road vector.

[0025] Optionally, the storage warehouse information includes the location information of multiple storage warehouses, and the security factor information includes the location information and maximum effective distance of multiple threat sources;

[0026] Based on the storage warehouse information and the security factor information, equivalent modeling is performed on multiple threat sources within the target planning area to determine the security equivalence height of the multiple storage warehouses, including:

[0027] Determine the threat level K of the threat source. ThreadLevel ;

[0028] The threat equivalence factor K of the corresponding threat source is calculated and determined based on the threat level. Thr :

[0029]

[0030]

[0031] Among them, K TohreadTttalLevel This indicates the total number of threat levels, with the highest threat level being 1. This represents the average equivalent height of threat sources in the target planning area. The average elevation of the target planning area is represented by τ′, which is a constant.

[0032] Based on the location information of the multiple storage warehouses, the location information of the multiple threat sources, and the corresponding threat equivalence factors, the security equivalence height of the multiple storage warehouses is determined as follows:

[0033]

[0034] Where Q represents the number of threat sources within the target planning area. This represents the threat value of the q-th threat source against the i-th storage repository;

[0035] The threat value of the q-th threat source against the i-th storage repository:

[0036]

[0037] Among them, R maxThis represents the maximum effective range of the q-th threat source. This represents the distance between the q-th threat source and the i-th storage warehouse;

[0038] The distance between the q-th threat source and the i-th storage repository:

[0039]

[0040] Where, x i ,y i Let x and y represent the x and y coordinates of the location information of the i-th storage warehouse, respectively. q ,y q These represent the horizontal and vertical coordinates in the location information of the q-th threat source, respectively.

[0041] Optionally, the time cost corresponding to multiple demands in the target planning area is determined based on the demand information, including:

[0042] Determine and adjust the required level of assurance K for the various requirements. RequestProportion The level of protection satisfies the following constraints:

[0043]

[0044] in, This indicates the level of protection corresponding to the j-th requirement. Let m represent the quantity of materials required for the j-th requirement, and m represent the number of requirements. This represents the amount of materials stored in the i-th storage warehouse, and n represents the number of storage warehouses;

[0045] Determine the demand level K for multiple requirements. RequestLevel And based on the aforementioned demand level K RequestLevel Calculate the demand equivalence factor K of the aforementioned demand. RequestLevelEquality :

[0046]

[0047] Among them, K RequestTotalLevel This indicates the total number of demand levels;

[0048] The time cost is calculated and determined based on the level of protection and the demand equivalence factor:

[0049] K CostRequestGuaranteen

[0050] =K RequestMount *K Requestproportion *K RequestLevelEquality

[0051] Among them, KCostRequestGuaranteen K represents the time cost. RequestMount K represents the amount of materials required for the stated demand. RequestProportion K represents the level of protection corresponding to the stated requirement. RequestLevelEquality This represents the equivalent factor of the stated demand.

[0052] Optionally, based on the time cost of the multiple storage repositories and the time cost of the multiple requirements, corresponding storage repositories are allocated sequentially for the multiple requirements to generate a configuration scheme, including:

[0053] Create a requirement array, in which multiple requirements are sorted in ascending order according to their respective time costs;

[0054] Based on the time cost corresponding to the first requirement in the requirement array and the space cost corresponding to the multiple storage warehouses, calculate the minimum requirement cost f(1) to satisfy the first requirement, and determine the configuration item assign[(1,θ1)] corresponding to the first requirement based on the storage warehouse θ1 corresponding to the minimum requirement cost f(1);

[0055] Starting from the second demand in the demand array, calculate the minimum demand cost F(β) to satisfy the first β demands sequentially, and then calculate the storage warehouse θ corresponding to the minimum demand cost F(β). β Determine the configuration item assign[(β,θ]] corresponding to the β-th requirement. β )];

[0056] The configuration scheme is determined based on the multiple configuration items corresponding to the multiple requirements.

[0057] Optionally, based on the time cost corresponding to the first demand in the demand array and the space cost corresponding to the multiple storage warehouses, the minimum demand cost f(1) for satisfying the first demand is calculated, including:

[0058] Starting from the i-th (i=1) storage warehouse, traverse the warehouse and compare the current material storage quantity of the i-th storage warehouse with the minimum requirement of the first requirement to determine whether the current material storage quantity meets the minimum requirement.

[0059] In response to the current material storage quantity satisfying the minimum demand, calculate the demand cost f(1) for the i-th storage warehouse to satisfy the first demand. i :

[0060]

[0061] Where, x i ,y iThe horizontal and vertical coordinates represent the location information of the i-th storage warehouse, respectively. These represent the horizontal and vertical coordinates of the center location information corresponding to the first requirement, respectively. Let represent the space cost of the i-th storage warehouse. The time cost of the first requirement is represented by k, where k is a constant factor.

[0062] In response to the current material storage quantity not meeting the minimum demand quantity, determine whether the traversal has been completed;

[0063] In response to the completion of the traversal, the minimum demand cost is selected from the corresponding demand costs of the multiple storage repositories:

[0064] F(1)=f(1)=min(f(1) i ), i∈[1,n]

[0065] Where n represents the number of storage warehouses in the target planning area;

[0066] In response to incomplete traversal, continue traversing the next storage repository.

[0067] Optionally, calculate the minimum demand cost F(β) to satisfy the first β terms of demand, including:

[0068] Based on the configuration item assign[(β-1,θ] corresponding to the first β-1 requirements β-1 ]] Calculate the minimum demand cost f(β) to satisfy the β-th demand. β-1 ;

[0069] Based on the minimum demand cost f(β) to satisfy the β-th demand. β-1 Calculate the minimum conditional cost F(β) to satisfy the first β terms. β-1 :

[0070]

[0071] Determine the θth β-1 Does the initial material storage capacity of each of the storage warehouses meet the minimum requirement of the β-th requirement?

[0072] Response to the θth β-1 The initial material storage capacity of each of the aforementioned storage warehouses does not meet the minimum requirement for the βth requirement. Determine the minimum requirement cost F(β) to meet the first β requirements:

[0073] F(β)=F(β) β-1

[0074] Where, F(β) β-1 This represents the minimum conditional cost;

[0075] Response to the θth β-1 The initial material storage capacity of each of the aforementioned storage warehouses satisfies the minimum requirement for the β-th requirement, calculated from the θ-th requirement. β-1 The cost of satisfying the βth requirement in each of the aforementioned storage warehouses

[0076] According to the aforementioned demand cost Calculation determines based on the γth β-1 The minimum conditional cost F(β) for each of the aforementioned storage warehouses. ′ :

[0077]

[0078] Determine the minimum demand cost F() that satisfies the first β terms:

[0079] F(β)=min(F(β) β-1 ,(β) ′ ).

[0080] In a second aspect, embodiments of this specification also provide a resource planning and allocation system, the system comprising:

[0081] The regional information acquisition module is used to acquire storage environment information within the target planning area. The storage environment information includes storage warehouse information, transportation condition information, and security factor information.

[0082] The space cost calculation module is used to calculate and determine the space cost of multiple storage warehouses in the target planning area based on the storage environment information.

[0083] The time cost calculation module is used to acquire demand information in the target planning area, and determine the time cost of multiple demands in the target planning area based on the demand information; and

[0084] The planning and configuration module is used to allocate corresponding storage warehouses to the multiple requirements in sequence according to the time cost of the multiple storage warehouses and the time cost of the multiple requirements in order to generate a configuration scheme.

[0085] The resource planning and allocation system is used to execute the resource planning and allocation method described in the first aspect.

[0086] In a third aspect, embodiments of this specification also provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the resource planning and configuration method as described in the first aspect.

[0087] As can be seen from the above, the resource planning and configuration method, system, and electronic device provided by one or more optional embodiments of this specification have the following beneficial technical effects:

[0088] Based on the storage environment information in the target planning area, equivalent modeling is performed to determine the spatial cost of multiple storage warehouses in the target planning area. Similarly, based on the demand information in the target planning area, equivalent modeling is performed to determine the time cost of multiple demands. Finally, a configuration scheme is determined based on the spatial and time costs. This approach involves equivalent modeling of various environmental constraints in the planning area and overlaying them with actual geographic data to form spatial data representing the constraints. It also involves equivalent modeling of the various demands to be met into time data. Using these two types of data as decision factors to establish a resource scheduling model for resource planning and configuration, this approach can generate configuration schemes that comprehensively consider multiple constraints, closely relate to the actual environment, and simultaneously meet multiple demands, resulting in more rational and efficient resource planning and utilization. Attached Figure Description

[0089] The features and advantages of the invention will be more clearly understood by referring to the accompanying drawings, which are schematic and should not be construed as limiting the invention in any way. In the drawings:

[0090] Figure 1 This specification illustrates a resource planning and configuration method provided by one or more optional embodiments;

[0091] Figure 2 This diagram illustrates the elevation of the target planning area in a resource planning and allocation method provided by one or more optional embodiments of this specification.

[0092] Figure 3 This diagram illustrates a method for calculating and determining spatial costs in a resource planning and allocation method provided by one or more optional embodiments of this specification;

[0093] Figure 4 This diagram illustrates a method for calculating and determining the equivalent transport height in a resource planning and allocation method provided by one or more optional embodiments of this specification;

[0094] Figure 5 This diagram illustrates a method for calculating and determining a safe equivalent height in a resource planning and allocation method provided by one or more optional embodiments of this specification;

[0095] Figure 6 This diagram illustrates a method for calculating and determining time costs in a resource planning and allocation method provided by one or more optional embodiments of this specification;

[0096] Figure 7This illustration shows a method for allocating corresponding storage warehouses to generate a configuration scheme in a resource planning and configuration method provided by one or more optional embodiments of this specification;

[0097] Figure 8 This specification shows a schematic diagram of the structure of a resource planning and configuration system provided by one or more optional embodiments;

[0098] Figure 9 This specification illustrates a schematic diagram of the structure of a resource planning and configuration electronic device provided by one or more alternative embodiments. Detailed Implementation

[0099] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0100] In daily life and production, the safe and rational planning and allocation of storage resources is essential. In many cases, resource planning and allocation only considers a few constraints such as time and economic costs for specific needs. However, in actual production and life applications, it is necessary to consider a variety of complex constraints and simultaneously meet multiple needs. For example, emergency resource allocation for disasters and epidemics requires consideration of safety factors and actual geographical environmental factors in addition to time and economic costs. Resource allocation under complex needs such as military support requires consideration of geographical conditions, transportation conditions, safety factors, time costs, and the level of protection, while also comprehensively planning and allocating resources to meet various different needs. Faced with such complex scenarios, some related technologies can only selectively select a few key conditions for constraint, and the effects of multiple constraints are simply linearly superimposed. The resulting configuration scheme is not closely related to actual environmental factors, cannot scientifically fit the actual application scenario, and has poor practical application results.

[0101] To address the aforementioned issues, the purpose of this specification's embodiments is to propose a resource planning and allocation method. This method involves equivalently modeling various environmental constraints within the planning area and overlaying them with actual geographic environmental data to form spatial data representing the constraints. It also involves equivalently modeling the various requirements to be met into temporal data. These two types of data are then used as decision factors to establish a resource scheduling model for resource planning and allocation. This approach generates allocation schemes that comprehensively consider multiple constraints, closely relate to the actual environment, and simultaneously meet multiple requirements, resulting in more rational and efficient resource planning and utilization.

[0102] In view of the above objectives, in a first aspect, embodiments of this specification provide a resource planning and deployment method.

[0103] like Figure 1 As shown, one or more optional embodiments of this specification provide a resource planning and deployment method, including:

[0104] S1: Obtain storage environment information within the target planning area, including storage warehouse information, transportation condition information, and security factor information.

[0105] The storage warehouse information may include the location information of multiple storage warehouses within the target planning area and the corresponding storage material quantity of each storage warehouse. The transportation condition information may include road types, road conditions, and road location data of multiple roads within the target planning area. The security factor information may include threat type information, threat center location information, and maximum threat radius of one or more threat sources existing within the target planning area. The threat sources may be various disaster locations in disaster scenarios, epidemic locations in epidemic scenarios, or various threat elements in military support issues.

[0106] The storage environment information may also include the geographical elevation information of the target planning area. Figure 2 This is an elevation diagram of the target planning area, where each grid point represents its location and elevation. For example... Figure 2 As shown, multiple storage warehouses and threat sources exist within the target planning area. Figure 2 Point O represents the center point of the threat source. The circular area defined by the maximum threat radius with point O as the center is the range that the threat source can influence.

[0107] S2: Calculate and determine the space cost of multiple storage warehouses in the target planning area based on the storage environment information.

[0108] To accurately describe the potential constraints of various storage environment factors on resource planning issues within the target planning area, equivalent modeling can be performed based on specific storage environment information to determine the spatial costs of multiple storage warehouses within the target planning area.

[0109] Figure 3 This is a schematic diagram illustrating a method for calculating and determining the space cost of multiple storage warehouses in the target planning area based on the storage environment information. Figure 3 As shown, in some optional embodiments of this specification, the space cost of multiple storage warehouses in the target planning area can be calculated and determined based on the storage environment information in real time using the following methods:

[0110] S301: Based on the storage warehouse information and the transportation condition information, perform equivalent modeling of the transportation conditions within the target planning area to determine the equivalent transportation height of multiple storage warehouses.

[0111] The storage warehouse information includes the location information of multiple storage warehouses, and the transportation condition information includes road types and road vectors, wherein the road vectors are used to represent the location information of multiple roads. The generated transportation equivalent height, obtained by performing equivalent modeling of the transportation conditions within the target planning area, is used to characterize the degree to which the multiple storage warehouses are affected by actual storage environment factors.

[0112] Figure 4 This is a schematic diagram illustrating a method for equivalent modeling of transportation conditions within the target planning area. For example... Figure 4 As shown in some optional embodiments of this specification, based on the storage warehouse information and the transportation condition information, equivalent modeling of the transportation conditions within the target planning area is performed to determine the equivalent transportation height of multiple storage warehouses, including the following steps:

[0113] S401: Determine the transport condition parameter K based on the road type. Type .

[0114] The transport condition parameter K Type The values ​​are set according to the actual road type. For example, the transport condition parameter for air route roads can be set to -1, for expressways to -0.6, for railways to -0.6, for ordinary roads to -0.3, and for other road conditions to 0.

[0115] It is understood that the specific values ​​of the transport condition parameters corresponding to different road types can be flexibly modified and adjusted.

[0116] S402: Calculate and determine the transportation condition equivalence factor K based on the aforementioned transportation condition parameters. Tra :

[0117]

[0118]

[0119] in, This represents the equivalent height of the target planning area. The average elevation of the target planning area is represented by τ, which is a constant. The average elevation can be determined based on the elevation data of the target planning area.

[0120] S403: Determine the shortest distance to the road vector based on the location information of the multiple storage warehouses, and determine the shortest distance based on the transportation condition equivalence factor K. Tra The equivalent height for transportation is determined by calculating the shortest distance:

[0121]

[0122] Where, ΔH i Let represent the transport equivalent height of the i-th storage warehouse, and dis(i) represent the shortest distance between the i-th storage warehouse and the road vector.

[0123] The shortest distance refers to the shortest distance within the corresponding horizontal projection plane of the target planning area. The shortest distance dis(i) between the i-th storage warehouse and the road vector can be calculated and determined based on the location information of the i-th storage warehouse and the road vectors of multiple roads in the target planning area.

[0124] S302: Based on the storage warehouse information and the security factor information, perform equivalent modeling on multiple threat sources within the target planning area to determine the security equivalence height of the multiple storage warehouses.

[0125] The security factor information includes the location information and maximum effective distance of multiple threat sources. The security equivalent height, determined by equivalent modeling of the threat sources, is used to characterize the degree of threat impact on the multiple storage warehouses.

[0126] Figure 5 This is a schematic diagram illustrating a method for equivalent modeling of multiple threat sources within the target planning area. (Example) Figure 5 As shown, in some optional embodiments, based on the storage warehouse information and the security factor information, multiple threat sources within the target planning area are equivalently modeled to determine the security equivalence height of the multiple storage warehouses, including the following steps:

[0127] S501: Determine the threat level K of the threat source. ThreadLevel ;

[0128] S502: Calculate and determine the corresponding threat equivalence factor K of the threat source based on the threat level. Thr :

[0129]

[0130]

[0131] Among them, K ThreadTotalLevel This indicates the total number of threat levels, with the highest threat level being 1. The lower the threat level, the higher the corresponding value. This represents the average equivalent height of threat sources in the target planning area. τ represents the average elevation of the target planning area. ′ It is a constant;

[0132] S503: Determine the security equivalence height of the multiple storage warehouses based on the location information of the multiple threat sources and the corresponding threat equivalence factors:

[0133]

[0134] Where Q represents the number of threat sources within the target planning area. This represents the threat value of the q-th threat source against the i-th storage repository.

[0135] The threat value of the q-th threat source against the i-th storage repository:

[0136]

[0137] Among them, R max This represents the maximum effective range of the q-th threat source. This represents the distance between the q-th threat source and the i-th storage repository.

[0138] The distance between the q-th threat source and the i-th storage repository:

[0139]

[0140] Where, x i ,y i Let x and y represent the x and y coordinates of the location information of the i-th storage warehouse, respectively. q ,y q These represent the horizontal and vertical coordinates in the location information of the q-th threat source, respectively.

[0141] S303: Calculate and determine the space cost based on the transport equivalent height and the safety equivalent height:

[0142]

[0143] in, Let ΔH represent the space cost of the i-th storage warehouse. i This represents the transport equivalent height of the i-th storage warehouse. This represents the security equivalent height of the i-th storage warehouse.

[0144] The transportation equivalent height and the safety equivalent height are used to characterize the degree to which the storage warehouse is affected by the actual transportation environment, road conditions, and threat sources. Taking both factors into account, these factors are used as the space cost of the storage warehouse.

[0145] S3: Obtain the demand information in the target planning area, and determine the time cost of multiple demands in the target planning area based on the demand information;

[0146] The demand information includes the types, content, and location information of multiple demands within the target planning area. For example... Figure 2 As shown, the various requirements are distributed at different locations within the target planning area. The time costs can be determined by equivalent modeling of these requirements based on the requirement information; these time costs characterize and measure the cost required to satisfy each requirement.

[0147] Figure 6 This is a schematic diagram illustrating a method for determining the time cost corresponding to multiple demands in the target planning area based on the aforementioned demand information. (Example) Figure 6 As shown, in some optional embodiments, determining the time cost corresponding to multiple demands in the target planning area based on the demand information includes:

[0148] S601: Determine and adjust the required level of assurance K for the various requirements. RequestProportion K RequestPripirtion ≤1. When the guarantee level is 1, it means that the corresponding requirement must be fully met.

[0149] The level of protection satisfies the following constraints:

[0150]

[0151] in, This indicates the level of protection corresponding to the j-th requirement. Let m represent the quantity of materials required for the j-th requirement, and m represent the number of requirements.

[0152] This represents the minimum amount of materials required for the j-th requirement, which can satisfy the j-th requirement to a certain extent.

[0153] Let represent the material storage capacity of the i-th storage warehouse, and n represent the number of storage warehouses. The above constraint means that the amount of materials required to meet multiple needs cannot exceed the total material storage capacity of the multiple storage warehouses.

[0154] S602: Determine the requirement level K for the multiple requirements. RequestLevelAnd based on the aforementioned demand level K RequestLevel Calculate the demand equivalence factor K of the aforementioned demand. RequestLevelEquality :

[0155]

[0156] Among them, K RequestTotalLevel This represents the total number of demand levels. Wherein demand level K... RequestLevel It can be set and adjusted according to the actual needs and the urgency of the needs.

[0157] S603: Calculate and determine the time cost based on the level of protection and the demand equivalence factor:

[0158] K CostRequestGuaranteen

[0159] =K RequestMount *K RequestProportion *K RequestLevelEquality

[0160] Among them, K CostRequestGuaranteen K represents the time cost. RequestMount K represents the amount of materials required for the stated demand. RequestProportion K represents the level of protection corresponding to the stated requirement. RequestLevelEquality This represents the equivalent factor of the stated demand.

[0161] S4: Based on the time cost of the multiple storage warehouses and the time cost of the multiple requirements, allocate corresponding storage warehouses to the multiple requirements in sequence to generate a configuration scheme.

[0162] Figure 7 This is a schematic diagram illustrating the method for generating a configuration scheme for the root. For example... Figure 7 As shown, in some optional embodiments, based on the time cost of the multiple storage warehouses and the time cost of the multiple requirements, corresponding storage warehouses are sequentially allocated to the multiple requirements to generate a configuration scheme, including the following steps:

[0163] S701: Create a requirement array, in which multiple requirements are sorted in ascending order according to their respective time costs.

[0164] The multiple requirements can be sorted according to the time cost to construct a requirement array of length m.

[0165] S702: Based on the time cost corresponding to the first requirement in the requirement array and the space cost corresponding to the multiple storage warehouses, calculate the minimum requirement cost f(1) to satisfy the first requirement and determine the configuration item assign[(1,θ1)] corresponding to the first requirement based on the storage warehouse θ1 corresponding to the minimum requirement cost f(1).

[0166] After determining the minimum cost f(1) to satisfy the first requirement, the storage warehouse corresponding to the minimum cost f(1) can be determined to satisfy the first requirement. Thus, the configuration item assign[(1,θ1)] can be determined. The configuration item assign[(1,θ1)] indicates that the first requirement is satisfied by storage warehouse θ1, where storage warehouse θ1 represents the storage warehouse corresponding to the minimum cost f(1).

[0167] After determining the configuration item assign[(1,θ1)], it is also necessary to update the current material storage quantity in the storage warehouse θ1.

[0168] As a specific embodiment, the minimum demand cost f(1) for satisfying the first demand can be calculated based on the time cost corresponding to the first demand in the demand array and the space cost corresponding to the multiple storage warehouses. This can be achieved by the following steps:

[0169] Step (1-1): Starting from the i-th storage repository, traverse the multiple storage repositories.

[0170] The initial value of i is set to 1, meaning that the traversal starts from the first storage warehouse.

[0171] Step (1-2): Compare the current material storage quantity of the i-th storage warehouse with the minimum demand quantity of the first requirement to determine whether the current material storage quantity meets the minimum demand quantity.

[0172] That is, to judge Whether it is valid or not.

[0173] in, To meet the minimum requirement for the first requirement, This represents the current material storage quantity of the i-th storage warehouse.

[0174] Step (1-3): In response to the current material storage quantity meeting the minimum demand, the i-th storage warehouse can be selected to meet the first demand.

[0175] Calculate the demand cost f(1) for satisfying the first requirement by the i-th storage warehouse. i :

[0176]

[0177] Where, x i ,y i The horizontal and vertical coordinates represent the location information of the i-th storage warehouse, respectively. These represent the horizontal and vertical coordinates of the center location information corresponding to the first requirement, respectively. Let represent the space cost of the i-th storage warehouse. The time cost represents the first requirement, and k is a constant factor. The constant factor k is used to adjust the spatial cost and the time cost to the same order of magnitude.

[0178] Step (1-4): In response to the current material storage quantity not meeting the minimum demand, the i-th storage warehouse cannot meet the first requirement. At this time, it is determined whether the traversal is complete, that is, whether the i-th storage warehouse is the last warehouse among the multiple warehouses.

[0179] Steps (1-5): In response to the completion of the traversal, the i-th storage repository is the last repository. The demand costs corresponding to all storage repositories that can satisfy the first requirement have been calculated.

[0180] Select the minimum demand cost from the corresponding demand costs of the multiple storage warehouses:

[0181] F(1)=f(1)=min(f(1) i ), i∈[1,n]

[0182] Where n represents the number of storage warehouses in the target planning area.

[0183] Steps (1-6): In response to incomplete traversal, continue traversing the next storage repository.

[0184] Assign the value i = i + 1, and return to step (1-2).

[0185] S703: Starting from the second demand in the demand array, calculate the minimum demand cost F() to satisfy the first β demands sequentially, and then calculate the storage warehouse θ corresponding to the minimum demand cost F(). β Determine the configuration item assign[(,θ] corresponding to the β-th requirement. β )).

[0186] After determining the minimum demand cost F() to satisfy the first β requirements, it can be determined that the storage warehouse corresponding to the minimum demand cost F() is used to satisfy the β-th requirement. Therefore, the configuration item assign[(,θ] can be determined. β Configuration item assign[(,θ β )] indicates that the storage warehouse θ βTo satisfy the βth requirement, the storage warehouse θ β This refers to the storage warehouse corresponding to the minimum demand cost F().

[0187] In determining the configuration item assign[(,θ β After that, the storage warehouse θ also needs to be set up. β Update the current inventory of materials.

[0188] As a specific example, the minimum requirement cost F() to satisfy the first β requirements can be calculated using the following steps:

[0189] Step (2-1): Based on the configuration item assigned[(-1,θ] corresponding to the first β-1 requirements β-1 ]] Calculate the minimum demand cost f(β) to satisfy the β-th demand. β-1 .

[0190] The minimum cost to satisfy the β-th requirement can be calculated using the same method as calculating the minimum cost corresponding to the first requirement. Multiple storage warehouses are traversed, and the cost to satisfy the β-th requirement by each of the multiple storage warehouses is determined, from which the minimum value is selected.

[0191] Step (2-2): Based on the minimum demand cost f(β) to satisfy the β-th demand. β-1 Calculation determines that it satisfies

[0192] The minimum condition cost is the sum of the minimum demand cost corresponding to the first β-1 demands and the minimum condition cost corresponding to the βth demand.

[0193] Step (2-3): Determine the θ-th... β-1 Does the initial material storage capacity of each of the storage warehouses meet the minimum requirement of the βth requirement?

[0194] Step (2-4): In response to the θth β-1 The initial material storage capacity of each of the aforementioned storage warehouses does not meet the minimum requirement of the βth requirement.

[0195] In this case, the storage warehouse that satisfies requirement β-1 can no longer satisfy requirement β. The storage warehouse corresponding to requirement β-1 is independent of the storage warehouse corresponding to requirement β.

[0196] Therefore, the minimum demand cost F() that satisfies the first β terms can be determined:

[0197] F(β)=(β) β-1

[0198] Where, F(β)β-1 This represents the minimum conditional cost.

[0199] Step (2-5): In response to the θth β-1 The initial material storage capacity of each of the aforementioned storage warehouses satisfies the minimum requirement for the β-th requirement. In this case, the storage warehouse that satisfies the β-1-th requirement can be used to satisfy the β-th requirement.

[0200] The storage warehouse that satisfies the (β-1)th requirement is the θth requirement. β-1 The storage warehouse is calculated by the θth... β-1 The cost of satisfying the βth requirement in each of the aforementioned storage warehouses

[0201]

[0202] in, Representing the θth β-1 The horizontal and vertical coordinates of the location information of the storage warehouse. The x and y coordinates represent the location information of the center of demand corresponding to the βth demand, respectively.

[0203] Represents the θth β-1 The space cost of the aforementioned storage warehouse;

[0204] Let k represent the time cost of the βth requirement, where k is a constant factor.

[0205] Step (2-6): Based on the stated demand cost Calculation determined based on the θth β-1 The minimum conditional cost F(β) for each of the aforementioned storage warehouses. ′ :

[0206]

[0207] Determine the minimum demand cost F() that satisfies the first β terms:

[0208] F(β)=min(F(β) β-1 ,(β) ′ ).

[0209] S704: Determine the configuration scheme based on the multiple configuration items corresponding to the multiple requirements.

[0210] Multiple configuration items corresponding to the multiple requirements mentioned above:

[0211] assign[(1,θ1)],assign[(2,θ2)],…,assign[(m,θ m )]

[0212] Together they constitute the configuration scheme.

[0213] The demand array contains multiple demands sorted in ascending order of time cost. In determining the configuration items corresponding to these demands, starting with the first item, the minimum demand cost F() satisfying the first β demands is determined sequentially, and a corresponding storage repository is identified to define the configuration item. This ensures that in the final determined configuration scheme, the storage repositories recorded for multiple configuration items are those that minimize the demand cost. Therefore, resource planning and configuration according to this scheme guarantees the minimum demand cost and the highest resource utilization.

[0214] The resource planning and allocation method describes a process that determines the spatial cost of multiple storage warehouses in a target planning area by performing equivalent modeling based on storage environment information, and determines the time cost of multiple demands by performing equivalent modeling based on demand information in the target planning area. Based on these spatial and time costs, a configuration scheme is then determined. This approach involves equivalent modeling of various environmental constraints in the planning area and overlaying them with actual geographic data to form spatial data representing the constraints. It also involves equivalent modeling of the various demands to be met into time data. Using these two types of data as decision factors, a resource scheduling model is established for resource planning and allocation. This method generates a configuration scheme that comprehensively considers multiple constraints, closely relates to the actual environment, and simultaneously meets multiple demands, resulting in more rational and efficient resource planning and utilization.

[0215] It should be noted that the methods of one or more embodiments of this specification can be executed by a single device, such as a computer or server. The methods of this embodiment can also be applied in a distributed scenario, where multiple devices cooperate to complete the task. In such a distributed scenario, one of these devices may execute only one or more steps of the methods of one or more embodiments of this specification, and the multiple devices will interact with each other to complete the method described.

[0216] It should be noted that the above description describes specific embodiments of this specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims may be performed in a different order than that shown in the embodiments and still achieve the desired results. Furthermore, the processes depicted in the drawings do not necessarily require the specific or sequential order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0217] Based on the same inventive concept, and corresponding to any of the above embodiments, this specification also provides a resource planning and allocation method system.

[0218] refer to Figure 8 The resource planning and allocation system includes:

[0219] The regional information acquisition module is used to acquire storage environment information within the target planning area. The storage environment information includes storage warehouse information, transportation condition information, and security factor information.

[0220] The space cost calculation module is used to calculate and determine the space cost of multiple storage warehouses in the target planning area based on the storage environment information.

[0221] The time cost calculation module is used to acquire demand information in the target planning area, and determine the time cost of multiple demands in the target planning area based on the demand information; and

[0222] The planning and configuration module is used to allocate corresponding storage warehouses to the multiple requirements in sequence according to the time cost of the multiple storage warehouses and the time cost of the multiple requirements in order to generate a configuration scheme.

[0223] In a resource planning and configuration system provided by one or more optional embodiments of this specification, the space cost calculation module is further configured to: perform equivalent modeling of transportation conditions within the target planning area based on the storage warehouse information and the transportation condition information, to determine the transportation equivalent height of multiple storage warehouses; perform equivalent modeling of multiple threat sources within the target planning area based on the storage warehouse information and the security factor information, to determine the security equivalent height of multiple storage warehouses; and calculate and determine the space cost based on the transportation equivalent height and the security equivalent height according to the following formula:

[0224]

[0225] in, Let ΔH represent the space cost of the i-th storage warehouse. i This represents the transport equivalent height of the i-th storage warehouse. This represents the security equivalent height of the i-th storage warehouse.

[0226] In a resource planning and allocation system provided by one or more optional embodiments of this specification, the spatial cost calculation module is further configured to determine the transport condition parameter K based on the road type. Type ;

[0227] The equivalent factor K of transportation conditions is calculated using the following formula. Tra :

[0228]

[0229]

[0230] in, This represents the equivalent height of the target planning area. The average elevation of the target planning area is represented by τ, which is a constant.

[0231] Based on the location information of the multiple storage warehouses, the shortest distance to the road vector is determined, and the equivalent transport height is calculated according to the following formula:

[0232]

[0233] Where, ΔH i Let represent the transport equivalent height of the i-th storage warehouse, and dis(i) represent the shortest distance between the i-th storage warehouse and the road vector.

[0234] In a resource planning and allocation system provided by one or more optional embodiments of this specification, the spatial cost calculation module is further configured to determine the threat level K of the threat source. ThreadLevel ;

[0235] The corresponding threat equivalence factor K is calculated using the following formula. Thr :

[0236]

[0237]

[0238] Among them, K ThreadTotalLevel This indicates the total number of threat levels, with the highest threat level being 1. This represents the average equivalent height of threat sources in the target planning area. The average elevation of the target planning area is represented by τ′, which is a constant.

[0239] The security equivalent height of the multiple storage warehouses is calculated and determined according to the following formula:

[0240]

[0241] Where Q represents the number of threat sources within the target planning area. This represents the threat value of the q-th threat source against the i-th storage repository;

[0242] The threat value of the q-th threat source against the i-th storage repository:

[0243]

[0244] Among them, R max This represents the maximum effective range of the q-th threat source. This represents the distance between the q-th threat source and the i-th storage warehouse;

[0245] The distance between the q-th threat source and the i-th storage repository:

[0246]

[0247] Where, x i ,y i Let x and y represent the x and y coordinates of the location information of the i-th storage warehouse, respectively. q ,y q These represent the horizontal and vertical coordinates in the location information of the q-th threat source, respectively.

[0248] In a resource planning and allocation system provided by one or more optional embodiments of this specification, the time cost calculation module is further configured to determine and adjust the guarantee level K that the multiple requirements need to achieve. RequestProportion The level of protection satisfies the following constraints:

[0249]

[0250] in, This indicates the level of protection corresponding to the j-th requirement. Let m represent the quantity of materials required for the j-th requirement, and m represent the number of requirements. This represents the amount of materials stored in the i-th storage warehouse, and n represents the number of storage warehouses;

[0251] Determine the demand level K for multiple requirements. RequestLevel The demand equivalence factor K is calculated and determined according to the following formula. RequestLevelEquality :

[0252]

[0253] Among them, K RequestTotalLevel This indicates the total number of demand levels;

[0254] And the time cost is calculated and determined according to the following formula:

[0255] K CostRequestGuaranteen

[0256] =K RequestMount *K RequestProportion *K RequestLevelEquality

[0257] Among them, K CostRequestGuaranteenK represents the time cost. RequestMount K represents the amount of materials required for the stated demand. RequestProportion K represents the level of protection corresponding to the stated requirement. RequestLevelEquality This represents the equivalent factor of the stated demand.

[0258] In a resource planning and configuration system provided by one or more optional embodiments of this specification, the planning and configuration module is further configured to create a demand array, wherein multiple demands in the demand array are sorted in ascending order of their respective time costs; calculate the minimum demand cost f(1) to satisfy the first demand based on the time cost corresponding to the first demand in the demand array and the space cost corresponding to the multiple storage warehouses, and determine the configuration item assign[(1,θ1)] corresponding to the first demand based on the storage warehouse θ1 corresponding to the minimum demand cost f(1); starting from the second demand in the demand array, calculate the minimum demand cost F(β) to satisfy the first β demands sequentially, and determine the configuration item assign[(1,θ1)] corresponding to the storage warehouse θ1 corresponding to the minimum demand cost F(β). β Determine the configuration item assign[(β,θ]] corresponding to the β-th requirement. β The configuration scheme is determined based on the multiple configuration items corresponding to the multiple requirements.

[0259] In a resource planning and configuration system provided by one or more optional embodiments of this specification, the planning and configuration module is further configured to traverse from the i-th (i=1) storage warehouse, compare the current material storage quantity of the i-th storage warehouse with the minimum requirement of the first requirement to determine whether the current material storage quantity meets the minimum requirement; when the current material storage quantity meets the minimum requirement, calculate the requirement cost f(1) for the i-th storage warehouse to meet the first requirement according to the following formula. i :

[0260]

[0261] Where, x i ,y i The horizontal and vertical coordinates represent the location information of the i-th storage warehouse, respectively. These represent the horizontal and vertical coordinates of the center location information corresponding to the first requirement, respectively. Let represent the space cost of the i-th storage warehouse. The time cost of the first requirement is represented by k, where k is a constant factor.

[0262] If the current material storage quantity does not meet the minimum requirement, determine whether to complete the traversal;

[0263] If the traversal is complete, the planning and configuration module is further configured to select the minimum demand cost F(1) = f(1) = min(f(1)) from the corresponding demand costs of the multiple storage warehouses. i ), i∈[1,n], where n represents the number of storage warehouses in the target planning area;

[0264] If the traversal is not completed, the planning and configuration module is also used to continue traversing the next storage warehouse.

[0265] In a resource planning and configuration system provided by one or more optional embodiments of this specification, the planning and configuration module is further configured to assign[(β-1,θ]] based on the configuration item corresponding to the first β-1 requirements. β-1 ]] Calculate the minimum demand cost f(β) to satisfy the β-th demand. β-1 According to the following formula, based on the minimum demand cost f(β) to satisfy the β-th demand, β-1 Calculate the minimum conditional cost F(β) to satisfy the first β terms. β-1 :

[0266]

[0267] Determine the θth β-1 Does the initial material storage capacity of each of the storage warehouses meet the minimum requirement of the β-th requirement?

[0268] At the θ β-1 When the initial material storage quantity of the storage warehouse does not meet the minimum requirement of the βth requirement, the minimum requirement cost F(β) to meet the first β requirements is determined:

[0269] F(β)=F(β) β-1

[0270] Where, F(β) β-1 This represents the minimum conditional cost;

[0271] At the θ β-1 When the initial material storage capacity of each of the aforementioned storage warehouses meets the minimum requirement of the β-th requirement, the calculation is performed based on the θ-th requirement. β-1 The cost of satisfying the βth requirement in each of the aforementioned storage warehouses

[0272] The following formula is used to calculate and determine the value based on θ. β-1 The minimum conditional cost F(β)′ of each of the aforementioned storage warehouses:

[0273]

[0274] And determine the minimum demand cost F(β) to satisfy the first β terms of demand:

[0275] F(β)=min(F(β) β-1 ,F(β)′).

[0276] For ease of description, the above apparatus is described in terms of function, divided into various modules. Of course, when implementing one or more embodiments of this specification, the functions of each module can be implemented in one or more software and / or hardware.

[0277] The apparatus described above is used to implement the corresponding methods in the foregoing embodiments and has the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0278] Figure 9 This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.

[0279] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0280] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0281] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.

[0282] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0283] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.

[0284] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0285] The electronic devices described above are used to implement the corresponding methods in the foregoing embodiments and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0286] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this disclosure also provides a non-transitory computer-readable storage medium storing computer instructions for causing the computer to execute the resource planning and configuration method as described in any of the above embodiments.

[0287] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0288] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the resource planning and configuration method as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0289] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, it can include the processes of the embodiments of the methods described above. The storage medium can be a magnetic disk, optical disk, read-only memory (ROM), random access memory (RAM), flash memory, hard disk drive (HDD), or solid-state drive (SSD), etc.; the storage medium can also include combinations of the above types of memory.

[0290] The systems, devices, modules, or units described in the above embodiments can be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, a computer can be, for example, a personal computer, laptop computer, cellular phone, camera phone, smartphone, personal digital assistant, media player, navigation device, email device, game console, tablet computer, wearable device, or any combination of these devices.

[0291] For ease of description, the above devices are described separately by function as various units. Of course, in implementing this application, the functions of each unit can be implemented in one or more software and / or hardware.

[0292] Those skilled in the art will understand that embodiments of this specification can be provided as methods, systems, or computer program products. Therefore, this specification may take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this specification may 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.

[0293] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0294] The various embodiments in this specification are described in a progressive manner. Similar or identical parts between embodiments can be referred to interchangeably. Each embodiment focuses on describing the differences from other embodiments. In particular, the system embodiments are basically similar to the method embodiments, so the description is relatively simple; relevant parts can be referred to the descriptions in the method embodiments.

[0295] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this disclosure (including the claims) is limited to these examples; within the framework of this disclosure, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of one or more embodiments of this specification as described above, which are not provided in detail for the sake of brevity.

[0296] Although this disclosure has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.

[0297] One or more embodiments of this specification are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of one or more embodiments of this specification should be included within the scope of protection of this disclosure.

Claims

1. A resource planning and allocation method, characterized in that, The method includes: Obtain storage environment information within the target planning area, including storage warehouse information, transportation condition information, and security factor information; The spatial cost of multiple storage warehouses in the target planning area is calculated and determined based on the storage environment information, including: performing equivalent modeling of the transportation conditions in the target planning area based on the storage warehouse information and the transportation condition information to determine the transportation equivalent height of the multiple storage warehouses; performing equivalent modeling of multiple threat sources in the target planning area based on the storage warehouse information and the security factor information to determine the security equivalent height of the multiple storage warehouses; and calculating and determining the spatial cost based on the transportation equivalent height and the security equivalent height. in, Indicates the first The space cost of the aforementioned storage warehouses, Indicates the first The equivalent transport height of the storage warehouse. Indicates the first The security equivalent height of the aforementioned storage warehouse; Obtain demand information within the target planning area, and determine the corresponding time costs for multiple demands within the target planning area based on the demand information, including: determining and adjusting the required level of assurance for multiple demands. The level of protection satisfies the following constraints: in, Indicates the first j The corresponding level of protection for each requirement Indicates the first j The required amount of materials for the aforementioned needs, Indicates the number of items required. Indicates the first i The material storage capacity of each of the aforementioned storage warehouses. Indicates the number of storage warehouses; Determine the requirement levels for multiple requirements. And based on the aforementioned demand level Calculate the demand equivalence factor of the aforementioned demand. : in, This indicates the total number of demand levels; The time cost is calculated and determined based on the level of protection and the demand equivalence factor: in, This represents the time cost. This indicates the amount of materials required for the stated demand. This indicates the level of protection corresponding to the stated requirement. This represents the demand equivalence factor corresponding to the stated demand; Based on the time cost of the various storage repositories and the time cost of the various requirements, corresponding storage repositories are allocated to the various requirements in sequence to generate a configuration scheme.

2. The method according to claim 1, characterized in that, The storage warehouse information includes the location information of multiple storage warehouses, and the transportation condition information includes road type and road vector; Based on the storage warehouse information and the transportation condition information, an equivalent model is performed on the transportation conditions within the target planning area to determine the equivalent transportation height of multiple storage warehouses, including: Determine transport condition parameters based on the road type. ; The equivalent factor of transportation conditions is calculated and determined based on the aforementioned transportation condition parameters. : in, This represents the equivalent height of the target planning area. This represents the average elevation of the target planning area. It is a constant; The shortest distance to the road vector is determined based on the location information of the multiple storage warehouses, and the transportation condition equivalence factor is used. The equivalent height for transportation is determined by calculating the shortest distance: in, Indicates the first The equivalent transport height of the storage warehouse. Indicates the first The shortest distance between the storage warehouse and the road vector.

3. The method according to claim 1, characterized in that, The storage warehouse information includes the location information of multiple storage warehouses, and the security factor information includes the location information and maximum effective distance of multiple threat sources. Based on the storage warehouse information and the security factor information, equivalent modeling is performed on multiple threat sources within the target planning area to determine the security equivalence height of the multiple storage warehouses, including: Determine the threat level of the threat source. ; The threat equivalence factor of the corresponding threat source is calculated based on the threat level. : in, This indicates the total number of threat levels, with the highest threat level being 1. This represents the average equivalent height of threat sources in the target planning area. This represents the average elevation of the target planning area. It is a constant; Based on the location information of the multiple storage warehouses, the location information of the multiple threat sources, and the corresponding threat equivalence factors, the security equivalence height of the multiple storage warehouses is determined as follows: in, This indicates the number of threat sources within the target planning area. Indicates the first The aforementioned threat sources target the first Threat values ​​for the aforementioned storage warehouses; No. The aforementioned threat sources target the first Threat values ​​for the aforementioned storage warehouses: in, Indicates the first The maximum effective range of each of the aforementioned threat sources, Indicates the first The aforementioned threat sources and the first The distance between the aforementioned storage warehouses; No. The aforementioned threat sources and the first Distance between the aforementioned storage warehouses: in, They represent the first The horizontal and vertical coordinates of the location information of the storage warehouses They represent the first The horizontal and vertical coordinates of the location information of the aforementioned threat sources.

4. The method according to claim 1, characterized in that, Based on the time cost of the various storage repositories and the time cost of the various requirements, corresponding storage repositories are allocated sequentially for the various requirements to generate a configuration scheme, including: Create a requirement array, in which multiple requirements are sorted in ascending order according to their respective time costs; Based on the time cost corresponding to the first requirement in the requirement array and the space cost corresponding to each of the multiple storage warehouses, calculate the minimum requirement cost to satisfy the first requirement. And based on minimum demand cost The corresponding storage warehouse Determine the configuration items corresponding to the first requirement. ; Starting from the second requirement in the requirement array, calculate the requirements to be satisfied sequentially. Minimum demand cost of a demand item And based on minimum demand cost The corresponding storage warehouse Determine the first Configuration items corresponding to each requirement ; The configuration scheme is determined based on the multiple configuration items corresponding to the multiple requirements.

5. The method according to claim 4, characterized in that, Based on the time cost corresponding to the first requirement in the requirement array and the space cost corresponding to each of the multiple storage warehouses, calculate the minimum requirement cost to satisfy the first requirement. ,include: From the The traversal of the aforementioned storage warehouse begins, and the first... The current material storage quantity of each of the storage warehouses is compared with the minimum requirement of the first requirement to determine whether the current material storage quantity meets the minimum requirement. In response to the current material storage quantity meeting the minimum demand quantity, calculate the quantity calculated by the first... The cost of satisfying the first requirement for each of the aforementioned storage warehouses : in, They represent the first The horizontal and vertical coordinates of the location information of the storage warehouse. These represent the horizontal and vertical coordinates of the center location information corresponding to the first requirement, respectively. Indicates the first The space cost of the aforementioned storage warehouses, This represents the time cost of the first requirement. It is a constant factor; In response to the current material storage quantity not meeting the minimum demand quantity, determine whether the traversal has been completed; In response to the completion of the traversal, the minimum demand cost is selected from the corresponding demand costs of the multiple storage repositories: in, This indicates the number of storage warehouses in the target planning area; In response to incomplete traversal, continue traversing the next storage repository.

6. The method according to claim 4, characterized in that, Calculate before Minimum demand cost of a demand item ,include: Based on the previous The configuration items corresponding to the item requirements Calculate the condition that satisfies the first... Minimum demand cost of a demand item ; According to satisfying the... Minimum demand cost of a demand item Calculate and determine before Minimum conditional cost of a requirement : Judge the first Does the initial material storage capacity of the storage warehouse satisfy the requirements of the first storage warehouse? The minimum required quantity for a given item; In response to the The initial material storage capacity of the storage warehouse does not meet the requirements of the first... The minimum required quantity for each item is determined to satisfy the preceding conditions. The minimum cost of the required item : in, This represents the minimum conditional cost; In response to the The initial material storage capacity of the storage warehouses meets the requirements of the first... The minimum demand quantity for item 1 is calculated from the first item. The storage warehouse satisfies the first... The cost of demand for a item : According to the aforementioned demand cost Calculation determined based on the first Minimum condition cost of the storage warehouse : Before determining that the condition is met The minimum cost of the required item : 。 7. A resource planning and allocation system, characterized in that, The system includes: The regional information acquisition module is used to acquire storage environment information within the target planning area. The storage environment information includes storage warehouse information, transportation condition information, and security factor information. The space cost calculation module is used to calculate and determine the space cost of multiple storage warehouses in the target planning area based on the storage environment information. The time cost calculation module is used to acquire demand information in the target planning area, and determine the time cost of multiple demands in the target planning area based on the demand information; and The planning and configuration module is used to allocate corresponding storage warehouses to the multiple requirements in sequence according to the time cost of the multiple storage warehouses and the time cost of the multiple requirements in order to generate a configuration scheme. The spatial cost calculation module is further configured to: perform equivalent modeling of transportation conditions within the target planning area based on the storage warehouse information and the transportation condition information to determine the equivalent transportation height of multiple storage warehouses; perform equivalent modeling of multiple threat sources within the target planning area based on the storage warehouse information and the security factor information to determine the equivalent security height of multiple storage warehouses; and calculate and determine the spatial cost based on the equivalent transportation height and the equivalent security height. in, Indicates the first The space cost of the aforementioned storage warehouses, Indicates the first The equivalent transport height of the storage warehouse. Indicates the first The security equivalent height of the aforementioned storage warehouse; The time cost calculation module is further used to determine and adjust the level of guarantee required for multiple requirements. The level of protection satisfies the following constraints: in, Indicates the first j The corresponding level of protection for each requirement Indicates the first j The required amount of materials for the aforementioned needs, Indicates the number of items required. Indicates the first i The material storage capacity of each of the aforementioned storage warehouses. Indicates the number of storage warehouses; Determine the requirement levels for multiple requirements. And based on the aforementioned demand level Calculate the demand equivalence factor of the aforementioned demand. : in, This indicates the total number of demand levels; The time cost is calculated and determined based on the level of protection and the demand equivalence factor: in, This represents the time cost. This indicates the amount of materials required for the stated demand. This indicates the level of protection corresponding to the stated requirement. This represents the equivalent factor of the stated demand.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1 to 6.

Images