Resource allocation method, electronic equipment and readable medium

Abstract

The invention relates to the technical field of data processing, and discloses a resource allocation method, electronic equipment and a readable medium. The resource allocation method comprises the following steps: determining a target resource demand quantity of each demand bin in a demand bin group and an inventory quantity of an invoked bin corresponding to each demand bin in the demand bin group; based on the optimization target, the constraint condition, the inventory of the call-out bins corresponding to the demand bins of the demand bin group and the target resource demand quantity, a target allocation mode is determined, the inventory of the call-out bins corresponding to the demand bins of the demand bin group is allocated into the corresponding demand bins through the target allocation mode, the optimization target comprises at least one optimization sub-target, and the optimization sub-target comprises at least one optimization sub-target. The optimization sub-targets comprise the allocation amount, the allocation frequency, the allocation area and the allocation distance. According to the scheme, the allocation mode for allocating the inventory from the call-out bin to the demand bin can be determined based on the optimization target, so that the allocation mode meets diversified business requirements, and the resource scheduling efficiency is improved.

Description

Technical Field

[0001] This application relates to the technical field of data processing, and particularly relates to a resource allocation method, an electronic device, and a readable medium. Background Art

[0002] Allocation refers to the process of transferring resources from the outbound warehouse to the demand warehouse, which is used to adjust the inventory surplus and shortage of resources in different warehouses, so as to meet the needs of sales and logistics distribution. Whether for the outbound warehouse or the demand warehouse, the long-term retention of inventory resources will reduce the resource turnover rate and result in low resource utilization.

[0003] In order to improve the resource turnover rate and resource utilization rate, inventory sharing can be established between warehouses (sites) in different regions, so as to realize the orderly flow of inventory and improve the inventory turnover rate and resource utilization rate. In an inventory flow network composed of multiple warehouses, the decision of which outbound warehouse to transfer inventory from and which demand warehouse to transfer the inventory to determines the scheduling efficiency, and it is necessary to effectively allocate the resources of each warehouse to reduce unnecessary waste. Summary of the Invention

[0004] To improve the inventory turnover rate and resource utilization rate, an embodiment of this application provides a resource allocation method, an electronic device, and a readable medium.

[0005] In a first aspect, an embodiment of this application provides a resource allocation method, which includes: determining the target resource demand of each demand warehouse in the demand warehouse group and the inventory of the outbound warehouse corresponding to each demand warehouse in the demand warehouse group; determining a target allocation method based on the optimization target, the inventory of the outbound warehouse corresponding to each demand warehouse in the demand warehouse group, and the target resource demand, and transferring the inventory of the outbound warehouse corresponding to each demand warehouse in the demand warehouse group to the corresponding demand warehouse through the target allocation method, where the optimization target includes at least one optimization sub-target, and the optimization sub-targets include allocation quantity, allocation times, allocation area, and allocation distance.

[0006] In an embodiment of this application, the user can select at least one optimization sub-target as the optimization target according to the actual application scenario, so as to determine the target allocation method for transferring the inventory from the outbound warehouse to the demand warehouse based on the optimization target, making the allocation method meet diverse business requirements, improving the resource scheduling efficiency, and achieving more efficient utilization of inventory resources.

[0007] In a possible implementation, based on the optimization objective, the inventory levels of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group, and the target resource demand, determine the target transfer method, and transfer the inventory of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group to the corresponding demand warehouse through the target transfer method, including: obtaining the constraint conditions; based on the constraint conditions, the optimization objective, the inventory levels of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group, and the target resource demand, determine the target transfer method, and transfer the inventory of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group to the corresponding demand warehouse through the target transfer method.

[0008] In an embodiment of the present application, a set of feasible solutions that meet the inventory levels of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group and the target resource demand can be first screened based on the constraint conditions. Then, the user can combine the current application scenario to determine the optimization sub-objective, and screen out the target transfer method that meets the current application scenario from the set of feasible solutions based on the optimization sub-objective, thereby improving the transfer efficiency of resources.

[0009] In a possible implementation, the constraint conditions include: the transfer-in quantity of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group transferred to the corresponding demand warehouse is less than or equal to the demand of the demand warehouse; the transfer-out quantity of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group transferred out of the corresponding demand warehouse is less than or equal to the adjustable inventory quantity of the transfer-out warehouse.

[0010] In a possible implementation, based on the constraint conditions, the optimization objective, the inventory levels of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group, and the target resource demand, determine the target transfer method, including: based on the constraint conditions, the inventory levels of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group, and the target resource demand, screen the array composed of the inventory levels of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group and the target resource demand to obtain a set of target arrays; obtain the priorities of the optimization sub-objectives in the optimization objective; based on the priorities of the optimization sub-objectives in the optimization objective, the objective function of the optimization objective, and the set of target arrays, determine the target transfer method, and transfer the inventory of the transfer-out warehouses corresponding to each demand warehouse in the demand warehouse group to the corresponding demand warehouse through the target transfer method.

[0011] In a possible implementation, based on the priorities of the optimization sub-objectives in the optimization objective, the objective function of the optimization objective, and the set of target arrays, determine the target transfer method, including: based on the objective function of the optimization sub-objective with the first priority, process the set of target arrays to obtain a first set of transfer arrays; based on the objective function of the optimization sub-objective with the second priority, process the first set of transfer arrays to obtain a second set of transfer arrays, where the first priority is higher than the second priority; determine the target transfer method based on the second set of transfer arrays.

[0012] In a possible implementation, the optimization sub-goal corresponding to the first priority is the allocation quantity. Based on the objective function of the optimization sub-goal corresponding to the first priority, the target array set is processed to obtain the first allocation array set, including: processing the target array set based on the objective function of the allocation quantity to obtain the first array set, where the first array set includes at least one array, and each array in the array set corresponds to an allocation method; determining the array with the largest sum of elements in the first array set as the first array, where the first array includes at least one array; obtaining the first allocation array set based on the first array.

[0013] In a possible implementation, the optimization sub-goal corresponding to the second priority is the allocation times. Based on the objective function of the optimization sub-goal corresponding to the second priority, the first allocation array set is processed to obtain the second allocation array set, including: determining the first coefficient of each element in the first allocation array set according to the allocation quantity corresponding to each element in the first allocation array set; establishing the second array set based on the first allocation array set and the first coefficient of each element in the first allocation array set; determining the array with the smallest sum of the corresponding values of each element in the second array set as the second array, where the second array includes at least one array; obtaining the second allocation array set based on the second array.

[0014] In a possible implementation, the method for determining the first coefficient includes: corresponding to the allocation quantity corresponding to the element being greater than 0, determining the first coefficient as the first value; corresponding to the allocation quantity corresponding to the element being equal to 0, determining the first coefficient as the second value.

[0015] In a possible implementation, the optimization sub-goal corresponding to the second priority is the allocation area. Based on the objective function of the optimization sub-goal corresponding to the second priority, the first allocation array set is processed to obtain the second allocation array set, including: obtaining the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group; determining the second coefficient of each element in the first allocation array set based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group; establishing the third array set based on the first allocation array set and the first coefficient and the second coefficient of each element in the first allocation array set, where the third array set includes at least one array, and each array in the array set corresponds to an allocation method; determining the array with the largest sum of elements in the third array set as the third array, where the third array includes at least one array; obtaining the second allocation array set based on the third array.

[0016] In a possible implementation, the method for determining the second coefficient includes: corresponding to determining that the demand warehouse and the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group belong to the same region based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, determining the second coefficient as a third value; corresponding to determining that the demand warehouse and the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group belong to different regions based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, determining the second coefficient as a fourth value.

[0017] In a possible implementation, corresponding to the optimization sub-goal of the second priority being the transfer distance, based on the objective function of the optimization sub-goal of the second priority, processing the first transfer array set to obtain a second transfer array set, including: obtaining the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group; determining the third coefficient of each element in the first array set based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group; establishing a fourth array set based on the first array set and the first coefficient and the third coefficient of each element in the first array set; determining the array with the smallest sum of the corresponding values of each element in the fourth array set as the fourth array, where the fourth array includes at least one array; obtaining the second transfer array set based on the fourth array.

[0018] In a possible implementation, the method for determining the third coefficient includes: determining the distance between the demand warehouse and the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, as the third coefficient.

[0019] In some embodiments, the transfer quantity is the first priority, the transfer times is the second priority, the transfer region is the third priority, and the transfer distance is the fourth priority.

[0020] In a possible implementation, the optimization goal includes financial indicators, and the financial indicators include cost indicators and revenue indicators, and the cost indicators include logistics cost indicators and management cost indicators.

[0021] In a second aspect, an embodiment of the present application provides an electronic device, including: a memory for storing instructions executed by one or more processors of the electronic device, and a processor, which is one of the one or more processors of the electronic device, for implementing any one of the resource transfer methods provided in the first aspect and various possible implementations of the first aspect.

[0022] In a third aspect, an embodiment of the present application provides a readable medium, on which instructions are stored, and when the instructions are executed on an electronic device, the electronic device is enabled to implement any one of the resource transfer methods provided in the first aspect and various possible implementations of the first aspect. Description of the Drawings

[0023] Figure 1 According to an embodiment of the present application, a schematic diagram of a multi-site transfer method is shown;

[0024] Figure 2 According to an embodiment of the present application, a flowchart of a resource transfer method is shown;

[0025] Figure 3 According to an embodiment of the present application, a flowchart of determining a candidate transfer-out site is shown;

[0026] Figure 4 According to an embodiment of the present application, a schematic diagram of another multi-site transfer method is shown;

[0027] Figure 5 According to an embodiment of the present application, a schematic diagram of the structure of an electronic device 10 is shown. Detailed implementation manners

[0028] First, the technical terms related to the embodiments of the present application are introduced below.

[0029] Decision variable: It represents a factor that the decision maker can control, that is, a controllable input, and is an unknown variable in the model that needs to be determined by solving the model.

[0030] Environmental variable: It represents an external factor that the decision maker cannot control, that is, a non-controllable input. Its specific value needs to be determined during the data collection stage and is represented as a constant in the model.

[0031] Objective function: It refers to a mathematical equation that describes the goal of the problem.

[0032] Constraint condition: It refers to a mathematical expression (equality or inequality) that describes the restrictive and limiting factors in the problem.

[0033] The illustrative embodiments of the present application include, but are not limited to, a resource transfer method, an electronic device, and a readable medium.

[0034] It can be understood that the electronic devices applicable to the technical solution of this application can also be referred to as terminals, user equipment (UE), mobile stations (MS), mobile terminals (MT), etc.; they can also be mobile phones, smart TVs, wearable devices, tablets (Pad), computers with wireless transceiver functions, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, etc. The embodiments of the present invention do not impose any restrictions on the specific types of electronic devices.

[0035] It can be understood that the inventory financing network includes multiple demand warehouses and transfer-out warehouses within a certain area. In an inventory financing network composed of multiple demand warehouses and transfer-out warehouses (or multiple sites or multiple outlets), when one or more demand warehouses have a need to replenish inventory and at the same time one or more transfer-out warehouses can provide inventory, there will be many optional allocation plans, and it is necessary to quickly and accurately determine the optimal financing plan that meets the relevant objectives and constraints, so as to accelerate the inventory turnover rate in the inventory financing network.

[0036] It can be understood that a transfer-out warehouse can only ship goods to a designated demand warehouse. Similarly, a demand warehouse can only transfer goods from a designated transfer-out warehouse. As Figure 1 shown, the transfer-out warehouses include Site 1 and Site 3, and the demand warehouses include Site 2, Site 4, and Site 5. The inventory of Site 1 can only be transferred into Site 2 and Site 4, and the inventory of Site 3 can only be transferred into Site 2 and Site 5. Similarly, Site 2 can only transfer inventory from Site 1 and Site 3, Site 5 can only transfer inventory from Site 3, and Site 4 can only transfer inventory from Site 1.

[0037] In some embodiments, in order to accelerate the inventory turnover rate, the available inventory quantity and the recorded outstanding inventory quantity of goods in each warehouse can be obtained from the requested resource library, and then based on the available inventory quantity and the recorded outstanding inventory quantity, the recommended quantity of recorded outstanding allocation and the recommended quantity of non-recorded outstanding allocation of the goods can be determined. According to the flow route of the goods between the warehouses, the recommended quantity of recorded outstanding allocation and the recommended quantity of non-recorded outstanding allocation of the goods on the same route are merged, and an allocation plan is generated based on the merged recommended quantity of recorded outstanding allocation and the recommended quantity of non-recorded outstanding allocation.

[0038] However, the above-mentioned requested resource repository has a tree-like network structure. The inventory shortage requirements of lower-level warehouses can only be met by fixed and single upper-level warehouses, and inventory cannot be allocated from other upper-level warehouses, resulting in unreasonable resource allocation.

[0039] To solve the above problems, an embodiment of the present application provides a resource allocation method. The resource allocation method includes: determining a resource allocation method for allocating resources from a transfer-out warehouse to a demand warehouse according to an optimization goal; wherein, at least one optimization sub-goal among the transfer quantity, transfer times, transfer area, and transfer distance can be used as the optimization goal according to the actual application scenario.

[0040] For example, based on the inventory financing network, determine the target resource demand of each demand warehouse in the demand warehouse group and the corresponding transfer-out warehouse for each demand warehouse, and then determine the optimization goal according to the application scenario. According to the optimization goal, the target resource demand, and the inventory of the corresponding transfer-out warehouse for each demand warehouse in the demand warehouse group, determine the transfer method for transferring the inventory from the transfer-out warehouse to the corresponding demand warehouse. In this way, the user can select at least one optimization sub-goal as the optimization goal according to the actual application scenario, realize determining the transfer method for transferring the inventory from the transfer-out warehouse to the demand warehouse based on the optimization goal, make the transfer method meet diverse business requirements, realize more efficient utilization of inventory resources, and improve the resource scheduling efficiency.

[0041] It can be understood that the inventory financing network of the present application is a network structure that supports many-to-many. The demand of one demand warehouse can be met by multiple transfer-out warehouses. Similarly, one transfer-out warehouse can also allocate inventory to multiple demand warehouses.

[0042] The resource allocation method provided by the embodiment of the present application will be described in detail below. The resource allocation method of the embodiment of the present application is applied to the above-mentioned electronic device. Among them, Figure 2 shows a schematic diagram of a resource allocation method according to an embodiment of the present application. The resource allocation method includes:

[0043] 101: Determine the structure and relevant basic information of the inventory financing network.

[0044] In the embodiment of the present application, the inventory financing network is composed of multiple transfer-out warehouses (or inventory storage points, network points) and demand warehouses (or demand points, network points), and may include peer supply chain network nodes that transfer to each other, two-level supply chain network nodes that transfer to each other, peer supply chain network nodes with one-way transfer, and two-level supply chain network nodes with one-way transfer. Among them, the peer level can be a first-level network composed of multiple demand warehouses, and the demand warehouses can transfer to each other. The two-level supply chain network can be a two-level supply chain network composed of multiple demand warehouses and transfer-out warehouses.

[0045] In some embodiments, the demand warehouse can be a store, and the transfer-out warehouse can be a front-end warehouse. Among them, the front-end warehouse is the warehouse closest to consumers.

[0046] In the embodiments of the present application, an inventory financing network can be generated in multiple scenarios, such as in the scenario of sales outlets for vegetable products. The inventory financing network can be a network composed of multiple multi-level regional warehouses, or a multi-level after-sales service network.

[0047] In the embodiments of the present application, on the basis of determining the inventory financing network structure, relevant basic information affecting inventory financing can also be collected. The relevant basic information includes: (1) The distances, transportation times, and transportation costs between each network point, for example, the distance between demand warehouses and the distance between demand warehouses and transfer-out warehouses. (2) The adjustable transfer relationships and priority transfer relationships between each network point (station); for example, the inventory of station 1 can only be transferred into station 2 and station 4, the inventory of station 3 can only be transferred into station 2 and station 5, station 1 gives priority to transferring inventory to station 2, and station 3 gives priority to transferring inventory to station 5. (3) The set of transferable products, and data such as their cost prices or selling prices. (4) Factors for judging whether the inventory goods are transferable, such as whether the inventory goods are convenient for transportation, the freshness period or shelf life of the inventory goods, the profit margin of the inventory goods, etc.

[0048] Thus, by constructing an inventory financing network that supports many-to-many, the front warehouse can transfer goods to the store, and the stores can also transfer goods to each other, increasing the ways of inventory transfer and improving the inventory turnover rate.

[0049] 102: Collect and filter inventory financing requirements, and screen out transferable network points.

[0050] In the embodiments of the present application, the method for collecting and filtering inventory financing requirements includes: reporting requirements and updating inventory status in real time according to the actual situation of each network point in the inventory financing network, such as updating the current sales situation and inventory situation of the network point, and then judging whether it is necessary to temporarily transfer goods from nearby network points to avoid out-of-stock situations.

[0051] In the embodiments of the present application, the inventory financing network can refer to the set of transferable products, retain the transfer requirements of the products within the set, and record information such as the demand party, the demand quantity, and the demand timeliness requirements.

[0052] In the embodiments of the present application, when it is determined that there is an inventory financing requirement, transferable network points can be screened. The method for screening transferable network points is as Figure 3 shown, including: First, according to the transfer matching relationship, screen out the potential transfer-out network points (transfer-out warehouses) of the demand party (demand warehouse); second, evaluate the transferable inventory quantity of each potential transfer-out network point, and finally, determine the network points with a transferable quantity > 0 as the candidate transfer-out network points.

[0053] Among them, the transferable matching relationship means that the transfer-out warehouse can only transfer goods to the designated demand warehouse, and similarly, the demand warehouse can only transfer goods from the designated transfer-out warehouse. Figure 1 As shown, the outbound warehouse includes site 1 and site 3, and the demand warehouse includes site 2, site 4, and site 5. The inventory of site 1 can only be transferred to site 2 and site 4, and the inventory of site 3 can only be transferred to site 2 and site 5. Similarly, site 2 can transfer inventory from site 1 and site 3, site 5 can only transfer inventory from site 3, and site 4 can only transfer inventory from site 1.

[0054] In the embodiment of the present application, the evaluation method of the available inventory includes: first, calculating the maximum available inventory of the transfer station, wherein the maximum available inventory = current inventory - safety inventory - expected amount to be used. Then, adding restriction conditions on the basis of the maximum available inventory, such as inventory affected by sluggish time, storage period, etc. Finally, setting a screening rule, and filtering the maximum available inventory after adding restriction conditions based on the screening rule, such as filtering the inventory with sluggish time exceeding a certain threshold as the available inventory.

[0055] In other embodiments, the method for evaluating the available inventory may be determined based on the actual application scenario, and this application does not limit this.

[0056] It is understood that during the allocation process, the available products should meet the availability principle, that is, the performance of the products is intact and available or saleable when they are delivered to the demander. In some embodiments, during the process of setting the screening rules, the availability principle of the products to be allocated can also be added to the restriction conditions.

[0057] 103: Determine whether there is inventory that can be transferred. If the result of the determination is yes, go to 104: determine the goal and constraint conditions of financing optimization; if the result of the determination is no, return to 102: collect and filter inventory financing needs, and select outlets that can be transferred.

[0058] 104: Determine the optimization objectives and constraints of the integration.

[0059] In the embodiment of the present application, the optimization objectives can be divided into the following three categories, each of which includes at least one optimization sub-objective. The user can select at least one optimization sub-objective in the optimization objective according to the actual application scenario.

[0060] The first type of optimization goal: optimization goals related to cost or benefit, for example, optimization sub-goals include setting cost minimization goals or benefit maximization goals. Among them, costs include transfer costs, which include logistics costs and management costs; benefits include transfer benefits, which = benefits generated by meeting demand - transfer costs.

[0061] The second type of optimization objective: The optimization objective related to the satisfaction rate, that is, for all inventory financing requirements, try to meet or reach a certain percentage as much as possible. For example, the optimization sub-objective is that the inventory quantity transferred into the demand warehouse is as close to 100% as possible.

[0062] The third type of optimization objective: Other types of optimization objectives. For example, the optimization sub-objectives include transfer quantity, transfer times, transfer area, and transfer distance; to achieve the fastest financing time based on transfer quantity, transfer times, transfer area, and transfer distance, give priority to short-distance transfers based on transfer distance, give priority to transfers within the same area based on transfer area, and when the demand at one network point can be transferred from multiple network points based on transfer times, try to make the whole order as much as possible, and the number of split orders is as small as possible when the whole order cannot be made.

[0063] In the embodiment of the present application, during the process of transferring resources from the transfer-out warehouse to the demand warehouse, the constraints of the transfer should also be met. The constraints include: the transferred-in quantity does not exceed the demand of the demander, the transferred-out quantity does not exceed the adjustable inventory quantity of the supplier, and goods can only be transferred from the designated network points (or satisfy the adjustable transfer matching relationship).

[0064] Among them, the requirement that goods can only be transferred from the designated network points means that the transfer-out warehouse can only transfer inventory to the demand warehouse that meets the corresponding relationship. For example, as Figure 4 shown, Transferor 1 can transfer resources to Demander 1, Demander 2, and Demander 4; Transferor 2 can transfer resources to Demander 1 and Demander 3; Transferor 3 can transfer resources to Demander 2 and Demander 4.

[0065] 105: Build a financing optimization model, solve the optimal solution, and output the transfer plan.

[0066] In the embodiment of the present application, a financing optimization model can be built based on the structure of the inventory financing network, so as to determine the transfer plan based on the adjustable network points and the financing optimization model when the inventory financing requirements are obtained.

[0067] It can be understood that the financing optimization model includes multiple mathematical models. The following introduces some mathematical models in the financing optimization model in combination with Table 1.

[0068] It can be understood that x ij represents the transfer quantity from Factory i to Factory j, and [x ij represents the array (or matrix) composed of transfer quantities. represents the total transfer quantity corresponding to an array with n rows and m columns in the transfer network composed of n transfer-out network points and m demand network points. In the transfer network composed of n transfer-out network points and m demand network points, multiple arrays with n rows and m columns constitute the first array set. z1 is the target value of Target 1, which can be obtained through Find the value of z1 corresponding to each array. maxz1 indicates that the optimization direction of objective 1 is to find the maximum value. Through maxz1, the first array corresponding to the allocation method with the largest allocation volume in the first array set can be determined.

[0069] When allocating inventory from factory i to factory j, g(x ij ) = 1; when factory i does not allocate inventory to factory j, g(x ij ) = 0. In the allocation network composed of n supply points and m demand points, the total number of allocations corresponding to an n×m array. In the allocation network composed of n supply points and m demand points, multiple n×m arrays constitute the second array set. z2 is the objective value of objective 2, which can be obtained through Find the value of z2 corresponding to each array. minz2 indicates that the optimization direction of objective 2 is to find the minimum value. Through minz2, the second array corresponding to the allocation method with the fewest allocation times in the second array set can be determined.

[0070] When factory i and factory j belong to the same region, R ij = 1; when factory i and factory j belong to different regions, R ij = 0. Represents the same-region allocation corresponding to an n×m array in the allocation network composed of n supply points and m demand points. In the allocation network composed of n supply points and m demand points, multiple n×m arrays constitute the third array set. z4 is the objective value of objective 3, which can be obtained through Find the value of z4 corresponding to each array. maxz4 indicates that the optimization direction of objective 3 is to find the maximum value. Through maxz4, the third array corresponding to the allocation method with the most same-region allocation times in the third array set can be determined.

[0071] dist ij Represents the distance between factory i and factory j. Represents the total allocation distance corresponding to an n×m array in the allocation network composed of n supply points and m demand points. In the allocation network composed of n supply points and m demand points, multiple n×m arrays constitute the fourth array set. z5 is the objective value of objective 4, which can be obtained through Find the value of z5 corresponding to each array. minz5 indicates that the optimization direction of objective 4 is to find the minimum value. Through minz5, the fourth array corresponding to the allocation method with the shortest allocation distance in the fourth array set can be determined.

[0072] Table 1

[0073]

[0074] In some embodiments, the target priority order is Target 1 > Target 2 > Target 3 > Target 4, that is, the allocation quantity is the first priority, the allocation times is the second priority, the allocation area is the third priority, and the allocation distance is the fourth priority. In some other embodiments, the target priority order is Target 2 > Target 1 > Target 3 > Target 4. It can be understood that the priority order of the targets can be set according to the actual scenario.

[0075] In the embodiments of the present application, the constraint condition can represent that the incoming quantity does not exceed the demand quantity of the demander through formula (1), and represent that the outgoing quantity does not exceed the adjustable inventory quantity of the supplier through formula (2). Among them, D j represents the demand quantity of the demander; S i represents the adjustable inventory quantity of the supplier.

[0076]

[0077]

[0078] In the embodiments of the present application, based on the constraint conditions, the inventory quantity of the outgoing warehouse corresponding to each demand warehouse in the demand warehouse group, and the target resource demand quantity, the array composed of the inventory quantity of the outgoing warehouse corresponding to each demand warehouse in the demand warehouse group and the target resource demand quantity can be screened to obtain the target array set; obtain the priority ranking of each optimization sub-goal in the optimization goal; based on the priority ranking of each optimization sub-goal in the optimization goal, the optimization goal, the allocation parameters, and the target array set, determine the target allocation method, and transfer the inventory of the outgoing warehouse corresponding to each demand warehouse in the demand warehouse group to the corresponding demand warehouse through the target allocation method.

[0079] Taking the demand network points including Network Point A, Network Point B, and Network Point C, and the outgoing network points being Network Point D, Network Point E, and Network Point F as an example, the above Table 1 will be introduced below.

[0080] As shown in Table 2, the demand quantity D j of Network Point A is 100 kg, the demand quantity D j of Network Point B is 120 kg, and the demand quantity D j of Network Point C is 200 kg.

[0081] Table 2

[0082] Demand network points <![CDATA[Demand D j > Network point A 100 Network point B 120 Network point C 200

[0083] As shown in Table 3, the supply quantity S i of Network Point D is 60 kg, the supply quantity S i of Network Point E is 300 kg, and the supply quantity S iis 50 kg.

[0084] Table 3

[0085] Adjustable network points <![CDATA[Supply S i > Network point D 60 Network point E 300 Network point F 50

[0086] As shown in Table 4, network point A and network point D are in the same area, network point A and network point C are in the same area as network point E, and network point B and network point C are in the same area as network point F.

[0087] Table 4

[0088] <![CDATA[Whether in the same region R ij > Network point A Network point B Network point C Network point D 1 0 0 Network point E 1 0 1 Network point F 0 1 1

[0089] As shown in Table 5, the distance between network point A and network point D is 20 km, the distance between network point A and network point E is 30 km, and the distance between network point A and network point F is 20 km; the distance between network point B and network point D is 30 km, the distance between network point B and network point E is 50 km, and the distance between network point B and network point F is 40 km; the distance between network point C and network point D is 40 km, the distance between network point C and network point E is 25 km, and the distance between network point C and network point F is 35 km.

[0090] Table 5

[0091] <![CDATA[Distance between network points dist ij > Network point A Network point B Network point C Network point D 20 30 40 Network point E 30 50 25 Network point F 20 40 35

[0092] After inputting the data in the above Tables 2 to 5 into the mathematical model including Target 1, Target 2, Target 3, and Target 4 as shown in Table 1, the output results as shown in Table 6 can be obtained, that is, 60 goods are transferred from network point D to network point B, 100 goods are transferred from network point E to network point A, 200 goods are transferred from network point E to network point C, and 50 goods are transferred from network point F to network point B. That is, the total transfer quantity is 410, the number of transfer orders is 4, and the unmet demand is 10.

[0093] Table 6

[0094] Distance between network points Network point A Network point B Network point C Network point D 0 60 0 Network point E 100 0 200 Network point F 0 50 0

[0095] The process of obtaining the output results as shown in Table 6 is introduced below. It can be understood that the goods transferred from network points D, E, and F to network points A, B, and C can be represented as an array as shown in formula (3), where x DA represents the transfer inventory from factory D to factory A, x EA represents the transfer inventory from factory E to factory A, and so on, which will not be elaborated here. It can be understood that in each array, the elements x DA 、x EA 、x FA 、x DB 、x EB 、x FB 、x DC 、x EC, x FC The sizes are not necessarily the same, and may include multiple 3-row and 3-column arrays.

[0096]

[0097]

[0098]

[0099]

[0100]

[0101] Then, determine maxz1 in the array set corresponding to z1; determine minz2 in the array set corresponding to z2; determine maxz4 in the array set corresponding to z4; determine minz5 in the array set corresponding to z5.

[0102] In some embodiments, if the optimization objective includes Objective 1, then the first array corresponding to maxz1 can be determined, and the transfer method corresponding to the first array can be used as the target transfer method, so as to transfer as many materials as possible from the transfer-out warehouse during the transfer process.

[0103] In some embodiments, if the optimization objective includes Objective 2, then the second array corresponding to minz2 can be determined, and the transfer method corresponding to the second array can be used as the target transfer method, so as to minimize the number of transfer times during the transfer process.

[0104] In some embodiments, if the optimization objective includes Objective 3, then the third array corresponding to maxz4 can be determined, and the transfer method corresponding to the third array can be used as the target transfer method, so as to maximize the number of transfer times within the same region during the transfer process.

[0105] In some embodiments, if the optimization objective includes Objective 4, then the fourth array corresponding to minz5 can be determined, and the transfer method corresponding to the fourth array can be used as the target transfer method, so as to minimize the transfer distance during the transfer process.

[0106] In the embodiments of the present application, if the optimization objective includes at least one optimization sub-objective, then according to the priorities of the optimization sub-objectives, the optimal solution corresponding to the optimization sub-objective with the highest priority can be determined first, and then in the optimal solutions that satisfy the highest priority objective, the optimal solution that satisfies the optimization sub-objective of the next priority level can be determined until the optimal solution of the last optimization sub-objective is determined, and the final optimal solution is used as the target optimal solution.

[0107] In the embodiments of the present application, the transfer quantity can be set as the first priority, the transfer times as the second priority, the transfer area as the third priority, and the transfer distance as the fourth priority. In some other embodiments, the transfer quantity can be set as the second priority, the transfer times as the third priority, the transfer area as the fourth priority, and the transfer distance as the first priority. In some other embodiments, the transfer quantity can be set as the third priority, the transfer times as the fourth priority, the transfer area as the first priority, and the transfer distance as the second priority.

[0108] First, taking the optimization objective including two optimization sub-objectives as an example, the method for determining the target transfer method will be introduced.

[0109] For example, if the optimization objective includes Objective 1 and Objective 2, then in the feasible solutions of all objective functions, the first array corresponding to maxz1 can be determined, and then the fifth array that satisfies minz2 can be determined from the first array. The transfer method corresponding to the fifth array is used as the target transfer method, so that under the premise of transferring as many materials as possible from the transfer-out warehouse, the transfer times are as few as possible.

[0110] For example, if the optimization objective includes Objective 1 and Objective 3, then in the feasible solutions of all objective functions, the first array corresponding to maxz1 can be determined, and then the sixth array that satisfies maxz4 can be determined from the first array. The transfer method corresponding to the sixth array is used as the target transfer method, so that under the premise of transferring as many materials as possible from the transfer-out warehouse, the transfer times within the same area are as many as possible.

[0111] For example, if the optimization objective includes Objective 1 and Objective 4, then in the feasible solutions of all objective functions, the first array corresponding to maxz1 can be determined, and then the seventh array that satisfies minz5 can be determined from the first array. The transfer method corresponding to the seventh array is used as the target transfer method, so that under the premise of transferring as many materials as possible from the transfer-out warehouse, the transfer distance is as short as possible.

[0112] If the optimization objective includes Objective 2 and Objective 3, then in the feasible solutions of all objective functions, the second array corresponding to minz2 can be determined, and then the eighth array that satisfies maxz4 can be determined from the second array. The transfer method corresponding to the eighth array is used as the target transfer method, so that under the premise of minimizing the transfer times during the transfer process, the transfer times within the same area are as many as possible.

[0113] For example, if the optimization objective includes Objective 2 and Objective 4, then in the feasible solutions of all objective functions, the second array corresponding to minz2 can be determined, and then the ninth array that satisfies minz5 can be determined from the second array. The transfer method corresponding to the ninth array is used as the target transfer method, so that under the premise of minimizing the transfer times during the transfer process, the transfer distance is as short as possible.

[0114] For example, if the optimization objectives include Objective 3 and Objective 4, then among the feasible solutions of all objective functions, the third array corresponding to maxz4 can be determined, and then the tenth array that satisfies minz5 can be determined from the third array. The allocation method corresponding to the tenth array is used as the target allocation method, so that the allocation distance is as short as possible on the premise that the number of allocations within the same region is as large as possible.

[0115] Taking the optimization objectives including 3 optimization sub-objectives as an example, the method for determining the target allocation method will be introduced below.

[0116] For example, if the optimization objectives include Objective 1, Objective 2, and Objective 3, then among the feasible solutions of all objective functions, the first array corresponding to maxz1 can be determined, and then the fifth array that satisfies minz2 can be determined from the first array. The eleventh array that satisfies maxz4 can be determined from the fifth array. The allocation method corresponding to the eleventh array is used as the target allocation method, so that the number of allocations within the same region is as large as possible on the premise that as many materials as possible are transferred out of the transfer-out warehouse and the number of allocations is as small as possible.

[0117] For example, if the optimization objectives include Objective 1, Objective 2, and Objective 4, then among the feasible solutions of all objective functions, the first array corresponding to maxz1 can be determined, and then the fifth array that satisfies minz2 can be determined from the first array. The twelfth array that satisfies minz5 can be determined from the fifth array. The allocation method corresponding to the twelfth array is used as the target allocation method, so that the allocation distance is as short as possible on the premise that as many materials as possible are transferred out of the transfer-out warehouse and the number of allocations is as small as possible.

[0118] For example, if the optimization objectives include Objective 1, Objective 3, and Objective 4, then among the feasible solutions of all objective functions, the first array corresponding to maxz1 can be determined, and then the sixth array that satisfies maxz4 can be determined from the first array. The thirteenth array that satisfies minz5 can be determined from the sixth array. The allocation method corresponding to the thirteenth array is used as the target allocation method, so that the allocation distance is as short as possible on the premise that as many materials as possible are transferred out of the transfer-out warehouse and the number of allocations within the same region is as large as possible.

[0119] For example, if the optimization objectives include Objective 2, Objective 3, and Objective 4, then among the feasible solutions of all objective functions, the second array corresponding to minz2 can be determined, and then the eighth array that satisfies maxz4 can be determined from the second array. The fourteenth array that satisfies minz5 can be determined from the eighth array. The allocation method corresponding to the fourteenth array is used as the target allocation method, so that the allocation distance is as short as possible on the premise that the number of allocations is as small as possible during the allocation process and the number of allocations within the same region is as large as possible.

[0120] Taking the example that the optimization objective includes four sub-optimization objectives, the method for determining the target allocation method will be introduced below.

[0121] For example, if the optimization objective includes Objective 1, Objective 2, Objective 3, and Objective 4, then among the feasible solutions of all objective functions, the first array corresponding to maxz1 can be determined, and then the fifth array that satisfies minz2 can be determined from the first array, the eleventh array that satisfies maxz4 can be determined from the fifth array, and the fifteenth array that satisfies minz5 can be determined from the eleventh array. The allocation method corresponding to the fifteenth array is used as the target allocation method. Thus, on the premise of shipping out as many materials as possible from the outbound warehouse and minimizing the number of allocations, the number of allocations within the same region is maximized as much as possible, and the allocation distance is minimized as much as possible.

[0122] The present application provides a financing network structure that supports many-to-many, enabling the demand of one network point to be satisfied by multiple network points simultaneously, thereby improving the inventory turnover rate. Moreover, the present application considers the allocation and utilization of inventory resources from dimensions such as cost and service level. Users can set multiple optimization objectives and their priorities according to the actual application scenario, enabling the resource allocation method to match multiple application scenarios.

[0123] Figure 5 According to some embodiments of the present application, a schematic structural diagram of an electronic device 10 is shown. As Figure 5 shown, the electronic device 10 includes one or more processors 101, a system memory 102, a non-volatile memory (NVM) 103, a communication interface 104, an input / output (I / O) device 105, and a system control logic 106 for coupling the processor 101, the system memory 102, the non-volatile memory 103, the communication interface 104, and the input / output (I / O) device 105.

[0124] Among them:

[0125] The processor 101 can be used to control an electronic device to execute the resource allocation method of the present application. Among them, the processor 101 can include one or more processing units. For example, it can include a central processing unit (CPU), a graphics processing unit (GPU), a digital signal processor (DSP), a micro-programmed control unit (MCU), an artificial intelligence (AI) processor, or a processing module or processing circuit of a field programmable gate array (FPGA), which can include one or more single-core or multi-core processors. The system memory 102 is a volatile memory, such as a random-access memory (RAM), a double data rate synchronous dynamic random access memory (DDR SDRAM), etc. The system memory is used to temporarily store data and / or instructions.

[0126] The non-volatile memory 103 can include one or more tangible, non-transitory computer-readable media for storing data and / or instructions. In some embodiments, the non-volatile memory 103 can include any suitable non-volatile memory such as flash memory and / or any suitable non-volatile storage device, such as a hard disk drive (HDD), a compact disc (CD), a digital versatile disc (DVD), a solid-state drive (SSD), etc. In some embodiments, the non-volatile memory 103 can also be a removable storage medium, such as a secure digital (SD) memory card, etc.

[0127] In particular, the system memory 102 and the non-volatile memory 103 can respectively include: a temporary copy and a permanent copy of the instruction 107. The instruction 107 can include: when executed by the processor 101, enabling the electronic device 10 to implement the resource allocation method provided by the various embodiments of the present application.

[0128] The communication interface 104 may include a transceiver for providing a wired or wireless communication interface for the electronic device 10, and further communicating with any other suitable device through one or more networks. In some embodiments, the communication interface 104 may be integrated with other components of the electronic device 10. For example, the communication interface 104 may be integrated in the processor 101. In some embodiments, the electronic device 10 may communicate with other devices through the communication interface 104. For example, the electronic device 10 may obtain a resource allocation method to be run from other electronic devices through the communication interface 104.

[0129] The input / output (I / O) device 105 may include input devices such as keyboards, mice, etc., and output devices such as displays, etc. Users may interact with the electronic device 10 through the input / output (I / O) device 105.

[0130] The system control logic 106 may include any suitable interface controller to provide any suitable interface to other modules of the electronic device 10. For example, in some embodiments, the system control logic 106 may include one or more memory controllers to provide an interface connected to the system memory 102 and the non-volatile memory 103.

[0131] In some embodiments, at least one of the processors 101 may be logically packaged with one or more controllers for the system control logic 106 to form a system in package (SiP). In other embodiments, at least one of the processors 101 may also be integrated with the logic of one or more controllers for the system control logic 106 on the same chip to form a system on chip (SoC).

[0132] It can be understood that Figure 5 The structure of the illustrated electronic device 10 is only an example. In other embodiments, the electronic device 10 may include more or fewer components than shown in the figure, or combine certain components, or split certain components, or have different component arrangements. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.

[0133] Embodiments of the mechanisms disclosed in this application may be implemented in hardware, software, firmware, or a combination of these implementation methods. Embodiments of this application may be implemented as a computer program or program code executed on a programmable system, which includes at least one processor, a storage system (including volatile and non-volatile memories and / or storage elements), at least one input device, and at least one output device.

[0134] Program code can be applied to the input instructions to perform the various functions described in this application and generate output information. The output information can be applied to one or more output devices in a known manner. For the purposes of this application, a processing system includes any system having a processor such as, for example, a digital signal processor (DSP), a microcontroller, an application specific integrated circuit (ASIC), or a microprocessor.

[0135] The program code can be implemented in a high-level procedural language or an object-oriented programming language in order to communicate with the processing system. When necessary, the program code can also be implemented in assembly language or machine language. In fact, the mechanisms described in this application are not limited to the scope of any particular programming language. In any case, the language can be a compiled language or an interpreted language.

[0136] In some cases, the disclosed embodiments can be implemented in hardware, firmware, software, or any combination thereof. The disclosed embodiments can also be implemented as instructions carried or stored on one or more transient or non-transient machine-readable (e.g., computer-readable) storage media, which can be read and executed by one or more processors. For example, the instructions can be distributed via a network or via other computer-readable media. Thus, a machine-readable medium can include any mechanism for storing or transmitting information in a machine (e.g., computer) readable form, including but not limited to, floppy disks, optical disks, optical discs, compact disc-read only memory (CD-ROMs), magneto-optical discs, read only memory (ROM), random access memory (RAM), erasable programmable read only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), magnetic or optical cards, flash memory, or tangible machine-readable memories for transmitting information (e.g., carrier waves, infrared signals, digital signals, etc.) in electrical, optical, acoustic, or other forms via the Internet. Thus, a machine-readable medium includes any type of machine-readable medium suitable for storing or transmitting electronic instructions or information in a machine (e.g., computer) readable form.

[0137] In the accompanying drawings, some structural or method features may be shown in a specific arrangement and / or order. However, it should be understood that such specific arrangements and / or orderings may not be required. Rather, in some embodiments, these features may be arranged in a manner and / or order different from that shown in the illustrative drawings. Additionally, the inclusion of a structural or method feature in a particular figure does not imply that such a feature is required in all embodiments, and in some embodiments, these features may not be included or may be combined with other features.

[0138] It should be noted that each unit / module mentioned in the device embodiments of this application is a logical unit / module. Physically, a logical unit / module can be a physical unit / module, a part of a physical unit / module, or can be implemented as a combination of multiple physical units / module. The physical implementation manner of these logical units / module themselves is not the most important. The combination of the functions implemented by these logical units / module is the key to solving the technical problems proposed in this application. In addition, in order to highlight the innovative part of this application, the above device embodiments of this application do not introduce units / modules that are not closely related to solving the technical problems proposed in this application. This does not mean that there are no other units / modules in the above device embodiments.

[0139] It should be noted that in the examples and descriptions of this patent, the term "comprising", "including" or any other variant thereof is intended to cover non-exclusive inclusion, such that a process, method, article or device comprising a series of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article or device. Without further limitation, an element defined by the phrase "comprising one" does not exclude the presence of additional identical elements in the process, method, article or device comprising the element.

[0140] Although this application has been illustrated and described by reference to certain preferred embodiments thereof, those of ordinary skill in the art should understand that various changes in form and detail may be made therein without departing from the spirit and scope of this application.

Claims

1. A resource allocation method, characterized in that, The resource allocation method includes: Determine the target resource demand of each demand warehouse in the demand warehouse group and the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group; Based on the optimization objective, the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, and the target resource demand, determine the target allocation method, and transfer the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group into the corresponding demand warehouse through the target allocation method, where the optimization objective includes at least one optimization sub-objective, and the optimization sub-objective includes allocation quantity, allocation times, allocation area, and allocation distance.

2. The resource allocation method according to claim 1, wherein The step of determining the target allocation method based on the optimization objective, the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, and the target resource demand, and transferring the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group into the corresponding demand warehouse through the target allocation method includes: Obtain the constraint conditions; Based on the constraint conditions, the optimization objective, the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, and the target resource demand, determine the target allocation method, and transfer the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group into the corresponding demand warehouse through the target allocation method.

3. The resource allocation method according to claim 2, wherein The constraint conditions include: The transfer-in quantity of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group into the corresponding demand warehouse is less than or equal to the demand of the demand warehouse; The transfer-out quantity of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group out of the corresponding demand warehouse is less than or equal to the adjustable inventory of the transfer-out warehouse.

4. The resource allocation method according to claim 2, wherein The step of determining the target allocation method based on the constraint conditions, the optimization objective, the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, and the target resource demand includes: Based on the constraint conditions, the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, and the target resource demand, filter the array composed of the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group and the target resource demand to obtain a target array set; Obtain the priority of each optimization sub-objective in the optimization objective; Based on the priority of each optimization sub-objective in the optimization objective, the objective function of the optimization objective, and the target array set, determine the target allocation method, and transfer the inventory of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group into the corresponding demand warehouse through the target allocation method.

5. The resource allocation method according to claim 3, wherein The step of determining the target allocation method based on the priority of each optimization sub-objective in the optimization objective, the objective function of the optimization objective, and the target array set includes: Process the target array set based on the objective function of the optimization sub-objective with the first priority to obtain a first allocation array set; Process the first allocation array set based on the objective function of the optimization sub-objective with the second priority to obtain a second allocation array set, where the first priority is higher than the second priority; Determine the target allocation method based on the second allocation array set.

6. The resource allocation method according to claim 5, wherein The optimization sub-objective corresponding to the first priority is the allocation quantity. The step of processing the target array set based on the objective function of the optimization sub-objective with the first priority to obtain a first allocation array set includes: Process the target array set based on the objective function of the allocation quantity to obtain a first array set, where the first array set includes at least one array, and each array in the array set corresponds to an allocation method; Determine the array with the largest sum of elements in the first array set as the first array, where the first array includes at least one array; Obtain the first allocation array set based on the first array.

7. The resource allocation method according to claim 5, wherein The optimization sub-objective corresponding to the second priority is the number of allocations. Process the first allocation array set based on the objective function of the optimization sub-objective based on the second priority, and obtain a second allocation array set, including: Determine the first coefficient of each element in the first allocation array set according to the allocation quantity corresponding to each element in the first allocation array set; Establish a second array set based on the first allocation array set and the first coefficient of each element in the first allocation array set; Determine the array with the smallest sum of the corresponding values of each element in the second array set as the second array, where the second array includes at least one array; Obtain the second allocation array set based on the second array.

8. The resource allocation method according to claim 7, wherein The method for determining the first coefficient includes: Corresponding to the allocation quantity corresponding to the element being greater than 0, determine the first coefficient as the first value; Corresponding to the allocation quantity corresponding to the element being equal to 0, determine the first coefficient as the second value.

9. The resource allocation method according to claim 5, wherein The optimization sub-objective corresponding to the second priority is the allocation area. Process the first allocation array set based on the objective function of the optimization sub-objective based on the second priority, and obtain a second allocation array set, including: Obtain the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group; Determine the second coefficient of each element in the first allocation array set based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group; Establish a third array set based on the first allocation array set and the first coefficient and the second coefficient of each element in the first allocation array set, where the third array set includes at least one array, and each array in the array set corresponds to an allocation method; Determine the array with the largest sum of elements in the third array set as the third array, where the third array includes at least one array; Obtain the second allocation array set based on the third array.

10. The resource allocation method according to claim 9, wherein The method for determining the second coefficient includes: Corresponding to determining that the demand warehouse and the transfer-out warehouse corresponding to the demand warehouse belong to the same area based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, determine the second coefficient as the third value; Corresponding to determining that the demand warehouse and the transfer-out warehouse corresponding to the demand warehouse belong to different areas based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, determine the second coefficient as the fourth value.

11. The resource allocation method according to claim 5, wherein The optimization sub-objective corresponding to the second priority is the allocation distance. Process the first allocation array set based on the objective function of the optimization sub-objective based on the second priority, and obtain a second allocation array set, including: Obtain the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group; Based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, determine the third coefficient of each element in the first array set; Based on the first array set and the first coefficient and the third coefficient of each element in the first array set, establish a fourth array set; Determine that the array with the smallest sum of the corresponding values of each element in the fourth array set is the fourth array, where the fourth array includes at least one array; Obtain the second transfer array set based on the fourth array.

12. The resource allocation method according to claim 11, wherein The method for determining the third coefficient includes: Based on the location information of each demand warehouse in the demand warehouse group and the location information of the transfer-out warehouse corresponding to each demand warehouse in the demand warehouse group, determine the distance between the demand warehouse and the transfer-out warehouse corresponding to the demand warehouse as the third coefficient.

13. An electronic device, characterized in that, It includes: a memory for storing instructions executed by one or more processors of the electronic device, and the processor, which is one of the one or more processors of the electronic device, for executing the resource transfer method according to any one of claims 1 to 12.

14. A readable medium, characterized in that, Instructions are stored on the readable medium, and when the instructions are executed on the electronic device, the electronic device is caused to execute the resource transfer method according to any one of claims 1 to 12.

Images