Registered container code positioning method and device, electronic equipment and storage medium

Abstract

The embodiment of the invention discloses a registration container code positioning method and device, electronic equipment and a storage medium. The method comprises the following steps: determining an article to be processed, and determining at least one registration container code associated with the article; obtaining a first number of articles, and obtaining a second number of articles corresponding to each registration container code in the at least one registration container code; according to the second number and the first number corresponding to each registered container code, at least one time of positioning is carried out in at least one registered container code, and a target positioning result is obtained from at least one initial positioning result obtained through positioning, so that the article is processed based on the target positioning result; wherein the sum of the second number corresponding to each registered container code in the preliminary positioning result is smaller than or equal to the first number. According to the technical scheme provided by the embodiment of the invention, the whole tray treatment of the articles can be realized, so that the time cost and the labor cost in the article treatment process are reduced.

Description

Technical Field

[0001] The embodiments of the present invention relate to the field of warehousing technology, and in particular to a method, device, electronic device and storage medium for locating a registered container code. Background Art

[0002] The License Plate Number (LPN) is a code used internally in the Warehouse Management System (WMS).

[0003] LPN is a concept of pallet. When items are put into storage, multiple items can be grouped into a pallet to realize the process of item entry. Correspondingly, when items are out of storage, the process of item out of storage can be realized through the positioning result of LPN. At present, LPN positioning is mainly realized based on the hard-coded storage location clearing principle.

[0004] In the process of realizing the present invention, the inventors found that the prior art has the following technical problems: the currently adopted positioning solution easily leads to excessively high time and labor costs in the process of handling items. Summary of the invention

[0005] The embodiments of the present invention provide a method, device, electronic device and storage medium for positioning a registered container code to achieve pallet processing of items, thereby reducing the time cost and labor cost in the item processing process.

[0006] According to one aspect of the present invention, a method for locating a registration container code is provided, which may include:

[0007] determining an article to be processed and determining at least one registered container code associated with the article;

[0008] Obtaining a first quantity of items, and obtaining a second quantity of items corresponding to each of the at least one registered container code;

[0009] According to the second quantity and the first quantity respectively corresponding to each registered container code, at least one registered container code is located at least once, and a target location result is obtained from at least one preliminary location result obtained by the location, so as to process the item based on the target location result;

[0010] The sum of the second quantities corresponding to the registration container codes in the preliminary positioning result is less than or equal to the first quantity.

[0011] According to another aspect of the present invention, a positioning device for registering a container code is provided, which may include:

[0012] A registration container code determination module, used to determine an item to be processed and determine at least one registration container code associated with the item;

[0013] A second quantity acquisition module, used to acquire a first quantity of items, and acquire a second quantity of items corresponding to each registered container code of at least one registered container code;

[0014] A registered container code positioning module, used to perform at least one positioning in at least one registered container code according to the second quantity and the first quantity respectively corresponding to each registered container code, and obtain a target positioning result from at least one preliminary positioning result obtained by positioning, so as to process the item based on the target positioning result;

[0015] The sum of the second quantities corresponding to the registration container codes in the preliminary positioning result is less than or equal to the first quantity.

[0016] According to another aspect of the present invention, there is provided an electronic device, which may include:

[0017] at least one processor; and

[0018] a memory communicatively connected to at least one processor; wherein,

[0019] The memory stores a computer program executable by at least one processor, and the computer program is executed by at least one processor so that the at least one processor implements the registration container code positioning method provided by any embodiment of the present invention when executing the computer program.

[0020] According to another aspect of the present invention, a computer-readable storage medium is provided, on which computer instructions are stored, and the computer instructions are used to enable a processor to implement the registration container code positioning method provided by any embodiment of the present invention when executed.

[0021] The technical solution of the embodiment of the present invention determines the items to be processed and determines at least one LPN associated with the items; obtains a first number of items and obtains a second number of items corresponding to each LPN in at least one LPN; performs at least one positioning in at least one LPN according to the second number and the first number corresponding to each LPN, and obtains a target positioning result from at least one preliminary positioning result obtained by positioning, so as to process the items based on the target positioning result, and the sum of the second numbers corresponding to each LPN in the preliminary positioning result is less than or equal to the first number. The above technical solution performs at least one positioning in at least one LPN to obtain at least one preliminary positioning result. Since the sum corresponding to each preliminary positioning result is less than or equal to the first number, the sum corresponding to the target positioning result obtained from these preliminary positioning results is also less than or equal to the first number. Therefore, based on such a target positioning result, the whole pallet processing of the items can be realized, that is, in the process of processing the items, there is no need to remove the pallet of any LPN, thereby reducing the time cost and labor cost in the process of processing the items.

[0022] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present invention, nor are they intended to limit the scope of the present invention. Other features of the present invention will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0024] Figure 1 is a flow chart of a method for locating a registration container code provided in an embodiment of the present invention;

[0025] Figure 2 is a flowchart of another registration container code positioning method provided by an embodiment of the present invention;

[0026] Figure 3 is a flowchart of another registration container code positioning method provided by an embodiment of the present invention;

[0027] Figure 4 is a flowchart of another registration container code positioning method provided by an embodiment of the present invention;

[0028] Figure 5 is a flowchart of an optional example of a positioning method for a registered container code provided in an embodiment of the present invention;

[0029] Figure 6 is a structural block diagram of a positioning device for registering a container code provided according to an embodiment of the present invention;

[0030] Figure 7 It is a structural schematic diagram of an electronic device for implementing the registration container code positioning method according to an embodiment of the present invention. DETAILED DESCRIPTION

[0031] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.

[0032] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. The situations of "target", "original", etc. are similar and will not be repeated here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0033] Before introducing the embodiments of the present invention, the reasons why the currently used positioning solutions described in the background technology easily lead to excessively high time and labor costs in the process of handling items are first explained by way of example.

[0034] Taking the goods out of the warehouse as an example, for each LPN associated with the goods, the inventory of these LPNs can be sorted from small to large, and then the LPNs corresponding to the sorted inventory are traversed to locate the LPN that can meet the goods out of the warehouse, thereby completing the goods out of the warehouse process. For example, assuming that the sorted inventory is 10, 20, 30 and 40, and the LPNs corresponding to these inventories are A, B, C and D, and the goods out of the warehouse is 45, on this basis, the inventory of A is less than the goods out of the warehouse, and traverse backwards; the inventory of A + the inventory of B is less than the goods out of the warehouse, and traverse backwards; the inventory of A + the inventory of B + the inventory of C is greater than the goods out of the warehouse, then A, B and C are used as the located LPNs, and C can be disassembled at this time, so that all the goods in A and B and some of the goods in C are out of the warehouse, completing the goods out of the warehouse process.

[0035] It should be noted that the purpose of grouping pallets into the warehouse is to send the whole pallet out of the warehouse, so as to control the time cost and labor cost of the goods in the process of sending out the warehouse. However, as can be seen from the above, the current positioning scheme is prone to the situation of pallet disassembly, which will lead to the increase of the above-mentioned time cost and labor cost.

[0036] Figure 1 1 is a flow chart of a registration container code positioning method provided in an embodiment of the present invention. This embodiment can be applicable to the case of handling items by the entire pallet. The method can be executed by a registration container code positioning device provided in an embodiment of the present invention, which can be implemented by software and / or hardware, and can be integrated in an electronic device, which can be various user terminals or servers.

[0037] See also Figure 1 The method of the embodiment of the present invention specifically includes the following steps:

[0038] S110, determining the items to be processed, and determining at least one registered container code associated with the items. The items can be understood as items to be processed, such as items to be shipped out, to be counted, or to be sorted, which depends on the actual situation and is not specifically limited here.

[0039] The registered container number (LPN) can be understood as a code used within the WMS. In the embodiment of the present invention, it can be specifically understood as a code associated with the determined items to be processed. In practical applications, the LPN can be optionally represented by at least one of numbers, letters, and symbols; of course, it can also be represented by other methods according to actual needs, which is not specifically limited here.

[0040] In combination with the application scenarios that may be involved in the embodiments of the present invention, LPN can be used to uniquely identify containers in a warehouse. On this basis, further, generally speaking, an item can be stored in one or more containers, and a container usually only stores one type of item, so an item can correspond to one or more LPNs, and an LPN only corresponds to one type of item. Exemplarily, here, the item is a toothbrush. Assuming that there are 10,000 toothbrushes stored in the warehouse, and the 10,000 toothbrushes are stored in 10 containers, the number of LPNs corresponding to the toothbrushes is 10, and the items corresponding to each of the 10 LPNs are all toothbrushes.

[0041] It should be noted that the above-mentioned container can be understood as a device that can be used to store items, such as a pallet and / or a box. In practical applications, in order to facilitate warehouse management, in the warehousing stage, multiple items of the same kind can be stored as a whole in the same container, so that the items are put into the warehouse in units of containers. On this basis, in the outbound stage, all items stored in the same container can also be outbound as a whole.

[0042] In the field of warehousing, the process of storing multiple items of the same kind in the same container for storage as described above is sometimes figuratively expressed as grouping multiple items of the same kind into a pallet for storage, i.e., pallet storage; similarly, the process of taking all items stored in the same container out of the warehouse as a whole as described above is sometimes figuratively expressed as taking multiple items of the same kind in the same pallet out of the warehouse as a whole, i.e., whole pallet storage. Therefore, the concept of "pallet" mentioned in each embodiment of the present invention can be understood as the meaning of "container".

[0043] S120: Acquire a first quantity of items, and acquire a second quantity of items corresponding to each registered container code in at least one registered container code.

[0044] The first quantity can be used to indicate the number of items to be processed this time, that is, how many items need to be processed this time. For each LPN in at least one LPN, the second quantity of items corresponding to the LPN can be used to indicate the number of items stored in the container represented by the LPN, which may be less than, equal to or greater than the first quantity, which depends on the actual situation and is not specifically limited here.

[0045] The first quantity and the second quantity corresponding to each LPN are obtained.

[0046] S130, performing at least one positioning in at least one registered container code according to the second quantity and the first quantity respectively corresponding to each registered container code, and obtaining a target positioning result from at least one preliminary positioning result, so as to process the item based on the target positioning result;

[0047] The sum of the second quantities corresponding to the registration container codes in the preliminary positioning result is less than or equal to the first quantity.

[0048] Among them, according to the first number and the second number corresponding to each LPN, at least one positioning is performed in at least one LPN, that is, one or more positioning is performed in at least one LPN, so as to obtain preliminary positioning results corresponding to each positioning in at least one positioning, that is, to obtain at least one preliminary positioning result. It should be noted that for each preliminary positioning result in at least one preliminary positioning result, it includes at least part of at least one LPN, and the sum of the second numbers corresponding to each LPN included is less than or equal to the first number, that is, the sum corresponding to the preliminary coding result is less than or equal to the first number. In practical applications, optionally, all of at least one preliminary positioning result may be less than or equal to the first number, or a part of them may be less than the first number and another part may be equal to the first number. This is related to the actual situation and is not specifically limited here.

[0049] The target positioning result is obtained from at least one preliminary positioning result. For example, the target positioning result can be obtained from these preliminary positioning results according to the positioning time of each of these preliminary positioning results or the corresponding sum respectively. The number of target positioning results can be one or more, which is not specifically limited here. Furthermore, based on the target positioning result, specifically each LPN in the target positioning result, the items can be processed, for example, the items represented by these LPNs can be sent out of the warehouse, counted or sorted.

[0050] In practical applications, the above steps can be optionally implemented by recursion or traversal, and of course, can also be implemented by other methods, which are not specifically limited here. The traversal method will be described in detail later, and the recursive method is briefly described here.

[0051] At least part of at least one LPN is combined to obtain at least one LPN group; then, at least one preliminary positioning result is located from the at least one LPN group according to the sum of the first number and each second number corresponding to each LPN group in the at least one LPN group; and then, a target positioning result is obtained from the at least one preliminary positioning result.

[0052] Exemplarily, assuming that at least one LPN includes three LPNs A, B and C, these three LPNs are combined to obtain four LPN groups A and B, A and C, B and C, and A, B and C; assuming that the sum of the second quantities corresponding to A and B is 20, the sum of the second quantities corresponding to A and C is 30, the sum of the second quantities corresponding to B and C is 40, and the sum of the second quantities corresponding to A, B and C is 40, and the first quantity is 35, then the two LPN groups A and B and A and C are respectively used as preliminary positioning results; the target positioning result is obtained from the two preliminary positioning results, for example, the preliminary positioning result of A and C closest to the first quantity can be used as the target positioning result.

[0053] The technical solution of the embodiment of the present invention determines the items to be processed and determines at least one LPN associated with the items; obtains a first number of items and obtains a second number of items corresponding to each LPN in at least one LPN; performs at least one positioning in at least one LPN according to the second number and the first number corresponding to each LPN, and obtains a target positioning result from at least one preliminary positioning result obtained by positioning, so as to process the items based on the target positioning result, and the sum of the second numbers corresponding to each LPN in the preliminary positioning result is less than or equal to the first number. The above technical solution performs at least one positioning in at least one LPN to obtain at least one preliminary positioning result. Since the sum corresponding to each preliminary positioning result is less than or equal to the first number, the sum corresponding to the target positioning result obtained from these preliminary positioning results is also less than or equal to the first number. Therefore, based on such a target positioning result, the whole pallet processing of the items can be realized, that is, in the process of processing the items, there is no need to remove the pallet of any LPN, thereby reducing the time cost and labor cost in the process of processing the items.

[0054] An optional technical solution, obtaining a target positioning result from at least one located preliminary positioning result, includes: for the sums corresponding to the at least one located preliminary positioning result, taking the preliminary positioning result corresponding to the sum with the largest value in at least one sum as the target positioning result. Among them, for each preliminary positioning result in at least one preliminary positioning result, the sum corresponding to the preliminary positioning result can be understood as the sum of the second quantity corresponding to each LPN in the preliminary positioning result. For at least one sum corresponding to at least one preliminary positioning result, the preliminary positioning result corresponding to the sum with the largest value in at least one sum, that is, the sum closest to the first quantity, is taken as the target positioning result. Exemplarily, continuing with the above example, assuming that the sum corresponding to the preliminary positioning results A and B is 20, the sum corresponding to the preliminary positioning results A and C is 30, and the first quantity is 35, then the preliminary positioning results A and C closest to 35 are taken as the target positioning result. The advantage of this setting is that the number of items corresponding to the target positioning result is less than or equal to the first number, which means that in order to process the first number of items, it may be necessary to take out a part of the items stored in scattered (i.e., not in a whole pallet) for processing. Therefore, by taking the preliminary positioning result closest to the first number as the target positioning result, as many items as possible stored in a whole pallet can be processed, that is, as few items stored in a scattered manner as possible can be processed, thereby further reducing time and labor costs.

[0055] Another optional technical solution is to determine the items to be processed, including: determining the items to be shipped out; processing the items based on the target positioning result, including: performing a shipping operation on the items based on each registered container code in the target positioning result. The above technical solution realizes the shipping of items in a pallet, that is, during the shipping or picking process of items, there is no need to remove any LPN, thereby reducing time and labor costs.

[0056] Figure 2It is a flowchart of another registration container code positioning method provided in an embodiment of the present invention. This embodiment is optimized based on the above-mentioned technical solutions. In this embodiment, optionally, according to the second number and the first number corresponding to each registration container code, at least one registration container code is positioned at least once, and the target positioning result is obtained from at least one preliminary positioning result located, including: according to the second number and the preset sorting method corresponding to each registration container code, at least one registration container code is sorted to obtain the sorting result; for the current code in the sorting result, according to the first number, the current code and each registration container code sorted in the preset position of the current code are positioned to obtain the preliminary positioning result corresponding to the current code, wherein the preset position matches the preset sorting method; for the adjacent code sorted adjacent to the current code in the preset position, the sum corresponding to the preliminary positioning result corresponding to the current code is compared with the sum corresponding to the preliminary positioning result corresponding to the adjacent code, so as to obtain the target positioning result from the preliminary positioning result corresponding to each registration container code according to the comparison result. Among them, the explanation of the terms that are the same or corresponding to the above-mentioned embodiments will not be repeated here.

[0057] See also Figure 2 The method of this embodiment may specifically include the following steps:

[0058] S210: Determine an item to be processed, and determine at least one registered container code associated with the item.

[0059] S220: Acquire a first quantity of items, and acquire a second quantity of items corresponding to each registered container code in at least one registered container code.

[0060] S230: Sort at least one registration container code according to the second quantity corresponding to each registration container code and a preset sorting method to obtain a sorting result.

[0061] Among them, the preset sorting method can be understood as a pre-set sorting method, for example, it can be ascending sorting (i.e. sorting from small to large) or descending sorting (i.e. sorting from large to small), which can be selected according to actual conditions and is not specifically limited here.

[0062] According to the second quantity corresponding to each LPN and the preset sorting method, at least one LPN is sorted to obtain a sorting result. It should be noted that the purpose of sorting is to ensure no aftereffect. For example, assuming that at least one LPN includes A, B, C, D and E, and the second quantities corresponding to them are 20, 10, 30, 50 and 40 respectively, when the preset sorting method is ascending sorting, the sorting results obtained may be B, A, C, E and D. For ease of understanding, this example is also applicable in the following text.

[0063] S240. For the current code in the sorting result, according to the first quantity, positioning is performed in the current code and each registered container code sorted at a preset position of the current code to obtain a preliminary positioning result corresponding to the current code, wherein the preset position matches the preset sorting method, and the sum of the second quantities corresponding to each registered container code in the preliminary positioning result corresponding to the current code is less than or equal to the first quantity.

[0064] The current code can be understood as the LPN currently traversed among the LPNs in the sorting result. The preset position matches the preset sorting method. For example, when the preset sorting method is ascending, the preset position can be the front; when the preset sorting method is descending, the preset position can be the back.

[0065] According to the first number, positioning is performed in each LPN of the current code and the LPN sequenced in the preset position of the current code to obtain a preliminary positioning result corresponding to the current code. Exemplarily, continuing with the above example, assuming that the current code is C, then each registered container code sequenced in front of C includes B and A, that is, positioning is performed in B, A and C, and a preliminary positioning result corresponding to C is obtained.

[0066] S250. For adjacent codes that are adjacent to the current code in a preset orientation, compare the sum corresponding to the preliminary positioning result corresponding to the current code with the sum corresponding to the preliminary positioning result corresponding to the adjacent codes, so as to obtain a target positioning result from the preliminary positioning results corresponding to each registered container code according to the comparison result, and process the item based on the target positioning result.

[0067] Among them, the adjacent code can be understood as the LPN that is adjacent to the current code in the preset direction, and is traversed before the current code. Exemplarily, continuing with the above example, the current code is C, and the adjacent code is A. It should be noted that the process of determining the preliminary positioning result corresponding to the adjacent code is the same as the process of determining the preliminary positioning result corresponding to the current code, and will not be repeated here.

[0068] The sum corresponding to the preliminary positioning result corresponding to the current code (that is, the sum of the second number corresponding to each LPN in the preliminary positioning result corresponding to the current code, which can be referred to as the sum corresponding to the current code) is compared with the sum corresponding to the preliminary positioning result corresponding to the adjacent code, so as to obtain the target positioning result from the preliminary positioning results corresponding to each LPN according to the comparison result.

[0069] Exemplarily, assuming that the preliminary positioning results corresponding to adjacent codes include B and A, and the preliminary positioning results corresponding to the current code include B, A and C, then the sum of the second quantities corresponding to B, A and C respectively is compared with the sum of the second quantities corresponding to B and A respectively.

[0070] The technical solution of the embodiment of the present invention is to sort each LPN, and then traverse each LPN in the sorting result, and compare the sum corresponding to the preliminary positioning result corresponding to the current code with the sum corresponding to the preliminary positioning result corresponding to the adjacent code, thereby obtaining the target positioning result from the preliminary positioning results corresponding to each LPN.

[0071] An optional technical solution, based on the first quantity, positioning is performed in each registered container code of the current code and the sorting at the preset position of the current code, including: when the second quantity corresponding to the current code is greater than the first quantity, positioning is performed in each registered container code of the current code and the sorting at the preset position of the current code based on the preliminary positioning result corresponding to the adjacent code. Exemplarily, the preliminary positioning result corresponding to the adjacent code can be used as the preliminary positioning result obtained after positioning in each registered container code of the current code and the sorting at the preset position of the current code, thereby obtaining the preliminary positioning result closest to the first quantity, which helps the subsequent target positioning result to be closest to the first quantity, thereby further reducing the time cost and labor cost in the process of handling items.

[0072] Another optional technical solution is that according to the first quantity, when the second quantity corresponding to the current code is less than or equal to the first quantity, according to the sum corresponding to the preliminary positioning result corresponding to the adjacent code, and the third quantity, positioning is performed in the current code and each registered container code sorted at the preset position of the current code; wherein the third quantity is determined according to the sum corresponding to the intermediate positioning result, and the intermediate positioning result is obtained by positioning in each registered container code sorted at the preset position of the current code based on the fourth quantity, and the fourth quantity is determined according to the first quantity and the second quantity corresponding to the current code. wherein the sum corresponding to the intermediate positioning result can be understood as the sum of the second quantities corresponding to each LPN in the intermediate positioning result. the sum corresponding to the preliminary positioning result corresponding to the adjacent code (i.e. the sum corresponding to the adjacent code) matches the addition of the current code to the preliminary positioning result, while the third quantity matches the non-addition of the current code to the preliminary positioning result, so how to perform positioning can be determined by comparing these two quantities, i.e. determining whether to add the current code to the preliminary positioning result, thereby obtaining the preliminary positioning result closest to the first quantity, which helps the subsequent target positioning result to be closer to the first quantity, thereby further reducing the time cost and labor cost in the item processing process.

[0073] Another optional technical solution is to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code according to the comparison result, including:

[0074] When it is determined according to the comparison result that the preliminary positioning result corresponding to the adjacent code needs to be used as the preliminary positioning result corresponding to the current code, the preliminary positioning result corresponding to the adjacent code is used as the preliminary positioning result corresponding to the current code;

[0075] Taking the registration container code that is adjacent to the current code in the reverse direction of the preset direction as the current code, and returning to perform the step of positioning in the current code and each registration container code that is adjacent to the current code in the preset direction according to the first quantity;

[0076] When the current code is the registered container code located on the end side in the sorting result, the preliminary positioning result corresponding to the current code is used as the target positioning result.

[0077] Among them, in order to obtain the target positioning result closest to the first number, during the traversal process, when the preliminary positioning result corresponding to the adjacent code is better than the preliminary positioning result corresponding to the current code, the preliminary positioning result corresponding to the adjacent code is used as the preliminary positioning result corresponding to the current code; of course, in the case of not being better, it can remain as it is. Further, the LPN that is adjacent to the current code in the reverse direction of the preset direction is used as the current code. Exemplarily, still taking the above example, E is used as the current code; then, the above-mentioned steps of determining the preliminary positioning result corresponding to the current code and comparing are performed again, that is, the traversal is continued. When the current code is the LPN located on the end side (for example, the head end or the tail end) in the sorting result, the traversal ends, and the preliminary positioning result corresponding to the current code is used as the target positioning result. Exemplarily, when the current code is D, the preliminary positioning result corresponding to D is the best, and it can be used as the target positioning result, thereby obtaining the target positioning result closest to the first number.

[0078] In order to better understand the above-mentioned technical solutions, the following is an exemplary explanation of them in combination with specific examples. For example, in order to ensure that the sum of the second number corresponding to each located LPN is closest to the first number, the above-mentioned positioning process can be implemented based on the dynamic programming (DP) idea, and sorting the LPNs can just meet the principle of no aftereffect required by the DP idea, that is, the addition of the current code (such as the i-th LPN in the sorting result) will not affect the preliminary positioning result calculated based on the first i-1 LPNs (i.e., corresponding to adjacent codes), and the preliminary positioning result here can be understood as the optimal solution.

[0079] Specifically, the LPNs are sorted in ascending order according to the second quantities corresponding to the LPNs to obtain a sorting result. Assume that w[i] and v[i] both represent the second quantity corresponding to the i-th LPN, j represents the first quantity, and dp[i][j] represents the sum of the second quantities corresponding to these LPN groups obtained by any combination of the first i LPNs in the sorting result, which is closest to j. For example, assume that the first i LPNs include X, Y and Z, and their corresponding second quantities are 100, 120 and 150, respectively, and the first quantity is 230. X, Y and Z are randomly combined to obtain four LPN groups, namely X and Y, X and Z, Y and Z, and X, Y and Z. The sums corresponding to these four LPN groups are 220 (i.e., 100+120), 250 (i.e., 100+150), 270 (i.e., 120+150) and 370 (i.e., 100+120+150), respectively. The sum closest to the first quantity among them is 220, so dp[3]

[230] =220. On this basis, each LPN in the sorting result is traversed, and for the i-th LPN currently traversed, the preliminary positioning result corresponding to the i-th LPN is determined based on the following steps:

[0080] When w[i]>j, dp[i][j]=dp[i-1][j], that is, the preliminary positioning result corresponding to the i-1th LPN is used as the preliminary positioning result corresponding to the i-th LPN;

[0081] In the case of j>=w[i], dp[i][j]=max{dp[i-1][j], dp[i-1][jw[i]]+v[i]}, that is, to maximize the sum, there are two strategies. One is not to add the i-th LPN to the positioning result. In this case, the maximum sum is dp[i-1][j]; the other is to add the i-th LPN to the positioning result. In this case, the maximum sum is dp[i-1][jw[i]]+v[i], which is to add dp[i-1][jw[i]] to v[i]. Among them, jw[i] is equivalent to the fourth number mentioned above, the positioning result corresponding to dp[i-1][jw[i]] is the intermediate positioning result mentioned above, and dp[i-1][jw[i]]+v[i] is equivalent to the third number mentioned above.

[0082] The above example can be understood as solving the optimal solution of the i-th LPN based on the optimal solution of the first i+1 LPNs. When traversing to the last LPN in the sorted result, its optimal solution is the target positioning result.

[0083] Figure 3It is a flowchart of another registration container code positioning method provided in an embodiment of the present invention. This embodiment is optimized based on the above-mentioned technical solutions. In this embodiment, optionally, according to the comparison result, the target positioning result is obtained from the preliminary positioning results corresponding to each registration container code, which may include: when the comparison result is equal, the current code number of each registration container code in the preliminary positioning result corresponding to the current code, and the adjacent code number of each registration container code in the preliminary positioning result corresponding to the adjacent code can be obtained; when the current code number is greater than the adjacent code number, the preliminary positioning result corresponding to the adjacent code is used as the preliminary positioning result corresponding to the current code, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registration container code. Among them, the explanation of the terms that are the same or corresponding to the above-mentioned embodiments will not be repeated here.

[0084] See also Figure 3 The method of this embodiment may specifically include the following steps:

[0085] S310: Determine an item to be processed, and determine at least one registered container code associated with the item.

[0086] S320: Acquire a first quantity of items, and acquire a second quantity of items corresponding to each registered container code in at least one registered container code.

[0087] S330: Sort at least one registration container code according to the second quantity corresponding to each registration container code and a preset sorting method to obtain a sorting result.

[0088] S340. For the current code in the sorting result, according to the first quantity, positioning is performed in the current code and each registered container code sorted at a preset position of the current code to obtain a preliminary positioning result corresponding to the current code, wherein the preset position matches the preset sorting method, and the sum of the second quantities corresponding to each registered container code in the preliminary positioning result corresponding to the current code is less than or equal to the first quantity.

[0089] S350. For an adjacent code that is adjacent to the current code in a preset position, compare the sum corresponding to the preliminary positioning result corresponding to the current code with the sum corresponding to the preliminary positioning result corresponding to the adjacent code.

[0090] S360: When the comparison result is equal, obtain the current code number of each registered container code in the preliminary positioning result corresponding to the current code, and the adjacent code number of each registered container code in the preliminary positioning result corresponding to the adjacent code.

[0091] Among them, the more LPNs there are in the target positioning result, the higher the time cost and labor cost will be when processing items based on these LPNs. For example, taking item picking as an example, in a warehouse, a pallet usually contains hundreds or thousands of items, so most of them are based on forklift picking. If multiple pallets need to be picked, it will lead to higher time cost and labor cost.

[0092] In order to solve the above problem, when the two sums are equal, the current coding number and the adjacent coding number can be obtained, wherein the current coding number can be understood as the number of LPNs in the preliminary positioning result corresponding to the current coding, and the adjacent coding number can be understood as the number of LPNs in the preliminary positioning result corresponding to the adjacent coding.

[0093] S370. When the number of current codes is greater than the number of adjacent codes, the preliminary positioning results corresponding to the adjacent codes are used as the preliminary positioning results corresponding to the current code, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code, and process the item based on the target positioning result.

[0094] Among them, when the current code number is greater than the adjacent code number, it means that compared with the preliminary positioning result corresponding to the current code, the number of LPNs in the preliminary positioning result corresponding to the adjacent code is smaller. Therefore, the preliminary positioning result corresponding to the adjacent code can be used as the preliminary positioning result corresponding to the current code, so that when the sum of the second numbers located is equal, the LPN with fewer numbers is selected.

[0095] In order to better understand the implementation process of the above technical solution, the following is an illustrative explanation of it with specific examples. For example, in the actual calculation process, all LPNs can be placed in a List, so a Knapsack type can be defined, which contains an int[]items attribute to record the index of the LPN in the List corresponding to each optimal solution obtained during the calculation process, and then use Map<BigDecimal,Knapsack> The key in choose is used to record the sum corresponding to the current optimal solution. Each time, a comparison is made based on the current optimal solution and the previous optimal solution. If the key of the current optimal solution is greater than the key of the previous optimal solution, the current optimal solution is used as the optimal solution for the next calculation. If the two keys are the same, the size of the items in the Map value is determined. The smaller the size of the items, the fewer the number of LPNs and the better the corresponding preliminary positioning result.

[0096] The technical solution of the embodiment of the present invention, when the sum corresponding to the current code is consistent with the sum corresponding to the adjacent code, the preliminary positioning result corresponding to the LPN with fewer number in the two preliminary positioning results is used as the preliminary positioning result corresponding to the current code, thereby further reducing the time cost and labor cost.

[0097] Figure 4 It is a flowchart of another registration container code positioning method provided in an embodiment of the present invention. This embodiment is optimized based on the above-mentioned technical solutions. In this embodiment, optionally, according to the comparison result, the target positioning result is obtained from the preliminary positioning results corresponding to each registration container code, and it also includes: when the current code number is equal to the adjacent code number, the current storage positions corresponding to each registration container code corresponding to the current code are obtained, and the adjacent storage positions corresponding to each registration container code corresponding to the adjacent code are obtained; the current storage position number of different current storage positions in the corresponding current storage positions is determined, and the adjacent storage position number of different adjacent storage positions in the corresponding adjacent storage positions is determined; when the current storage position number is greater than or equal to the adjacent storage position number, the preliminary positioning result corresponding to the adjacent code is used as the preliminary positioning result corresponding to the current code, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registration container code. Among them, the explanations of the terms that are the same or corresponding to the above-mentioned embodiments are not repeated here.

[0098] See also Figure 4 The method of this embodiment may specifically include the following steps:

[0099] S4010: Determine an item to be processed, and determine at least one registered container code associated with the item.

[0100] S4020: Obtain a first quantity of items, and obtain a second quantity of items corresponding to each registered container code in at least one registered container code.

[0101] S4030: Sort at least one registration container code according to the second quantity corresponding to each registration container code and a preset sorting method to obtain a sorting result.

[0102] S4040. For a current code in the sorting result, positioning is performed in the current code and each registered container code sorted at a preset position of the current code according to the first quantity, to obtain a preliminary positioning result corresponding to the current code, wherein the preset position matches the preset sorting method, and the sum of the second quantities corresponding to each registered container code in the preliminary positioning result corresponding to the current code is less than or equal to the first quantity.

[0103] S4050. For an adjacent code that is adjacent to the current code in a preset position, compare the sum corresponding to the preliminary positioning result corresponding to the current code with the sum corresponding to the preliminary positioning result corresponding to the adjacent code.

[0104] S4060: When the comparison result is equal, obtain the current code number of each registered container code in the preliminary positioning result corresponding to the current code, and the adjacent code number of each registered container code in the preliminary positioning result corresponding to the adjacent code.

[0105] S4070: When the number of current codes is greater than the number of adjacent codes, the preliminary positioning results corresponding to the adjacent codes are used as the preliminary positioning results corresponding to the current code, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code.

[0106] S4080: When the number of current codes is equal to the number of adjacent codes, obtain the current storage locations corresponding to each registration container code corresponding to the current code, and the adjacent storage locations corresponding to each registration container code corresponding to the adjacent codes.

[0107] Among them, each LPN corresponds to its own storage location in the warehouse. It should be noted that in the process of item processing, the fewer storage locations involved, the lower the time cost and labor cost. Therefore, when the number of current codes is equal to the number of adjacent codes, the current storage location and adjacent storage location can be determined. The current storage location can be understood as the storage location corresponding to each LPN in the preliminary positioning result corresponding to the current code, and the adjacent code can be understood as the storage location corresponding to each LPN in the preliminary positioning result corresponding to the adjacent code.

[0108] S4090: Determine the current storage location numbers of different current storage locations in the respectively corresponding current storage locations, and the adjacent storage location numbers of different adjacent storage locations in the respectively corresponding adjacent storage locations.

[0109] In actual applications, there may be duplications in these current storage locations corresponding to the current encoding, so these current storage locations can be deduplicated to obtain the number of current storage locations, which can be used to represent the number of different current storage locations in these current storage locations.

[0110] The process of obtaining the number of adjacent storage locations is similar and will not be repeated here.

[0111] S4100. When the number of current storage locations is greater than or equal to the number of adjacent storage locations, the preliminary positioning result corresponding to the adjacent code is used as the preliminary positioning result corresponding to the current code, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code, and process the item based on the target positioning result.

[0112] Among them, when the number of current storage locations is greater than or equal to the number of adjacent storage locations, this means that compared with the preliminary positioning result corresponding to the current code, the preliminary positioning result corresponding to the adjacent code involves fewer storage locations. Therefore, the preliminary positioning result corresponding to the adjacent code can be used as the preliminary positioning result corresponding to the current code, so that when the number of located LPNs is the same, a smaller number of storage locations can be selected.

[0113] The technical solution of the embodiment of the present invention, when the current number of codes is equal to the number of adjacent codes, further reduces the time cost and labor cost by using the preliminary positioning result involving fewer storage positions in the two preliminary positioning results as the preliminary positioning result corresponding to the current code.

[0114] An optional technical solution, the above registration container code positioning method further includes:

[0115] According to the storage locations respectively corresponding to the at least one registered container code, the at least one registered container code is grouped to obtain at least one registered container code group;

[0116] Sorting at least one registered container code according to the second quantity corresponding to each registered container code and the preset sorting method to obtain a sorting result, including:

[0117] For each of the at least one registered container code group, sorting the registered container codes in the registered container code group according to the second quantities and the preset sorting method respectively corresponding to the registered container codes in the registered container code group to obtain a sub-sorting result;

[0118] According to the sub-sorting results corresponding to each registration container code group, a sorting result of at least one registration container code is obtained.

[0119] Among them, at least one LPN is grouped based on the storage position corresponding to the LPN. For example, the LPNs corresponding to the same storage position in at least one LPN can be grouped into one group, thereby obtaining at least one registration container code group (i.e., LPN group). On this basis, an LPN group can be used as a unit to sort the LPNs therein, thereby obtaining a sub-sorting result corresponding to the LPN group. Furthermore, according to the sub-sorting results corresponding to each LPN group, a sorting result of at least one LPN is obtained, for example, these sub-sorting results are connected in sequence, and the obtained connection result is used as the sorting result. The above technical solution can ensure that the principle of no aftereffect is met during the loop traversal process, that is, it can ensure that the optimal solution of the first i LPNs can be derived based on the optimal solution of the first i-1 LPNs.

[0120] In order to better understand the implementation process of the above technical solution, the following is an exemplary explanation of it in combination with specific examples. For example, in order to determine whether the number of storage locations involved is the least, the storage location information of the LPN can be stored based on a list, and the index of the storage location List and the index of the LPN need to correspond one to one. First, each LPN is grouped according to the storage location information of each LPN, and then each LPN in the storage location is sorted from small to large according to the second number. The final data example is as follows:

[0121] Storage List:["AP1011","AP1011","AP1011","AP1011","AP1011","AP1011","AP1012","AP10 12","AP1012","AP1012","AP1015","AP1015","AP1015","AP1015","AP1015","AP1015"]

[0122] LPN quantity List:[1,1,3,7,7,7,1,5,8,8,1,3,3,4,8,8]

[0123] In addition, a List is used to store inventory objects, which contains LPN codes and actual inventory information. The calculation is based on the above storage location List and LPN quantity List. In order to minimize the number of storage locations, when comparing the optimal solution corresponding to the current code and the optimal solution corresponding to the adjacent code, if the number of LPNs is the same, the storage location corresponding to the LPN is obtained based on the index in the item to the storage location List, and the number of storage locations is obtained after deduplication. The optimal solution with the smaller number of storage locations is used as the latest optimal solution.

[0124] In order to better understand the above-mentioned technical solutions as a whole, the following is an exemplary description of them in combination with specific examples. Figure 5Here, taking the product out of the warehouse as an example, query the second quantity (i.e., inventory) corresponding to each LPN associated with the product to be out of the warehouse and obtain the first quantity of the product; group these LPNs according to the storage locations corresponding to these LPNs, and after grouping, sort these LPNs from small to large according to inventory. Traverse these LPNs, calculate the optimal solution B of the first N+1 (i.e., i in the above text) LPNs closest to the first quantity based on the DP idea, and compare B with the optimal solution A of the first N (i.e., i-1 in the above text) LPNs. In terms of sum, if B>A, then set B as the optimal solution of N+1, and A=B; otherwise (i.e., B=A), in terms of the number of LPNs, if B>A, then set A as the optimal solution of N+1, and A=A, and if B<A, then set B as the optimal solution of N+1, and A=B; otherwise (i.e., B=A), in terms of the number of storage locations, if B≥A, then set A as the optimal solution of N+1, and A=A; otherwise (i.e., B<A), then set B as the optimal solution of N+1, and A=B. Continue traversing, and when the last LPN in the sorted result has been traversed, and / or the sum corresponding to A is the first number and there is only one LPN in A, end the traversal and take A as the optimal solution (i.e., the target positioning result).

[0125] Based on the above example, we process the following sample inventory data:

[0126] Inventory status at storage location AP1011: LPN1 (100 pieces), LPN2 (50 pieces), LPN3 (50 pieces), LPN4 (30 pieces);

[0127] Inventory status at storage location AP1012: LPN6 (100 pieces), LPN7 (50 pieces);

[0128] The following target positioning results can be obtained:

[0129] If the first quantity is 40 pieces, locate LPN4 (30 pieces);

[0130] If the first quantity is 80 pieces, then locate LPN3 (50 pieces) / LPN2 (50 pieces) + LPN4 (30 pieces), not LPN7 (50 pieces) + LPN4 (30 pieces);

[0131] If the first quantity is 100 pieces, locate LPN1 (100 pieces) or LPN6 (100 pieces);

[0132] If the first quantity is 130 pieces, then LPN1 (100 pieces) + LPN4 (30 pieces) is located, and it cannot be LPN6 (100 pieces) + LPN4 (30 pieces).

[0133] In the above example, as many LPN inventories as possible can be located, and under the premise that the located inventories are the same, the solution with the least number of LPNs can be selected, and under the premise that the located inventories and the number of LPNs are the same, the solution with the least storage space can be selected to achieve the optimal positioning of LPNs.

[0134] Figure 6 This is a structural block diagram of a registration container code positioning device provided in an embodiment of the present invention. The device is used to execute the registration container code positioning method provided in any of the above embodiments. The device and the registration container code positioning method of the above embodiments belong to the same inventive concept. For details not described in detail in the embodiment of the registration container code positioning device, refer to the embodiment of the registration container code positioning method. Figure 6 The device may specifically include: a registered container code determination module 510, a second quantity acquisition module 520 and a registered container code positioning module 530.

[0135] A registered container code determination module 510 is used to determine an item to be processed and determine at least one registered container code associated with the item;

[0136] A second quantity acquisition module 520 is used to acquire a first quantity of items and acquire a second quantity of items corresponding to each registered container code of at least one registered container code;

[0137] The registered container code positioning module 530 is used to perform at least one positioning in at least one registered container code according to the second quantity and the first quantity respectively corresponding to each registered container code, and obtain a target positioning result from at least one preliminary positioning result so as to process the item based on the target positioning result;

[0138] The sum of the second quantities corresponding to the registration container codes in the preliminary positioning result is less than or equal to the first quantity.

[0139] Optionally, the registration container code positioning module 530 may include:

[0140] A registered container code sorting unit, configured to sort at least one registered container code according to the second quantity and a preset sorting method respectively corresponding to each registered container code, to obtain a sorting result;

[0141] a preliminary positioning result obtaining unit, configured to perform positioning in the current code and each registered container code sorted at a preset position of the current code according to the first quantity for the current code in the sorting result, and obtain a preliminary positioning result corresponding to the current code, wherein the preset position matches the preset sorting method;

[0142] The target positioning result obtaining unit is used to compare the sum corresponding to the preliminary positioning result corresponding to the current code with the sum corresponding to the preliminary positioning result corresponding to the adjacent code which is arranged adjacent to the current code in a preset direction, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code according to the comparison result.

[0143] On this basis, an optional, preliminary positioning result is obtained by the unit, including:

[0144] The registered container code first positioning subunit is used to locate the current code and each registered container code arranged at a preset position of the current code based on the preliminary positioning result corresponding to the adjacent code when the second number corresponding to the current code is greater than the first number;

[0145] and / or,

[0146] The second registration container code positioning subunit is used to perform positioning in the current code and each registration container code arranged at a preset position of the current code according to the sum of the preliminary positioning results corresponding to the adjacent codes and the third number when the second number corresponding to the current code is less than or equal to the first number;

[0147] The third number is determined according to the sum corresponding to the intermediate positioning result, the intermediate positioning result is obtained based on the fourth number in each registered container code sorted on the preset position of the current code, and the fourth number is determined according to the first number and the second number corresponding to the current code.

[0148] Alternatively, the target positioning result obtaining unit includes:

[0149] The first obtaining subunit of the preliminary positioning result is used to use the preliminary positioning result corresponding to the adjacent code as the preliminary positioning result corresponding to the current code when it is determined according to the comparison result that the preliminary positioning result corresponding to the adjacent code is needed to be used as the preliminary positioning result corresponding to the current code;

[0150] a return execution subunit, configured to take the registration container code that is adjacent to the current code in the reverse direction of the preset direction as the current code, and return to execute the step of positioning in the current code and each registration container code that is adjacent to the current code in the preset direction according to the first quantity;

[0151] The target positioning result first obtaining subunit is used to use the preliminary positioning result corresponding to the current code as the target positioning result when the current code is the registration container code located on the end side in the sorting result.

[0152] Alternatively, the target positioning result obtaining unit includes:

[0153] A code quantity acquisition subunit is used to acquire the current code quantity of each registered container code in the preliminary positioning result corresponding to the current code, and the adjacent code quantity of each registered container code in the preliminary positioning result corresponding to the adjacent code, when the comparison result is equal;

[0154] The second subunit for obtaining the target positioning result is used to use the preliminary positioning result corresponding to the adjacent code as the preliminary positioning result corresponding to the current code when the current code number is greater than the adjacent code number, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code.

[0155] On this basis, optionally, the target positioning result obtaining unit further includes:

[0156] A storage location acquisition subunit is used to acquire the current storage locations corresponding to each registered container code corresponding to the current code and the adjacent storage locations corresponding to each registered container code corresponding to the adjacent code when the current code number is equal to the adjacent code number;

[0157] A storage location quantity determination subunit, used to determine the current storage location quantities of different current storage locations in the respectively corresponding current storage locations, and the adjacent storage location quantities of different adjacent storage locations in the respectively corresponding adjacent storage locations;

[0158] The third subunit for obtaining the target positioning result is used to use the preliminary positioning result corresponding to the adjacent code as the preliminary positioning result corresponding to the current code when the current storage location number is greater than or equal to the adjacent storage location number, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code.

[0159] On this basis, optionally, the above-mentioned registration container code positioning device also includes:

[0160] A registered container code grouping module, used to group at least one registered container code according to the storage locations respectively corresponding to the at least one registered container code, to obtain at least one registered container code group;

[0161] Register container encoding sorting unit, specifically used for:

[0162] For each of the at least one registered container code group, sorting the registered container codes in the registered container code group according to the second quantities and the preset sorting method respectively corresponding to the registered container codes in the registered container code group to obtain a sub-sorting result;

[0163] According to the sub-sorting results corresponding to each registration container code group, a sorting result of at least one registration container code is obtained.

[0164] Optionally, the registration container code positioning module 530 may include:

[0165] The target positioning result determination unit is used to take the preliminary positioning result corresponding to the sum with the largest value in at least one sum as the target positioning result for the sums respectively corresponding to at least one preliminary positioning result located.

[0166] Optionally, the registration container code determination module may include:

[0167] An item determination unit, used to determine items to be shipped out of the warehouse;

[0168] The registration container code positioning module 530 may include:

[0169] The item outbound unit is used to perform an outbound operation on the item based on each registered container code in the target positioning result.

[0170] The registration container code positioning device provided in the embodiment of the present invention determines the items to be processed through the registration container code determination module and determines at least one LPN associated with the items; obtains the first quantity of the items through the second quantity acquisition module, and obtains the second quantity of the items corresponding to each LPN in at least one LPN; performs at least one positioning in at least one LPN according to the second quantity and the first quantity corresponding to each LPN through the registration container code positioning module, and obtains the target positioning result from at least one preliminary positioning result obtained by positioning, so as to process the items based on the target positioning result, wherein the sum of the second quantities corresponding to each LPN in the preliminary positioning result is less than or equal to the first quantity. The above device performs at least one positioning in at least one LPN to obtain at least one preliminary positioning result. Since the sum corresponding to each preliminary positioning result is less than or equal to the first quantity, the sum corresponding to the target positioning result obtained from these preliminary positioning results is also less than or equal to the first quantity. Therefore, the whole pallet processing of the items can be realized based on the target positioning result, that is, in the process of processing the items, there is no need to remove the pallet of any LPN, thereby reducing the time cost and labor cost in the process of processing the items.

[0171] The registration container code positioning device provided in the embodiment of the present invention can execute the registration container code positioning method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0172] It is worth noting that in the embodiment of the positioning device for registering container codes, the various units and modules included are only divided according to functional logic, but are not limited to the above division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of the present invention.

[0173] Figure 7 A schematic diagram of the structure of an electronic device 10 that can be used to implement an embodiment of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0174] like Figure 7 As shown, the electronic device 10 includes at least one processor 11, and a memory connected to the at least one processor 11, such as a read-only memory (ROM) 12, a random access memory (RAM) 13, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 11 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 12 or the computer program loaded from the storage unit 18 to the random access memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 can also be stored. The processor 11, the ROM 12, and the RAM 13 are connected to each other through a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0175] A number of components in the electronic device 10 are connected to the I / O interface 15, including: an input unit 16, such as a keyboard, a mouse, etc.; an output unit 17, such as various types of displays, speakers, etc.; a storage unit 18, such as a disk, an optical disk, etc.; and a communication unit 19, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0176] The processor 11 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 11 executes the various methods and processes described above, such as a positioning method for registering a container code.

[0177] In some embodiments, the registration container code positioning method may be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 10 via the ROM 12 and / or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the registration container code positioning method described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the registration container code positioning method in any other appropriate manner (e.g., by means of firmware).

[0178] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0179] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine as a stand-alone software package and partially on a remote machine, or entirely on a remote machine or server.

[0180] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, 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 foregoing.

[0181] To provide interaction with a user, the systems and techniques described herein may be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the electronic device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).

[0182] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0183] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.

[0184] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.

[0185] 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 can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for locating a registration container code, characterized in that: include: determining an article to be processed and determining at least one registered container code associated with the article; Acquire a first quantity of the item, and acquire a second quantity of the item corresponding to each of the at least one registered container code; According to the second quantity and the first quantity respectively corresponding to each registered container code, positioning is performed at least once in at least one registered container code, and a target positioning result is obtained from at least one preliminary positioning result, so as to process the item based on the target positioning result; The sum of the second numbers corresponding to the registration container codes in the preliminary positioning result is less than or equal to the first number.

2. The method according to claim 1, characterized in that According to the second number and the first number respectively corresponding to each of the registration container codes, performing at least one positioning in the at least one registration container code, and obtaining a target positioning result from at least one preliminary positioning result obtained by positioning, including: Sorting the at least one registration container code according to the second quantity corresponding to each registration container code and the preset sorting method to obtain a sorting result; For the current code in the sorting result, positioning is performed in each registered container code sorted at the current code and at a preset position of the current code according to the first number to obtain a preliminary positioning result corresponding to the current code, wherein the preset position matches the preset sorting method; For the adjacent codes that are adjacent to the current code in the preset orientation, the sum corresponding to the preliminary positioning result corresponding to the current code is compared with the sum corresponding to the preliminary positioning result corresponding to the adjacent codes, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code according to the comparison result.

3. The method according to claim 2, characterized in that The positioning, according to the first number, in each registered container code of the current code and sorting at a preset position of the current code includes: When the second number corresponding to the current code is greater than the first number, positioning is performed in the current code and in each registered container code arranged at a preset position of the current code based on the preliminary positioning result corresponding to the adjacent code; and / or, When the second number corresponding to the current code is less than or equal to the first number, positioning is performed in each registered container code of the current code and sorted at a preset position of the current code according to the sum of the preliminary positioning results corresponding to the adjacent codes and the third number; The third number is determined based on the sum corresponding to the intermediate positioning result, the intermediate positioning result is located based on the fourth number in each registered container code sorted at a preset position of the current code, and the fourth number is determined based on the first number and the second number corresponding to the current code.

4. The method according to claim 2, characterized in that: The step of obtaining the target positioning result from the preliminary positioning results corresponding to each of the registered container codes according to the comparison result includes: If it is determined according to the comparison result that the preliminary positioning result corresponding to the adjacent code needs to be used as the preliminary positioning result corresponding to the current code, the preliminary positioning result corresponding to the adjacent code is used as the preliminary positioning result corresponding to the current code; Taking the registration container code that is adjacent to the current code in the reverse direction of the preset direction as the current code, and returning to perform the step of positioning the current code and each registration container code that is adjacent to the current code in the preset direction according to the first number; In the case where the current code is the registration container code located on the terminal side in the sorting result, the preliminary positioning result corresponding to the current code is used as the target positioning result.

5. The method according to claim 2, characterized in that: The step of obtaining the target positioning result from the preliminary positioning results corresponding to each of the registered container codes according to the comparison result includes: When the comparison result is equal, obtaining the current code number of each registered container code in the preliminary positioning result corresponding to the current code, and the adjacent code number of each registered container code in the preliminary positioning result corresponding to the adjacent code; When the number of the current code is greater than the number of adjacent codes, the preliminary positioning result corresponding to the adjacent codes is used as the preliminary positioning result corresponding to the current code, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code.

6. The method according to claim 5, characterized in that The step of obtaining the target positioning result from the preliminary positioning results corresponding to each of the registered container codes according to the comparison result also includes: When the number of the current codes is equal to the number of adjacent codes, obtaining the current storage locations corresponding to the respective registration container codes corresponding to the current code, and the adjacent storage locations corresponding to the respective registration container codes corresponding to the adjacent codes; Determine the current storage location quantity of different current storage locations among the respectively corresponding current storage locations, and the adjacent storage location quantity of different adjacent storage locations among the respectively corresponding adjacent storage locations; When the current number of storage locations is greater than or equal to the number of adjacent storage locations, the preliminary positioning result corresponding to the adjacent code is used as the preliminary positioning result corresponding to the current code, so as to obtain the target positioning result from the preliminary positioning results corresponding to each registered container code.

7. The method according to claim 6, characterized in that Also includes: According to the storage locations respectively corresponding to the at least one registered container code, the at least one registered container code is grouped to obtain at least one registered container code group; The step of sorting the at least one registration container code according to the second quantity corresponding to each registration container code and the preset sorting method to obtain a sorting result includes: For each registration container code group in the at least one registration container code group, sorting the registration container codes in the registration container code group according to the second quantities and the preset sorting method respectively corresponding to the registration container codes in the registration container code group to obtain a sub-sorting result; The sorting result of the at least one registration container code is obtained according to the sub-sorting results respectively corresponding to each registration container code group.

8. The method according to claim 1, characterized in that The step of obtaining a target positioning result from at least one preliminary positioning result obtained by positioning includes: For the sums corresponding to at least one of the located preliminary positioning results, the preliminary positioning result corresponding to the sum with the largest value in at least one of the sums is taken as the target positioning result.

9. The method according to claim 1, characterized in that: Identify items to be processed, including: Identify items to be shipped out of the warehouse; The processing of the item based on the target positioning result includes: Based on each registered container code in the target positioning result, a warehouse removal operation is performed on the item.

10. A positioning device for registering container codes, characterized in that: include: a registered container code determination module, used to determine an item to be processed and to determine at least one registered container code associated with the item; A second quantity acquisition module, configured to acquire the first quantity of the item, and acquire the second quantity of the item corresponding to each registered container code of the at least one registered container code; A registered container code positioning module, configured to perform at least one positioning in the at least one registered container code according to the second quantity and the first quantity respectively corresponding to each registered container code, and obtain a target positioning result from at least one preliminary positioning result so as to process the item based on the target positioning result; The sum of the second quantities corresponding to the registration container codes in the preliminary positioning result is less than or equal to the first quantity.

11. An electronic device, characterized in that: include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor performs the method for locating a registration container code according to any one of claims 1 to 9.

12. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a processor to implement the registration container code positioning method as described in any one of claims 1-9 when executed.

Images