Dynamic stacking-based tallying method and related device

Abstract

The invention provides a tallying method based on dynamic stacking and a related device. The tallying method comprises the following steps: screening out a plurality of candidate containers of which the occupied volume is smaller than a preset volume from a plurality of containers; acquiring batch information of the articles in the candidate container and the SKU type number of the articles; piling the plurality of candidate containers according to the batch information to obtain at least one candidate container pile so as to avoid the risk of batch mixing and adapt to a batch isolation core rule; the priority sequence of each candidate container in the candidate container pile is determined according to the SKU type number and the container occupied volume, single sorting logic is replaced, and the matching accuracy is improved; and the tallying task is determined according to the priority sequence and the preset tallying rule, so that the limitation of mechanical polling and a fixed threshold is eliminated, the calculation complexity is reduced, the processing efficiency is improved, the space utilization of the target container can be optimized, the idle waste is reduced, and finally the collaborative improvement of rule adaptation, efficiency and space utilization rate is realized.

Description

Technical Field

[0001] This application relates to the field of logistics and warehousing technology, and in particular to a sorting method and related apparatus based on dynamic stacking. Background Technology

[0002] In the warehousing sector, sorting operations are required, which involve transferring goods to target containers. This can consolidate scattered goods and improve space utilization. Sorting operations must simultaneously consider multiple rules such as batch segregation and SKU purity, and also address the need for efficient matching of a large number of containers and efficient use of space.

[0003] Existing inventory management methods not only fail to cover key rules such as batch exclusivity, but also suffer from low computational efficiency due to rigid logic. Furthermore, they neglect space optimization strategies, which can easily lead to inventory management errors, excessive processing time, and serious waste of container space, making them unsuitable for actual operational needs. Summary of the Invention

[0004] This application provides a dynamic stacking-based cargo handling method and related apparatus. Compared with the prior art, this application avoids the risk of batch mixing from the source by screening candidate containers with low occupancy volume and stacking them in combination with batch information, and adapts to the core rules of batch isolation; it uses the number of SKU types and the volume occupied as dual dimensions to determine priority, replacing the single sorting logic and improving the matching accuracy; it dynamically generates cargo handling tasks based on priority and preset rules, getting rid of the limitations of mechanical polling and fixed thresholds, which not only reduces the computational complexity and improves the processing efficiency, but also optimizes the space utilization of the target container, reduces idle waste, and achieves a synergistic improvement in rule adaptation, efficiency and space utilization.

[0005] In a first aspect, embodiments of this application provide a sorting method based on dynamic stacking. The method includes: selecting multiple candidate containers from multiple containers, the containers being used to hold items, and the candidate containers being containers whose volume occupies less than a preset volume; obtaining container loading information of the candidate containers, the container loading information including batch information of the items in the candidate containers and the number of SKU types of the items; stacking the multiple candidate containers according to the batch information to obtain at least one candidate container stack; determining the priority order of each candidate container in the candidate container stack according to the number of SKU types and the container volume occupied; and determining a sorting task according to the priority order and preset sorting rules, the sorting task referring to the task of transferring the items in the candidate containers to a target container.

[0006] In some embodiments, determining the priority order of each candidate container in the candidate container stack based on the number of SKU types and the container volume includes: performing a first ascending sort on at least one candidate container in the candidate container stack according to the number of SKU types; and performing a second ascending sort on the candidate containers with the same number of SKU types according to the container volume to obtain the priority order.

[0007] In some embodiments, the sorting rule is to sort goods according to the batch information; the step of determining the sorting task according to the priority order and the preset sorting rule includes: determining the sorting task according to the target sorting order, wherein the sorting task is to transfer the items in the candidate container to the target container according to the target sorting order, and the target sorting order is the priority order.

[0008] In some embodiments, the sorting rule is to sort goods according to the number of SKU types; the step of determining the sorting task according to the priority order and the preset sorting rule includes: determining a target sorting order according to the ascending order of the number of SKU types of each candidate container in at least one candidate container pile; determining the sorting task according to the target sorting order, wherein the sorting task is the task of transferring the items in the candidate containers to the target containers according to the target sorting order.

[0009] In some embodiments, both the target container and the candidate container include multiple compartments. Determining the sorting task according to the target sorting order includes: establishing a first mapping relationship between each SKU in each candidate container and the target compartment in the target container according to the target sorting order, wherein each compartment corresponds to one SKU, and the items in each target container belong to the same batch.

[0010] In some embodiments, for each candidate container, the process of establishing the first mapping relationship includes: for the nth SKU in the current candidate container, determining whether there exists a first target container in the first target container that is already occupied and has the same SKU loaded as the nth SKU, wherein the first target container is a target container used to load SKUs from the same batch as the current candidate container, where n is a positive integer and n ≤ the total number of slots in a single candidate container, and the nth SKU is the SKU loaded in any slot of the current candidate container; if it exists, and the first target slot can load the nth SKU, then establishing a mapping relationship between the nth SKU and the nth SKU. The first mapping relationship between the target slot and the target slot is established; if it does not exist, and there is an unoccupied second target slot in the first target container, then the first mapping relationship between the nth SKU and the second target slot is established; any other SKU in the current candidate container that has not established the first mapping relationship is updated to the nth SKU, and the steps "for the nth SKU in the current candidate container, determine whether there is a first target slot in the first target container that has been occupied and whose loaded SKU is the same as the nth SKU" and subsequent steps are repeated until each SKU in the current candidate container has established the first mapping relationship with the target container.

[0011] In some embodiments, after determining whether there is a first target slot in the first target container that is already occupied and has the same type as the nth SKU, the method further includes: if there is, and the first target slot cannot load the nth SKU, determining whether there is an unoccupied third target slot in the first target container; if there is an unoccupied third target slot, establishing the first mapping relationship between the nth SKU and the third target slot; if there is no unoccupied third target slot, determining whether to establish the first mapping relationship between the nth SKU and the next target container according to the target sorting order corresponding to the current candidate container.

[0012] In some embodiments, after determining whether there is a first target slot in the first target container that is already occupied and has the same type as the nth SKU, the method further includes: if there is no first target slot and there is no unoccupied second target slot in the first target container, then determining whether to establish the first mapping relationship between the nth SKU and the next target container according to the target sorting order corresponding to the current candidate container.

[0013] In some embodiments, determining whether to establish the first mapping relationship between the nth SKU and the next target container based on the target sorting order corresponding to the current candidate container includes: if the current candidate container is the last one in the target sorting order, performing a volume occupancy lower limit detection to determine whether to establish the first mapping relationship between the nth SKU and the next target container; if the current candidate container is not the last one in the target sorting order, then establishing the first mapping relationship between the nth SKU and the next target container.

[0014] In some embodiments, the specific steps of the volume occupancy lower limit detection include: determining the size relationship between the container volume occupied by the nth SKU and the preset minimum volume occupied; if the container volume occupied by the nth SKU is less than the preset minimum volume occupied, then abandoning the establishment of the first mapping relationship between the nth SKU and the next target container; if the container volume occupied by the nth SKU is greater than or equal to the preset minimum volume occupied, then establishing the first mapping relationship between the nth SKU and the next target container.

[0015] Secondly, embodiments of this application provide an intelligent sorting device based on dynamic stacking. The device includes: a processing unit for selecting multiple candidate containers from multiple containers, wherein the containers are used to place items, and the candidate containers are containers whose volume occupies less than a preset volume; an acquisition unit for acquiring container loading information of the candidate containers, wherein the container loading information includes batch information of the items in the candidate containers and the number of SKU types of the items; the processing unit for stacking the multiple candidate containers according to the batch information to obtain at least one candidate container stack; determining the priority order of each candidate container in the candidate container stack according to the number of SKU types and the container volume occupied; and determining a sorting task according to the priority order and preset sorting rules, wherein the sorting task refers to the task of transferring the items in the candidate containers to the target container.

[0016] Thirdly, embodiments of this application provide a server including a processor, a memory, a communication interface, and one or more programs, the one or more programs being stored in the memory and configured to be executed by the processor, the programs including instructions for performing steps as described in any of the first aspects.

[0017] Fourthly, embodiments of this application provide a computer-readable storage medium storing a computer program for electronic data interchange, wherein the computer program causes a computer to execute instructions for the steps of the method as described in any of the first aspects.

[0018] As can be seen from the embodiments of this application, multiple candidate containers with a volume smaller than a preset volume are selected from multiple containers; batch information and the number of SKU types of items in the candidate containers are obtained; multiple candidate containers are stacked according to the batch information to obtain at least one candidate container stack, thereby avoiding the risk of batch mixing and adapting to the core rules of batch isolation; the priority order of each candidate container in the candidate container stack is determined according to the number of SKU types and the volume occupied by the container, replacing the single sorting logic and improving the matching accuracy; the sorting task is determined according to the priority order and the preset sorting rules, getting rid of the limitations of mechanical polling and fixed thresholds, which not only reduces the computational complexity and improves the processing efficiency, but also optimizes the space utilization of the target container and reduces idle waste, ultimately achieving a synergistic improvement in rule adaptation, efficiency and space utilization. Attached Figure Description

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

[0020] Figure 1 A flowchart illustrating a dynamic stacking-based tallying method provided in this application embodiment; Figure 2 A schematic diagram illustrating the complete process of establishing the first mapping relationship of a single candidate container provided in this application embodiment; Figure 3 A functional unit structure block diagram of an intelligent cargo handling device based on dynamic stacking provided in an embodiment of this application; Figure 4 This is a structural block diagram of a server provided in an embodiment of this application. Detailed Implementation

[0021] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present application.

[0022] The terms "first," "second," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish different objects, not to describe a specific order. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the listed steps or units, but in some embodiments includes steps or units not listed, or in some embodiments includes other steps or units inherent to these processes, methods, products, or apparatuses.

[0023] In this document, the term "embodiment" means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of this application. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0024] In the embodiments of this application, "and / or" describes the relationship between associated objects, indicating that three relationships can exist. For example, A and / or B can represent the following three situations: A exists alone; A and B exist simultaneously; B exists alone. Among them, A and B can be singular or plural.

[0025] In this embodiment, the symbol " / " can indicate that the preceding and following objects are in an "or" relationship. Alternatively, the symbol " / " can also represent a division sign, i.e., performing a division operation. For example, A / B can mean A divided by B.

[0026] In the embodiments of this application, "at least one item" or its similar expression refers to any combination of these items, including any combination of a single item or a plurality of items. "One or more" means one or more, while "multiple" means two or more. For example, "at least one item" of a, b, or c can represent the following seven cases: a, b, c; a and b; a and c; b and c; a, b, and c. Each of a, b, and c can be an element or a set containing one or more elements.

[0027] In the embodiments of this application, "equal to" can be used with "greater than" and is applicable to technical solutions used when "greater than" is used; it can also be used with "less than" and is applicable to technical solutions used when "less than" is used. When "equal to" is used with "greater than", it is not used with "less than"; when "equal to" is used with "less than", it is not used with "greater than".

[0028] To address the aforementioned technical issues, this application provides a dynamic stacking-based cargo handling method and related apparatus. Compared to existing technologies, this application avoids the risk of batch mixing from the source by screening candidate containers with low occupancy volume and stacking them in combination with batch information, thus adapting to the core rules of batch isolation. Prioritization is determined by both the number of SKU types and the volume occupied, replacing a single sorting logic and improving matching accuracy. Cargo handling tasks are dynamically generated based on priority and preset rules, eliminating the limitations of mechanical polling and fixed thresholds. This reduces computational complexity, improves processing efficiency, optimizes the space utilization of target containers, reduces idle waste, and achieves a synergistic improvement in rule adaptation, efficiency, and space utilization.

[0029] The technical solution of this application and how it solves the above-mentioned technical problems will be described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments. The embodiments of this application will be described below with reference to the accompanying drawings.

[0030] Please see Figure 1 , Figure 1 A flowchart illustrating a dynamic stacking-based tallying method provided in this application embodiment, applied to a server, the method includes steps S101-S105: Step S101: Select multiple candidate containers from multiple containers.

[0031] The container is used to place items, and the candidate container is a container whose volume is smaller than a preset volume.

[0032] Candidate containers, or unsaturated containers, possess significant potential for space utilization optimization and are the core focus of inventory management operations. By setting a certain volume occupancy threshold (i.e., a preset volume), such as 50% of the total container volume, all containers in the warehousing system are selected as candidate containers if the volume of items inside does not reach this threshold. This approach abandons the traditional method of indiscriminately processing all containers, precisely targeting the areas needing optimization. It avoids ineffective processing of containers that are already full or nearly full, reducing computational load from the outset and improving the focus and efficiency of inventory management operations.

[0033] Step S102: Obtain the container loading information of the candidate container.

[0034] The container loading information includes batch information of the items in the candidate container and the number of SKU types of the items.

[0035] The process involves retrieving container loading information from servers or collecting data from sensors. This information primarily includes two types of data: batch information of the items within the container (such as production batch and shelf life), and the number of SKUs (Stock Keeping Units) of items within the container. Batch information refers to the batch number of the items; since a container holds only one batch of items, each container corresponds to only one batch. SKUs are unique codes or identifiers used in warehousing and logistics to identify the smallest unit of an item. Their core function is to distinguish the "unmistakable attributes" of items. If an item differs in any key attribute such as brand, model, specifications, size, color, batch, or packaging, it will be assigned a different SKU code. The number of SKUs refers to the total number of different SKU categories of items loaded in a single container. The number of SKUs is unrelated to the quantity of items; it only counts the number of categories of items with different attributes within the container. It is a key indicator for assessing the difficulty and adaptability of container handling. Fewer SKUs indicate more homogeneous items, making handling and integration easier.

[0036] For example, if a candidate container contains T-shirts, socks, and pants, then the SKUs of the T-shirts, socks, and pants are all different, and the number of SKU types in the candidate container is 3.

[0037] By incorporating batch information and the number of SKU types, this approach breaks away from the traditional technology that focuses solely on the number of SKUs, integrating the key factor of batches into the data system to provide data support for solving the problem of mixed batch storage.

[0038] Step S103: Based on the batch information, the multiple candidate containers are divided into at least one candidate container pile.

[0039] In step S103, the candidate containers are divided into multiple container piles based on batch information. Containers in the same pile contain items from the same batch. Different piles are strictly distinguished by batch, especially for items with batch exclusivity requirements, to ensure that there is no risk of cross-batch mixing after the piles are divided.

[0040] Step S104: Determine the priority order of each candidate container in the candidate container stack based on the number of SKU types and the volume occupied by the container.

[0041] In some embodiments, determining the priority order of each candidate container in the candidate container stack based on the number of SKU types and the container volume includes: performing a first ascending sort on at least one candidate container in the candidate container stack according to the number of SKU types; and performing a second ascending sort on the candidate containers with the same number of SKU types according to the container volume to obtain the priority order.

[0042] This embodiment employs a two-dimensional progressive ascending sorting strategy, relying on the number of SKU types (related to the difficulty of sorting) and the container volume (the potential for space optimization) to form a clear and efficient priority judgment logic. The sorting process is as follows: First, sort the candidate containers in ascending order based on the number of SKU types. The number of SKU types directly reflects the complexity of the items inside the container. The fewer the types, the simpler the item composition, and the easier the operation of transferring and classifying items during inventory management. Therefore, prioritize sorting them. Secondly, for candidate containers with the same number of SKU types after sorting, they are sorted in ascending order based on their container volume (the proportion of item volume to the total container volume). Assuming the complexity of item categories is the same, containers with smaller volume have more remaining usable space and greater potential for integration with other containers in the same batch, and can be prioritized.

[0043] By performing two ascending sorts, a unique priority sort is ultimately formed: fewer SKU types > more SKU types, and for the same number of SKU types, smaller file size > larger file size.

[0044] For example, suppose a candidate container stack has been batch-sorted, and all containers in the stack are batch A of children's antipyretics. A certain stack contains a total of 5 candidate containers, and the key parameters of each container are as follows: Container 1: SKU type 1 (containing only 100mg / tablet antipyretics), occupying 32% of the volume; Container 2: SKU type 2 (including 100mg / tablet and 50mg / tablet specifications), occupying 28% of the volume; Container 3: SKU type 1 (same as container 1), occupying 45% of the volume; Container 4: SKU types 3 (including 100mg / tablet, 50mg / tablet, and 25mg / tablet), occupying 22% of the volume; Container 5: SKU type number 2 (same as container 2 specifications), occupying 38% of the volume.

[0045] The priority sorting process is as follows: The first sorting is based on the number of SKU types: Container 1, Container 3 > Container 2, Container 5 > Container 4; The second sorting is based on the volume occupied by containers with the same number of SKU types: container 1 > container 3, container 2 > container 5. The final priority order is: container 1 > container 3 > container 2 > container 5 > container 4.

[0046] As can be seen, in this embodiment, candidate containers within each candidate container stack are sorted based on two factors: the number of SKU types and the volume occupied by the containers. This not only reduces the difficulty of sorting and classification by prioritizing containers with fewer SKU types, thus reducing operation time and error rate, but also maximizes the potential for space integration by prioritizing containers with low volume within the same product category, thereby increasing the target container fill rate and reducing idle waste. At the same time, the sorting logic is clear and simple, requiring no complex calculations, making the system easy to implement and easy for personnel to master. This achieves a synergistic improvement in sorting efficiency and space utilization while ensuring batch compliance.

[0047] Step S105: Determine the sorting task according to the priority order and the preset sorting rules.

[0048] The sorting task refers to the task of transferring the items in the candidate container to the target container.

[0049] In some embodiments, the sorting rule is to sort goods according to the batch information; the step of determining the sorting task according to the priority order and the preset sorting rule includes: determining the sorting task according to the target sorting order, wherein the sorting task is to transfer the items in the candidate container to the target container according to the target sorting order, and the target sorting order is the priority order.

[0050] The sorting rule, which prioritizes transferring items from candidate containers within the same batch to one or more target containers, means that the target sorting order during the sorting process is determined by the priority order specified in step S104. Specifically, for each candidate container stack, items are transferred to target containers according to priority, and only items from the same batch can be loaded into the same target container. The sorting task for one batch is completed before proceeding to the next batch. The sorting order between batches can be based on batch order, random order, or other suitable order; this application does not impose any restrictions on this. Following this sorting rule allows for the fastest possible emptying of candidate containers within the same batch and the fastest possible filling of target containers.

[0051] For example, taking the inventory management scenario of a certain brand of oral medicine in an e-commerce warehouse as an example, after processing in steps S101-S104, two independent candidate container piles are formed: pile 1 contains batch 202408 of cold medicine, with the priority order being container A > container C > container F; pile 2 contains batch 202409 of cold medicine, with the priority order being container B > container E > container D. Each candidate container meets the requirement of low occupied volume and the SKU information is clear.

[0052] In this embodiment, the sorting rules strictly limit "the same target container can only hold the same batch of items," and the target sorting order is the priority ranking result. The system generates sorting tasks accordingly. For stack 1, sorting task 11: transfer the items in container A to target container X (which will then be used to store the items from batch 202408). Inventory Management Task 12: Transfer the items in container C to the target container X; Inventory Management Task 13: Transfer the items in container F to the target container X; For stack 2, sorting task 21: transfer the items in container B to the target container Y (which will then be used to store the items from batch 202409). Inventory Management Task 22: Transfer items from container E to target container Y; Inventory Management Task 23: Transfer the items in container D to the target container Y.

[0053] During the transfer process, batch information must be verified in real time through the warehouse management system to prevent cross-batch transfer operations.

[0054] The order of sorting goods in pile 1 and pile 2 can be determined according to batches or other rules.

[0055] Among them, target container X and target container Y are only used to indicate the naming identifiers of target containers that are specifically used to store different batches. There is no limit to the number of target containers X and target containers Y. There can be one or more. The number of target containers is determined according to the volume of the items loaded in each candidate container, the volume of the target container, and the sorting rules.

[0056] As can be seen, in this embodiment, batch information is used as the core sorting rule, and the priority order is directly used as the target sorting order to generate sorting tasks. This not only prevents cross-batch mixing from the source of the task through the collaboration of batch rules and candidate container pre-sorting, ensuring the compliance of sensitive categories, but also reduces human decision-making costs by relying on a clear priority execution order, making the sorting process efficient and smooth. At the same time, the task generation logic is simple, the system is easy to implement, and the personnel are easy to operate. It can also help to efficiently integrate the target container space by prioritizing the transfer of low SKU and low volume containers, achieving a simultaneous improvement in compliance, efficiency, and space utilization.

[0057] In some embodiments, the sorting rule is to sort goods according to the number of SKU types; the step of determining the sorting task according to the priority order and the preset sorting rule includes: determining a target sorting order according to the ascending order of the number of SKU types of each candidate container in at least one candidate container pile; determining the sorting task according to the target sorting order, wherein the sorting task is the task of transferring the items in the candidate containers to the target containers according to the target sorting order.

[0058] The sorting rule is based on the number of SKU types. This means that items from candidate containers with fewer SKU types are prioritized for transfer to one or more target containers. The target sorting order during the sorting process is determined by globally sorting each candidate container in at least one candidate container stack in ascending order based on the number of SKU types. This process calibrates and clarifies the final target sorting order. In other words, sorting is performed solely based on the number of SKU types, prioritizing the candidate container with the fewest SKU types across multiple candidate container stacks, and is not limited to processing one batch before processing others. When the number of SKU types is the same, a secondary ascending sort can be performed based on the container's occupied volume to clarify the sorting order for each candidate container. Candidate containers from the same batch still correspond to the same one or more target containers; that is, only items from the same batch can be loaded into the same target container. Therefore, multiple target containers may be used during the sorting process. The core advantage of this approach is that it can ensure the isolated storage of items in the same batch by dedicated allocation of multiple target containers to meet compliance requirements, and it can also sort low-SKU containers from different batches in parallel, quickly sort out multiple empty boxes, avoid slowing down the overall progress of a single batch of highly complex containers, and improve the overall sorting efficiency.

[0059] For example, taking the inventory management scenario of a certain brand of oral medicine in an e-commerce warehouse as an example, after processing in steps S101-S104, two independent candidate container piles are formed: pile 1 contains batch 202408 of cold medicine, with the priority order being container A (number of SKUs: 1) > container C (number of SKUs: 2) > container F (number of SKUs: 5); pile 2 contains batch 202409 of cold medicine, with the priority order being container B (number of SKUs: 3) > container E (number of SKUs: 4) > container D (number of SKUs: 6). Each candidate container meets the requirement of low volume occupation and the SKU information is clear.

[0060] First, determine the target sorting order. Sort the SKUs in ascending order globally. The target sorting order is: Container A > Container C > Container B > Container E > Container F > Container D.

[0061] In this embodiment, the sorting rules strictly limit that "the same target container can only hold the same batch of items," and the target sorting order is the result of a global ascending sort by SKU type. Based on this, the system generates sorting tasks: Inventory Management Task 1: Transfer the items in container A to the target container X (which will then be used to store the items from batch 202408). Inventory Management Task 2: Transfer the items in container C to the target container X; Inventory Management Task 3: Transfer the items in container B to the target container Y (which will then be used to store the items from batch 202409). Inventory Management Task 4: Transfer the items in container E to the target container Y; Inventory Management Task 5: Transfer the items in container F to the target container X; Inventory Management Task 6: Transfer the items in container D to the target container Y.

[0062] During the transfer process, batch information must be verified in real time through the warehouse management system to prevent cross-batch transfer operations.

[0063] Among them, target container X and target container Y are only used to indicate the naming identifiers of target containers that are specifically used to store different batches. There is no limit to the number of target containers X and target containers Y. There can be one or more. The number of target containers is determined according to the volume of the items loaded in each candidate container, the volume of the target container, and the sorting rules.

[0064] As can be seen, in this embodiment, the number of SKU types is used as the core rule to break through the limitations of single internal sorting and prioritize the processing of low-complexity containers globally. This avoids high-complexity containers in a certain pile occupying a lot of time, making the overall sorting rhythm more balanced. Especially in multi-pile parallel scenarios, it can reduce the waiting time between piles and quickly sort out multiple empty boxes. This ensures both batch isolation compliance and improves operational efficiency through category concentration, achieving a synergy between compliance and economy.

[0065] In some embodiments, both the target container and the candidate container include multiple compartments. Determining the sorting task according to the target sorting order includes: establishing a first mapping relationship between each SKU in each candidate container and the target compartment in the target container according to the target sorting order, wherein each compartment corresponds to one SKU, and the items in each target container belong to the same batch.

[0066] In this embodiment, the container is used to place items. Specifically, the container includes multiple compartments, such as 2 compartments, 3 compartments, 4 compartments, 6 compartments, etc. The number of compartments in each container is not specifically required. Items are placed in the compartments, and each compartment contains only one SKU. Before performing the sorting task, the SKUs in each compartment of the candidate container are mapped one-to-one with the target compartments of the target container. When performing the sorting task, the SKUs in each compartment are transferred to the corresponding target compartments according to the mapping relationship to complete the sorting operation.

[0067] In some embodiments, for each candidate container, the process of establishing the first mapping relationship includes: for the nth SKU in the current candidate container, determining whether there exists a first target container in the first target container that is already occupied and has the same SKU loaded as the nth SKU, wherein the first target container is a target container used to load SKUs from the same batch as the current candidate container, where n is a positive integer and n ≤ the total number of slots in a single candidate container, and the nth SKU is the SKU loaded in any slot of the current candidate container; if it exists, and the first target slot can load the nth SKU, then establishing a mapping relationship between the nth SKU and the nth SKU. The first mapping relationship between the target slot and the target slot is established; if it does not exist, and there is an unoccupied second target slot in the first target container, then the first mapping relationship between the nth SKU and the second target slot is established; any other SKU in the current candidate container that has not established the first mapping relationship is updated to the nth SKU, and the steps "for the nth SKU in the current candidate container, determine whether there is a first target slot in the first target container that has been occupied and whose loaded SKU is the same as the nth SKU" and subsequent steps are repeated until each SKU in the current candidate container has established the first mapping relationship with the target container.

[0068] The current candidate container is any one of the low-volume containers selected in step S101, and the SKUs within its slots need to be transferred to the target container. The first target container is the target container used to load SKUs from the same batch as the current candidate container: If the current candidate container is the candidate container corresponding to the first sorting task, when establishing the first mapping relationship, a target container can be randomly selected and recorded as the first target container. The first target container is then exclusively used to load items from the batch to which the current candidate container belongs. If the current candidate container is not the candidate container corresponding to the first sorting task, it is determined whether there is a target container among the target containers with which the mapping relationship has been established that is used to load items from the same batch as the current candidate container. If it exists, it is used as the first target container; if it does not exist, a new target container is created to load items from the batch to which the current candidate container belongs.

[0069] Here, the nth SKU refers to any SKU loaded in any slot of the current candidate container, where n is a positive integer and n ≤ the total number of slots in a single candidate container. For example, if the current candidate container has 3 slots, then n = 1, 2, and 3, corresponding to the SKUs in the 3 slots respectively. The first target slot is the slot in the first target container that is already occupied and whose loaded SKU is of the same type as the currently processed nth SKU. The second target slot is the unoccupied free slot in the first target container.

[0070] The first mapping relationship establishment process in this embodiment takes a single SKU of the current candidate container as the smallest processing unit and executes the following steps A1-A4: Step A1: Select the current candidate container after filtering (e.g., container A), and identify its corresponding first target container (e.g., container X, exclusive to the same batch); select the nth SKU (n increases from 1) as the current processing object according to the grid order.

[0071] Step A2: Query whether there exists a first target slot in the first target container that is "already occupied and contains the same SKU as the nth SKU". For example, when processing the first SKU (potato chips), query whether there is an occupied slot in container X that contains potato chips.

[0072] Step A3: If the first target slot exists and the remaining space of the slot can accommodate the current nth SKU (e.g., slot 1 has already been filled with some potato chips and the remaining space can accommodate new potato chips), then directly establish the first mapping relationship of "nth SKU - first target slot". If the first target slot does not exist (e.g., there is no slot for potato chips in container X), but there is an unoccupied second target slot in the first target container (e.g., slot 2 is free), then the first mapping relationship of "nth SKU - second target slot" is established.

[0073] Step A4: Update any SKU in the current candidate container that has not established a first mapping relationship to the nth SKU, and repeat step A1 and subsequent steps until all SKUs in each cell of the candidate container have established a first mapping relationship with a cell of the first target container, and the first mapping relationship of the current candidate container is completed.

[0074] After the first mapping relationship of the current candidate container is established, the same method as steps A1-A4 is executed for the remaining candidate containers to establish the first mapping relationship between the other remaining candidate containers and the target container.

[0075] For example, suppose an e-commerce warehouse needs to process 202,410 batches of snacks for sorting, with the following specific parameters: Current candidate containers: Container A (low volume, 3 compartments), compartment 1 - SKU1 (potato chips), compartment 2 - SKU2 (cookies), compartment 3 - SKU1 (potato chips); First target container: Container X (exclusive to batch 202410, 5 compartments), compartment 2 is occupied (loaded with SKU1, ample space remaining), compartments 1, 3, 4, and 5 are available.

[0076] The process of establishing the mapping relationship according to the steps in this embodiment is as follows: Processing n=1 (SKU1: potato chips): Query container X, find that slot 2 is the first target slot that is "occupied and has the same SKU", and there is enough space. Establish a mapping relationship: SKU1 (slot 1) — container X slot 2; Processing n=2 (SKU2: Cookie): Query container X. If there is no occupied cookie slot (no first target slot), select free slot 1 (second target slot) and establish a mapping relationship: SKU2 (slot 2) — container X slot 1; For n=3 (SKU1: potato chips): Query container X again. There is still enough space in slot 2. Establish a mapping relationship: SKU1 (slot 3) — container X slot 2; Mapping has been established for all 3 SKUs in container A, and the process has terminated.

[0077] Final mapping result: Container X compartment 2 is loaded with potato chips (from compartments 1 and 3 of container A), and compartment 1 is loaded with cookies (from compartment 2 of container A), achieving the goal of centralized storage of the same SKU and isolation of the same batch.

[0078] As can be seen, in this embodiment, the first target container is limited to the same batch, which prevents cross-batch mixing from the mapping source and meets the storage requirements of sensitive categories such as pharmaceuticals and food. The same SKU is preferentially matched to the same compartment to avoid SKUs occupying multiple compartments. During subsequent sorting, the corresponding SKU can be directly retrieved by compartment, reducing search and classification costs and improving sorting efficiency. Idle compartments are allocated as needed to avoid compartment waste and reduce the number of compartments occupied due to SKU dispersion, thereby improving compartment utilization.

[0079] In some embodiments, after determining whether there is a first target slot in the first target container that is already occupied and has the same type as the nth SKU, the method further includes: if there is, and the first target slot cannot load the nth SKU, determining whether there is an unoccupied third target slot in the first target container; if there is an unoccupied third target slot, establishing the first mapping relationship between the nth SKU and the third target slot; if there is no unoccupied third target slot, determining whether to establish the first mapping relationship between the nth SKU and the next target container according to the target sorting order corresponding to the current candidate container.

[0080] The third target slot is an unoccupied free slot in the first target container, defined the same as the second target slot, and is used to distinguish the allocation of free slots in different branch scenarios. The next target container is a target container in the same batch as the current candidate container, used to take over SKU mapping when the first target container has no suitable slot (e.g., after the first target container X is full, a new target container is started to load SKUs).

[0081] In the scenario following step A2 above, where a first target slot exists but cannot load the nth SKU, proceed with steps A5-A7: Step A5: Determine whether there is an unoccupied third target slot in the first target container.

[0082] Step A6: If it exists, then establish the first mapping relationship between the nth SKU and the third target grid.

[0083] Step A7: If it does not exist, determine whether to establish the first mapping relationship between the nth SKU and the next target container based on the target sorting order of the current candidate container.

[0084] As can be seen, in this embodiment, by supplementing with the third target slot and using the next target container as a fallback, the inability to map SKUs due to saturation of the same source slot is avoided; and the remaining free slots of the first target container are used first to avoid wasting space caused by activating the new target container too early.

[0085] In some embodiments, determining whether to establish the first mapping relationship between the nth SKU and the next target container based on the target sorting order corresponding to the current candidate container includes: if the current candidate container is the last one in the target sorting order, then performing a volume occupancy lower limit detection to determine whether to establish the first mapping relationship between the nth SKU and the next target container; if the current candidate container is not the last one in the target sorting order, then establishing the first mapping relationship between the nth SKU and the next target container.

[0086] When the nth SKU cannot be placed into the first target container (e.g., it cannot be placed into the first target slot and there are no unoccupied slots), whether to activate the next target container depends on the position of the current candidate container in the target sorting sequence and the actual container volume occupied by the nth SKU. If the current candidate container is the last in the target sorting sequence, there are no more SKUs available to fill the next target container. Activating a new container solely because of a small number of current SKUs would lead to excessively high container idle rates (e.g., 1 SKU occupying a 100L container). Therefore, it is necessary to determine the activation value through quantitative detection, such as first performing a volume occupancy lower limit detection, rather than directly activating the next target container, to avoid wasting space by a small number of SKUs occupying a complete container.

[0087] If the current candidate container is not the last one in the target sorting sequence, a new target container can be quickly activated, avoiding the waste of space caused by "a small number of SKUs occupying a single container" and ensuring process efficiency. By controlling resource waste through the lower limit detection of the last container, a balance between efficiency and cost can be achieved.

[0088] In some embodiments, the specific steps of the volume occupancy lower limit detection include: determining the size relationship between the container volume occupied by the nth SKU and the preset minimum volume occupied; if the container volume occupied by the nth SKU is less than the preset minimum volume occupied, then abandoning the establishment of the first mapping relationship between the nth SKU and the next target container; if the container volume occupied by the nth SKU is greater than or equal to the preset minimum volume occupied, then establishing the first mapping relationship between the nth SKU and the next target container.

[0089] The container volume occupied by the nth SKU refers to the actual volume of the nth SKU being processed. The preset minimum occupied volume is the minimum occupied threshold preset according to the warehousing scenario and container specifications (e.g., 30% of the target container, the preset minimum occupied volume of a 100L container is 30L), which can be configured by the user according to actual needs.

[0090] In this embodiment, the decision to enable the next target container is quantitatively determined by comparing the container volume occupied by the SKU with a preset threshold. The specific steps are as follows: After determining that the current candidate container is the last one in the target sorting order, obtain the container volume occupied by the nth SKU (e.g., 25L) and the preset minimum occupied volume (e.g., 30L). Compare the size relationship between the container's occupied volume and the preset minimum occupied volume; If the container volume occupied by the nth SKU is less than the preset minimum volume, which does not meet the space utilization requirements, then the establishment of the first mapping relationship with the next target container is abandoned, that is, the sorting task of the nth SKU is directly abandoned. If the container volume occupied by the nth SKU is greater than or equal to the preset minimum volume, and meets the space utilization requirements, then the first mapping relationship between the nth SKU and the next target container is established.

[0091] In some embodiments, after determining whether there is a first target slot in the first target container that is already occupied and has the same type as the nth SKU, the method further includes: if there is no first target slot and there is no unoccupied second target slot in the first target container, then determining whether to establish the first mapping relationship between the nth SKU and the next target container according to the target sorting order corresponding to the current candidate container.

[0092] In the case where there is no first target slot and no unoccupied second target slot in the first target container, after step A2 above, it is determined whether to establish a first mapping relationship between the nth SKU and the next target container based on the target sorting order corresponding to the current candidate container. This step has been described in the above embodiment and will not be repeated here.

[0093] Based on the above embodiments, the complete process for establishing the first mapping relationship of a single candidate container can be found in [link to relevant documentation]. Figure 2 ,like Figure 2 As shown, for each candidate container, the process of establishing the first mapping relationship includes the following steps S201-S2012: Step S201: For the nth SKU in the current candidate container, determine whether there is a first target slot in the first target container that has been occupied and whose loaded SKU is the same as the nth SKU.

[0094] If it exists, proceed to step S202.

[0095] If it does not exist, proceed to step S203.

[0096] Step S202: Determine whether the first slot can load the nth SKU.

[0097] If possible, proceed to step S204.

[0098] If not, proceed to step S203.

[0099] Step S203: Determine whether there is an unoccupied second target slot in the first target container.

[0100] If it exists, proceed to step S205.

[0101] If it does not exist, proceed to step S206.

[0102] Step S204: Establish the first mapping relationship between the nth SKU and the first target grid.

[0103] Step S205: Establish the first mapping relationship between the nth SKU and the second target grid.

[0104] Step S206: Determine whether the current candidate container is the last candidate container.

[0105] If so, proceed to step S207.

[0106] If not, proceed to step S208.

[0107] Step S207: Determine whether the container volume occupied by the nth SKU is greater than or equal to the preset minimum volume.

[0108] If so, proceed to step S208.

[0109] If not, proceed to step S209.

[0110] Step S208: Establish the first mapping relationship between the nth SKU and the next target container.

[0111] Step S209: Abandon establishing the first mapping relationship between the nth SKU and the next target container.

[0112] Step S2010: Detect whether each SKU in the current candidate container has established a first mapping relationship with the target container.

[0113] If so, proceed to step S2011.

[0114] If not, proceed to step S2012.

[0115] Step S2011: End the tallying task for the current candidate container and execute the tallying task for the next candidate container.

[0116] Step S2012: Update any other SKU in the current candidate container that has not established a mapping relationship to the nth SKU, and then execute step S201.

[0117] As can be seen from the embodiments of this application, multiple candidate containers with a volume smaller than a preset volume are selected from multiple containers; batch information and the number of SKU types of items in the candidate containers are obtained; multiple candidate containers are stacked according to the batch information to obtain at least one candidate container stack, thereby avoiding the risk of batch mixing and adapting to the core rules of batch isolation; the priority order of each candidate container in the candidate container stack is determined according to the number of SKU types and the volume occupied by the container, replacing the single sorting logic and improving the matching accuracy; the sorting task is determined according to the priority order and the preset sorting rules, getting rid of the limitations of mechanical polling and fixed thresholds, which not only reduces the computational complexity and improves the processing efficiency, but also optimizes the space utilization of the target container and reduces idle waste, ultimately achieving a synergistic improvement in rule adaptation, efficiency and space utilization.

[0118] The above mainly describes the solutions of the embodiments of this application from the perspective of the method execution process. It is understood that, in order to achieve the above functions, the central control unit includes the corresponding hardware structures and / or software modules for executing each function. Those skilled in the art should readily recognize that, in conjunction with the units and algorithm steps of the various examples described in the embodiments provided herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0119] This application embodiment can divide the central control unit into functional units according to the above method example. For example, each function can be divided into different functional units, or two or more functions can be integrated into one processing module. The integrated unit can be implemented in hardware or as a software program module. It should be noted that the unit division in this application embodiment is illustrative and only represents a logical functional division, while other division methods may be used in actual implementation.

[0120] In the case of using integrated units, please refer to Figure 3 , Figure 3 A functional unit structure block diagram of an intelligent tallying device based on dynamic stacking provided in this application embodiment is shown below. Figure 3 As shown, the intelligent sorting device 3 includes: Processing unit 301 is used to filter out multiple candidate containers from multiple containers, the containers being used to place items, and the candidate containers being containers whose volume is less than a preset volume; The acquisition unit 302 is used to acquire the container loading information of the candidate container, the container loading information including the batch information of the items in the candidate container and the number of SKU types of the items; The processing unit 301 is configured to divide the multiple candidate containers into at least one candidate container pile according to the batch information; determine the priority order of each candidate container in the candidate container pile according to the number of SKU types and the volume occupied by the container; and determine the sorting task according to the priority order and the preset sorting rules, wherein the sorting task refers to the task of transferring the items in the candidate containers to the target container.

[0121] As can be seen from the embodiments of this application, multiple candidate containers with a volume smaller than a preset volume are selected from multiple containers; batch information and the number of SKU types of items in the candidate containers are obtained; multiple candidate containers are stacked according to the batch information to obtain at least one candidate container stack, thereby avoiding the risk of batch mixing and adapting to the core rules of batch isolation; the priority order of each candidate container in the candidate container stack is determined according to the number of SKU types and the volume occupied by the container, replacing the single sorting logic and improving the matching accuracy; the sorting task is determined according to the priority order and the preset sorting rules, getting rid of the limitations of mechanical polling and fixed thresholds, which not only reduces the computational complexity and improves the processing efficiency, but also optimizes the space utilization of the target container and reduces idle waste, ultimately achieving a synergistic improvement in rule adaptation, efficiency and space utilization.

[0122] In some embodiments, in determining the priority order of each candidate container in the candidate container pile based on the number of SKU types and the container volume occupied, the processing unit 301 is further configured to: perform a first ascending sort on at least one candidate container in the candidate container pile according to the number of SKU types; and perform a second ascending sort on the candidate containers with the same number of SKU types according to the container volume occupied, to obtain the priority order.

[0123] In some embodiments, the sorting rule is to sort goods according to the batch information; in determining the sorting task according to the priority order and the preset sorting rule, the processing unit 301 is further configured to: determine the sorting task according to the target sorting order, the sorting task being the task of transferring the items in the candidate container to the target container according to the target sorting order, the target sorting order being the priority order.

[0124] In some embodiments, the sorting rule is to sort goods according to the number of SKU types; in determining the sorting task according to the priority order and the preset sorting rule, the processing unit 301 is further configured to: determine a target sorting order according to the ascending order of the number of SKU types of each candidate container in at least one candidate container pile; determine the sorting task according to the target sorting order, wherein the sorting task is a task of transferring the items in the candidate containers to the target containers according to the target sorting order.

[0125] In some embodiments, both the target container and the candidate container include multiple compartments. In determining the sorting task according to the target sorting order, the processing unit 301 is further configured to: establish a first mapping relationship between each SKU in each candidate container and the target compartment in the target container according to the target sorting order, wherein each compartment corresponds to one SKU and the items in each target container belong to the same batch.

[0126] In some embodiments, for each candidate container, in the process of establishing the first mapping relationship, the processing unit 301 is specifically configured to: for the nth SKU in the current candidate container, determine whether there exists a first target slot in the first target container that is already occupied and has the same SKU loaded as the nth SKU, wherein the first target container is a target container used to load SKUs from the same batch as the current candidate container, n is a positive integer and n ≤ the total number of slots in a single candidate container, and the nth SKU is the SKU loaded in any slot of the current candidate container; if it exists and the first target slot can load the nth SKU, then establish the nth SKU... The first mapping relationship between the nth SKU and the first target slot is established; if it does not exist, and there is an unoccupied second target slot in the first target container, then the first mapping relationship between the nth SKU and the second target slot is established; any other SKU in the current candidate container that has not established the first mapping relationship is updated to the nth SKU, and the steps "for the nth SKU in the current candidate container, determine whether there is a first target slot in the first target container that has been occupied and whose loaded SKU is the same as the nth SKU" and subsequent steps are repeated until the first mapping relationship between each SKU in the current candidate container and the target container is established.

[0127] In some embodiments, after determining whether there is a first target slot in the first target container that is already occupied and has the same type as the nth SKU, the processing unit 301 is further configured to: if there is, and the first target slot cannot load the nth SKU, determine whether there is an unoccupied third target slot in the first target container; if there is an unoccupied third target slot, establish the first mapping relationship between the nth SKU and the third target slot; if there is no unoccupied third target slot, determine whether to establish the first mapping relationship between the nth SKU and the next target container according to the target sorting order corresponding to the current candidate container.

[0128] In some embodiments, after determining whether there is a first target slot in the first target container that is already occupied and has the same type as the nth SKU, the processing unit 301 is further configured to: if there is no first target slot and there is no unoccupied second target slot in the first target container, then determine whether to establish the first mapping relationship between the nth SKU and the next target container according to the target sorting order corresponding to the current candidate container.

[0129] In some embodiments, in determining whether to establish the first mapping relationship between the nth SKU and the next target container based on the target sorting order corresponding to the current candidate container, the processing unit 301 is further configured to: if the current candidate container is the last one in the target sorting order, perform a volume occupancy lower limit detection to determine whether to establish the first mapping relationship between the nth SKU and the next target container; if the current candidate container is not the last one in the target sorting order, establish the first mapping relationship between the nth SKU and the next target container.

[0130] In some embodiments, regarding the volume occupancy lower limit detection, the processing unit 301 is specifically configured to: determine the size relationship between the container volume occupied by the nth SKU and a preset minimum volume occupied; if the container volume occupied by the nth SKU is less than the preset minimum volume occupied, then abandon the establishment of the first mapping relationship between the nth SKU and the next target container; if the container volume occupied by the nth SKU is greater than or equal to the preset minimum volume occupied, then establish the first mapping relationship between the nth SKU and the next target container.

[0131] Please see Figure 4 , Figure 4 The present application provides a structural block diagram of a server. The server 4 includes a processor 401, a memory 403, a communication interface 402, and one or more computer programs 4031. The one or more computer programs 4031 are stored in the memory 403 and configured to be executed by the processor 401. The programs include a method for performing a dynamic stacking-based tallying method as described in the above embodiments.

[0132] This application provides a computer-readable storage medium storing a computer program / instructions thereon, which, when executed by a processor, implement the steps of any possible embodiment of the method.

[0133] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that this application is not limited to the described order of actions, as some steps may be performed in other orders or simultaneously according to this application. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments, and the actions and modules involved are not necessarily essential to this application.

[0134] In the above embodiments, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions in other embodiments.

[0135] In the several embodiments provided in this application, it should be understood that the disclosed apparatus can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of the units described above is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical or other forms.

[0136] The units described above as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0137] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0138] If the aforementioned integrated units are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage device (CMD). Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a memory and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned memory includes various media capable of storing program code, such as USB flash drives, read-only memory (ROM), random access memory (RAM), portable hard drives, magnetic disks, or optical disks.

[0139] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage device, which may include: flash drive, ROM, random access RAM, disk or optical disk, etc.

[0140] The embodiments of this application have been described in detail above. Specific examples have been used to illustrate the principles and implementation methods of this application. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A tallying method based on dynamic stacking, characterized in that, The method includes: Multiple candidate containers are selected from multiple containers. The containers are used to place items. The candidate containers are containers whose volume is smaller than a preset volume. Obtain the container loading information of the candidate container, which includes batch information of the items in the candidate container and the number of SKU types of the items; Based on the batch information, the multiple candidate containers are divided into at least one candidate container pile; The priority order of each candidate container in the candidate container stack is determined based on the number of SKU types and the volume occupied by the container. The sorting task is determined according to the priority order and the preset sorting rules. The sorting task refers to the task of transferring the items in the candidate container to the target container.

2. The method according to claim 1, characterized in that, The step of determining the priority order of each candidate container in the candidate container stack based on the number of SKU types and the container volume includes: At least one of the candidate containers in the candidate container stack is sorted in ascending order according to the number of SKU types; The candidate containers with the same number of SKU types are sorted in ascending order according to the container volume occupied to obtain the priority order.

3. The method according to claim 1, characterized in that, The sorting rules are based on the batch information; determining the sorting task according to the priority order and the preset sorting rules includes: The sorting task is determined according to the target sorting order, which is the task of transferring the items in the candidate container to the target container according to the target sorting order, where the target sorting order is the priority order.

4. The method according to claim 1, characterized in that, The sorting rules are based on the number of SKU types; determining the sorting task according to the priority order and preset sorting rules includes: The target sorting order is determined according to the ascending order of the number of SKU types of each candidate container in at least one candidate container stack; The sorting task is determined according to the target sorting order, and the sorting task is the task of transferring the items in the candidate containers to the target containers according to the target sorting order.

5. The method according to claim 3 or 4, characterized in that, Both the target container and the candidate container include multiple compartments. Determining the sorting task according to the target sorting order includes: According to the target sorting order, a first mapping relationship is established between each SKU in each candidate container and the target compartment in the target container, with each compartment corresponding to one SKU, and the items in each target container belonging to the same batch.

6. The method according to claim 5, characterized in that, For each of the candidate containers, the process of establishing the first mapping relationship includes: For the nth SKU in the current candidate container, determine whether there is a first target slot in the first target container that is already occupied and has the same SKU as the nth SKU. The first target container is a target container used to load SKUs from the same batch as the current candidate container. n is a positive integer and n ≤ the total number of slots in a single candidate container. The nth SKU is the SKU loaded in any slot of the current candidate container. If it exists, and the first target slot can load the nth SKU, then establish the first mapping relationship between the nth SKU and the first target slot; If it does not exist, and there is an unoccupied second target slot in the first target container, then establish the first mapping relationship between the nth SKU and the second target slot; Update any other SKU in the current candidate container that has not established the first mapping relationship to the nth SKU, and repeat the steps "for the nth SKU in the current candidate container, determine whether there is a first target slot in the first target container that has been occupied and has the same SKU as the nth SKU" and the subsequent steps, until each SKU in the current candidate container establishes the first mapping relationship with the target container.

7. The method according to claim 6, characterized in that, After determining whether there is a first target slot in the first target container that is already occupied and has the same type as the nth SKU, the method further includes: If it exists, and the first target slot cannot load the nth SKU, determine whether there is an unoccupied third target slot in the first target container; If there is an unoccupied third target slot, then establish the first mapping relationship between the nth SKU and the third target slot; If there is no unoccupied third target slot, then determine whether to establish the first mapping relationship between the nth SKU and the next target container based on the target sorting order corresponding to the current candidate container.

8. The method according to claim 6, characterized in that, After determining whether there is a first target slot in the first target container that is already occupied and has the same type as the nth SKU, the method further includes: If it does not exist, and there is no unoccupied second target slot in the first target container, then determine whether to establish the first mapping relationship between the nth SKU and the next target container according to the target sorting order corresponding to the current candidate container.

9. The method according to claim 7 or 8, characterized in that, The step of determining whether to establish the first mapping relationship between the nth SKU and the next target container based on the target sorting order corresponding to the current candidate container includes: If the current candidate container is the last one in the target sorting order, then a volume occupancy lower limit detection is performed to determine whether to establish the first mapping relationship between the nth SKU and the next target container; If the current candidate container is not the last one in the target sorting order, then the first mapping relationship between the nth SKU and the next target container is established.

10. The method according to claim 9, characterized in that, The specific steps for detecting the lower limit of volume occupancy include: Determine the relationship between the container volume occupied by the nth SKU and the preset minimum volume occupied; If the container volume occupied by the nth SKU is less than the preset minimum volume, then the establishment of the first mapping relationship between the nth SKU and the next target container is abandoned. If the container volume occupied by the nth SKU is greater than or equal to the preset minimum volume, then the first mapping relationship between the nth SKU and the next target container is established.

11. An intelligent cargo handling device based on dynamic stacking, characterized in that, The device includes: A processing unit is used to filter out multiple candidate containers from multiple containers, the containers being used to place items, and the candidate containers being containers whose volume is less than a preset volume; The acquisition unit is used to acquire the container loading information of the candidate container, the container loading information including the batch information of the items in the candidate container and the number of SKU types of the items; The processing unit is configured to divide the multiple candidate containers into at least one candidate container pile according to the batch information; determine the priority order of each candidate container in the candidate container pile according to the number of SKU types and the volume occupied by the container; and determine the sorting task according to the priority order and the preset sorting rules, wherein the sorting task refers to the task of transferring the items in the candidate containers to the target container.

12. A server, characterized in that, The method includes a processor, a memory, a communication interface, and one or more programs, said one or more programs being stored in the memory and configured to be executed by the processor, said programs including instructions for performing the steps of the method as described in any one of claims 1-10.

13. A computer-readable storage medium, characterized in that, A computer program for electronic data interchange is stored, wherein the computer program causes a computer to execute instructions for the steps of the method as described in any one of claims 1-10.

Images