A method and device for determining transfer relationship

Abstract

The present invention discloses a method and device for determining a transfer relationship, and relates to the field of computer technology. A specific implementation of the method includes: predicting the sales volume of each commodity in each store, and calculating the total inventory of each commodity; judging whether the total inventory is greater than or equal to the sales volume, if so, taking a function based on the transfer cost and the out-of-stock cost as the objective function; if not, taking a function based on the transfer cost and the holding cost as the objective function; optimizing and solving the objective function, thereby determining the transfer relationship. This implementation can solve the problem of not considering insufficient inventory and transfer costs.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method and device for determining a transfer relationship. Background Art

[0002] In chain brand stores, due to large changes in demand or inaccurate initial shipments from warehouses, some stores are often out of stock, while other stores have inventory backlogs. Therefore, it is necessary to transfer inventory between stores so that each store can properly meet customer needs. If there are many stores, how to deliver goods between them and which goods to deliver are urgent problems that need to be solved.

[0003] The existing technology is to predict future product sales based on historical orders, and then set an objective function, which is mainly to minimize the difference between the store inventory after allocation and the predicted sales, and then optimize and solve the objective function under the constraints to obtain the allocation relationship.

[0004] In the process of implementing the present invention, the inventors found that there are at least the following problems in the prior art:

[0005] 1) The situation of insufficient inventory is not taken into account. If the inventory is insufficient, the actual store inventory after allocation is still less than the sales volume, and the above function will fail;

[0006] 2) The transfer cost is not taken into consideration. Each transfer will incur a certain cost. The more frequent the transfer and the higher the transfer amount, the higher the cost. Summary of the invention

[0007] In view of this, an embodiment of the present invention provides a method and apparatus for determining a transfer relationship, which can solve the problem of not considering insufficient inventory and transfer costs.

[0008] To achieve the above objective, according to one aspect of an embodiment of the present invention, a method for determining a transfer relationship is provided, comprising:

[0009] Predict sales of each product in each store and calculate total inventory of each product;

[0010] Determine whether the total inventory is greater than or equal to the sales volume. If so, use a function based on the transfer cost and the out-of-stock cost as the objective function; if not, use a function based on the transfer cost and the holding cost as the objective function;

[0011] The objective function is optimized and solved to determine the allocation relationship.

[0012] Optionally, the function based on the transfer cost and the out-of-stock cost is:

[0013]

[0014] in, For the predicted sales volume, To transfer the inventory of store j, C s is the out-of-stock cost of each item, C al The transfer cost of each commodity;

[0015] The function based on transfer cost and holding cost is:

[0016]

[0017] Among them, H is the daily holding cost of each commodity, C al is the transfer cost of each item, is the average daily sales volume of store products. To transfer the back-end store inventory, D l It is the remaining inventory of all stores after T days, which is the time required for all stores to sell out all the goods on the same day.

[0018] Optionally, optimizing and solving the objective function to determine the allocation relationship includes:

[0019] Optimizing the objective function through constraint rules to obtain an optimized objective function;

[0020] The optimized objective function is solved to determine the allocation relationship.

[0021] Optionally, the constraint rules include at least one of a store transferable inventory constraint, a warehouse supply constraint, an avoidance of self-allocation constraint, an allocation quantity non-negative constraint, and a store storage capacity constraint.

[0022] In addition, according to another aspect of an embodiment of the present invention, a device for determining a transfer relationship is provided, including:

[0023] The calculation module is used to predict the sales volume of each product in each store and calculate the total inventory of each product;

[0024] A judgment module, used to judge whether the total inventory is greater than or equal to the sales volume, and if so, a function based on the allocation cost and the out-of-stock cost is used as the objective function; if not, a function based on the allocation cost and the holding cost is used as the objective function;

[0025] The solution module is used to optimize and solve the objective function to determine the allocation relationship.

[0026] Optionally, the function based on the transfer cost and the out-of-stock cost is:

[0027]

[0028] in, For the predicted sales volume, To transfer the inventory of store j, C s is the out-of-stock cost of each item, C al The transfer cost of each commodity;

[0029] The function based on transfer cost and holding cost is:

[0030]

[0031] Among them, H is the daily holding cost of each commodity, C al is the transfer cost of each item, is the average daily sales volume of store products. To transfer the back-end store inventory, D l It is the remaining inventory of all stores after T days, which is the time required for all stores to sell out all the goods on the same day.

[0032] Optionally, the solution module is used to:

[0033] Optimizing the objective function through constraint rules to obtain an optimized objective function;

[0034] The optimized objective function is solved to determine the allocation relationship.

[0035] Optionally, the constraint rules include at least one of a store transferable inventory constraint, a warehouse supply constraint, an avoidance of self-allocation constraint, an allocation quantity non-negative constraint, and a store storage capacity constraint.

[0036] According to another aspect of an embodiment of the present invention, there is further provided an electronic device, including:

[0037] one or more processors;

[0038] a storage device for storing one or more programs,

[0039] When the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any of the above embodiments.

[0040] According to another aspect of an embodiment of the present invention, a computer-readable medium is provided, on which a computer program is stored. When the program is executed by a processor, the method described in any one of the above embodiments is implemented.

[0041] One embodiment of the above invention has the following advantages or beneficial effects: because it uses a technical means to determine whether the total inventory is greater than or equal to the sales volume, if so, a function based on the allocation cost and the out-of-stock cost is used as the objective function; if not, a function based on the allocation cost and the holding cost is used as the objective function, so it overcomes the technical problem of not considering insufficient inventory and allocation cost; the present invention first determines the size of the inventory and the predicted sales volume, if the inventory is greater than the sales volume, it can be optimized according to the objective function of matching the inventory with the sales volume; if the inventory is less than the sales volume, the optimization goal becomes to clear all the goods as soon as possible to reduce the holding cost. Therefore, the present invention reconciles the dual objectives of sales matching and allocation cost according to the predicted sales volume and the given inventory, and uses the operations optimization method to calculate the optimal inter-store allocation relationship, so as to obtain the allocation plan with the lowest comprehensive cost.

[0042] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with specific implementation examples. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.

[0044] Figure 1 is a schematic diagram of the main process of the method for determining the transfer relationship according to an embodiment of the present invention;

[0045] Figure 2 is a schematic diagram of the main process of a method for determining a transfer relationship according to a reference embodiment of the present invention;

[0046] Figure 3 is a schematic diagram of main modules of an apparatus for determining a transfer relationship according to an embodiment of the present invention;

[0047] Figure 4 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;

[0048] Figure 5 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION

[0049] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0050] Figure 1FIG. 1 is a schematic diagram of the main process of the method for determining the transfer relationship according to an embodiment of the present invention. Figure 1 As shown, as an embodiment of the present invention, the method for determining the transfer relationship may include:

[0051] Step 101, predict the sales volume of each product in each store and calculate the total inventory of each product.

[0052] The future sales of each product can be predicted based on its historical sales and future market activities, thereby guiding the future inventory levels of each product in each store.

[0053] Optionally, the sales volume can be processed by the following two operations:

[0054] For stores with high historical sales, the historical sales + predicted sales can be considered as the predicted value, that is,

[0055]

[0056] in, For the comprehensive sales volume, For the predicted sales volume, For historical sales volume.

[0057] This is similar to a moving average, and the higher the alpha, the more it depends on historical sales.

[0058] Different sales forecast results can be used for products in different periods. As mentioned above, a higher sales forecast can be used for products that have just been launched. Value, you can use more conservative ones when the season is almost over value.

[0059] Calculating inventory refers to the inventory counting and calculation of current store inventory, warehouse inventory, in-transit inventory, etc. In an embodiment of the present invention, the total inventory of each commodity includes the sum of the store inventory and warehouse inventory of each commodity.

[0060] The inventory balance formula is:

[0061] Among them, commodity: I = 1, ..., i, ..., I;

[0062] Code + color: s + c∈ψs-size; c-color is abbreviated as s;

[0063] Store: J = 1, ..., j, ..., J;

[0064] is the total inventory before transfer;

[0065] It is the sum of the existing inventory of the store before the transfer;

[0066] It is the warehouse inventory before transfer.

[0067] The inventory balance formula also applies after transfer, that is, When there is no new stock in the warehouse

[0068] in, is the total inventory after transfer, It is the sum of store inventory after transfer. It is the warehouse inventory after transfer.

[0069] Step 102, determining whether the total inventory is greater than or equal to the sales volume, if so, taking a function based on the transfer cost and the out-of-stock cost as the objective function; if not, taking a function based on the transfer cost and the holding cost as the objective function.

[0070] 1) If the total inventory is greater than or equal to the predicted sales, that is At this time, inventory needs to be allocated according to actual sales volume.

[0071] Then the objective function is as follows:

[0072] in, For the predicted sales volume, To allocate store inventory.

[0073] For simplicity, a balance coefficient γ can be used as the transfer balance coefficient. A high γ value means that inter-store transfer is not recommended, and a low γ value means that inter-store transfer is encouraged. Different products and sizes can have different transfer balance coefficients, that is, γ i，s , the transfer balance coefficient between different stores It may also be different.

[0074] For simplicity, the present invention treats all transfers equally, that is,

[0075] Any transfer will increase the objective function value, and the number of self-allocations is 0, that is,

[0076] It should be pointed out that the value of γ can be obtained by simulation from historical data, for example, by comparing the optimization function based on transfer cost and holding cost with the current balance coefficient.

[0077] Therefore, the function based on the transfer balance coefficient can be obtained:

[0078]

[0079] The store has a tolerance factor β j , more stock is allowed, but must meet

[0080] When inventory is greater than sales, considering the overstocking of stores, the store tolerance coefficient β can be set based on the previous sales and capacity of each store. j , allowing stores to stock more inventory, i.e.

[0081]

[0082] This can avoid inventory backlogs in stores to a certain extent.

[0083] In another embodiment of the present invention, the allocation balance coefficient γ is Thus, we can get a function based on transfer cost and out-of-stock cost, and use it as the objective function:

[0084]

[0085] in, For the predicted sales volume, To transfer the inventory of store j, C s is the out-of-stock cost of each item, C al The transfer cost of each item.

[0086] It should be noted that, in the above formula, “+” means: if the value in the brackets is greater than zero, the value is retained; if the value in the brackets is less than zero, the value is removed.

[0087] 2) If the total inventory is less than the predicted sales, that is At this time, supply is insufficient to meet demand, so what needs to be optimized is to clear the inventory in the shortest possible time to reduce holding costs.

[0088] Then the objective function is:

[0089] in, is the average daily sales volume of store products. To transfer the back-end store inventory, D l It is the remaining inventory of all stores after T days, which is the time required for all stores to sell out all the goods on the same day.

[0090] The time T required for the store to sell out the goods after the transfer is calculated j , What is calculated is the time T required for all stores to sell out all the goods on the same day, that is, the shortest time. D1 refers to the remaining inventory of store J after T days. This design can make the time when each store's inventory is sold out as close to the optimal time as possible. In addition, since the average daily sales of different stores are different, it is necessary to multiply the remaining inventory by the store time penalty. Similarly, T j For stores that have sold out within the time frame, the more inventory remaining after time T, the higher the penalty will be.

[0091] To reduce transfers, the penalty term is the same as above: Any transfer will increase the objective function value, and the number of self-allocations is 0, that is,

[0092] It should be pointed out that the value of γ can be obtained by simulation from historical data.

[0093] Therefore, the function based on the transfer balance coefficient can be obtained:

[0094]

[0095] In another embodiment of the present invention, the allocation balance coefficient γ is Thus, we can get the function based on transfer cost and holding cost, and use it as the objective function:

[0096]

[0097] Among them, H is the daily holding cost of each commodity, C al is the transfer cost of each item, is the average daily sales volume of store products. To transfer the back-end store inventory, D l It is the remaining inventory of all stores after T days, which is the time required for all stores to sell out all the goods on the same day.

[0098] It should be noted that, in the above formula, “+” means: if the value in the brackets is greater than zero, the value is retained; if the value in the brackets is less than zero, the value is removed.

[0099] Step 103, optimizing and solving the objective function to determine the allocation relationship.

[0100] In order to optimize the objective function, it is necessary to constrain the objective function. Optionally, step 103 may include: optimizing the objective function through constraint rules to obtain an optimized objective function; solving the optimized objective function to determine the allocation relationship. The constraint rules include at least one of store allocatable inventory constraints, warehouse supply constraints, self-allocation avoidance constraints, allocation quantity non-negative constraints, and store storage capacity constraints.

[0101] Constraints on store transferable inventory: where i∈I, s∈ψ, j∈J

[0102] Warehouse supply constraints: where i∈I, s∈ψ

[0103] Avoid self-allocation constraints: where i∈I, s∈ψ

[0104] The transfer amount is non-negative: where i∈I, s∈ψ

[0105] Store capacity constraints: where j∈J

[0106] in, is the sum of the amount transferred in from other stores. To transfer the existing inventory of the front store, is the replenishment quantity from the warehouse to the store, To transfer the warehouse inventory before, For self-allocation, is the transfer amount from store j1 to store j2, After the transfer, the store inventory, C j The store storage capacity.

[0107] Therefore, the optimized objective function is as follows:

[0108] 1) If the total inventory is greater than or equal to the predicted sales, the optimized objective function is as follows:

[0109]

[0110] in,

[0111]

[0112]

[0113]

[0114]

[0115]

[0116]

[0117] 2) If the total inventory is less than the predicted sales, the optimized objective function is as follows:

[0118]

[0119] in,

[0120]

[0121]

[0122]

[0123]

[0124]

[0125]

[0126]

[0127] By minimizing the objective function, the optimal solution can be obtained, that is, the output allocation relationship:

[0128]

[0129] According to the various embodiments described above, it can be seen that the present invention solves the problem of not considering insufficient inventory and allocation cost by adopting a technical solution that determines whether the total inventory is greater than or equal to the sales volume. If so, a function based on allocation cost and out-of-stock cost is used as the objective function; if not, a function based on allocation cost and holding cost is used as the objective function. That is to say, the traditional store allocation method does not consider the allocation cost, but in fact, the allocation between stores requires certain costs, such as distribution costs, etc. Therefore, the result produced by the traditional store allocation method is not the lowest cost solution. The present invention first determines the size of the inventory and the predicted sales volume. If the inventory is greater than the sales volume, it can be optimized according to the objective function of matching the inventory with the sales volume; if the inventory is less than the sales volume, the optimization goal becomes to clear all the goods as soon as possible to reduce the holding cost. Therefore, the present invention reconciles the dual objectives of sales matching and allocation cost according to the predicted sales volume and the given inventory, and uses the operations optimization method to calculate the optimal store allocation relationship, so as to obtain the allocation plan with the lowest comprehensive cost.

[0130] Figure 2 : is a schematic diagram of the main process of a method for determining a transfer relationship according to a reference embodiment of the present invention. The method for determining a transfer relationship may include:

[0131] Step 201, predicting the sales volume of each commodity in each store and calculating the total inventory of each commodity;

[0132] Step 202, determining whether the total inventory is greater than or equal to the sales volume; if so, executing step 203; if not, executing step 204;

[0133] Step 203, using a function based on transfer cost and out-of-stock cost as an objective function;

[0134] Step 204, using a function based on transfer cost and holding cost as an objective function;

[0135] Step 205, optimizing the objective function by using constraint rules to obtain an optimized objective function;

[0136] Step 206, solving the optimized objective function;

[0137] Step 207: output the transfer relationship.

[0138] In addition, the specific implementation content of the method for determining the transfer relationship in a reference embodiment of the present invention has been described in detail in the method for determining the transfer relationship described above, so the repeated content will not be described here.

[0139] Figure 3 Schematic diagram of main modules of the apparatus for determining a transfer relationship according to an embodiment of the present invention. Figure 3 As shown, the device 300 for determining the transfer relationship includes a calculation module 301, a judgment module 302 and a solution module 303. The calculation module 301 predicts the sales volume of each commodity in each store and calculates the total inventory of each commodity; the judgment module 302 determines whether the total inventory is greater than or equal to the sales volume, and if so, a function based on the transfer cost and the out-of-stock cost is used as the objective function; if not, a function based on the transfer cost and the holding cost is used as the objective function; the solution module 303 optimizes and solves the objective function to determine the transfer relationship.

[0140] Optionally, the function based on the transfer cost and the out-of-stock cost is:

[0141]

[0142] in, For the predicted sales volume, To transfer the inventory of store j, C s is the out-of-stock cost of each item, C al The transfer cost of each commodity;

[0143] The function based on transfer cost and holding cost is:

[0144]

[0145] Among them, H is the daily holding cost of each commodity, C al is the transfer cost of each item, is the average daily sales volume of store products. To transfer the back-end store inventory, D l It is the remaining inventory of all stores after T days, which is the time required for all stores to sell out all the goods on the same day.

[0146] Optionally, the solving module 303 optimizes the objective function through constraint rules to obtain an optimized objective function; and solves the optimized objective function to determine the allocation relationship.

[0147] Optionally, the constraint rules include at least one of a store transferable inventory constraint, a warehouse supply constraint, an avoidance of self-allocation constraint, an allocation quantity non-negative constraint, and a store storage capacity constraint.

[0148] According to the various embodiments described above, it can be seen that the present invention solves the problem of not considering insufficient inventory and allocation cost by adopting a technical solution that determines whether the total inventory is greater than or equal to the sales volume. If so, a function based on allocation cost and out-of-stock cost is used as the objective function; if not, a function based on allocation cost and holding cost is used as the objective function. That is to say, the traditional store allocation method does not consider the allocation cost, but in fact, the allocation between stores requires certain costs, such as distribution costs, etc. Therefore, the result produced by the traditional store allocation method is not the lowest cost solution. The present invention first determines the size of the inventory and the predicted sales volume. If the inventory is greater than the sales volume, it can be optimized according to the objective function of matching the inventory with the sales volume; if the inventory is less than the sales volume, the optimization goal becomes to clear all the goods as soon as possible to reduce the holding cost. Therefore, the present invention reconciles the dual objectives of sales matching and allocation cost according to the predicted sales volume and the given inventory, and uses the operations optimization method to calculate the optimal store allocation relationship, so as to obtain the allocation plan with the lowest comprehensive cost.

[0149] It should be noted that the specific implementation content of the device for determining the allocation relationship in the present invention has been described in detail in the method for determining the allocation relationship described above, so the repeated content will not be described here.

[0150] Figure 4 An exemplary system architecture 400 is shown to which the method for determining an allocation relationship or the method for determining an allocation relationship according to an embodiment of the present invention can be applied.

[0151] like Figure 4 As shown, system architecture 400 may include terminal devices 401, 402, 403, network 404 and server 405. Network 404 is used to provide a medium for communication links between terminal devices 401, 402, 403 and server 405. Network 404 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0152] Users can use terminal devices 401, 402, 403 to interact with server 405 through network 404 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 401, 402, 403, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only as examples).

[0153] The terminal devices 401 , 402 , and 403 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers.

[0154] The server 405 may be a server that provides various services, such as a backend management server (only an example) that provides support for shopping websites browsed by users using the terminal devices 401, 402, and 403. The backend management server may analyze and process the received data such as product information query requests, and feed back the processing results (such as target push information, product information - only an example) to the terminal device.

[0155] It should be noted that the method for determining the transfer relationship provided in the embodiment of the present invention is generally executed on the server 405, and accordingly, the device for determining the transfer relationship is generally set in the server 405. The method for determining the transfer relationship provided in the embodiment of the present invention can also be executed on the terminal devices 401, 402, and 403, and accordingly, the device for determining the transfer relationship is generally set on the terminal devices 401, 402, and 403.

[0156] It should be understood that Figure 4 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.

[0157] Reference below Figure 5 , which shows a schematic diagram of the structure of a computer system 500 of a terminal device suitable for implementing an embodiment of the present invention. Figure 5 The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0158] like Figure 5As shown, the computer system 500 includes a central processing unit (CPU) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage part 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the system 500 are also stored. The CPU 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0159] The following components are connected to the I / O interface 505: an input section 506 including a keyboard, a mouse, etc.; an output section 507 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 508 including a hard disk, etc.; and a communication section 509 including a network interface card such as a LAN card, a modem, etc. The communication section 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to the I / O interface 505 as needed. A removable medium 511, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 510 as needed, so that a computer program read therefrom is installed into the storage section 508 as needed.

[0160] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 509, and / or installed from the removable medium 511. When the computer program is executed by the central processing unit (CPU) 501, the above-mentioned functions defined in the system of the present invention are executed.

[0161] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0162] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0163] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor, for example, it may be described as: a processor includes a calculation module, a judgment module and a solution module, wherein the names of these modules do not constitute a limitation on the modules themselves in some cases.

[0164] As another aspect, the present invention further provides a computer-readable medium, which may be included in the device described in the above embodiment; or may exist independently without being assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by a device, the device includes: predicting the sales volume of each commodity in each store and calculating the total inventory of each commodity; judging whether the total inventory is greater than or equal to the sales volume, and if so, using a function based on the allocation cost and the out-of-stock cost as the objective function; if not, using a function based on the allocation cost and the holding cost as the objective function; optimizing and solving the objective function to determine the allocation relationship.

[0165] According to the technical solution of the embodiment of the present invention, because it adopts a technical means to judge whether the total inventory is greater than or equal to the sales volume, if so, a function based on the allocation cost and the out-of-stock cost is used as the objective function; if not, a function based on the allocation cost and the holding cost is used as the objective function, so it overcomes the technical problem of not considering insufficient inventory and allocation cost; the present invention first judges the size of the inventory and the predicted sales volume. If the inventory is greater than the sales volume, it can be optimized according to the objective function of matching the inventory with the sales volume; if the inventory is less than the sales volume, the optimization goal becomes to clear all the goods as soon as possible to reduce the holding cost. Therefore, the present invention reconciles the dual objectives of sales matching and allocation cost according to the predicted sales volume and the given inventory, and uses the operations optimization method to calculate the optimal inter-store allocation relationship, so as to obtain the allocation plan with the lowest comprehensive cost.

[0166] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for determining a transfer relationship, characterized in that: include: Predict sales of each product in each store and calculate total inventory of each product; Determine whether the total inventory is greater than or equal to the sales volume. If so, use a function based on the transfer cost and the out-of-stock cost as the objective function; if not, use a function based on the transfer cost and the holding cost as the objective function; Optimizing and solving the objective function to determine the allocation relationship; The function based on transfer cost and out-of-stock cost is: in, For the predicted sales volume, To transfer the inventory of store j, C s is the out-of-stock cost of each item, C a1 is the transfer cost of each item, is the transfer amount from store j1 to store j2; The function based on transfer cost and holding cost is: Among them, H is the daily holding cost of each commodity, C a1 is the transfer cost of each item, is the average daily sales volume of store products. To transfer the inventory of store j, D l The remaining inventory of all stores after all the goods are sold out on the same day, T days, is the total inventory after transfer; i is the product, s is the code number, j is the store, j1 is the store transferred out, j2 is the store transferred in, I is all products, J is all stores, and ψ is all code numbers.

2. The method according to claim 1, characterized in that Optimizing and solving the objective function to determine the allocation relationship includes: Optimizing the objective function through constraint rules to obtain an optimized objective function; The optimized objective function is solved to determine the allocation relationship.

3. The method according to claim 2, characterized in that The constraint rules include at least one of a store transferable inventory constraint, a warehouse supply constraint, an avoidance of self-allocation constraint, an allocation quantity non-negative constraint, and a store storage capacity constraint.

4. A device for determining a transfer relationship, characterized in that: include: The calculation module is used to predict the sales volume of each product in each store and calculate the total inventory of each product; A judgment module, used to judge whether the total inventory is greater than or equal to the sales volume, and if so, a function based on the allocation cost and the out-of-stock cost is used as the objective function; if not, a function based on the allocation cost and the holding cost is used as the objective function; A solution module, used for optimizing and solving the objective function, so as to determine the transfer relationship; The function based on transfer cost and out-of-stock cost is: in, For the predicted sales volume, To transfer the inventory of store j, C s is the out-of-stock cost of each item, C al is the transfer cost of each item, is the transfer amount from store j1 to store j2; The function based on transfer cost and holding cost is: Where H is the daily holding cost of each item, c al is the transfer cost of each item, is the average daily sales volume of store products. To transfer the inventory of store j, D l The remaining inventory of all stores after all the goods are sold out on the same day, T days, is the total inventory after transfer; i is the product, s is the code number, j is the store, j1 is the store transferred out, j2 is the store transferred in, I is all products, J is all stores, and ψ is all code numbers.

5. The device according to claim 4, characterized in that The solution module is used to: Optimizing the objective function through constraint rules to obtain an optimized objective function; The optimized objective function is solved to determine the allocation relationship.

6. The device according to claim 5, characterized in that The constraint rules include at least one of a store transferable inventory constraint, a warehouse supply constraint, an avoidance of self-allocation constraint, an allocation quantity non-negative constraint, and a store storage capacity constraint.

7. An electronic device, characterized in that: include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 3.

8. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 3 is implemented.

Images