Method and device for determining commodity allocation quantity

Abstract

The invention discloses a method and device for determining the commodity allocation quantity, and the method aims at the allocation of any commodity in a plurality of front warehouses of a regional distribution center, and comprises the steps: determining the target stock quantity of the commodity in each front warehouse; a constraint condition set of commodity allocation is obtained, a first constraint condition represents that the total allocation amount of the commodities in the regional distribution center is the multiple of the box gauge of the commodities, and a second constraint condition represents that the stock satisfaction rate of any front warehouse does not exceed the stock satisfaction rate upper limit; on the premise that all constraint conditions in the constraint condition set are met, the allocation quantity of the commodities in each front bin is determined by taking the optimal stocking efficiency of all the front bins as a target; the optimal stock-up efficiency represents that the deviation between the stock-up satisfaction rate of each front bin and the average stock-up satisfaction rate is minimum. By adopting the method, the uniform distribution of the stock satisfaction rate of the commodities in each front warehouse can be realized, and the total allocation quantity in the regional distribution center is the multiple of the box gauge of the commodities.

Description

Technical Field

[0001] This application relates to the technical field of warehouse management, and in particular, to a method and device for determining the transfer quantity of goods. Background Art

[0002] During the sorting operation in the regional distribution center, after determining the transfer quantity of a product in a front warehouse, the sorter will obtain the corresponding quantity of products and deliver them to the designated location. This process often requires unpacking operations, and frequent unpacking operations reduce the work efficiency of the sorter.

[0003] The traditional method is to transfer in integer multiples of the case size of the product. However, this may cause problems. For example, if the case size of the product is too large, transferring in integer multiples of the case size will result in too high inventory in the front warehouse. Another example is that when the inventory in the regional distribution center is insufficient, transferring to the front warehouse in integer multiples of the case size will cause too high inventory in some front warehouses and out-of-stock in some front warehouses, and uniform transfer cannot be achieved. Summary of the Invention

[0004] This application provides a method and device for determining the transfer quantity of goods, which is used to achieve a uniform distribution of the stocking satisfaction rate of goods in each front warehouse, and the total transfer quantity in the regional distribution center is a multiple of the case size of the product.

[0005] In a first aspect, an embodiment of this application provides a method for determining the transfer quantity of goods. This method can be executed by a device for determining the transfer quantity of goods. The method includes: determining the target stocking quantity of the product in each front warehouse; obtaining a set of constraint conditions for product transfer, where the set of constraint conditions includes at least a first constraint condition and a second constraint condition; the first constraint condition indicates that the total transfer quantity of the product in the regional distribution center is a multiple of the case size of the product, and the second constraint condition indicates that the stocking satisfaction rate of any front warehouse does not exceed the upper limit of the stocking satisfaction rate; the stocking satisfaction rate is determined by the actual stocking quantity and the target stocking quantity of the front warehouse; on the premise of satisfying each constraint condition in the set of constraint conditions, with the goal of optimal stocking efficiency for each front warehouse, determining the transfer quantity of the product in each front warehouse; the optimal stocking efficiency means that the deviation between the stocking satisfaction rate of each front warehouse and the average stocking satisfaction rate is the smallest; the average stocking satisfaction rate is the mean value of the stocking satisfaction rates of each front warehouse.

[0006] By using the method for determining the commodity allocation quantity in the embodiment of the present application, the total allocation quantity of the commodity in the regional distribution center can be ensured to be an integer multiple of the commodity case specification through the first constraint condition. In this way, the management of the commodity in the regional distribution center can be simplified. The regional distribution center can store and manage the commodity by the whole case, reducing the difficulty of inventory counting caused by scattered commodities. By the second constraint condition, it is ensured that the stock availability rate of the commodity in each front warehouse does not exceed the upper limit of the stock availability rate, and with the goal of minimizing the deviation between the stock availability rate of each front warehouse and the average stock availability rate, the actual allocation quantity of the commodity in each front warehouse can be restricted from being infinitely large, thereby ensuring that the stock availability rate of the commodity in each front warehouse is evenly distributed.

[0007] In a possible implementation manner, the optimal stock preparation efficiency is to calculate the maximum difference between the sum of the stock availability rates of each front warehouse and the sum of the deviations of the stock availability rates of each front warehouse; the deviation of the stock availability rate of any front warehouse is the difference between the stock availability rate of the front warehouse and the average stock availability rate.

[0008] In a possible implementation manner, the set of constraint conditions further includes a third constraint condition; the third constraint condition sets a rounding interval determined by the upper and lower limits of case specification rounding; the third constraint condition indicates that if the remainder obtained by dividing the allocation quantity by the case specification is not within the rounding interval, the allocation quantity is not rounded; within the rounding interval, with the goal of the optimal stock preparation efficiency.

[0009] In a possible implementation manner, the set of constraint conditions includes a fourth constraint condition, and the fourth constraint condition indicates that when the allocation quantity of the commodity in the front warehouse is less than one times the case specification, the allocation quantity is not rounded.

[0010] In a possible implementation manner, determining the target stock quantity of the commodity in each front warehouse includes: for any front warehouse, determining whether the end-of-period inventory of the front warehouse is greater than the starting value of stock preparation; if not, determining the target stock quantity of the front warehouse according to the end-of-period inventory of the front warehouse.

[0011] In a possible implementation manner, the set of constraint conditions further includes at least one of the following constraint conditions: the sum of the allocation quantities of the commodity in the multiple front warehouses is less than or equal to the inventory data of the commodity in the regional distribution center; the allocation quantity of the commodity in any front warehouse is an integer multiple of the allocation unit of the commodity; the allocation unit of the commodity is less than or equal to the case specification of the commodity.

[0012] Second aspect, an embodiment of the present application provides a device for determining the commodity transfer volume. The device includes a determination module for determining the target stock quantity of the commodity in each front warehouse; an acquisition module for acquiring a set of constraint conditions for commodity transfer, where the set of constraint conditions includes at least a first constraint condition and a second constraint condition; the first constraint condition indicates that the total transfer volume of the commodity in the regional distribution center is a multiple of the case size of the commodity, and the second constraint condition indicates that the stock satisfaction rate of any front warehouse does not exceed the upper limit of the stock satisfaction rate; the stock satisfaction rate is determined by the actual stock quantity and the target stock quantity of the front warehouse; the determination module is further configured to, on the premise of satisfying each constraint condition in the set of constraint conditions, determine the transfer volume of the commodity in each front warehouse with the optimal stock efficiency of each front warehouse as the goal; the optimal stock efficiency means that the deviation between the stock satisfaction rate of each front warehouse and the average stock satisfaction rate is the smallest; the average stock satisfaction rate is the average value of the stock satisfaction rates of each front warehouse.

[0013] In a possible implementation manner, the optimal stock efficiency is to calculate the maximum difference between the sum of the stock satisfaction rates of each front warehouse and the sum of the deviations of the stock satisfaction rates of each front warehouse; the deviation of the stock satisfaction rate of any front warehouse is the difference between the stock satisfaction rate of the front warehouse and the average stock satisfaction rate.

[0014] In a possible implementation manner, the set of constraint conditions further includes a third constraint condition; the third constraint condition sets a rounding interval determined by the upper and lower limits of case size rounding; the third constraint condition indicates that if the remainder obtained by dividing the transfer volume by the case size is not within the rounding interval, the transfer volume is not rounded; within the rounding interval, with the optimal stock efficiency as the goal.

[0015] In a possible implementation manner, the set of constraint conditions includes a fourth constraint condition, and the fourth constraint condition indicates that when the transfer volume of the commodity in the front warehouse is less than one times the case size, the transfer volume is not rounded.

[0016] In a possible implementation manner, the determination module is further configured to, for any front warehouse, determine whether the end-of-period inventory of the front warehouse is greater than the starting stock value; if not, determine the target stock quantity of the front warehouse according to the end-of-period inventory of the front warehouse.

[0017] In a possible implementation manner, the set of constraint conditions further includes at least one of the following constraint conditions: the sum of the transfer volumes of the commodity in the multiple front warehouses is less than or equal to the inventory data of the commodity in the regional distribution center; the transfer volume of the commodity in any front warehouse is an integer multiple of the transfer unit of the commodity; the transfer unit of the commodity is less than or equal to the case size of the commodity.

[0018] In a third aspect, an embodiment of the present application further provides a device for determining the quantity of goods allocated. The device includes a memory and a processor. The memory is used to store computer programs or instructions. The processor is used to call the computer programs or instructions stored in the memory and execute the method in any possible implementation manner of the first aspect.

[0019] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium. Instructions are stored in the computer-readable storage medium. When a computer reads and executes the instructions, the computer is caused to execute the method in any possible implementation manner of the first aspect.

[0020] In a fifth aspect, an embodiment of the present application provides a computer program product. Instructions are stored in the computer program product. When a computer reads and executes the instructions, the computer is caused to execute the method in any possible implementation manner of the above-mentioned first aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for description in the embodiments. Obviously, the drawings in the following description are only some embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0022] Figure 1 It is a schematic flowchart corresponding to a method for determining the quantity of goods allocated provided by an embodiment of the present application;

[0023] Figure 2 It is a schematic flowchart corresponding to a method for determining the quantity of goods allocated provided by an embodiment of the present application;

[0024] Figure 3 It is a schematic internal module diagram of a device 3000 for determining the quantity of goods allocated provided by an embodiment of the present application;

[0025] Figure 4 It is a schematic structural diagram of a device 4000 for determining the quantity of goods allocated provided by an embodiment of the present application. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0026] In order to make the objectives, technical solutions, and advantages of the present application clearer, the following will further describe the present application in detail with reference to the drawings. Obviously, the described embodiments are only some embodiments of the present application, rather than all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present application.

[0027] Under the supply chain system of the front - end warehouse model, various commodities are allocated from the regional distribution center to the front - end warehouse for sale. After determining the allocation quantity of a commodity in a front - end warehouse, the sorter will obtain the corresponding quantity of the commodity and place it at the designated position. This process often requires unpacking because the allocation quantity of a commodity in a front - end warehouse is an integer multiple of the allocation unit, but the allocation unit is not equal to the case quantity. The allocation unit is a positive integer less than or equal to the case quantity, that is, the allocation quantity of a commodity in a front - end warehouse is not an integer multiple of the case quantity. The case quantity can be understood as the quantity included in one case, and the allocation unit represents the minimum unit of allocation. For example, 4 bottles of Wahaha beverages are packaged in a plastic film, and one case of Wahaha contains 10 plastic films, including 40 bottles of beverages, that is, the case quantity is 40 bottles, and the allocation unit is 4. The present application does not limit the size of the case quantity and the allocation unit.

[0028] After the sorter unpacks the box to pick up the goods and then sorts the goods, this will reduce the operation efficiency. If the allocation of goods in each front - end warehouse is in integer multiples of the case quantity, the following problems may occur: the case quantity of the goods is too large, and allocating according to the case quantity will lead to too high turnover in the front - end warehouse; when the total inventory in the regional distribution center is insufficient, allocating according to the case quantity can only be allocated to some front - end warehouses, while in actual business, it is expected that the allocation quantities of each front - end warehouse are evenly distributed, otherwise some front - end warehouses will be out of stock and some front - end warehouses will have too high turnover.

[0029] If the allocation quantity of the commodity in some front - end warehouses is rounded, when the remainder of the allocation quantity relative to the case quantity is close to 0 times the case quantity or 1 times the case quantity, the allocation quantity is rounded to a multiple of the case quantity. For example, if the case quantity is 10 and the allocation unit is 1 piece, when the allocation quantity is 8 - 12 pieces, it is allocated according to one - time case quantity; when the allocation quantity is 18 - 22 pieces, it is allocated according to 2 times the case quantity. When the remainder of the allocation quantity relative to the case quantity is not close to 0 times the case quantity or 1 times the case quantity, the allocation quantity may not be rounded. In this way, the total allocation quantity of the commodity in all front - end warehouses under the regional distribution center is not a multiple of the case quantity, which cannot meet the requirement in the business that the total allocation quantity of a commodity under the regional distribution center is a multiple of the case quantity. For example, the case quantity is 10, the regional distribution center manages 3 front - end warehouses, and the allocation quantities of a commodity for the 3 front - end warehouses are 12, 19, and 15 respectively. Then, according to the preset rules, 12 is rounded to 10, 19 is rounded to 20, and 15 is not rounded. Then, the adjusted allocation quantities of the 3 front - end warehouses are 10, 20, and 15 respectively. The total allocation quantity of this commodity in the regional distribution center is 45, which is not an integer multiple of the case quantity. If it is necessary to make the total allocation quantity of this commodity by the regional distribution center meet the integer multiple of the case quantity, manual adjustment is still required. Since there are many types of commodities and many front - end warehouses, it is also difficult for manual operation to decide how to adjust the allocation quantity.

[0030] Based on this, an embodiment of the present application provides a method for determining the commodity allocation quantity. This method is for the allocation of any commodity among multiple front warehouses in the regional distribution center. The regional distribution center is responsible for managing the allocation of each front warehouse, which can achieve a uniform distribution of the stock fulfillment rate of the commodity in each front warehouse, and the total allocation quantity in the regional distribution center is a multiple of the case size of the commodity.

[0031] Figure 1 It is a schematic flowchart corresponding to a method for determining the commodity allocation quantity provided by an embodiment of the present application. This schematic flowchart can be executed by a device for determining the commodity allocation quantity, such as Figure 1 As shown, this process includes the following steps:

[0032] Step 101, the device for determining the commodity allocation quantity determines the target stock quantity of the commodity in each front warehouse.

[0033] The device for determining the commodity allocation quantity can be a computer, a server, or other intelligent devices. For any commodity, determine the target stock quantity of the commodity in each front warehouse. The target stock quantity is the stock target of the commodity determined by the front warehouse, that is, after the allocation of the commodity, the inventory quantity of the commodity in the front warehouse. For example, a commodity is Simian dumplings. After this allocation, the target stock quantity of the commodity in the first front warehouse is 50 bags, and the target stock quantity in the second front warehouse is 45 bags. Regarding the determination of the target stock quantity of the commodity in each front warehouse, the present application does not make specific limitations. It can be determined by the staff based on experience or by the staff according to an algorithm model.

[0034] In a possible implementation manner, determining the target stock quantity of the commodity in each front warehouse includes: for any front warehouse, determining whether the end-of-period inventory of the front warehouse is greater than the starting stock value; if not, determining the target stock quantity of the front warehouse according to the end-of-period inventory of the front warehouse.

[0035] Specifically, before determining the target stock quantity of a product in each front-warehouse, the starting stock value and the ending inventory of the product in each front-warehouse can be determined first. Exemplarily, for any front-warehouse, such as the first front-warehouse, the first front-warehouse has a starting stock value for the product. The starting stock value refers to the threshold at which the product is allocated in the first front-warehouse. Determine the ending inventory of the product in the first front-warehouse. The ending inventory refers to the current remaining quantity of the product. If the ending inventory of the product is greater than the starting stock value, then the product is not allocated to the first front-warehouse this time; if the ending inventory of the product is not greater than the starting stock value, then the product can be allocated to the first front-warehouse this time. For example, the product is Simiao dumplings, and the starting stock value of Simiao dumplings in the first front-warehouse is 20 bags. If the current ending inventory of Simiao dumplings in the first front-warehouse is 25 bags, then Simiao dumplings are not allocated to the first front-warehouse this time; if the current ending inventory in the first front-warehouse is 10 bags, then Simiao dumplings can be allocated to the first front-warehouse. In this way, it can be prevented that when the ending inventory of the product in the first front-warehouse is too high, the product is still continuously allocated to the first front-warehouse, resulting in inventory backlog, because when the ending inventory of the product in the first front-warehouse is too high, it means that the sales situation of the product in the first front-warehouse is not good. If the product is continuously allocated to the first front-warehouse, it will cause inventory backlog of the product in the first front-warehouse.

[0036] Step 102, the device for determining the product allocation quantity obtains a set of constraints for product allocation. The set of constraints includes at least a first constraint and a second constraint. The first constraint indicates that the total allocation quantity of the product in the regional distribution center is a multiple of the case size of the product, and the second constraint indicates that the stock satisfaction rate of any front-warehouse does not exceed the upper limit of the stock satisfaction rate.

[0037] Specifically, obtain the set of constraints, and determine the allocation quantity of the product according to the set of constraints. Optionally, construct a mathematical model according to the set of constraints, and solve the model according to the constructed mathematical model to determine the allocation quantity of the product. The mathematical model can be constructed when determining the allocation quantity of the product, or can be pre-constructed.

[0038] The set of constraints includes at least a first constraint and a second constraint. The first constraint indicates that the total allocation quantity of the product in the regional distribution center is an integer multiple of the case size of the product. The regional distribution center is responsible for managing the products in each front-warehouse. A certain quantity of products is allocated from the regional distribution center to each front-warehouse. In the embodiments of the present application, the total allocation quantity of a certain product allocated from the regional distribution center is required to be an integer multiple of the case size of the product. In this way, the management in the regional distribution center can be simplified. The regional distribution center can store and manage according to whole cases, reducing the difficulty of inventory counting caused by scattered products.

[0039] The first constraint can be expressed by the formula as:

[0040]

[0041] wherein, i is the i-th front warehouse, B is the case specification of the goods in the regional distribution center, indicating the number of goods included in one case, N is a positive integer, and x i represents the allocation quantity of a certain good in the i-th front warehouse.

[0042] The second constraint condition indicates that the stock availability rate of any front warehouse does not exceed the upper limit of the stock availability rate. The stock availability rate is determined by the actual stock quantity and the target stock quantity of the front warehouse. Specifically, any front warehouse can be the first front warehouse. The actual stock quantity refers to the actual quantity of the good in the first front warehouse after the goods are allocated to the first front warehouse. Optionally, the stock availability rate can be the ratio of the actual stock quantity to the target stock quantity, and the actual stock quantity can be the sum of the end-of-period inventory of the good and the allocation quantity of this allocation. The stock availability rate does not exceed the upper limit of the stock availability rate.

[0043] The upper limit of the stock availability rate can be set according to the nature of the goods and the experience of relevant staff. Generally, taking 1 as the benchmark, it takes values within a small range, such as greater than or equal to 0.9 and less than or equal to 1.1. It can be 1.05. The embodiments of the present application do not limit the value of the upper limit of the stock availability rate.

[0044] Taking Synear dumplings as an example, the end-of-period inventory of Synear dumplings in the first front warehouse is 10 bags, and the target stock quantity of Synear dumplings in the first front warehouse is 35 bags. If 25 bags are allocated to the first front warehouse in this allocation, the stock availability rate of Synear dumplings in the first front warehouse is 100%, that is, (10 + 25) / 35; if 26 bags are allocated to the first front warehouse in this allocation, the stock availability rate of Synear dumplings in the first front warehouse is 1.03, that is, (10 + 26) / 35. The second constraint condition of the present application requires that the stock availability rate of the goods in each front warehouse does not exceed the upper limit of the stock availability rate. In this way, it can be restricted that the actual allocation quantity of the goods in each front warehouse will not be infinitely large, and further ensure that the stock availability rates of the goods in each front warehouse are evenly distributed.

[0045] The second constraint condition can be expressed by the formula as:

[0046] y i ≤L

[0047]

[0048] wherein, y i represents the stock availability rate of the i-th front warehouse for a certain good, L is the upper limit of the stock availability rate; s i represents the end-of-period inventory of the i-th front warehouse for this good, represents the target stock quantity of the i-th front warehouse for this good, regarding x iIts meaning has been described in the first constraint condition and will not be elaborated here.

[0049] In a possible implementation, the set of constraint conditions further includes other constraint conditions, such as the third constraint condition. The third constraint condition sets a rounding interval determined by the upper and lower limits of case-size rounding. The third constraint condition indicates that if the remainder obtained by dividing the allocation quantity by the case size is not within the rounding interval, the allocation quantity is not rounded; if it is within the rounding interval, the goal is to optimize the stocking efficiency.

[0050] Specifically, the upper and lower limits of case-size rounding can be set according to the experience of the staff. The value range of the lower limit can be a natural number greater than 0.5 and less than 1, and the value range of the upper limit can be a natural number greater than 1 and less than 1.5. The range of the upper and lower limits is only an example, and the embodiments of the present application do not specifically limit the value range of the upper and lower limits or the values of the upper and lower limits. In the embodiments of the present application, 0.8 and 1.2 can be used as the upper and lower limits of rounding. Combining the size of the case, the rounding interval is determined according to the case size and the upper and lower limits of case-size rounding. If the case size is 10, the lower limit of rounding is 0.8, and the upper limit is 1.2, then the rounding interval is 8 - 12, that is, 0.8 * 10 - 1.2 * 10. If the remainder obtained by dividing the allocation quantity by the case size is not within the rounding interval, the allocation quantity does not need to be rounded, that is, if the remainder obtained by dividing the allocation quantity by the case size is less than 8 or greater than 2, the allocation quantity does not need to be rounded; if the remainder obtained by dividing the allocation quantity by the case size is within the rounding interval, the goal is to optimize the stocking efficiency. In this way, it is possible to determine whether to round according to the size of the allocation quantity and the stocking efficiency. In addition, rounding the case size according to the upper and lower limits of case-size rounding is flexible, and the upper and lower limits of case-size rounding can be flexibly adjusted according to the characteristics of the commodity.

[0051] The third constraint condition can be expressed by the formula:

[0052] x i -t i B = r i (a)

[0053] r i ≤(1 - w i ) M (b)

[0054] r i ≤l i B+w i M (c)

[0055] r i ≥(u i -1-p i ) B - w i M (d)

[0056] Among them, x iThe meanings of A and B have been described above and will not be elaborated here. t i represents the multiple obtained by dividing the allocation quantity of the commodity in the i-th front warehouse by the case size; r i represents the remainder obtained by dividing the allocation quantity of the commodity in the i-th front warehouse by the case size; l i is the lower limit of the rounding of the commodity case size; u i is the upper limit of the rounding of the commodity case size; M is a maximum value, such as 10 to the power of 6, and can be any large number; p i , w i is a logical constraint binary variable, taking values of 0 or 1, where p i = 1 represents that the allocation quantity is less than one case size, and p i = 0 represents that the allocation quantity exceeds one case size; w i = 1 indicates that case size rounding has occurred, and w i = 0 indicates that case size rounding has not occurred.

[0057] Specifically, according to the formula in (a), t i can be determined as the multiple obtained by dividing the allocation quantity of the commodity in the i-th front warehouse by the case size, and r i is the remainder obtained by dividing the allocation quantity of the commodity in the i-th front warehouse by the case size; it can be seen from formula (b) that when w i = 1 (meeting the rounding condition), the remainder of the allocation quantity by the case size is 0, and when w i = 0 (not meeting the rounding condition), the remainder of the allocation quantity by the case size is less than or equal to a maximum value; it can be seen from formula (c) that when w i = 0 (not meeting the rounding condition), the remainder of the allocation quantity by the case size is not greater than the case size * the lower limit of the case size rounding threshold. For example, when l i = 0.8 and the case size is 10, then the remainder of the allocation quantity is required to be not greater than 8 at this time; when w i = 1 (meeting the rounding condition), the remainder of the allocation quantity by the case size is also obviously established; it can be seen from formula (d) that when w i = 0 (not meeting the rounding condition), and when the allocation quantity is at least 1 case size (p i = 0), the remainder of the allocation quantity by the case size is not less than the case size * (the upper limit of the case size rounding threshold - 1). For example, when u i = 1.2 and the case size is 10, then the remainder of the allocation quantity is required to be not less than 2 at this time; when w i = 0 (not meeting the rounding condition) and the allocation quantity is less than one case size (p i = 1) and w i = 1 (meeting the rounding condition), the remainder of the allocation quantity by the case size is obviously established.

[0058] In a possible implementation, the set of constraint conditions further includes a fourth constraint condition, which characterizes that when the allocation quantity of the commodity in the front warehouse is less than one case size, the allocation quantity is not rounded.

[0059] Specifically, since the transfer quantity of goods in many front warehouses is very small, when the transfer quantity is less than one times the box specification, the box specification rounding is not considered in the embodiments of the present application. The fourth constraint condition can be expressed by the formula:

[0060] t i ≤ (1 - p i ) M (e)

[0061] t i ≥ 1 - p i (f)

[0062] Wherein, the meanings of p i and M will not be elaborated here. It can be seen from formula (e) that when p i = 1 (the transfer quantity is less than one times the box specification), t i = 0, that is, when the transfer quantity is less than one times the box specification, the box specification rounding is not considered, and the multiple of the transfer quantity box specification is 0; It can be seen from formula (f) that when p i = 0 (the transfer quantity is greater than one times the box specification), it is required that the transfer quantity is not less than one times the box specification when the box specification rounding occurs, and the multiple of the transfer quantity box specification is greater than or equal to 1. For example, the box specification is 10, the transfer quantity is 7, p i = 1. According to formulas (e) and (f), t i = 0, which meets the requirement that the box specification rounding is not considered when the transfer quantity is less than one times the box specification. In this way, it can be ensured that when the transfer quantity of goods is small or the box specification is too large, it will not be rounded to 0, and there is still a transfer quantity to meet the needs of the front warehouse.

[0063] In a possible implementation manner, the constraint condition set further includes at least one of the following constraint conditions: the sum of the transfer quantities of goods in multiple front warehouses is less than or equal to the inventory data of the goods in the regional distribution center; the transfer quantity of goods in any front warehouse is an integer multiple of the transfer unit of the goods, and the transfer unit of the goods is less than or equal to the box specification of the goods.

[0064] Specifically, the sum of the transfer quantities of goods in multiple front warehouses cannot be greater than the total inventory of the goods in the regional distribution center. If it is greater than the inventory of the goods in the regional distribution center, the actual transfer cannot be realized according to the transfer quantity of the goods. Moreover, in business, it is required that the transfer quantity of goods is at least an integer multiple of the transfer unit, and the transfer unit of the goods is less than or equal to the box specification of the goods.

[0065] It can be expressed by the formula:

[0066]

[0067] x i = n i b i

[0068] Let D denote the total inventory of goods in the regional distribution center, and b i denote the transfer unit, and n i denote an integer multiple of the transfer unit.

[0069] Step 103: On the premise of satisfying each constraint condition in the constraint condition set, the device for determining the goods transfer volume aims to optimize the stocking efficiency of each front warehouse and determines the transfer volume of goods in each front warehouse.

[0070] Specifically, on the premise of satisfying each constraint condition, aiming to optimize the stocking efficiency, determine the transfer volume of goods in each front warehouse. Optimizing the stocking efficiency means that the deviation between the stocking satisfaction rate of each front warehouse and the average stocking satisfaction rate is minimized, and the average stocking satisfaction rate is the mean value of the stocking satisfaction rates of each front warehouse. Ensuring that the deviation between the stocking satisfaction rate of each front warehouse and the average stocking satisfaction rate is minimized can ensure that the stocking satisfaction rates of each front warehouse are closest to the average stocking satisfaction rate, that is, the stocking satisfaction rates of each front warehouse are evenly distributed.

[0071] In a possible implementation, optimizing the stocking efficiency is to calculate the maximum difference between the sum of the stocking satisfaction rates of each front warehouse and the sum of the deviations of the stocking satisfaction rates of each front warehouse. The deviation of the stocking satisfaction rate of any front warehouse is the difference between the stocking satisfaction rate of the front warehouse and the average stocking satisfaction rate.

[0072] Specifically, optimizing the stocking efficiency means the maximum difference between the sum of the stocking satisfaction rates of each front warehouse and the sum of the deviations of the stocking satisfaction rates of each front warehouse, that is, ensuring that the sum of the stocking satisfaction rates of each front warehouse is relatively large and the sum of the deviations of the stocking satisfaction rates of each front warehouse is relatively small. A relatively large sum of the stocking satisfaction rates of each front warehouse can ensure that each front warehouse can achieve a relatively high stocking satisfaction rate as much as possible, and a relatively small sum of the deviations of the stocking satisfaction rates of each front warehouse can ensure that the stocking satisfaction rates of each front warehouse are evenly distributed.

[0073] Optimizing the stocking efficiency can be expressed by the formula:

[0074]

[0075] Optimizing the stocking efficiency means that the value of the above formula is the largest. α and β are hyperparameters and are the weight coefficients of the two goals of "maximizing the stocking satisfaction rate" and "minimizing the deviation of the stocking satisfaction rate". Therefore, on the premise of satisfying each constraint condition in the constraint condition set, making the value of the above formula the largest, the obtained x i is the optimal solution of the transfer volume of goods in each front warehouse. Among them, that is denotes the average stocking satisfaction rate, and z i denotes the absolute value of the difference between the stocking satisfaction rate of goods in each front warehouse and the average stocking satisfaction rate.

[0076] In the embodiment of the present application, a mathematical model is constructed according to a set of constraint conditions. If the set of constraint conditions for each commodity is the same, then each commodity can share a mathematical model. Here, the same set of constraint conditions for each commodity means that the parameters in the set of constraint conditions are also the same. Information of the commodity is input into the data model, and the mathematical model is solved. The solution result of the model is the optimal solution of the allocation quantity of the commodity in each forward warehouse. The information of the commodity may include the end-of-period inventory of the commodity in each forward warehouse, the target stocking quantity, the starting value of stocking, the upper and lower limits of case size rounding, the allocation unit of the commodity, the upper limit of the stocking satisfaction rate of the commodity, the inventory data of the commodity in the regional distribution center, the case size of the commodity, the maximum value, and the hyperparameters in the stocking efficiency formula. Figure 2 FIG. 228 is a schematic flowchart corresponding to a method for determining the allocation quantity of a commodity provided by an embodiment of the present application. The model establishment in step 201 may also be to obtain a pre-set model. In this way, the optimal solution can be quickly obtained by calculating the data model according to the solution engine, improving the efficiency of determining the allocation quantity of the commodity.

[0077] Figure 3 FIG. 231 is a schematic internal module diagram of a device 3000 for determining the allocation quantity of a commodity provided by an embodiment of the present application. As Figure 3 shown, the device may include: a determination module 301, an acquisition module 302. Optionally, it further includes a storage module for storing computer instructions or programs. The determination module 301 may call the computer instructions or programs in the storage module.

[0078] The determination module 301 is used to determine the target stocking quantity of the commodity in each forward warehouse; the acquisition module 302 is used to acquire a set of constraint conditions for commodity allocation, and the set of constraint conditions includes at least a first constraint condition and a second constraint condition; the first constraint condition indicates that the total allocation quantity of the commodity in the regional distribution center is a multiple of the case size of the commodity, and the second constraint condition indicates that the stocking satisfaction rate of any forward warehouse does not exceed the upper limit of the stocking satisfaction rate; the stocking satisfaction rate is determined by the actual stocking quantity and the target stocking quantity of the forward warehouse; the determination module 301 is further used to, on the premise of satisfying each constraint condition in the set of constraint conditions, with the goal of optimal stocking efficiency for each forward warehouse, determine the allocation quantity of the commodity in each forward warehouse; the optimal stocking efficiency means that the deviation between the stocking satisfaction rate of each forward warehouse and the average stocking satisfaction rate is the smallest; the average stocking satisfaction rate is the mean value of the stocking satisfaction rates of each forward warehouse.

[0079] In a possible implementation manner, the optimal stocking efficiency is to calculate the maximum difference between the sum of the stocking satisfaction rates of each forward warehouse and the sum of the deviations of the stocking satisfaction rates of each forward warehouse; the deviation of the stocking satisfaction rate of any forward warehouse is the difference between the stocking satisfaction rate of the forward warehouse and the average stocking satisfaction rate.

[0080] In a possible implementation, the set of constraint conditions further includes a third constraint condition; the third constraint condition is provided with a rounding interval determined by the upper and lower limits of rounding by the case size; the third constraint condition indicates that if the remainder obtained by dividing the transfer quantity by the case size is not within the rounding interval, the transfer quantity is not rounded; within the rounding interval, the target is to optimize the stocking efficiency.

[0081] In a possible implementation, the set of constraint conditions includes a fourth constraint condition, and the fourth constraint condition indicates that when the transfer quantity of a commodity in a front warehouse is less than one times the case size, the transfer quantity is not rounded.

[0082] In a possible implementation, the determining module 301 is further configured to, for any front warehouse, determine whether the end-of-period inventory of the front warehouse is greater than the starting value of stocking; if not, determine the target stocking quantity of the front warehouse according to the end-of-period inventory of the front warehouse.

[0083] In a possible implementation, the set of constraint conditions further includes at least one of the following constraint conditions: the sum of the transfer quantities of the commodity in the multiple front warehouses is less than or equal to the inventory data of the commodity in the regional distribution center; the transfer quantity of the commodity in any front warehouse is an integer multiple of the transfer unit of the commodity; the transfer unit of the commodity is less than or equal to the case size of the commodity.

[0084] Figure 4 FIG. is a schematic structural diagram of a device 4000 for determining the transfer quantity of a commodity provided by an embodiment of the present application. As Figure 4 shown, it includes at least one processor 401 and a memory 402 connected to the at least one processor 401. In the embodiment of the present application, the specific connection medium between the processor 401 and the memory 402 is not limited. Figure 4 Taking the example that the processor 401 and the memory 402 are connected through a bus. The bus can be divided into an address bus, a data bus, a control bus, etc.

[0085] In the embodiment of the present application, the memory 402 stores instructions executable by the at least one processor 401, and the at least one processor 401 can implement the steps of the method for determining the transfer quantity of a commodity by executing the instructions stored in the memory 402.

[0086] Among them, the processor 401 is the control center of the computer device. It can connect various parts of the computer device through various interfaces and lines, and perform resource settings by running or executing instructions stored in the memory 402 and calling data stored in the memory 402. Optionally, the processor 401 may include one or more processing units. The processor 401 may integrate an application processor and a modem processor. Among them, the application processor mainly processes the operating system, user interface, application programs, etc., and the modem processor mainly processes wireless communication. It can be understood that the above-mentioned modem processor may not be integrated into the processor 401. In some embodiments, the processor 401 and the memory 402 may be implemented on the same chip. In some embodiments, they may also be separately implemented on independent chips.

[0087] The processor 401 may be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application specific integrated circuit (ASIC), a field programmable gate array, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present application may be directly embodied as being executed by a hardware processor, or executed by a combination of hardware and software modules in the processor.

[0088] The memory 402, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The memory 402 can include at least one type of storage medium. For example, it can include flash memory, hard disks, multimedia cards, card-type memories, random access memory (RAM), static random access memory (SRAM), programmable read-only memory (PROM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), magnetic memories, magnetic disks, optical disks, and so on. The memory 402 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. The memory 402 in the embodiments of the present application can also be a circuit or any other device capable of implementing a storage function, for storing program instructions and / or data.

[0089] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk memories, CD-ROMs, optical memories, etc.) that contain computer-usable program code.

[0090] The present application is described with reference to the flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of flows and / or blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to the processors of general-purpose computers, special-purpose computers, embedded processors, or other programmable data processing devices to generate a machine, such that the instructions executed by the processors of the computer or other programmable data processing devices generate means for implementing the functions specified in Figure 1 one flow or multiple flows and / or blocks Figure 1 one block or multiple blocks.

[0091] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce a manufacture including an instruction device that implements the function specified in one or more of the processes and / or blocks Figure 1 one or more of the processes and / or blocks Figure 1 specified in the block or blocks.

[0092] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, so that the instructions executed on the computer or other programmable apparatus provide steps for implementing the function specified in one or more of the processes and / or blocks Figure 1 one or more of the processes and / or blocks Figure 1 specified in the block or blocks.

[0093] It will be apparent to those skilled in the art that various modifications and variations can be made to the present application without departing from the spirit and scope of the application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalent technologies, the present application is also intended to include these modifications and variations.

Claims

1. A method for determining the amount of commodity transfer, characterized in that: The method is for the allocation of any commodity to multiple forward warehouses in a regional distribution center, and includes: Determine the target inventory quantity of the product in each forward warehouse; Obtain a set of constraints for commodity allocation, wherein the set of constraints includes at least a first constraint and a second constraint; the first constraint indicates that the total amount of the commodity allocated in the regional distribution center is a multiple of the box size of the commodity, and the second constraint indicates that the stocking satisfaction rate of any forward warehouse does not exceed the upper limit of the stocking satisfaction rate; the stocking satisfaction rate is determined by the actual stocking quantity of the forward warehouse and the target stocking quantity of the forward warehouse; On the premise of satisfying each constraint in the constraint set, with the goal of optimizing the stocking efficiency of each forward warehouse, the allocation quantity of the commodity in each forward warehouse is determined; the optimal stocking efficiency means that the deviation between the stocking satisfaction rate of each forward warehouse and the average stocking satisfaction rate is minimal; the average stocking satisfaction rate is the average of the stocking satisfaction rates of each forward warehouse.

2. The method according to claim 1, characterized in that The optimal stocking efficiency is to calculate the maximum difference between the sum of the stocking satisfaction rates of each forward warehouse and the sum of the stocking satisfaction rate deviations of each forward warehouse; The inventory fulfillment rate deviation of any forward warehouse is the difference between the inventory fulfillment rate of the forward warehouse and the average inventory fulfillment rate.

3. The method according to claim 1, characterized in that The constraint condition set also includes a third constraint condition; the third constraint condition is provided with a rounding interval determined by the upper and lower limits of the box gauge rounding; The third constraint condition indicates that if the remainder obtained by dividing the allocation quantity by the box size is not within the rounding interval, the allocation quantity is not rounded; within the rounding interval, the optimal stocking efficiency is taken as the goal.

4. The method according to claim 3, characterized in that The constraint condition set includes a fourth constraint condition, and the fourth constraint condition represents that when the allocation quantity of the commodity in the forward warehouse is less than one time of the box specification, the allocation quantity is not rounded.

5. The method according to any one of claims 1 to 4, characterized in that Determining the target stocking quantity of the product in each forward warehouse includes: For any forward warehouse, determine whether the ending inventory of the forward warehouse is greater than the starting value of stocking; If it is not greater than, the target stocking quantity of the forward warehouse is determined according to the ending inventory of the forward warehouse.

6. The method according to any one of claims 1 to 4, characterized in that The constraint set also includes at least one of the following constraints: The sum of the transfer quantities of the commodity in the multiple forward warehouses is less than or equal to the inventory data of the commodity in the regional distribution center; The transfer quantity of the commodity in any forward warehouse is an integer multiple of the transfer unit of the commodity; The allocation unit of the commodity is less than or equal to the box size of the commodity.

7. A device for determining the amount of commodity transfer, characterized in that: include: A determination module is used to determine the target stocking quantity of the product in each forward warehouse; An acquisition module is used to acquire a set of constraints for commodity allocation, wherein the set of constraints includes at least a first constraint and a second constraint; the first constraint indicates that the total amount of the commodity allocated in the regional distribution center is a multiple of the box size of the commodity, and the second constraint indicates that the stocking satisfaction rate of any forward warehouse does not exceed the upper limit of the stocking satisfaction rate; The stocking satisfaction rate is determined by the actual stocking quantity of the forward warehouse and the target stocking quantity of the forward warehouse; The determination module is further used to determine the allocation quantity of the commodity in each forward warehouse with the goal of optimizing the stocking efficiency of each forward warehouse on the premise of satisfying each constraint in the constraint set; the optimal stocking efficiency is characterized in that the deviation between the stocking satisfaction rate of each forward warehouse and the average stocking satisfaction rate is minimal; the average stocking satisfaction rate is the average of the stocking satisfaction rates of each forward warehouse.

8. A device for determining the amount of commodity transfer, characterized in that: include: Memory, used to store computer programs or instructions; A processor, configured to call a computer program or instruction stored in the memory to execute the method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores instructions, and when a computer reads and executes the instructions, the computer executes the method according to any one of claims 1 to 6.

10. A computer program product, characterized in that The computer program product stores instructions, and when a computer reads and executes the instructions, the computer executes the method according to any one of claims 1 to 6.

Images