Multi-area warehouse allocation method, device and equipment and storage medium

Abstract

The invention provides a multi-area warehouse allocation method and device, equipment and a storage medium, and in one embodiment, the method comprises the steps: obtaining a first adjustable amount of a supply warehouse and a first planned allocation amount of each demand warehouse; determining a first plan allocation total amount of all the demand warehouses according to the first plan allocation amount of each demand warehouse; if the first adjustable quantity is smaller than the first planned total allocation quantity, sequentially allocating the first adjustable quantity to each demand warehouse according to the first allocation priority until the remaining first adjustable quantity is smaller than the day prediction quantity of any demand warehouse; and determining a first actual allocation amount from the supply warehouse to each demand warehouse according to the first allocation result of each demand warehouse. According to the method and the device, the day-by-day cargo allocation process is simulated through the first allocation priority, so that the optimal inventory allocation quantity is determined, multi-area inventory allocation among different warehouses is realized, and the response speed and the flexibility of a supply chain are improved.

Description

Technical Field

[0001] The present application relates to the field of logistics and transportation technology, and in particular to a multi-region warehouse allocation method, device, equipment and storage medium. Background Art

[0002] In modern supply chain management, enterprises are facing increasingly complex logistics networks and diverse customer needs. Accurate and efficient inventory management has become crucial, especially in terms of regional warehouse transfers. With the rapid development of e-commerce and the expansion of the global market, enterprises need to make sophisticated inventory transfers between supply warehouses and multiple regional demand warehouses to meet the rapidly changing needs of various markets. This process not only needs to consider the inventory level of each demand warehouse, but also channel demand, purchases in transit, and the relationship between different SKUs (Stock Keeping Units).

[0003] Traditional inventory transfer methods mostly rely on static demand forecasts and fixed safety inventory strategies, which are difficult to flexibly respond to market fluctuations. Due to the differences in demand among regional demand warehouses, improper transfer strategies can easily lead to excess inventory in some demand warehouses, while other warehouses face the risk of out-of-stock. Therefore, it is very necessary to establish a reasonable inventory transfer method between supply warehouses and multi-regional demand warehouses. Summary of the invention

[0004] In view of the unreasonable problem of relying on static multi-regional inventory allocation strategies in the prior art, the present application aims to provide a multi-regional warehouse allocation method, device, equipment and storage medium, so as to optimize inventory management in a dynamic environment and improve the response speed and flexibility of the supply chain.

[0005] In a first aspect, an embodiment of the present application provides a multi-region warehouse allocation method, the method comprising:

[0006] Obtaining a first available allocation quantity of the supply warehouse and a first planned allocation quantity of each demand warehouse, wherein the supply warehouse allocates goods to the demand warehouse, and the first planned allocation quantity is the quantity of goods required by each demand warehouse to meet the periodic inventory;

[0007] Determine the total first planned transfer quantity of all demand warehouses based on the first planned transfer quantity of each demand warehouse;

[0008] If the first allocable quantity is less than the first planned total allocable quantity, the first allocable quantity is allocated to each demand warehouse in sequence according to the first allocation priority until the remaining first allocable quantity is less than the daily forecast quantity of any of the demand warehouses, and the first allocation priority is determined according to the inventory days and / or daily forecast quantity of each demand warehouse;

[0009] A first actual transfer quantity from the supply warehouse to each demand warehouse is determined according to the first allocation result of each demand warehouse.

[0010] In a possible embodiment, allocating the first allocable quantity to each demand warehouse in sequence according to the first allocation priority includes:

[0011] Determine the warehouse with the highest priority demand based on the first transfer priority;

[0012] Allocate the daily forecast quantity of goods to the warehouse with the highest priority demand;

[0013] Update the first available allocation quantity and the first allocation priority of each demand warehouse;

[0014] The above allocation process is repeated according to the updated first allocation priority.

[0015] In a possible embodiment, the first allocable quantity is allocated to each demand warehouse in sequence according to the first allocation priority until the remaining first allocable quantity is less than the daily forecast quantity of any of the demand warehouses, and the method further includes:

[0016] Allocate the remaining available transfer quantity to the demand warehouse with the highest priority in the updated first transfer priority.

[0017] In a possible embodiment, the method further includes: if the first allocable quantity is not less than the first planned total allocation quantity, directly allocating according to the first planned allocation quantity of each demand warehouse.

[0018] In a possible embodiment, the method further includes:

[0019] The second available allocation quantity of the supply warehouse and the second planned allocation quantity of each demand warehouse are obtained. The second available allocation quantity is the commodity inventory quantity of the supply warehouse after satisfying the periodic inventory of each demand warehouse. The second planned allocation quantity is the commodity demand quantity of each demand warehouse that needs to satisfy the safety inventory on the basis of satisfying the periodic inventory.

[0020] Determine the total second plan transfer quantity of all demand warehouses based on the second plan transfer quantity of each demand warehouse;

[0021] If the second available allocation quantity is less than the second planned total allocation quantity, the second available allocation quantity is allocated to each demand warehouse in sequence according to the second allocation priority until the remaining second available allocation quantity is less than the daily forecast quantity of any of the demand warehouses. The second allocation priority is determined according to the number of safety stock days and / or daily forecast quantity of each demand warehouse.

[0022] The second actual transfer quantity from the supply warehouse to each demand warehouse is determined according to the second allocation result of each demand warehouse.

[0023] In a possible embodiment, allocating the second allocable quantity to each demand warehouse in sequence according to the second allocation priority includes:

[0024] Determine the warehouse with the highest priority demand based on the second transfer priority;

[0025] Allocate the daily forecast quantity of goods to the warehouse with the highest priority demand;

[0026] Update the second available allocation quantity and the second allocation priority of each demand warehouse;

[0027] The above allocation process is repeated according to the updated second allocation priority.

[0028] In a possible embodiment, the second allocable quantity is allocated to each demand warehouse in sequence according to the second allocation priority until the remaining second allocable quantity is less than the daily forecast quantity of any demand warehouse, and the method further includes:

[0029] The remaining second allocable quantity is allocated to the demand warehouse with the highest priority in the updated second allocation priority.

[0030] In a possible embodiment, the method further includes: if the initial inventory of the demand warehouse is less than the lead time demand of the corresponding demand warehouse, determining the third actual allocation quantity from the supply warehouse to each demand warehouse according to the first actual allocation quantity, the second actual allocation quantity and the out-of-stock demand in the lead time, wherein the out-of-stock demand in the lead time is equal to the demand in the lead time minus the initial inventory.

[0031] In a possible embodiment, after determining the first actual allocation quantity from the supply warehouse to each demand warehouse according to the allocation result of each demand warehouse, the method further includes:

[0032] Determine the box specifications from the supply warehouse to each demand warehouse;

[0033] The fourth actual transfer quantity from the supply warehouse to each demand warehouse is determined according to the first actual transfer quantity and the box specification.

[0034] In a possible embodiment, the method further includes: if the goods in the supply warehouse have new and old codes, the goods corresponding to the first actual allocation quantity first select the old-coded goods; if the quantity of the old-coded goods cannot meet the first actual allocation quantity, then allocation is made from the new-coded goods to meet the gap of the old-coded goods.

[0035] In a second aspect, the embodiment of the present application further provides a multi-region inventory transfer device, including:

[0036] An acquisition module is configured to acquire the available allocation quantity of the supply warehouse and the planned allocation quantity of each demand warehouse, and the supply warehouse allocates goods to the demand warehouse;

[0037] A calculation module, which is configured to determine the total planned allocation amount of all demand warehouses according to the planned allocation amount of each demand warehouse;

[0038] an allocation module, configured to allocate the available allocation quantity to each demand warehouse in sequence according to a first allocation priority when it is determined that the available allocation quantity is less than the planned total allocation quantity, until the remaining available allocation quantity is less than the daily forecast quantity of any of the demand warehouses, wherein the first allocation priority is determined according to the inventory days in stock and / or the daily forecast quantity of each demand warehouse;

[0039] A determination module is configured to determine a first actual transfer quantity from the supply warehouse to each demand warehouse according to the allocation results of each demand warehouse.

[0040] In a third aspect, an embodiment of the present application further provides an electronic device, comprising: a processor, and a memory communicatively connected to the processor;

[0041] The memory stores computer-executable instructions;

[0042] The processor executes the computer-executable instructions stored in the memory to implement the method in any possible implementation manner of the first aspect.

[0043] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer execution instructions, and when the computer execution instructions are executed by a processor, they are used to implement the method in any possible implementation of the above-mentioned first aspect.

[0044] The present application provides a multi-region warehouse allocation method, device, equipment and storage medium, wherein the multi-region warehouse allocation method includes: first obtaining the first allocatable quantity of the supply warehouse and the first planned allocation quantity of each demand warehouse, and then determining the first planned allocation total of all demand warehouses; if the first allocatable quantity is less than the first planned allocation total, the first allocatable quantity is allocated to each demand warehouse in turn according to the first allocation priority until the remaining first allocatable quantity is less than the daily forecast quantity of any of the demand warehouses, and the first allocation priority is determined according to the number of days of inventory in stock and / or the daily forecast quantity of each demand warehouse; finally, the first actual allocation quantity from the supply warehouse to each demand warehouse is determined according to the first allocation result of each demand warehouse. The present application simulates the daily allocation process of goods through the first allocation priority, thereby determining the optimal inventory allocation quantity, realizing multi-region inventory allocation between different warehouses, and improving the response speed and flexibility of the supply chain. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0046] Figure 1 A schematic diagram of an application scenario of a multi-region inventory transfer method for this application;

[0047] Figure 2 A flow chart of a multi-region warehouse allocation method provided in an embodiment of the present application;

[0048] Figure 3 A flowchart of another multi-region warehouse allocation method provided in an embodiment of the present application;

[0049] Figure 4 A flow chart of a third multi-region warehouse transfer method provided in an embodiment of the present application;

[0050] Figure 5 A schematic diagram of the module structure of a multi-region inventory transfer device provided in an embodiment of the present application;

[0051] Figure 6 A hardware structure diagram of an electronic device provided in an embodiment of the present application.

[0052] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments.

[0053] Description of reference numerals:

[0054] 101 - first terminal; 102 - second terminal; 103 - server; 501 - acquisition module; 502 - calculation module; 503 - allocation module; 504 - determination module. DETAILED DESCRIPTION

[0055] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0056] In the embodiments of the present application, words such as "first" and "second" are used to distinguish between identical or similar items with substantially the same functions and effects. Those skilled in the art will understand that words such as "first" and "second" do not limit the quantity and execution order, and words such as "first" and "second" do not necessarily limit the difference. It should be noted that words such as "exemplary" or "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design described as "exemplary" or "for example" in this application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way. In the embodiments of the present application, "at least one" refers to one or more, and "more" refers to two or more.

[0057] It should be noted that the "at..." in the embodiment of the present application can be the instant when a certain situation occurs, or it can be a period of time after a certain situation occurs, and the embodiment of the present application does not specifically limit this. In addition, the multi-regional warehouse allocation method provided in the embodiment of the present application is only used as an example, and the multi-regional warehouse allocation method can also include more or less content.

[0058] In order to clearly describe the technical solutions of the embodiments of the present application, some terms and technologies involved in the embodiments of the present application are briefly introduced below:

[0059] SKU: Stock keeping unit, refers to the smallest divisible management unit in inventory management.

[0060] Transferable quantity: The maximum inventory quantity in a warehouse that can be transferred to other warehouses.

[0061] Purchase in transit: This means that the company has placed a purchase order with the supplier, the supplier has shipped the goods, but the goods are still in transit and have not yet arrived at the company's warehouse.

[0062] Inventory days in stock: the number of days the current inventory in the warehouse can be maintained.

[0063] Cycle inventory days: The minimum number of inventory days required to meet demand within a future order cycle.

[0064] Target inventory: The inventory quantity planned to be maintained in a certain warehouse.

[0065] Safety Stock: Minimum inventory level held to prepare for potential supply chain disruptions or demand fluctuations.

[0066] Daily forecast quantity: The quantity of a single commodity that the demand warehouse is expected to sell each day, or calculated by dividing the total sales volume in a preset cycle by the number of days in the cycle.

[0067] Lead Time (LT): The time between when an order is placed and when goods or services are received.

[0068] Box specification: refers to the specifications and requirements for packing goods, which can specifically refer to the size and type of the box.

[0069] In modern supply chain management, enterprises are facing increasingly complex logistics networks and diverse customer needs. Accurate and efficient inventory management has become crucial, especially in terms of regional warehouse transfers. With the rapid development of e-commerce and the expansion of the global market, enterprises need to make sophisticated inventory transfers between supply warehouses and multiple regional demand warehouses to meet the rapidly changing needs of various markets. This process not only needs to consider the inventory level of each demand warehouse, but also channel demand, purchases in transit, and the relationship between different SKUs.

[0070] Traditional inventory transfer methods mostly rely on static demand forecasts and fixed safety inventory strategies, which are difficult to flexibly respond to market fluctuations. Due to the differences in demand among regional demand warehouses, improper transfer strategies can easily lead to excess inventory in some demand warehouses, while other warehouses face the risk of out-of-stock. Therefore, it is very necessary to establish a reasonable inventory transfer method between supply warehouses and multi-regional demand warehouses.

[0071] In order to solve the above problems, the embodiments of the present application provide a multi-region warehouse transfer method, device, equipment and storage medium, through which the inventory transfer between different warehouses can be processed in a dynamic environment, thereby improving the response speed and flexibility of the supply chain.

[0072] Figure 1 This is a schematic diagram of an application scenario of a multi-regional inventory transfer method of the present application. In this application scenario, a first terminal 101, multiple second terminals 102 and a server 103 are included, wherein the first terminal 101 is a supply warehouse with transferable goods, and the second terminal 102 is a demand warehouse that receives goods transfers, wherein the goods include a variety of commodities, the first terminal 101 contains the commodity inventory data of the supply warehouse, and the second terminal 102 contains the planned transfer quantity data of the demand warehouse to meet the target inventory. The server 103 receives the transferable quantity data from the first terminal 101 and the planned transfer quantity data from different second terminals 102, and can calculate the actual transfer quantity from the supply warehouse to each demand warehouse, so as to reasonably allocate the transferable quantity.

[0073] Figure 2 A flow chart of a multi-region warehouse allocation method provided in an embodiment of the present application. Figure 2 As shown, the multi-region warehouse transfer method is applied to Figure 1 The server 103 shown in FIG. 103 is used to describe the allocation of any commodity by using the method, which specifically includes:

[0074] S210: Obtain a first available allocation quantity of the supply warehouse and a first planned allocation quantity of each demand warehouse. The supply warehouse allocates goods to the demand warehouse. The first planned allocation quantity is the quantity of goods required by each demand warehouse to meet the periodic inventory.

[0075] In this embodiment, the goods are only described for a single commodity. The first transferable quantity of the supply warehouse includes not only the available inventory quantity of the supply warehouse before the transfer, but also the purchase quantity in transit. Therefore, the first transferable quantity = available inventory + purchase in transit.

[0076] The first planned transfer quantity is the quantity of a single commodity that needs to be transferred to meet the target inventory. The first planned transfer quantity = max{target inventory - inventory on hand, 0}, where the target inventory is a value preset by the demand warehouse. In this embodiment, the target inventory only considers meeting the cycle inventory, and the cycle inventory is the number of commodities that meet the cycle inventory days. The default inventory on hand is the situation where the commodity quantity does not meet the cycle inventory.

[0077] Since this embodiment only considers the transfer of cycle inventory, meeting the target inventory is to meet the cycle inventory. In this case, if the current on-hand inventory of the demand warehouse cannot meet the target inventory (i.e., the cycle inventory), the first planned transfer quantity is the quantity of goods required to increase the on-hand inventory days to the cycle inventory days; if the current on-hand inventory of the demand warehouse has already met the target inventory, then there is no need to transfer to the demand warehouse, so the first planned transfer quantity is 0.

[0078] The following is a specific example to illustrate. Assume that there is a supply warehouse and five demand warehouses. The initial states of the five demand warehouses are shown in Table 1:

[0079] Table 1

[0080] Warehouse 1 Warehouse 2 Warehouse 3 Warehouse 4 Warehouse 5 Daily forecast 10 15 10 10 10 Inventory days in stock 15 12 12 17 17 Cycle Inventory Days 20 22 20 21 14

[0081] It can be seen that the inventory days of warehouse 5 are greater than the cycle inventory days, so the inventory of warehouse 5 can already meet the cycle inventory, so the first planned transfer quantity of warehouse 5 is 0.

[0082] S220: determining the first planned allocation total amount of all demand warehouses according to the first planned allocation amount of each demand warehouse;

[0083] The periodic inventory and on-hand inventory of each demand warehouse may be different, so the first planned allocation quantity of each demand warehouse is not exactly the same. Therefore, in order to determine whether the first available allocation quantity is sufficient, it is necessary to calculate the total first planned allocation quantity of all demand warehouses.

[0084] Refer to Table 1, the total amount of the first plan transfer required by the five demand warehouses to meet the cycle inventory days is:

[0085] (20-15)×10+(22-12)×15+(20-12)×10+(21-17)×10=320 units

[0086] S230: If the first allocable quantity is less than the first planned total allocable quantity, the first allocable quantity is allocated to each demand warehouse in sequence according to the first allocation priority until the remaining first allocable quantity is less than the daily forecast quantity of any demand warehouse, and the first allocation priority is determined according to the inventory days and / or daily forecast quantity of each demand warehouse;

[0087] If the first allocable quantity of the supply warehouse is greater than or equal to the first planned allocation total quantity (taking Table 1 as an example, the planned allocation total quantity is 320), that is, the number of allocable goods in the supply warehouse can meet the number of goods required by each demand warehouse, then the allocation can be arranged directly from the supply warehouse according to the first planned allocation quantity required by each demand warehouse.

[0088] If the first allocable quantity of the supply warehouse is less than the first planned total allocation, that is, the number of goods that can be allocated by the supply warehouse cannot meet the number of goods required by all demand warehouses, then it is necessary to allocate to each demand warehouse in turn from the supply warehouse according to the first priority until the remaining allocable quantity of the supply warehouse is less than the daily forecast quantity of any demand warehouse.

[0089] The first allocation priority here can be determined as follows:

[0090] Rule 1: Sort the inventory days in stock from small to large, the smaller the number, the higher the priority;

[0091] Rule 2: Sort the daily forecast from large to small, the larger the number, the higher the priority.

[0092] Rule 3: Prioritize the number of days inventory is in stock first. When the number of days inventory is the same, prioritize the size of the daily forecast.

[0093] Exemplarily, taking Table 1 as an example, according to Rule 3, the first allocation priority is to consider the number of days of inventory in stock. Since the lowest number of days of inventory in stock among all demand warehouses is 12, in order to increase the number of days of inventory in stock, the demand warehouses with the highest current priority are Warehouse 2 and Warehouse 3, followed by Warehouse 1, Warehouse 4 and Warehouse 5 (since Warehouse 5 does not need to be allocated, its allocation priority is the last). At this time, it is necessary to compare the daily forecast quantity of Warehouse 2 and Warehouse 3. Since the daily forecast quantity of Warehouse 2 (15) is greater than the daily forecast quantity of Warehouse 3 (10), the priority of Warehouse 2 is greater than that of Warehouse 3.

[0094] Exemplarily, the above allocating the available allocation quantity to each demand warehouse in sequence according to the first allocation priority includes:

[0095] S231: Determine the highest priority demand warehouse according to the first transfer priority;

[0096] Also take Table 1 as an example to illustrate. After the above analysis, according to the rule of the first allocation priority, the priorities of the five warehouses from high to low are Warehouse 2, Warehouse 3, Warehouse 1, Warehouse 4 and Warehouse 5. Then Warehouse 2 is the demand warehouse with the highest priority in the initial state.

[0097] S232: Allocate the daily forecast quantity of goods to the warehouse with the highest priority demand;

[0098] After the highest priority demand warehouse (Warehouse 2) is determined according to the above steps, the corresponding daily forecast quantity of goods needs to be allocated to Warehouse 2, that is, Warehouse 2 needs to be allocated 15 units of goods.

[0099] It should be noted that the allocation here is only a virtual process. It does not mean that the supply warehouse needs to transport the corresponding units of goods to the demand warehouse in real time. The purpose is to determine the first actual allocation quantity from the supply warehouse to each demand warehouse during multiple allocation processes.

[0100] S233: updating the first allocable quantity and the first allocation priority of each demand warehouse;

[0101] After step S232, the first available allocation quantity of the supply warehouse will be reduced by 15 units of the negotiated quantity, and the updated inventory status of the five demand warehouses after being allocated in sequence is shown in Table 2:

[0102] Table 2

[0103] Warehouse 1 Warehouse 2 Warehouse 3 Warehouse 4 Warehouse 5 Daily forecast 10 15 10 10 10 Inventory days in stock 15 13 12 17 17 Cycle Inventory Days 20 22 20 21 14

[0104] It can be seen that at this time, the number of days of inventory in warehouse 2 increases by 1 day, so the first allocation priority of each demand warehouse will change. Specifically, since the number of days of inventory in warehouse 2 increases by 1 day, the number of days of inventory in warehouse 3 will become the least, so warehouse 3 becomes the demand warehouse with the highest priority at present, and the first allocation priority needs to be updated. According to the updated first allocation priority, the second allocation needs to allocate the corresponding day's predicted quantity (10) of goods to warehouse 3.

[0105] S234: Repeat the above allocation process according to the updated first allocation priority.

[0106] After the second allocation, the updated inventory status of the five demand warehouses is shown in Table 3. Next, it is only necessary to repeat the process of steps S231 to S233 until the remaining transferable quantity is less than the daily forecast quantity of any demand warehouse.

[0107] Table 3

[0108] Warehouse 1 Warehouse 2 Warehouse 3 Warehouse 4 Warehouse 5 Daily forecast 10 15 10 10 10 Inventory days in stock 15 13 13 17 17 Cycle Inventory Days 20 22 20 21 14

[0109] At this time, the first available quantity of the supply warehouse is reduced by another 10 units. In the above manner, the virtual allocation process is completed continuously until the remaining available quantity of the supply warehouse is less than the daily forecast quantity of any demand warehouse (that is, the minimum daily forecast value of all demand warehouses, which is 10 in Table 1), and then the virtual allocation is stopped.

[0110] S240: Determine a first actual transfer quantity from the supply warehouse to each demand warehouse according to the first allocation result of each demand warehouse.

[0111] The first allocation result here is the final result after multiple virtual allocations in step S230. During each virtual allocation process, since each allocation is an allocation of daily forecast quantity, the number of days of inventory on hand of the allocated demand warehouse will increase by one day. At this time, after the allocation is completed, the number of days of inventory on hand increased by each demand warehouse multiplied by the corresponding daily forecast quantity can represent the first actual transfer quantity from the supply warehouse to each demand warehouse.

[0112] Finally, the first actual allocation quantity of each demand warehouse is sent to the supply warehouse, and the supply warehouse can transport the goods to each demand warehouse according to the first actual allocation quantity.

[0113] In step S230, the first allocable quantity is allocated to each demand warehouse in turn according to the first allocation priority until the remaining first allocable quantity is less than the daily forecast quantity of any demand warehouse, and the multi-region warehouse allocation method further includes: allocating the remaining first allocable quantity to the demand warehouse with the highest priority in the updated first allocation priority. At this time, the first actual allocation quantity will also be adjusted, specifically, the remaining first allocable quantity is added to the first actual allocation quantity allocated from the supply warehouse to the corresponding demand warehouse.

[0114] It should be noted that if the first available allocation quantity of the supply warehouse is less than the daily forecast quantity of any demand warehouse at the beginning, it can be directly allocated to the demand warehouse with the highest priority in the initial first allocation priority. At this time, the first actual allocation quantity from the supply warehouse to the demand warehouse with the highest priority only includes the first available allocation quantity.

[0115] Figure 3Another multi-region warehouse transfer method flow chart provided in the embodiment of the present application. This embodiment specifically describes the multi-region warehouse transfer method for satisfying safety inventory when the first transfer amount satisfies the periodic inventory. Figure 3 As shown, the multi-region warehouse allocation method of this embodiment includes:

[0116] S310: Obtain a second available allocation quantity of the supply warehouse and a second planned allocation quantity of each demand warehouse, wherein the second available allocation quantity is the commodity inventory quantity of the supply warehouse after satisfying the periodic inventory of each demand warehouse, and the second planned allocation quantity is the commodity demand quantity of each demand warehouse that needs to satisfy the safety inventory on the basis of satisfying the periodic inventory;

[0117] In this embodiment, the goods are also only described for a single commodity. The second transferable quantity of the supply warehouse is the available inventory quantity after satisfying the cycle inventory of each demand warehouse, and of course also includes the purchase in transit quantity. Therefore, the second transferable quantity = available inventory + purchase in transit.

[0118] The second planned transfer quantity is the quantity of a single commodity that needs to be transferred to meet the safety stock on the basis of meeting the cycle inventory. The second planned transfer quantity = max{target inventory - on-hand inventory, 0}. In this embodiment, the target inventory is the cycle inventory + safety inventory, the cycle inventory is the quantity of commodities that meet the cycle inventory days, and the safety stock is the quantity of commodities that meet the safety stock days. At this time, the on-hand inventory is the on-hand inventory days after the cycle inventory is transferred to meet the cycle inventory, so the on-hand inventory is able to meet the cycle inventory by default.

[0119] Since this embodiment requires satisfying safety stock in addition to cycle stock, satisfying target stock means satisfying cycle stock + safety stock. In this case, if the current inventory on hand of the demand warehouse cannot further satisfy safety stock, the second planned transfer quantity is the quantity of goods required to satisfy the safety stock days required for the inventory days on hand; if the current inventory on hand of the demand warehouse has satisfied safety stock, then there is no need to transfer to the demand warehouse, so the second planned transfer quantity is 0.

[0120] The following is a specific example for illustration. It is also assumed that there is one supply warehouse and five demand warehouses. The initial states of the five demand warehouses are shown in Table 4:

[0121] Table 4

[0122] Warehouse 1 Warehouse 2 Warehouse 3 Warehouse 4 Warehouse 5 Daily forecast 10 15 20 10 10 Cycle Inventory Days 20 22 20 21 14 The number of days of inventory in stock after the transfer cycle 20 22 20 21 17 Safety stock days 10 8 5 4 2 Safety stock days in stock 0 0 0 0 3

[0123] It can be seen that the inventory days after the transfer cycle inventory of warehouses 1-5 all meet the corresponding cycle inventory days. However, the safety inventory days of warehouses 1-4 cannot meet the corresponding safety inventory days.

[0124] Since Warehouse 5 has 3 days of on-hand inventory, it can meet its required 2 days of safety inventory. Therefore, Warehouse 5 has met the safety inventory on the basis of meeting the cycle inventory. At this time, the second planned allocation quantity of Warehouse 5 is 0.

[0125] To meet the safety stock days of warehouses 1-4, the second planned transfer quantities of warehouses 1-4 are 100, 120, 100 and 40 respectively.

[0126] S320: Determine the second planned allocation total amount of all demand warehouses according to the second planned allocation amount of each demand warehouse;

[0127] In order to determine whether the second available transfer quantity is sufficient, it is necessary to calculate the total second planned transfer quantity required to meet the safety stock of all demand warehouses.

[0128] In Table 4, the total amount of the first plan transfer to meet the safety stock needs of the five demand warehouses is:

[0129] 10×10+8×15+5×20+4×10=360 units

[0130] S330: If the second available allocation quantity is less than the second planned total allocation quantity, the second available allocation quantity is allocated to each demand warehouse in sequence according to the second allocation priority until the remaining second available allocation quantity is less than the daily forecast quantity of any demand warehouse, and the second allocation priority is determined according to the number of days of safety stock on hand and / or the daily forecast quantity of each demand warehouse;

[0131] If the second available allocation quantity of the supply warehouse after meeting the cycle inventory days is greater than or equal to the second planned allocation quantity required to meet the safety inventory days of each demand warehouse (taking Table 4 as an example, the planned allocation quantity is 360 units), then the second planned allocation quantity required for each demand warehouse to meet the safety inventory days can be directly allocated.

[0132] If the second allocable quantity is less than the second planned total allocation amount (360 units), that is, the current remaining quantity of goods in the supply warehouse cannot meet the quantity of goods required by all demand warehouses to reach the safety inventory days, then it is necessary to reallocate each demand warehouse in turn according to the second priority until the remaining second allocable quantity of the supply warehouse is less than the daily forecast quantity of any demand warehouse.

[0133] The second allocation priority here can be determined as follows:

[0134] Rule 4: Sort the number of days of safety stock in the warehouse from small to large, the smaller the number, the higher the priority;

[0135] Rule 5: Sort the daily forecast from large to small, the larger the number, the higher the priority.

[0136] Rule 6: Prioritize the number of days of safety stock on hand first. When the number of days of safety stock on hand is the same, prioritize the size of the daily forecast quantity.

[0137] For example, Table 4 is used as an example for explanation. According to Rule 6, the second transfer priority first considers the number of days of safety stock in stock. Since the number of days of safety stock in stock of warehouse 5 has met the corresponding number of days of safety stock, warehouse 5 has the lowest priority. The number of days of safety stock in stock of warehouses 1-4 is 0, so their priorities are the same, all higher than warehouse 5. When the number of days of safety stock in stock is the same, the daily forecast quantity of each demand warehouse is compared. Since the daily forecast quantity of warehouse 3 is the largest among warehouses 1-4, warehouse 3 has the highest priority.

[0138] Exemplarily, allocating the second allocable quantity to each demand warehouse in sequence according to the second allocation priority includes:

[0139] S331: Determine the highest priority demand warehouse according to the second transfer priority;

[0140] Also take Table 4 as an example to illustrate, after the above analysis, according to the rule of the second allocation priority, the highest priority of the five warehouses is Warehouse 3.

[0141] S332: Allocate the daily forecast quantity of goods to the warehouse with the highest priority demand;

[0142] After the highest priority demand warehouse (warehouse 3) is determined according to the above steps, the corresponding daily forecast quantity of goods needs to be allocated to warehouse 3, that is, warehouse 3 needs to be allocated 20 units of goods.

[0143] Similarly, the allocation here is only a virtual process. It does not mean that the supply warehouse needs to transport the corresponding units of goods to the demand warehouse in real time. The purpose is to determine the second actual allocation quantity from the supply warehouse to each demand warehouse during multiple allocation processes.

[0144] S333: updating the second allocable quantity and the second allocation priority of each demand warehouse;

[0145] After step S332, the second available quantity of the supply warehouse is further reduced by 20 units, and the updated inventory status of the five demand warehouses is shown in Table 5:

[0146] Table 5

[0147] Warehouse 1 Warehouse 2 Warehouse 3 Warehouse 4 Warehouse 5 Daily forecast 10 15 20 10 10 Cycle Inventory Days 20 22 20 21 14 The number of days of inventory in stock after the transfer cycle 20 22 20 21 17 Safety stock days 10 8 5 4 2 Safety stock days in stock 0 0 1 0 3

[0148] It can be seen that at this time, the number of days of safety inventory in warehouse 3 increases by 1 day, so the second allocation priority of each demand warehouse will change. Specifically, at this time, the number of days of safety inventory in warehouse 1, 2, and 4 is still 0, and it is necessary to compare their daily forecast quantities. Since the daily forecast quantity of warehouse 2 is the smallest at this time, warehouse 2 is the demand warehouse with the highest priority at present. Therefore, the second allocation needs to allocate the corresponding daily forecast quantity (15) to warehouse 2.

[0149] S334: Repeat the above allocation process according to the updated second allocation priority.

[0150] After the second allocation, the updated inventory status of the five demand warehouses is shown in Table 6. Next, it is only necessary to repeat the process of steps S331 to S333 until the second transferable quantity is less than the daily forecast quantity of any demand warehouse.

[0151] Table 6

[0152] Warehouse 1 Warehouse 2 Warehouse 3 Warehouse 4 Warehouse 5 Daily forecast 10 15 20 10 10 Cycle Inventory Days 20 22 20 21 14 The number of days of inventory in stock after the transfer cycle 20 22 20 21 17 Safety stock days 10 8 5 4 2 Safety stock days in stock 0 1 1 0 3

[0153] At this time, the available quantity of the supply warehouse is further reduced by 15 units. The virtual allocation process is completed continuously in the above manner until the remaining available quantity of the supply warehouse is less than the daily forecast quantity of any demand warehouse (that is, the minimum daily forecast value of all demand warehouses, which is 10 in Table 1), and then the virtual allocation is stopped.

[0154] S340: Determine a second actual transfer quantity from the supply warehouse to each demand warehouse according to the second allocation result of each demand warehouse;

[0155] During each virtual allocation process, since each allocation is based on the forecasted amount of allocation days, the number of days of safety inventory in stock of the allocated demand warehouse will increase by one day. At this time, after the allocation is completed, the number of goods allocated to each demand warehouse to reach the safety inventory days is the second actual allocation amount that the supply warehouse needs to allocate to each demand warehouse on the basis of meeting the cycle inventory.

[0156] Therefore, the quantity of goods that the supply warehouse needs to allocate to each demand warehouse is equal to the sum of the first actual allocation quantity and the second actual allocation quantity. Finally, this value is sent to the supply warehouse, and the supply warehouse can transport the goods to each demand warehouse as required.

[0157] In step S330, the available allocation quantity is allocated to each demand warehouse in turn according to the second allocation priority until the remaining second available allocation quantity is less than the daily forecast quantity of any demand warehouse, and the multi-region warehouse allocation method further includes: allocating the remaining second available allocation quantity to the demand warehouse with the highest priority in the updated second allocation priority. At this time, the second actual allocation quantity of the demand warehouse needs to be added to the remaining second available allocation quantity.

[0158] It should be noted that if the remaining second transferable quantity of the supply warehouse is less than the daily forecast quantity of any demand warehouse after the cycle inventory days are met, it can be directly allocated to the demand warehouse with the highest priority in the initial second transfer priority. At this time, the second actual transfer quantity from the supply warehouse to the demand warehouse with the highest priority only includes the remaining second transferable quantity of the supply warehouse.

[0159] S350: If the initial inventory of the demand warehouse is less than the lead time demand of the corresponding demand warehouse, the third actual allocation quantity from the supply warehouse to each demand warehouse is determined according to the first actual allocation quantity, the second actual allocation quantity and the out-of-stock demand in the lead time, and the out-of-stock demand in the lead time is equal to the demand in the lead time minus the initial inventory.

[0160] Since there will be inventory consumption in the warehouse during the lead time of cargo transportation, if too much inventory is on the way after allocation, it will cause all the available inventory to be in transit, and the demand warehouse will have no inventory in stock and will be out of stock.

[0161] Therefore, this step takes this situation into consideration and prepares for the possibility of out-of-stock in the next transportation process when allocating goods for the first time.

[0162] At this time, the allocation quantity from the supply warehouse to each demand warehouse is the third actual allocation quantity, which should satisfy: the third actual allocation quantity = the first actual allocation quantity + the second actual allocation quantity + the out-of-stock demand quantity in the lead time.

[0163] In another embodiment, if the safety stock is not considered, the third actual allocation quantity=the first actual allocation quantity+the out-of-stock demand quantity in the lead time.

[0164] Among them, the out-of-stock demand in the lead time = the demand in the lead time - the initial inventory, the demand in the lead time = the number of days in the lead time × the daily forecast quantity, where the number of days in the lead time refers to the transportation time (days) from the supply warehouse to the demand warehouse.

[0165] Figure 4 Another multi-region warehouse allocation method flow chart provided in the embodiment of the present application. Figure 2 Based on the embodiment shown, the multi-region warehouse allocation method is specifically described. Figure 4 As shown, the multi-region warehouse allocation method of this embodiment includes:

[0166] S410: Obtain a first available allocation quantity of the supply warehouse and a first planned allocation quantity of each demand warehouse. The supply warehouse allocates goods to the demand warehouse. The first planned allocation quantity is the quantity of goods required by each demand warehouse to meet the periodic inventory.

[0167] S420: determining the first planned allocation total amount of all demand warehouses according to the first planned allocation amount of each demand warehouse;

[0168] S430: If the first allocable quantity is less than the first planned total allocable quantity, the first allocable quantity is allocated to each demand warehouse in sequence according to the first allocation priority until the remaining first allocable quantity is less than the daily forecast quantity of any demand warehouse, and the first allocation priority is determined according to the inventory days and / or daily forecast quantity of each demand warehouse;

[0169] S440: Determine a first actual transfer quantity from the supply warehouse to each demand warehouse according to the first allocation result of each demand warehouse;

[0170] The specific contents of steps S410 to S440 can refer to the specific description of steps S210 to S240, which will not be repeated here.

[0171] S450: Determine the box specifications from the supply warehouse to each demand warehouse;

[0172] Since the transportation routes from the supply warehouse to each demand warehouse are different, the types of transportation vehicles may also be different, so the specifications of the boxes transported by the vehicles may also be different.

[0173] The box specification here only refers to the size of the box. For the same product, the same box specification means that the box can hold the same number of products.

[0174] In this embodiment, in order to simplify the description, it is assumed that different transportation routes all use the same vehicle type and container specifications.

[0175] S460: Determine a fourth actual transfer quantity from the supply warehouse to each demand warehouse according to the first actual transfer quantity and the box specification.

[0176] In the actual transportation process, the goods are not transported in a scattered manner, but are packed into boxes. Therefore, even if the goods cannot fill the box, these goods will occupy the space of a box. Therefore, in this case, the first actual transfer quantity needs to be recalculated based on the box specifications.

[0177] Specifically, assuming that the transfer quantity from the supply warehouse to each demand warehouse is the fourth actual transfer quantity based on the consideration of the box specification, and the supply warehouse only meets the cycle inventory of each demand warehouse, the fourth transfer quantity satisfies:

[0178]

[0179] in, The symbol for rounding up.

[0180] If the safety stock days need to be considered, the first actual transfer quantity needs to be added to the second actual transfer quantity; if the lead time demand needs to be considered, the out-of-stock demand needs to be added.

[0181] The following is an example of a warehouse that only meets the cycle inventory of each demand:

[0182] Assume that the first actual transfer quantity from the supply warehouse to one of the demand warehouses is 950, and the capacity of each box is 100. If only 950 are transported separately, 10 boxes are needed. In this way, when 9 boxes are full, there is a waste of space in the remaining box. Therefore, if the available transfer quantity is sufficient, in order to solve this problem, 10 boxes can be arranged to transport 1,000 items, so that each box is fully filled with goods and space is prevented from being wasted.

[0183] In another application scenario, as the product life cycle continues to shorten, the supply chain is also faced with the problem of the coexistence of new and old product codes. If the transfer of new and old codes cannot be handled effectively, it may lead to excess inventory of new products and insufficient inventory of old products, which in turn affects sales and customer satisfaction. In the business scenario of replacing old and new products, it is easy to have a situation where the demand for new codes is small and the inventory is large, and the demand for old codes is large and the inventory is small. In this case, the inventory of new codes must be supplemented according to the demand for old codes. That is, if there is still a transfer gap in the old code after the transfer is completed, the remaining transfer quantity of the new code needs to be used to meet the transfer gap of the old code.

[0184] In order to illustrate how to solve this problem, this embodiment Figure 4 The transfer process is improved on the basis of the embodiment shown, specifically:

[0185] If the goods in the supply warehouse have new and old codes, the goods corresponding to the first actual allocation quantity will select the old-coded goods. If the quantity of the old-coded goods cannot meet the first actual allocation quantity, the new-coded goods will be allocated to meet the gap of the old-coded goods.

[0186] For example, when obtaining the first actual transfer quantity of a certain commodity from the supply warehouse to each demand warehouse, the commodity with the oldest code is prioritized for transfer. If the oldest commodity does not exist, it is compensated with the second oldest commodity. If the second oldest commodity is also insufficient, newer commodities are selected to make up for it, until the latest commodity is out of stock.

[0187] The following are three situations where the transfer quantity is adjusted by replacing the old and new product codes. As shown in Table 7, "New" in the table represents the new code, "Old 1" represents the first old code, and "Old 2" represents the second old code. Because the old 1 code is used to replace the old 2 code, and the new code is used to replace the old 1 code, the old 1 code is also a new code relative to the old 2 code.

[0188] Table 7

[0189]

[0190] In Table 7, there is an allocation gap for the old 2 code, the old 1 code is a new code relative to the old 2 code, and the remaining allocation amount of the old 1 code can meet the allocation gap of the old 2 code, then the allocation amount of the old 1 code is increased to meet the allocation gap of the old 2 code.

[0191] Therefore, in order to meet the allocation gap of 100 of the old 2 code, the allocation amount of the old 1 code is increased by 100, and the remaining allocation amount of the old 1 code is adjusted to 0.

[0192] In Table 8, there is an allocation gap in the old 2 code. The old 1 code is a new code relative to the old 2 code, but the remaining allocation quantity of the old 1 is not enough to meet the allocation gap of the old 2 code. Therefore, the remaining allocation quantity of the new code needs to be called to meet the allocation gap of the old 2 code.

[0193] Table 8

[0194]

[0195] If both the old code 1 and the new code satisfy the allocation gap of the old code 2, the allocation quantity of the old code 1 is adjusted to 600, the remaining allocation quantity of the old code 1 is adjusted to 0, the allocation quantity of the new code is adjusted to 900, and the remaining allocation quantity of the new code is adjusted to 100.

[0196] In Table 9, allocation gaps appear in both the old 1 code and the old 2 code, and the remaining allocation quantity of the new code is not enough to meet the allocation gaps of both the old 1 and old 2. At this time, all the remaining allocation quantity of the new code needs to be allocated and the allocation gap of the old 2 code is met first, and then the allocation gap of the old 1 is met.

[0197]

[0198] All the remaining allocation quantity of the new code is allocated, first to meet the allocation gap of 800 of the oldest code, Old 2, and then to meet the gap of 200 of Old 1. However, because the remaining allocation quantity is insufficient, the gap of Old 1 can only be supplemented by 100. The new code is fully allocated, and the remaining allocation quantities of the new, Old 1, and Old 2 after adjustment are all 0.

[0199] Therefore, through the rational allocation of new and old coded products, it is possible to ensure accurate allocation of resources during the process of introducing new products and withdrawing old products, thereby maintaining the optimal inventory level.

[0200] It should be noted that the above embodiment is for the multi-regional warehouse allocation of a single commodity, but in actual situations, it is impossible for a supply warehouse to allocate only one commodity to each demand warehouse. In this case, it is only necessary to calculate the actual allocation quantity of any commodity from the supply warehouse to each demand warehouse according to the above embodiment, and then sum up the actual allocation quantities of each commodity to a certain demand warehouse to know the actual total allocation quantity of all commodities from the supply warehouse to the demand warehouse.

[0201] Figure 5 This is a schematic diagram of the module structure of a multi-region inventory transfer device provided in an embodiment of the present application. The device can be in the form of software and / or hardware, such as Figure 5 As shown, a multi-region inventory transfer device includes: an acquisition module 501, a calculation module 502, an allocation module 503 and a determination module 504.

[0202] An acquisition module 501 is configured to acquire the available allocation quantity of the supply warehouse and the planned allocation quantity of each demand warehouse, and the supply warehouse allocates goods to the demand warehouse;

[0203] A calculation module 502, which is configured to determine the total planned allocation amount of all demand warehouses according to the planned allocation amount of each demand warehouse;

[0204] The allocation module 503 is configured to allocate the available allocation quantity to each demand warehouse in sequence according to the first allocation priority when it is determined that the available allocation quantity is less than the planned total allocation quantity, until the remaining available allocation quantity is less than the daily forecast quantity of any demand warehouse, and the first allocation priority is determined according to the inventory days and / or daily forecast quantity of each demand warehouse;

[0205] The determination module 504 is configured to determine a first actual allocation quantity of goods from the supply warehouse to each demand warehouse.

[0206] In the allocation module 503, the available allocation quantity is allocated to each demand warehouse in sequence according to the first allocation priority, including:

[0207] Determine the warehouse with the highest priority demand based on the first transfer priority;

[0208] Allocate the daily forecast quantity of goods to the warehouse with the highest priority demand;

[0209] Update the available allocation quantity and the first allocation priority of each demand warehouse;

[0210] The above allocation process is repeated according to the updated first allocation priority.

[0211] In the allocation module 503, the available allocation quantity is allocated to each demand warehouse in turn according to the first allocation priority until the remaining available allocation quantity is less than the daily forecast quantity of any demand warehouse, and the remaining available allocation quantity is allocated to the demand warehouse with the highest priority in the updated first allocation priority.

[0212] In another embodiment, a multi-region inventory transfer device still includes: an acquisition module 501 , a calculation module 502 , an allocation module 503 and a determination module 504 .

[0213] An acquisition module 501 is configured to acquire the available allocation quantity of the supply warehouse and the planned allocation quantity of each demand warehouse, and the supply warehouse allocates goods to the demand warehouse;

[0214] A calculation module 502, which is configured to determine the total planned allocation amount of all demand warehouses according to the planned allocation amount of each demand warehouse;

[0215] The allocation module 503 is configured to determine that the available allocation quantity is not less than the planned allocation total quantity, and then directly allocate according to the planned allocation quantity of each demand warehouse; after the planned allocation quantity of each demand warehouse is met, the available allocation quantity is allocated to each demand warehouse in sequence according to the second allocation priority until the remaining available allocation quantity is less than the daily forecast quantity of any demand warehouse, and the first allocation priority is determined according to the inventory days and / or daily forecast quantity of each demand warehouse;

[0216] The determination module 504 is configured to determine a first actual allocation quantity of goods from the supply warehouse to each demand warehouse.

[0217] In the allocation module 503, the available allocation quantity is allocated to each demand warehouse in sequence according to the second allocation priority, including:

[0218] Determine the warehouse with the highest priority demand based on the second transfer priority;

[0219] Allocate the daily forecast quantity of goods to the warehouse with the highest priority demand;

[0220] Update the available allocation quantity and the second allocation priority of each demand warehouse;

[0221] The above allocation process is repeated according to the updated second allocation priority.

[0222] In the allocation module 503, the available allocation quantity is allocated to each demand warehouse in turn according to the second allocation priority until the remaining available allocation quantity is less than the daily forecast quantity of any demand warehouse, and the remaining available allocation quantity is allocated to the demand warehouse with the highest priority in the updated second allocation priority.

[0223] In another embodiment, after determining module 504, it also includes: determining that the initial inventory of the demand warehouse is less than the lead time demand of the corresponding demand warehouse, then the first actual transfer quantity plus the out-of-stock demand in the lead time is used as the second actual transfer quantity from the supply warehouse to each demand warehouse, and the out-of-stock demand in the lead time is equal to the demand in the lead time minus the initial inventory.

[0224] In another embodiment, after determining module 504, the method further includes:

[0225] Determine the box specifications from the supply warehouse to each demand warehouse;

[0226] The third actual transfer quantity from the supply warehouse to each demand warehouse is determined based on the first actual transfer quantity and the box specification.

[0227] In another embodiment, after determining module 504, it also includes: if the goods in the supply warehouse have new and old codes, the goods corresponding to the first actual allocation quantity select the old-coded goods, and if the quantity of the old-coded goods cannot meet the first actual allocation quantity, then allocation is made from the new-coded goods to meet the gap of the old-coded goods.

[0228] The multi-region inventory transfer device provided in the embodiment of the present application has the same implementation principle and technical effects as those of the aforementioned multi-region warehouse transfer method embodiment. For the sake of brief description, for matters not mentioned in the device embodiment, reference may be made to the corresponding contents in the aforementioned multi-region warehouse transfer method embodiment.

[0229] Figure 6 A hardware structure diagram of an electronic device provided in an embodiment of the present application. This embodiment provides an electronic device, comprising: a processor 601, and a memory 602 in communication with the processor 601; the memory 602 stores computer-executable instructions; the processor 601 executes the computer-executable instructions stored in the memory 602, so as to implement the multi-region warehouse allocation method described in any of the above embodiments.

[0230] Figure 6 The electronic device shown further includes a communication interface 603 and a communication bus 604 , wherein the processor 601 , the memory 602 and the communication interface 603 communicate with each other via the communication bus 604 .

[0231] The memory 602 may include a high-speed random access memory (RAM), and may also include a non-volatile memory, such as at least one disk storage. The communication bus 604 may be an ISA bus, a PCI bus, or an EISA bus. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one bidirectional arrow is used in the figure, but it does not mean that there is only one bus or one type of communication bus.

[0232] The communication interface 603 is used to connect to at least one user terminal and other network units through a network interface, and send the encapsulated IPv4 message or IPv4 message to the user terminal through the network interface.

[0233] The processor 601 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the processor 601. The above processor 601 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The disclosed methods, steps and logic block diagrams in the embodiments of the present disclosure can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiments of the present disclosure can be directly embodied as a hardware decoding processor for execution, or a combination of hardware and software modules in the decoding processor for execution. The software module may be located in a storage medium mature in the art, such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory 602, and the processor 601 reads the information in the memory 602 and completes the steps of the method of the above embodiment in combination with its hardware.

[0234] The embodiment of the present application also provides a computer storage medium, in which a computer-readable storage medium stores computer executable instructions, which are used to implement the multi-region warehouse transfer method described in any of the above embodiments when executed by a processor, and therefore, will not be described in detail here. In addition, the description of the beneficial effects of using the same method will not be described in detail. For technical details not disclosed in the computer storage medium embodiment involved in the present invention, please refer to the description of the method embodiment of the present invention.

[0235] An embodiment of the present application also provides a computer program product, which includes a computer program. When the computer program is executed by a processor, it is used to implement the multi-region warehouse allocation method described in any of the above embodiments. Therefore, it will not be repeated here.

[0236] A person skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program, and the above-mentioned program can be stored in a computer-readable storage medium, and when the program is executed, it can include the processes of the embodiments of the above-mentioned methods. The above-mentioned storage medium can be a disk, an optical disk, a read-only memory (ROM) or a random access memory (RAM), etc.

[0237] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.

Claims

1. A multi-region warehouse transfer method, characterized in that: The method comprises: Obtaining a first available allocation quantity of the supply warehouse and a first planned allocation quantity of each demand warehouse, wherein the supply warehouse allocates goods to the demand warehouse, and the first planned allocation quantity is the quantity of goods required by each demand warehouse to meet the periodic inventory; Determine the total first planned transfer quantity of all demand warehouses based on the first planned transfer quantity of each demand warehouse; If the first allocable quantity is less than the first planned total allocable quantity, the first allocable quantity is allocated to each demand warehouse in sequence according to the first allocation priority until the remaining first allocable quantity is less than the daily forecast quantity of any of the demand warehouses, and the first allocation priority is determined according to the inventory days and / or daily forecast quantity of each demand warehouse; A first actual transfer quantity from the supply warehouse to each demand warehouse is determined according to the first allocation result of each demand warehouse.

2. The method according to claim 1, characterized in that: The step of allocating the first allocable quantity to each demand warehouse in sequence according to the first allocation priority includes: Determine the warehouse with the highest priority demand based on the first transfer priority; Allocate the daily forecast quantity of goods to the warehouse with the highest priority demand; Update the first available allocation quantity and the first allocation priority of each demand warehouse; The above allocation process is repeated according to the updated first allocation priority.

3. The method according to claim 2, characterized in that The method further comprises: allocating the first allocable quantity to each demand warehouse in sequence according to the first allocation priority until the remaining first allocable quantity is less than the daily forecast quantity of any demand warehouse; The remaining first transferable quantity is allocated to the demand warehouse with the highest priority in the updated first transfer priority.

4. The method according to claim 1, characterized in that: The method further comprises: If the first available allocation quantity is not less than the first planned allocation total quantity, it will be directly allocated according to the first planned allocation quantity of each demand warehouse.

5. The method according to claim 4, characterized in that The method further comprises: The second available allocation quantity of the supply warehouse and the second planned allocation quantity of each demand warehouse are obtained. The second available allocation quantity is the commodity inventory quantity of the supply warehouse after satisfying the periodic inventory of each demand warehouse. The second planned allocation quantity is the commodity demand quantity of each demand warehouse that needs to satisfy the safety inventory on the basis of satisfying the periodic inventory. Determine the total second plan transfer quantity of all demand warehouses based on the second plan transfer quantity of each demand warehouse; If the second available allocation quantity is less than the second planned total allocation quantity, the second available allocation quantity is allocated to each demand warehouse in sequence according to the second allocation priority until the remaining second available allocation quantity is less than the daily forecast quantity of any of the demand warehouses. The second allocation priority is determined according to the number of safety stock days and / or daily forecast quantity of each demand warehouse. The second actual transfer quantity from the supply warehouse to each demand warehouse is determined according to the second allocation result of each demand warehouse.

6. The method according to claim 5, characterized in that The step of allocating the second allocable quantity to each demand warehouse in sequence according to the second allocation priority includes: Determine the warehouse with the highest priority demand based on the second transfer priority; Allocate the daily forecast quantity of goods to the warehouse with the highest priority demand; Update the second available allocation quantity and the second allocation priority of each demand warehouse; The above allocation process is repeated according to the updated second allocation priority.

7. The method according to claim 6, characterized in that The method further comprises: allocating the second allocable quantity to each demand warehouse in sequence according to the second allocation priority until the remaining second allocable quantity is less than the daily forecast quantity of any demand warehouse; The remaining second allocable quantity is allocated to the demand warehouse with the highest priority in the updated second allocation priority.

8. The method according to claim 7, characterized in that The method also includes: if the initial inventory of the demand warehouse is less than the lead time demand of the corresponding demand warehouse, determining the third actual allocation quantity from the supply warehouse to each demand warehouse according to the first actual allocation quantity, the second actual allocation quantity and the out-of-stock demand in the lead time, wherein the out-of-stock demand in the lead time is equal to the demand in the lead time minus the initial inventory.

9. The method according to claim 1, characterized in that: After determining the first actual transfer quantity from the supply warehouse to each demand warehouse according to the allocation result of each demand warehouse, the method further includes: Determine the box specifications from the supply warehouse to each demand warehouse; The fourth actual transfer quantity from the supply warehouse to each demand warehouse is determined according to the first actual transfer quantity and the box specification.

10. The method according to claim 1, characterized in that The method also includes: if the goods in the supply warehouse have new and old codes, the goods corresponding to the first actual allocation quantity first select the old-coded goods, and if the quantity of the old-coded goods cannot meet the first actual allocation quantity, then allocate from the new-coded goods to meet the gap of the old-coded goods.

11. A multi-region inventory transfer device, characterized in that: include: An acquisition module is configured to acquire a first available allocation quantity of a supply warehouse and a first planned allocation quantity of each demand warehouse, the supply warehouse allocates goods to the demand warehouse, and the first planned allocation quantity is the quantity of goods required by each demand warehouse to meet the periodic inventory; A calculation module, which is configured to determine the first planned allocation total amount of all demand warehouses according to the first planned allocation amount of each demand warehouse; an allocation module, configured to determine that the first allocable quantity is less than the first planned total allocation quantity, and then allocate the first allocable quantity to each demand warehouse in sequence according to a first allocation priority until the remaining allocable quantity is less than the daily forecast quantity of any of the demand warehouses, wherein the first allocation priority is determined according to the inventory days and / or daily forecast quantity of each demand warehouse; A determination module is configured to determine a first actual transfer quantity from the supply warehouse to each demand warehouse according to the allocation results of each demand warehouse.

12. An electronic device comprising: A processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory to implement the method according to any one of claims 1 to 10.

13. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 10 when executed by a processor.

Images