A method and device for allocating goods with shop intermittent codes

Abstract

The application provides a store intermittent code commodity allocation method and device. The store intermittent code commodity allocation method comprises the following steps: obtaining a target intermittent code commodity; determining a store containing the target intermittent code commodity as a candidate store set; determining one store in the candidate store set as a demand store, and determining other stores in the candidate store set as a supply store set; matching the demand store with each supply store in the supply store set to obtain a plurality of first store combinations; calculating the matching degrees corresponding to the plurality of first store combinations; if the first store combination with the highest matching degree does not cause the target intermittent code commodity of the demand store to be intermittent, recording the first store combination with the highest matching degree to a commodity allocation result of the target intermittent code commodity; and performing commodity allocation based on the commodity allocation result of the target intermittent code commodity. The application can automatically perform allocation, improve the allocation efficiency of the store intermittent code commodity, and improve the commodity digestion rate.

Description

Technical Field

[0001] This application relates to the field of big data technology, specifically to a method and apparatus for allocating intermittently coded goods in a store. Background Technology

[0002] With the continuous improvement of science and technology theories, the integration of technology with specific industries has become a social development trend. Big data, as a new technological force that is changing the world, is rapidly integrating into all walks of life. The same product often has multiple different models produced and sold. After a period of sales, some models will become out of stock, i.e., discontinued sizes. The sales performance of a product varies from store to store, resulting in different discontinued sizes. At this time, it is necessary to transfer out-of-stock products to other stores with the same discontinued sizes to ensure that the product is available for continued sale. As businesses expand, the number of stores and the number of products increase. Manually planning the unified product inventory across stores requires a significant amount of time and manpower.

[0003] In existing technologies, the methods for transferring discontinued products between stores are inefficient. Summary of the Invention

[0004] This application aims to provide a method and apparatus for transferring intermittently coded goods in a store, in order to solve the problem of low efficiency in the existing methods for transferring intermittently coded goods in a store.

[0005] On the one hand, this application provides a method for transferring intermittently stocked goods in a store, the method comprising:

[0006] Obtain the target product with a limited stock size;

[0007] Stores containing the target out-of-stock items are identified as the candidate store set;

[0008] One store in the candidate store set is identified as the demand store, and the other stores in the candidate store set are identified as the supply store set.

[0009] The demand store is matched with each supply store in the supply store set to obtain multiple first store combinations, each first store combination including the demand store and one supply store;

[0010] Calculate the matching degree corresponding to multiple combinations of the first store;

[0011] Determine whether the first store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock;

[0012] If the first store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to become out of stock, then the first store combination with the highest matching degree is recorded in the product transfer result of the target out-of-stock product.

[0013] Based on the results of the commodity transfer for the target out-of-stock commodity, commodity transfer is carried out.

[0014] Optionally, the method for transferring intermittently stocked goods in the store includes:

[0015] If the first store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock, then the first store combination with the highest matching degree is removed from the supply store set to obtain the supply store set after removal.

[0016] The first store combination with the highest matching degree is matched with each supply store in the eliminated supply store set to obtain multiple second store combinations;

[0017] Calculate the matching degree for multiple second store combinations;

[0018] Determine whether the second store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock;

[0019] If the second store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to be out of stock, then the second store combination with the highest matching degree is recorded in the product transfer results.

[0020] Optionally, the method for transferring intermittently stocked goods in the store includes:

[0021] If the second store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock, and there is only one supply store in the supply store set after elimination, then the other store in the candidate store set is determined as the new demand store, and the other stores in the candidate store set are determined as the new supply store set.

[0022] Optionally, determining whether the first store combination causes the target out-of-stock item in the demand store to be out of stock includes:

[0023] Supply the products from the supply stores in the first store combination to the demand stores;

[0024] If the target out-of-stock item is not out of stock in the demand store after the supply is obtained, it is determined that the first store combination does not cause the target out-of-stock item in the demand store to become out of stock; if the target out-of-stock item in the demand store becomes out of stock after the supply is obtained, it is determined that the first store combination causes the target out-of-stock item in the demand store to become out of stock.

[0025] Optionally, calculating the matching degree corresponding to multiple first store combinations includes:

[0026] The matching degree of the first store combination is calculated based on the inter-store logistics days, historical sales data, and product size matching degree, resulting in multiple matching degrees corresponding to the first store combination.

[0027] Optionally, the step of allocating goods based on the goods allocation results of the target out-of-stock goods includes:

[0028] After recording the first store combination with the highest matching degree into the product allocation result, the stores in the first store combination are removed from the candidate store set to obtain the candidate store set after removal, so that the demand stores of the first store combination do not participate in the demand calculation and the supply stores of the first store combination do not participate in the supply calculation.

[0029] One store in the candidate store set after elimination is identified as a new demand store, and the other stores in the candidate store set after elimination are identified as a new supply store set. This process is repeated multiple times to record store combinations.

[0030] When the candidate store set after elimination is empty after multiple store combination records are made, the store combination record is ended and the product allocation is carried out based on the product allocation result of the target missing code product.

[0031] Optionally, obtaining the target out-of-stock item includes:

[0032] Obtain items with limited sizes from various stores;

[0033] Each item in the out-of-stock items of each store is identified as the target out-of-stock item.

[0034] On one hand, this application provides a device for transferring intermittently stocked goods in a store, the device comprising:

[0035] The acquisition unit is used to acquire the target product with a missing size.

[0036] The first determining unit is used to identify stores containing the target out-of-stock items as a candidate store set;

[0037] The second determining unit is used to determine one store in the candidate store set as the demand store and the other stores in the candidate store set as the supply store set.

[0038] A matching unit is used to match the demand store with each supply store in the supply store set to obtain multiple first store combinations, wherein the first store combination includes the demand store and one supply store;

[0039] A calculation unit is used to calculate the matching degree corresponding to multiple combinations of the first stores;

[0040] The judgment unit is used to determine whether the first store combination with the highest matching degree causes the target out-of-size product of the demand store to be out of stock.

[0041] The recording unit is used to record the first store combination with the highest matching degree as the product allocation result of the target out-of-stock product if the first store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to be out of stock.

[0042] The allocation unit is used to allocate goods based on the allocation results of the target out-of-stock goods.

[0043] Optionally, the method for transferring intermittently stocked goods in the store includes:

[0044] If the first store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock, then the first store combination with the highest matching degree is removed from the supply store set to obtain the supply store set after removal.

[0045] The first store combination with the highest matching degree is matched with each supply store in the eliminated supply store set to obtain multiple second store combinations;

[0046] Calculate the matching degree for multiple second store combinations;

[0047] Determine whether the second store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock;

[0048] If the second store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to be out of stock, then the second store combination with the highest matching degree is recorded in the product transfer results.

[0049] Optionally, the method for transferring intermittently stocked goods in the store includes:

[0050] If the second store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock, and there is only one supply store in the supply store set after elimination, then the other store in the candidate store set is determined as the new demand store, and the other stores in the candidate store set are determined as the new supply store set.

[0051] Optionally, determining whether the first store combination causes the target out-of-stock item in the demand store to be out of stock includes:

[0052] Supply the products from the supply stores in the first store combination to the demand stores;

[0053] If the target out-of-stock item is not out of stock in the demand store after the supply is obtained, it is determined that the first store combination does not cause the target out-of-stock item in the demand store to become out of stock; if the target out-of-stock item in the demand store becomes out of stock after the supply is obtained, it is determined that the first store combination causes the target out-of-stock item in the demand store to become out of stock.

[0054] Optionally, calculating the matching degree corresponding to multiple combinations of the first stores includes:

[0055] The matching degree of the first store combination is calculated based on the inter-store logistics days, historical sales data, and product size matching degree, resulting in multiple matching degrees corresponding to the first store combination.

[0056] Optionally, the step of allocating goods based on the goods allocation results of the target out-of-stock goods includes:

[0057] After recording the first store combination with the highest matching degree into the product allocation result, the stores in the first store combination are removed from the candidate store set to obtain the candidate store set after removal, so that the demand stores of the first store combination do not participate in the demand calculation and the supply stores of the first store combination do not participate in the supply calculation.

[0058] One store in the candidate store set after elimination is identified as a new demand store, and the other stores in the candidate store set after elimination are identified as a new supply store set. This process is repeated multiple times to record store combinations.

[0059] When the candidate store set after elimination is empty after multiple store combination records are made, the store combination record is ended and the product allocation is carried out based on the product allocation result of the target missing code product.

[0060] Optionally, obtaining the target out-of-stock item includes:

[0061] Obtain items with limited sizes from various stores;

[0062] Each item in the out-of-stock items of each store is identified as the target out-of-stock item.

[0063] On the one hand, this application also provides an electronic device, the electronic device comprising:

[0064] One or more processors;

[0065] Memory; and

[0066] One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the method for transferring store-intermittent code goods as described in any of the first aspects.

[0067] In one aspect, this application also provides a computer-readable storage medium having a computer program stored thereon, the computer program being loaded by a processor to perform the steps in the method for allocating intermittently coded goods in a store according to any one of the first aspects.

[0068] This application provides a method for allocating out-of-stock items between stores. The method includes: acquiring target out-of-stock items; identifying stores containing the target out-of-stock items as a candidate store set; identifying one store in the candidate store set as the demand store and the other stores in the candidate store set as the supply store set; matching the demand store with each supply store in the supply store set to obtain multiple first store combinations, each first store combination including a demand store and a supply store; calculating the matching degree corresponding to the multiple first store combinations; determining whether the first store combination with the highest matching degree causes the target out-of-stock item in the demand store to become out of stock; if the first store combination with the highest matching degree does not cause the target out-of-stock item in the demand store to become out of stock, then recording the first store combination with the highest matching degree in the item allocation result of the target out-of-stock items; and performing item allocation based on the item allocation result of the target out-of-stock items. This application can automate the allocation process, improve the efficiency of out-of-stock item allocation between stores, and increase the product absorption rate. Attached Figure Description

[0069] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0070] Figure 1 This is a schematic diagram of a scenario for a store intermittent code product allocation system provided in an embodiment of this application;

[0071] Figure 2 This is a schematic flowchart of an embodiment of the method for transferring intermittently coded goods in a store provided in this application;

[0072] Figure 3 This is a schematic diagram of an embodiment of the store intermittent code product transfer device provided in this application;

[0073] Figure 4 This is a schematic diagram of an embodiment of the electronic device provided in this application. Detailed Implementation

[0074] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0075] In the description of this application, it should be understood that the terms "center," "longitudinal," "lateral," "length," "width," "thickness," "upper," "lower," "front," "rear," "left," "right," "vertical," "horizontal," "top," "bottom," "inner," and "outer," etc., indicating orientation or positional relationships based on the orientation or positional relationships shown in the accompanying drawings, are used only for the convenience of describing this application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of this application. Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Thus, features defined with "first" and "second" may explicitly or implicitly include one or more features. In the description of this application, "a plurality of" means two or more, unless otherwise explicitly specified.

[0076] In this application, the term "exemplary" is used to mean "used as an example, illustration, or description." Any embodiment described as "exemplary" in this application is not necessarily to be construed as being more preferred or advantageous than other embodiments. The following description is provided to enable any person skilled in the art to make and use this application. Details are set forth in the following description for purposes of explanation. It should be understood that those skilled in the art will recognize that this application can be made without using these specific details. In other instances, well-known structures and processes are not described in detail to avoid obscuring the description of this application with unnecessary detail. Therefore, this application is not intended to be limited to the embodiments shown, but is consistent with the broadest scope of the principles and features disclosed in this application.

[0077] It should be noted that since the method in this application embodiment is executed in an electronic device, the processing objects of each electronic device exist in the form of data or information, such as time, which is essentially time information. It can be understood that if size, quantity, position, etc. are mentioned in subsequent embodiments, they are all corresponding data that exist so that the electronic device can process them. Specific details will not be elaborated here.

[0078] This application provides a method and apparatus for transferring intermittently coded goods in a store, which will be described in detail below.

[0079] Please see Figure 1 , Figure 1 This is a schematic diagram of a scenario for a store-intermittent code product allocation system provided in an embodiment of this application. The store-intermittent code product allocation system may include an electronic device 100, which integrates an allocation device for store-intermittent code products, such as... Figure 1 Electronic devices in the system.

[0080] In this embodiment, the electronic device 100 can be a standalone server, a server network, or a server cluster. For example, the electronic device 100 described in this embodiment includes, but is not limited to, a computer, a network host, a single network server, a set of multiple network servers, or a cloud server composed of multiple servers. The cloud server is composed of a large number of computers or network servers based on cloud computing.

[0081] Those skilled in the art will understand that Figure 1 The application environment shown is merely one application scenario of the solution in this application and does not constitute a limitation on the application scenario of the solution in this application. Other application environments may include more than one application scenario. Figure 1 The number of more or fewer electronic devices shown, for example Figure 1 Only one electronic device is shown in the image. It is understood that the system for allocating intermittently coded goods in this store may also include one or more other servers, which are not specified here.

[0082] In addition, such as Figure 1 As shown, the system for transferring intermittently coded goods in the store may also include a memory 200 for storing data.

[0083] It should be noted that, Figure 1 The schematic diagram of the intermittent code product allocation system shown is merely an example. The intermittent code product allocation system and scenario described in this application are for the purpose of more clearly illustrating the technical solutions of this application and do not constitute a limitation on the technical solutions provided in this application. As those skilled in the art will know, with the evolution of the intermittent code product allocation system and the emergence of new business scenarios, the technical solutions provided in this application are also applicable to similar technical problems.

[0084] First, this application provides a method for allocating inter-store out-of-stock items. The execution body of this method is an inter-store out-of-stock item allocation device, which is applied to an electronic device. The method includes: acquiring a target out-of-stock item; identifying stores containing the target out-of-stock item as a candidate store set; identifying one store in the candidate store set as a demand store and the other stores in the candidate store set as a supply store set; matching the demand store with each supply store in the supply store set to obtain multiple first store combinations, each first store combination including a demand store and a supply store; calculating the matching degree corresponding to the multiple first store combinations; determining whether the first store combination with the highest matching degree causes the target out-of-stock item in the demand store to become out of stock; if the first store combination with the highest matching degree does not cause the target out-of-stock item in the demand store to become out of stock, then recording the first store combination with the highest matching degree in the item allocation result of the target out-of-stock item; and performing item allocation based on the item allocation result of the target out-of-stock item.

[0085] See Figure 2 , Figure 2 This is a schematic flowchart of an embodiment of the method for transferring intermittently coded goods in a store, as provided in this application. The method for transferring intermittently coded goods in a store includes steps S201-208:

[0086] S201. Obtain the target product with missing sizes.

[0087] In this embodiment of the application, obtaining the target out-of-stock product includes: obtaining out-of-stock products from each store; and determining each out-of-stock product from the out-of-stock products of each store as the target out-of-stock product.

[0088] In this embodiment, there are a batch of products with out-of-stock sizes, and each product is sold out in multiple stores. This application solves the problem of out-of-stock products by combining the inventory of each store to create a complete range of sizes, maximizing the availability of complete sizes. A complete range of sizes means that the store has all sizes of the product.

[0089] The demand and supply of out-of-stock items in the store are calculated based on the product inventory, recent sales, and standard display quantity.

[0090] In one specific embodiment, a single item with a limited size is selected from the limited-size items in each store as the target limited-size item S.

[0091] S202. Stores containing the target out-of-stock items are identified as the candidate store set.

[0092] In this embodiment, a single out-of-stock item is selected as the target out-of-stock item S from the out-of-stock items in each store, and the stores containing the target out-of-stock item are determined as the candidate store set. For example, all stores that contain the target out-of-stock item S and are out of stock are denoted as the candidate store set D. L .

[0093] S203. Identify one store in the candidate store set as the demand store and the other stores in the candidate store set as the supply store set.

[0094] In one specific embodiment, the candidate store set D is selected based on recent sales data. L The stores are sorted, with the stores whose products sell better ranking higher. The store ranked first is designated as the demand store D1, and the other stores D2, D3, D4, D5, ... are designated as supply stores, forming a supply store set.

[0095] S204. Match the demand stores with each supply store in the supply store set to obtain multiple first store combinations. Each first store combination includes a demand store and a supply store.

[0096] Specifically, demand store D1 is matched with each supply store D2, D3, D4, D5, ... in the supply store set to obtain multiple first store combinations. The multiple first store combinations are D1D2, D1D3, D1D4, D1D5, ...

[0097] S205. Calculate the matching degree corresponding to multiple first store combinations.

[0098] In one specific embodiment, calculating the matching degree corresponding to multiple first store combinations may include: calculating the matching degree corresponding to the first store combination based on the inter-store logistics days, historical sales data, and product size matching degree, thereby obtaining the matching degree corresponding to multiple first store combinations. The specific calculation formula is set according to the specific circumstances.

[0099] S206. Determine whether the first store combination with the highest matching degree causes the target out-of-size product of the demand store to be out of stock.

[0100] Specifically, determining whether the first store combination with the highest matching degree causes the target out-of-size product in the demand store to be out of stock includes:

[0101] (1) Supply the goods of the supply store to the demand store in the first store combination.

[0102] (2) If the target out-of-stock items of the demand stores are not out of stock after the supply is obtained, it is determined that the first store combination does not cause the target out-of-stock items of the demand stores to be out of stock; if the target out-of-stock items of the demand stores are out of stock after the supply is obtained, it is determined that the first store combination causes the target out-of-stock items of the demand stores to be out of stock.

[0103] S207. If the first store combination with the highest matching degree does not cause the target out-of-size product of the demand store to become out of stock, then the first store combination with the highest matching degree will be recorded in the product transfer results of the target out-of-size product.

[0104] If the first store combination with the highest matching degree does not cause the target out-of-size product of the demand store to become out of stock, then the first store combination with the highest matching degree will be recorded in the product transfer results of the target out-of-size product.

[0105] Furthermore, if the first store combination with the highest matching degree causes the target out-of-size product of the demand store to be out of stock, then the first store combination with the highest matching degree will be removed from the supply store set, resulting in the removed supply store set.

[0106] For example, D2, D3, D4, D5, ... form a supplier set. The first supplier combination with the highest matching degree is D1D3. Removing D3 from the first supplier combination with the highest matching degree results in the supplier set after removal: D2, D4, D5, ...

[0107] The first store combination with the highest matching degree is matched with each supplier in the removed supplier set to obtain multiple second store combinations. These multiple second store combinations are D1D3D2, D1D3D4, D... 1 D3D5, ...

[0108] Calculate the matching degree for multiple second store combinations. Determine whether the second store combination with the highest matching degree causes the target out-of-stock item in the demand store to become out of stock. If the second store combination with the highest matching degree does not cause the target out-of-stock item in the demand store to become out of stock, then record the second store combination with the highest matching degree in the product transfer results.

[0109] Furthermore, if the second store combination with the highest matching degree causes the target out-of-size product of the demand store to be out of stock, and there is only one supplier in the supply store set after removal, then the other store in the candidate store set is determined as the new demand store, and the other stores in the candidate store set are determined as the new supply store set. If the second store combination with the highest matching degree causes the target out-of-size product of the demand store to be out of stock, and there is only one supplier in the supply store set after removal, and the last supplier in the supply store set after removal cannot satisfy the requirement of not having out-of-size products, then the demand store and the supply store are re-determined.

[0110] S208. Based on the results of the commodity transfer of the target out-of-stock commodity, transfer the commodity.

[0111] In one specific embodiment, after recording the first store combination with the highest matching degree into the product allocation result, the stores in the first store combination are removed from the candidate store set to obtain a post-removal candidate store set, so that the demand stores of the first store combination do not participate in demand calculation, and the supply stores of the first store combination do not participate in supply calculation; one store in the post-removal candidate store set is identified as a new demand store, and the other stores in the post-removal candidate store set are identified as a new supply store set, and multiple combination records are made; when the post-removal candidate store set obtained after multiple combination records is empty, the combination record is terminated and the product allocation is performed based on the obtained product allocation result of the target out-of-stock product.

[0112] For each store that forms a combination, the demanding store will no longer supply other stores, and the supplying stores will not calculate demand. If demanding store D1 cannot obtain supply to complete its code after the above steps, then demanding store D1 will be released as a demanding store. After demanding store D1 is released, demanding store status will be assigned to store D2. At the same time, D1 will become a supplying store, and its matching degree will be calculated with D2. The above steps are repeated until the candidate store set is empty after elimination, that is, when there are no stores that can be demanding stores. The product transfer results are output, a transfer order is generated, and pushed to the stores to execute the transfer.

[0113] To better implement the method for transferring intermittently coded goods in stores as described in this application, this application also provides a device for transferring intermittently coded goods, such as... Figure 3 As shown, Figure 3 This is a schematic diagram of an embodiment of the store intermittent code product allocation device provided in this application. The store intermittent code product allocation device 300 includes:

[0114] Acquisition unit 301 is used to acquire target products with missing codes;

[0115] The first determining unit 302 is used to determine the stores containing the target missing size products as the candidate store set;

[0116] The second determining unit 303 is used to determine one store in the candidate store set as a demand store and the other stores in the candidate store set as a supply store set.

[0117] The matching unit 304 is used to match the demand store with each supply store in the supply store set to obtain multiple first store combinations, wherein the first store combination includes the demand store and one supply store;

[0118] Calculation unit 305 is used to calculate the matching degree corresponding to multiple combinations of the first store;

[0119] Judgment unit 306 is used to determine whether the first store combination with the highest matching degree causes the target out-of-size product of the demand store to be out of stock.

[0120] Recording unit 307 is used to record the first store combination with the highest matching degree as the product allocation result of the target out-of-stock product if the first store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to be out of stock.

[0121] The allocation unit 308 is used to allocate goods based on the allocation results of the target out-of-code goods.

[0122] Optionally, the method for transferring intermittently stocked goods in the store includes:

[0123] If the first store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock, then the first store combination with the highest matching degree is removed from the supply store set to obtain the supply store set after removal.

[0124] The first store combination with the highest matching degree is matched with each supply store in the eliminated supply store set to obtain multiple second store combinations;

[0125] Calculate the matching degree for multiple second store combinations;

[0126] Determine whether the second store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock;

[0127] If the second store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to be out of stock, then the second store combination with the highest matching degree is recorded in the product transfer results.

[0128] Optionally, the method for transferring intermittently stocked goods in the store includes:

[0129] If the second store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock, and there is only one supply store in the supply store set after elimination, then the other store in the candidate store set is determined as the new demand store, and the other stores in the candidate store set are determined as the new supply store set.

[0130] Optionally, determining whether the first store combination causes the target out-of-stock item in the demand store to be out of stock includes:

[0131] Supply the products from the supply stores in the first store combination to the demand stores;

[0132] If the target out-of-stock item is not out of stock in the demand store after the supply is obtained, it is determined that the first store combination does not cause the target out-of-stock item in the demand store to become out of stock; if the target out-of-stock item in the demand store becomes out of stock after the supply is obtained, it is determined that the first store combination causes the target out-of-stock item in the demand store to become out of stock.

[0133] Optionally, calculating the matching degree corresponding to multiple first store combinations includes:

[0134] The matching degree of the first store combination is calculated based on the inter-store logistics days, historical sales data, and product size matching degree, resulting in multiple matching degrees corresponding to the first store combination.

[0135] Optionally, the step of allocating goods based on the goods allocation results of the target out-of-stock goods includes:

[0136] After recording the first store combination with the highest matching degree into the product allocation result, the stores in the first store combination are removed from the candidate store set to obtain the candidate store set after removal, so that the demand stores of the first store combination do not participate in the demand calculation and the supply stores of the first store combination do not participate in the supply calculation.

[0137] One store in the candidate store set after elimination is identified as a new demand store, and the other stores in the candidate store set after elimination are identified as a new supply store set. This process is repeated multiple times to record store combinations.

[0138] When the candidate store set after elimination is empty after multiple store combination records are made, the store combination record is ended and the product allocation is carried out based on the product allocation result of the target missing code product.

[0139] Optionally, obtaining the target out-of-stock item includes:

[0140] Obtain items with limited sizes from various stores;

[0141] Each item in the out-of-stock items of each store is identified as the target out-of-stock item.

[0142] This application also provides an electronic device that integrates any of the store intermittent code product allocation devices provided in this application. For example... Figure 4 As shown, it illustrates a structural schematic diagram of the electronic device involved in the embodiments of this application, specifically:

[0143] The electronic device may include components such as a processor 501 with one or more processing cores, a memory 502 with one or more computer-readable storage media, a power supply 503, and an input unit 504. Those skilled in the art will understand that the electronic device structure shown in the figures does not constitute a limitation on the electronic device, and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0144] in:

[0145] The processor 501 is the control center of the electronic device. It connects various parts of the electronic device via various interfaces and lines. By running or executing software programs and / or modules stored in the memory 502, and by calling data stored in the memory 502, it performs various functions and processes data, thereby providing overall monitoring of the electronic device. Optionally, the processor 501 may include one or more processing cores; preferably, the processor 501 may integrate an application processor and a modem processor, wherein the application processor mainly handles the operating system, user interface, and applications, and the modem processor mainly handles wireless communication. It is understood that the modem processor may not be integrated into the processor 501.

[0146] The memory 502 can be used to store software programs and modules. The processor 501 executes various functional applications and data processing by running the software programs and modules stored in the memory 502. The memory 502 may mainly include a program storage area and a data storage area. The program storage area may store the operating system, application programs required for at least one function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the electronic device, etc. In addition, the memory 502 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other volatile solid-state storage device. Accordingly, the memory 502 may also include a memory controller to provide the processor 501 with access to the memory 502.

[0147] The electronic device also includes a power supply 503 that supplies power to various components. Preferably, the power supply 503 can be logically connected to the processor 501 through a power management system, thereby enabling functions such as charging, discharging, and power consumption management through the power management system. The power supply 503 may also include one or more DC or AC power supplies, recharging systems, power fault detection circuits, power converters or inverters, power status indicators, and other arbitrary components.

[0148] The electronic device may also include an input unit 504, which can be used to receive input digital or character information and generate keyboard, mouse, joystick, optical or trackball signal inputs related to user settings and function control.

[0149] Although not shown, the electronic device may also include a display unit, etc., which will not be described in detail here. Specifically, in this embodiment, the processor 501 in the electronic device loads the executable files corresponding to the processes of one or more applications into the memory 502 according to the following instructions, and the processor 501 runs the applications stored in the memory 502 to realize various functions, as follows:

[0150] Obtain the target out-of-stock product; identify stores containing the target out-of-stock product as a candidate store set; identify one store in the candidate store set as the demand store, and the other stores in the candidate store set as the supply store set; match the demand store with each supply store in the supply store set to obtain multiple first store combinations, each first store combination including a demand store and a supply store; calculate the matching degree corresponding to the multiple first store combinations; determine whether the first store combination with the highest matching degree causes the target out-of-stock product of the demand store to become out of stock; if the first store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to become out of stock, then record the first store combination with the highest matching degree in the product allocation result of the target out-of-stock product; perform product allocation based on the product allocation result of the target out-of-stock product.

[0151] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be performed by instructions, or by instructions controlling related hardware. These instructions can be stored in a computer-readable storage medium and loaded and executed by a processor.

[0152] Therefore, embodiments of this application provide a computer-readable storage medium, which may include: read-only memory (ROM), random access memory (RAM), a disk, or an optical disk, etc. A computer program is stored thereon, and the computer program is loaded by a processor to execute the steps in any of the store intermittent code product allocation methods provided in embodiments of this application. For example, the computer program loaded by the processor can execute the following steps:

[0153] Obtain the target out-of-stock product; identify stores containing the target out-of-stock product as a candidate store set; identify one store in the candidate store set as the demand store, and the other stores in the candidate store set as the supply store set; match the demand store with each supply store in the supply store set to obtain multiple first store combinations, each first store combination including a demand store and a supply store; calculate the matching degree corresponding to the multiple first store combinations; determine whether the first store combination with the highest matching degree causes the target out-of-stock product of the demand store to become out of stock; if the first store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to become out of stock, then record the first store combination with the highest matching degree in the product allocation result of the target out-of-stock product; perform product allocation based on the product allocation result of the target out-of-stock product.

[0154] In the above embodiments, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the detailed descriptions of other embodiments above, which will not be repeated here.

[0155] In practice, each of the above units or structures can be implemented as an independent entity or can be arbitrarily combined to be implemented as the same or several entities. For the specific implementation of each of the above units or structures, please refer to the previous method embodiments, which will not be repeated here.

[0156] For details on the implementation of each of the above operations, please refer to the previous examples, which will not be repeated here.

[0157] The above provides a detailed description of a method and apparatus for allocating intermittently coded goods in a store, as provided in the embodiments of this application. Specific examples have been used to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A method for transferring intermittently stocked goods in a store, characterized in that, The method for transferring out-of-stock items between stores includes: Obtain the target product with a limited stock size; Stores containing the target out-of-stock items are identified as the candidate store set; One store in the candidate store set is identified as the demand store, and the other stores in the candidate store set are identified as the supply store set. The demand store is matched with each supply store in the supply store set to obtain multiple first store combinations, each first store combination including the demand store and one supply store; Calculate the matching degree corresponding to multiple first store combinations; the calculation of the matching degree corresponding to multiple first store combinations includes: calculating the matching degree corresponding to the first store combination based on the inter-store logistics days, historical sales data, and product size matching degree of the first store combination, to obtain the matching degree corresponding to multiple first store combinations. Determine whether the first store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock; If the first store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to become out of stock, then the first store combination with the highest matching degree is recorded in the product allocation result of the target out-of-stock product; then, the stores in the first store combination are removed from the candidate store set to obtain a removed candidate store set, so that the demand stores of the first store combination do not participate in demand calculation, and the supply stores of the first store combination do not participate in supply calculation; one store in the removed candidate store set is determined as a new demand store, and the other stores in the removed candidate store set are determined as a new supply store set, and store combination recording is performed multiple times; when the removed candidate store set obtained after multiple store combination recordings is empty, the store combination recording ends; If the first store combination with the highest matching degree causes the target out-of-stock item in the demand store to be out of stock, then the first store combination with the highest matching degree is removed from the supply store set to obtain a removed supply store set; the first store combination with the highest matching degree is matched with each supply store in the removed supply store set to obtain multiple second store combinations; the matching degree corresponding to the multiple second store combinations is calculated; it is determined whether the second store combination with the highest matching degree causes the target out-of-stock item in the demand store to be out of stock; if the second store combination with the highest matching degree does not cause the target out-of-stock item in the demand store to be out of stock, then the second store combination with the highest matching degree is recorded in the product allocation result; Based on the results of the commodity transfer for the target out-of-stock commodity, commodity transfer is carried out.

2. The method for transferring intermittently stocked goods in a store according to claim 1, characterized in that, The method for transferring intermittently stocked items in the store includes: If the second store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock, and there is only one supply store in the supply store set after elimination, then the other store in the candidate store set is determined as the new demand store, and the other stores in the candidate store set are determined as the new supply store set.

3. The method for transferring intermittently stocked goods in a store according to claim 1, characterized in that, The step of determining whether the first store combination causes the target out-of-stock item in the demand store to be out of stock includes: Supply the products from the supply stores in the first store combination to the demand stores; If the target out-of-stock item is not out of stock in the demand store after the supply is obtained, it is determined that the first store combination does not cause the target out-of-stock item in the demand store to become out of stock; if the target out-of-stock item in the demand store becomes out of stock after the supply is obtained, it is determined that the first store combination causes the target out-of-stock item in the demand store to become out of stock.

4. The method for transferring intermittently stocked goods in a store according to claim 1, characterized in that, The acquisition of the target out-of-stock item includes: Obtain items with limited sizes from various stores; Each item in the out-of-stock items of each store is identified as the target out-of-stock item.

5. A device for transferring intermittently stocked goods in a store, characterized in that, The device for transferring out-of-stock items between stores includes: The acquisition unit is used to acquire the target product with a missing size. The first determining unit is used to identify stores containing the target out-of-stock items as a candidate store set; The second determining unit is used to determine one store in the candidate store set as the demand store and the other stores in the candidate store set as the supply store set. A matching unit is used to match the demand store with each supply store in the supply store set to obtain multiple first store combinations, wherein the first store combination includes the demand store and one supply store; The calculation unit is used to calculate the matching degree corresponding to multiple first store combinations; including: calculating the matching degree corresponding to the first store combination based on the inter-store logistics days, historical sales data, and product size matching degree of the first store combination, and obtaining the matching degree corresponding to multiple first store combinations. The judgment unit is used to determine whether the first store combination with the highest matching degree causes the target out-of-size product of the demand store to be out of stock. The recording unit is configured to: if the first store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to become out of stock, then record the first store combination with the highest matching degree in the product allocation result of the target out-of-stock product; subsequently, remove the stores in the first store combination from the candidate store set to obtain a post-removal candidate store set, so that the demand stores of the first store combination do not participate in demand calculation, and the supply stores of the first store combination do not participate in supply calculation; determine one store in the post-removal candidate store set as a new demand store, and determine the other stores in the post-removal candidate store set as a new supply store set, and perform multiple store combination recordings; when the post-removal candidate store set obtained after multiple store combination recordings is empty. When the first store combination recording ends, if the first store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock, then the first store combination with the highest matching degree is removed from the supply store set to obtain the removed supply store set; the first store combination with the highest matching degree is matched with each supply store in the removed supply store set to obtain multiple second store combinations; the matching degree corresponding to the multiple second store combinations is calculated; it is determined whether the second store combination with the highest matching degree causes the target out-of-stock product of the demand store to be out of stock; if the second store combination with the highest matching degree does not cause the target out-of-stock product of the demand store to be out of stock, then the second store combination with the highest matching degree is recorded in the product allocation result; The allocation unit is used to allocate goods based on the allocation results of the target out-of-stock goods.

6. An electronic device, characterized in that, The electronic device includes: One or more processors; Memory; and One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the method for transferring intermittently coded goods in a store as described in any one of claims 1 to 4.

7. A computer-readable storage medium, characterized in that, It stores a computer program, which is loaded by a processor to execute the steps in the method for transferring intermittently coded goods in a store as described in any one of claims 1 to 4.

Images