A method, device and equipment for processing a boxing task

Abstract

The application belongs to the technical field of logistics, and particularly relates to a method, device and equipment for processing a loading task, the method comprising: obtaining loading task information, determining a first loading scheme of the first N-m trucks by means of a greedy algorithm and a tree search algorithm according to the container information and the truck information, and obtaining the total volume of the remaining containers to be loaded corresponding to the first loading scheme, determining a plurality of truck combinations according to the total volume of the remaining containers to be loaded, each truck combination comprising m trucks, determining a plurality of second loading schemes corresponding to each truck combination by means of the tree search algorithm, determining at least one third loading scheme from the plurality of second loading schemes, and combining the at least one third loading scheme with the first loading scheme to obtain a final loading scheme. The above method can determine a loading scheme in different ways according to the total volume of the containers to be loaded in the process of loading, and can obtain a loading scheme with a high loading rate within a limited time.

Description

Technical Field

[0001] This application belongs to the field of logistics technology, specifically relating to a method, apparatus and equipment for handling packing tasks. Background Technology

[0002] With the rapid development of logistics and warehousing industries, packaging issues are very common in daily life and industrial fields.

[0003] In practice, as the types and quantities of cargo containers increase, loading different types of containers significantly reduces the packing rate compared to loading the same type. Current technologies typically use tree search to determine packing schemes. When there are many containers to be loaded, the search tree has many nodes. Each node represents a packing scheme for one container, and each leaf node represents a complete packing scheme or a scheme that cannot be continued. When the search tree has many nodes, it is impossible to traverse all nodes in a finite amount of time, resulting in a packing scheme that is only locally optimal and cannot meet business requirements.

[0004] Existing methods for handling container loading tasks cannot achieve high loading rates within a limited time when there are many containers to be loaded, thus failing to meet business needs. Summary of the Invention

[0005] To address the aforementioned problems in existing technologies, specifically the inability of current container loading methods to achieve high loading rates within a limited time when there are many containers to be loaded, thus failing to meet business requirements, this application provides a container loading task processing method, apparatus, and equipment. During the container loading process, when there are many containers to be loaded, a local optimization scheme is used to determine the loading scheme for the first Nm trucks; when there are few containers to be loaded, a global optimization scheme is used to determine the loading scheme for the last m trucks. By combining local and global optimization, a high loading rate can be achieved within a limited time, thus meeting business requirements.

[0006] In a first aspect, embodiments of this application provide a packing task processing method, the method comprising:

[0007] Obtain packing task information; the packing task information includes: cargo box information and truck information;

[0008] Based on the cargo box information and truck information, a greedy algorithm and a tree search algorithm are used to determine the first loading scheme for the first Nm trucks, and the total volume of the remaining cargo boxes to be loaded corresponding to the first loading scheme is obtained; where N is the number of trucks required to load all cargo boxes; the Nm trucks are the Nm trucks with the largest available volume; the tree search algorithm refers to a tree search algorithm with a limited search width that satisfies the preset cargo box placement rules.

[0009] Based on the total volume of the remaining cargo containers to be loaded, multiple truck combinations are determined, each truck combination including m trucks. A tree search algorithm is used to determine multiple second packing schemes corresponding to each truck combination. From the multiple second packing schemes, at least one third packing scheme is determined. The third packing scheme is a packing scheme among the second packing schemes that meets preset conditions.

[0010] At least one third packing scheme is combined with the first packing scheme to obtain at least one final packing scheme.

[0011] Optionally, the cargo box information includes the total volume of the cargo boxes currently to be loaded, and the truck information includes the volume of each truck currently available; based on the cargo box information and truck information, a first loading scheme for the first Nm trucks is determined using a greedy algorithm and a tree search algorithm, including:

[0012] Repeat the following steps until the total volume of the cargo containers to be loaded is less than the preset volume, to obtain the first loading scheme for the first Nm trucks:

[0013] If the total volume of the cargo boxes to be loaded is greater than or equal to the preset volume, the target vehicle is determined; the preset volume is the sum of the volumes of m trucks with the largest current volume;

[0014] The packing scheme for the target vehicle is determined using the greedy algorithm and the tree search algorithm.

[0015] Optionally, the packing scheme for the target vehicle is determined using the greedy algorithm and tree search algorithm, including:

[0016] Determine the packing method for the first container to be loaded and create the corresponding node;

[0017] Repeat the following steps until no new nodes are created, and obtain the packing plan for the target vehicle based on the currently created nodes:

[0018] Select the next cargo box to be loaded based on the available space of the target vehicle, determine the loading method of the currently selected cargo box, and create a corresponding node for each loading method. Multiple nodes created belong to the child nodes of the node corresponding to the previous cargo box to be loaded; the number of multiple nodes created is less than the search width.

[0019] Select the node with the highest priority from the multiple nodes of the currently selected cargo containers to be loaded.

[0020] Optionally, the method further includes:

[0021] For each node, determine the total volume of wasted space, the average volume of loaded containers, and the component of the center coordinate of the loaded containers along the preset axis under the local packing scheme corresponding to that node;

[0022] The score for the node is obtained by weighted summing of the total volume of the wasted space, the average volume of the loaded cargo boxes, and the components of the center coordinates of the loaded cargo boxes along a preset axis.

[0023] The node with the highest or lowest priority is determined based on the score of each node; where the priority of a node is positively correlated with its score.

[0024] Optionally, the method further includes:

[0025] When the target vehicle has available space to accommodate at least one cargo box, it is determined whether there is a first type of cargo box among the cargo boxes to be loaded; the first type of cargo box is a kit.

[0026] If there are first-type cargo boxes to be loaded, then stack several first-type cargo boxes to be loaded in the length and height directions of the cargo boxes to obtain a stacked complex block;

[0027] The complex block is placed in the available space. If the placement is successful, the complex block is designated as a child node of the node corresponding to the previous cargo box to be loaded. If the placement fails, the complex block is regenerated.

[0028] Optionally, the method further includes:

[0029] If there are no first-type cargo containers to be loaded, determine if there are second-type cargo containers to be loaded; the second-type cargo containers are loose parts.

[0030] If there are second-type cargo boxes to be loaded, stack several second-type cargo boxes to be loaded in the length and height directions of the cargo boxes to obtain a simple block after stacking;

[0031] The simple block is placed in the available space. If the placement is successful, the simple block is designated as a child node of the node corresponding to the previous cargo box to be loaded. If the placement fails, the simple block is regenerated.

[0032] Optionally, at least one third packing scheme is determined from the plurality of second packing schemes, including:

[0033] The space utilization rate and geometric center position of the cargo box are determined according to the placement method of the cargo box in each second packing scheme.

[0034] At least one third packing scheme is determined based on the space utilization rate and / or the geometric center position of the container; the third packing scheme is a second packing scheme in which the space utilization rate and / or the geometric center position of the container meets preset requirements.

[0035] Secondly, embodiments of this application also provide a packing task processing apparatus, the apparatus comprising:

[0036] The acquisition module is used to acquire packing task information; the packing task information includes: cargo box information and truck information;

[0037] The first determining module is used to determine the first loading scheme for the first Nm trucks based on the cargo box information and truck information using a greedy algorithm and a tree search algorithm, and to obtain the total volume of the remaining cargo boxes to be loaded corresponding to the first loading scheme; where N is the number of trucks required to load all cargo boxes; the Nm trucks are the Nm trucks with the largest available volume; the tree search algorithm refers to a tree search algorithm with a limited search width that satisfies the preset cargo box placement rules;

[0038] The second determining module is used to determine multiple truck combinations based on the total volume of the remaining cargo boxes to be loaded. Each truck combination includes m trucks. The module uses a tree search algorithm to determine multiple second packing schemes corresponding to each truck combination. It then determines at least one third packing scheme from the multiple second packing schemes. The third packing scheme is a packing scheme among the second packing schemes that meets preset conditions.

[0039] The combination module is used to combine at least one third packing scheme with the first packing scheme respectively to obtain at least one final packing scheme.

[0040] Optionally, the cargo box information includes the total volume of the cargo boxes currently to be loaded, and the truck information includes the volume of each truck currently available; when the first determining module determines the first loading scheme for the first Nm trucks using a greedy algorithm and a tree search algorithm based on the cargo box information and truck information, it is specifically used for:

[0041] Repeat the following steps until the volume of the cargo box to be loaded is less than the preset volume, to obtain the first loading plan for the first Nm trucks:

[0042] If the total volume of the cargo boxes to be loaded is greater than or equal to the preset volume, the target vehicle is determined; the preset volume is the sum of the volumes of m trucks with the largest current volume;

[0043] The packing scheme for the target vehicle is determined using the greedy algorithm and the tree search algorithm.

[0044] Optionally, when the first determining module determines the packing scheme for the target vehicle using the greedy algorithm and the tree search algorithm, it is specifically used for:

[0045] Determine the packing method for the first container to be loaded and create the corresponding node;

[0046] Repeat the following steps until no new nodes are created, and obtain the packing plan for the target vehicle based on the currently created nodes:

[0047] Select the next cargo box to be loaded based on the available space of the target vehicle, determine the loading method of the currently selected cargo box, and create a corresponding node for each loading method. Multiple nodes created belong to the child nodes of the node corresponding to the previous cargo box to be loaded; the number of multiple nodes created is less than the search width.

[0048] Select the node with the highest priority from the multiple nodes of the currently selected cargo containers to be loaded.

[0049] Optionally, the device further includes: a scoring calculation module, used for:

[0050] For each node, determine the total volume of wasted space, the average volume of loaded containers, and the component of the center coordinate of the loaded containers along a preset axis under the local packing scheme corresponding to that node.

[0051] The score for the node is obtained by weighted summing of the total volume of the wasted space, the average volume of the loaded cargo boxes, and the components of the center coordinates of the loaded cargo boxes along a preset axis.

[0052] The node with the highest or lowest priority is determined based on the score of each node; where the priority of a node is positively correlated with its score.

[0053] Optionally, the device further includes a segmentation module for:

[0054] When the target vehicle has available space to accommodate at least one cargo box, it is determined whether there is a first type of cargo box among the cargo boxes to be loaded; the first type of cargo box is a kit.

[0055] If there are first-type cargo boxes to be loaded, then stack several first-type cargo boxes to be loaded in the length and height directions of the cargo boxes to obtain a stacked complex block;

[0056] The complex block is placed in the available space. If the placement is successful, the complex block is designated as a child node of the node corresponding to the previous cargo box to be loaded. If the placement fails, the complex block is regenerated.

[0057] Optionally, the segmentation module is further configured to:

[0058] If there are no first-type cargo containers to be loaded, determine if there are second-type cargo containers to be loaded; the second-type cargo containers are loose parts.

[0059] If there are second-type cargo boxes to be loaded, stack several second-type cargo boxes to be loaded in the length and height directions of the cargo boxes to obtain a simple block after stacking;

[0060] The simple block is placed in the available space. If the placement is successful, the simple block is designated as a child node of the node corresponding to the previous cargo box to be loaded. If the placement fails, the simple block is regenerated.

[0061] Optionally, when determining at least one third packing scheme from the plurality of second packing schemes, the second determining module is specifically used for:

[0062] The space utilization rate and geometric center position of the cargo box are determined according to the placement method of the cargo box in each second packing scheme.

[0063] At least one third packing scheme is determined based on the space utilization rate and / or the geometric center position of the container; the third packing scheme is a second packing scheme in which the space utilization rate and / or the geometric center position of the container meets preset requirements.

[0064] Thirdly, embodiments of this application also provide a packing task processing device, including: a memory and at least one processor;

[0065] The memory stores computer-executed instructions;

[0066] The at least one processor executes computer execution instructions stored in the memory, causing the at least one processor to perform a packing task processing method as provided in any embodiment corresponding to the first aspect of this application.

[0067] Fourthly, embodiments of this application also provide a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the packing task processing method provided in any embodiment corresponding to the first aspect of this application.

[0068] Those skilled in the art will understand that the packing task processing method, apparatus, and equipment provided in this application embodiment obtains packing task information; the packing task information includes: cargo box information and truck information; based on the cargo box information and truck information, a first packing scheme for the first Nm trucks is determined using a greedy algorithm and a tree search algorithm, and the total volume of the remaining cargo boxes to be loaded corresponding to the first packing scheme is obtained; where N is the number of trucks required to load all cargo boxes; the Nm trucks are the Nm trucks with the largest currently available capacity; the tree search algorithm represents a tree search algorithm with a limited search width that satisfies preset cargo box placement rules; based on the total volume of the remaining cargo boxes to be loaded, a first packing scheme for the first Nm trucks is determined using a greedy algorithm and a tree search algorithm, and the total volume of the remaining cargo boxes to be loaded is obtained. Multiple truck combinations are defined, each combination consisting of m trucks. A tree search algorithm is used to determine multiple second packing schemes for each truck combination. From these multiple second packing schemes, at least one third packing scheme is determined. The third packing scheme is a packing scheme among the second packing schemes that meets preset conditions. The at least one third packing scheme is combined with the first packing scheme to obtain at least one final packing scheme. This approach enables the determination of the first packing scheme using local optimization for the first Nm trucks and the determination of the third packing scheme using global optimization for the last m trucks. This approach can achieve a packing scheme with a high packing rate within a limited time, thus meeting business requirements. Attached Figure Description

[0069] Preferred embodiments of the packing task processing method, apparatus, and device of this application will now be described with reference to the accompanying drawings. The accompanying drawings, which are incorporated in and form a part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this application. The drawings are as follows:

[0070] Figure 1 This is an application scenario diagram of a packing task processing method provided in an embodiment of this application;

[0071] Figure 2 This is a flowchart illustrating a packing task processing method provided in an embodiment of this application;

[0072] Figure 3 This is a flowchart illustrating a method for determining the first packing scheme for the first Nm trucks, as provided in an embodiment of this application.

[0073] Figure 4 This is a flowchart illustrating a method for determining a packing scheme for a target vehicle, as provided in an embodiment of this application.

[0074] Figure 5 This is a schematic diagram of a search tree structure provided in an embodiment of this application;

[0075] Figure 6 This is a schematic diagram of the structure of a packing task processing device provided in an embodiment of this application;

[0076] Figure 7 This is a schematic diagram of the structure of a packing task processing device provided in an embodiment of this application. Detailed Implementation

[0077] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions in the embodiments of this application will be clearly and completely described below in conjunction with the embodiments of this application. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0078] The technical solution of this application and how the technical solution of this application solves the above-mentioned technical problems are 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 now be described with reference to the accompanying drawings.

[0079] The application scenarios of the embodiments of this application are explained below:

[0080] Figure 1 This is an application scenario diagram of a packing task processing method provided in an embodiment of this application, such as... Figure 1 As shown, in the logistics industry, it is often necessary to load various types of trucks with different sizes of cargo boxes. Each cargo box has a certain length, width, and height, and occupies a certain volume. Each cargo box has corresponding placement requirements, such as vertical or horizontal placement. Based on the placement requirements of the cargo boxes, how can we obtain a loading strategy to ensure that all cargo boxes are placed in the trucks, while minimizing the number of trucks selected and maximizing the loading rate of the trucks?

[0081] For trucks, a coordinate system can be constructed. Point O represents the upper left corner of the cargo box bottom. The a-axis represents the horizontal direction extending from the origin to the unloading port, the b-axis represents the horizontal direction extending to the right from the origin, and the c-axis represents the upward direction extending from the origin. The lengths of the a, b, and c axes represent the length, width, and height of the truck. These three axes represent the truck space. After determining the truck space, multiple cargo boxes can be placed into that space sequentially. The loading strategy refers to which truck to place the cargo box on and how it is placed within that truck.

[0082] In existing technologies, the determination of packing schemes is usually based on tree search. However, when there are many boxes to be loaded, the number of nodes in the search tree increases. Each leaf node can represent a complete packing scheme or an unfeasible scheme. Traversing all leaf nodes of the search tree will result in a large amount of computation, making it impossible to obtain a packing scheme within a limited time and failing to meet business requirements.

[0083] To address the aforementioned issues, the main concept of the packing task processing method provided in this application is as follows: During the loading of the first Nm trucks, a greedy strategy is employed when searching for the packing method for each cargo box to be loaded. Based on the greedy strategy, an optimized local packing scheme can be obtained when loading each cargo box. When loading the last m trucks, the total volume of the cargo boxes to be loaded is relatively small, so all packing schemes can be traversed to obtain a packing scheme with a high packing rate. The packing schemes of the first Nm trucks and the packing schemes of the last m trucks are combined to obtain the final packing scheme, which satisfies the approximate maximization of the overall packing rate.

[0084] Figure 2 This is a flowchart illustrating a packing task processing method according to an embodiment of this application. The packing task processing method provided in this embodiment is applied to a packing task processing device, such as... Figure 2 As shown, the packing task processing method includes the following steps:

[0085] Step S201: Obtain packing task information; the packing task information includes: cargo box information and truck information.

[0086] This step requires determining the cargo box information and truck information. This information can be entered by the user based on the actual conditions of the cargo box and truck to be loaded, or it can be determined based on received order information. For example, for a store selling home appliances, the order includes the types, models, and quantities of appliances purchased by the user. Based on this information, the cargo box information for loading each appliance can be determined.

[0087] In practice, orders can be merged or split based on information such as the volume and size of multiple available trucks. For example, large orders with a large number of cargo boxes to be loaded can be split, while small orders with a small number of cargo boxes to be loaded can be merged, so that the cargo boxes of the split or combined orders can be loaded into a preset number of trucks.

[0088] Step S202: Based on the cargo box information and truck information, determine the first loading scheme for the first Nm trucks using a greedy algorithm and a tree search algorithm, and obtain the total volume of the remaining cargo boxes to be loaded corresponding to the first loading scheme; where N is the number of trucks required to load all cargo boxes; the Nm trucks are the Nm trucks with the largest available volume; the tree search algorithm refers to a tree search algorithm with a limited search width that satisfies the preset cargo box placement rules.

[0089] The first packing scheme represents the multiple cargo boxes loaded on the first Nm trucks and the placement of each cargo box within the trucks. When determining the packing scheme for the first Nm trucks, due to the large number of cargo boxes to be loaded, a greedy algorithm is used to determine the packing method for each cargo box using a tree search algorithm. The greedy algorithm means that when loading any cargo box, the packing method corresponding to the current optimal solution is used as the local packing scheme, and when determining the packing method for the next cargo box, the packing method of the previous cargo box is accepted. Here, N represents the number of trucks loading all the cargo boxes to be loaded.

[0090] When there are many or large containers to be loaded, a packing method based on a greedy algorithm is used. During the loading process, when there are few or small containers to be loaded, the packing method for each container is no longer determined based on a greedy algorithm.

[0091] Among these, satisfying the preset rules refers to the preset rules for cargo box placement. For example, when loading cargo boxes into a truck, they are always placed in the lower left corner of the available space. Once the loading position is determined, the number of possible placement schemes is minimized, thereby reducing the computational load of subsequent tree searches. Furthermore, different cargo boxes may have specific requirements for placement due to their inherent characteristics. For instance, if a truck that is not currently full has available vertical space, but the cargo box to be loaded can only be placed horizontally, then the cargo box to be loaded cannot be loaded into that truck. Or, if cargo box A has a certain weight limit, then if cargo box B exceeds that weight limit, then cargo box B cannot be placed on top of cargo box A.

[0092] When selecting the first Nm trucks, priority should be given to trucks with the largest capacity. The larger the capacity of the trucks, the fewer trucks are needed, thereby reducing freight costs.

[0093] Furthermore, the tree search algorithm determines the packing scheme for each cargo container by searching the nodes in a tree. Specifically, when determining the packing scheme for the first Nm trucks, a tree can represent either the overall packing scheme for the first Nm trucks or the overall packing scheme for all N trucks. A tree contains multiple nodes, each representing a packing scheme for one cargo container. Leaf nodes represent a complete packing scheme or a scheme that cannot be continued. During the tree search, a search width is limited, keeping the number of nodes within a certain range, thus enabling the search for high-potential packing schemes within a limited time.

[0094] Once the first Nm trucks are loaded, the total volume of the remaining cargo boxes to be loaded can be determined. Based on the total volume of the remaining cargo boxes to be loaded, the truck combination of the remaining m trucks can be determined.

[0095] Step S203: Determine multiple truck combinations based on the total volume of the remaining cargo boxes to be loaded. Each truck combination includes m trucks. Use a tree search algorithm to determine multiple second packing schemes corresponding to each truck combination. Determine at least one third packing scheme from the multiple second packing schemes. The third packing scheme is a packing scheme among the second packing schemes that meets preset conditions.

[0096] After determining the total volume of the remaining cargo boxes to be loaded, select m trucks from the currently available trucks based on the total volume of the remaining cargo boxes to be loaded, wherein the sum of the volumes of the m trucks must be greater than the total volume of the remaining cargo boxes to be loaded.

[0097] In this process, when selecting the remaining m trucks, the truck with the largest capacity is not chosen. Since there are fewer cargo boxes to be loaded at this point, selecting the largest capacity truck would waste a significant amount of cargo box space. Therefore, multiple smaller trucks are used to load the remaining cargo boxes. Furthermore, when determining the loading scheme for the remaining m trucks, a global optimization approach is employed. This involves identifying multiple feasible second-order loading schemes for each cargo box combination, and then selecting a third-order loading scheme that meets preset conditions from all the second-order loading schemes corresponding to all combinations. The second-order loading scheme is determined by traversing all nodes of the search tree. For example, if there are three different cargo box combinations, and four feasible loading schemes exist for each combination, then there are 12 loading schemes for the remaining cargo boxes to be loaded. From these, a third-order loading scheme that meets the conditions can be selected.

[0098] When determining the third packing scheme, it can be based on the space utilization rate and / or geometric center position of each second packing scheme, thereby determining the packing scheme for the last m vehicles with a higher packing rate.

[0099] Step S204: Combine at least one third packing scheme with the first packing scheme to obtain at least one final packing scheme.

[0100] After determining the first packing scheme for the first Nm trucks and at least one third packing scheme for the last m trucks, these schemes can be combined to obtain multiple final packing schemes. These multiple final packing schemes can then be presented to the user, allowing them to choose the scheme that best suits their packing habits based on their needs.

[0101] The container loading task processing method provided in this application obtains container loading task information, determines the first container loading scheme for the first Nm trucks based on the container information and truck information using a greedy algorithm and a tree search algorithm, and obtains the total volume of the remaining containers to be loaded corresponding to the first container loading scheme. This can obtain a locally optimized container loading scheme. Based on the total volume of the remaining containers to be loaded, multiple truck combinations are determined, each truck combination including m trucks. Multiple second container loading schemes corresponding to each truck combination are determined using a tree search algorithm. At least one third container loading scheme is determined from the multiple second container loading schemes. The third container loading scheme for the last m trucks is determined through global optimization, resulting in the final container loading scheme. This final container loading scheme satisfies the approximate maximization of the overall container loading rate and can obtain a container loading scheme with a high container loading rate within a limited time, thus meeting actual business needs.

[0102] Figure 3 This is a flowchart illustrating a method for determining the first packing scheme for the first Nm trucks, as provided in an embodiment of this application; Figure 3 As shown, the method includes:

[0103] Repeat steps S301 and S302 until the total volume of the cargo boxes to be loaded is less than the preset volume, thus obtaining the first loading scheme for the first Nm trucks:

[0104] Step S301: If the total volume of the cargo boxes to be loaded is greater than or equal to the preset volume, determine the target vehicle; the preset volume is the sum of the volumes of m trucks with the largest current volume.

[0105] When determining the initial loading plan for the first Nm trucks, it is necessary to first determine the relationship between the total volume of the cargo boxes to be loaded and the preset volume. The preset volume is the sum of the volumes of the m trucks with the largest current volume. The value of m can be set according to user needs; a larger value for m corresponds to a greater computational load than a smaller value, and the selection can be based on the device's data processing speed. For example, m can be set to 2.

[0106] The process of determining the relationship between the total volume of the cargo boxes to be loaded and the preset volume is to ascertain the status of the cargo boxes to be loaded. If the volume is greater than the preset volume, it indicates that there are more cargo boxes to be loaded; if it is less than the preset volume, it indicates that there are fewer cargo boxes to be loaded. The preset volume is the sum of the volumes of the m largest trucks currently available.

[0107] When the volume exceeds the preset capacity, it means the next cargo box to be loaded needs to be placed among the previous Nm trucks. In this case, the target vehicle needs to be determined first. The target vehicle is the one with the largest current capacity.

[0108] Step S302: Determine the packing scheme for the target vehicle using the greedy algorithm and tree search algorithm.

[0109] After identifying the target vehicle, a greedy algorithm and a tree search algorithm can be used to determine the loading scheme for that vehicle. The loading scheme determined by the greedy algorithm means that when placing the cargo boxes to be loaded into the truck, the optimal placement method for the current cargo box is selected. Once the placement method is determined, the placement method for the next cargo box to be loaded is determined based on the placement method of the previous cargo box; that is, the placement method of the previous cargo box is not considered again. The greedy algorithm can ensure that the placement method of each cargo box to be loaded is locally optimal.

[0110] The above method can determine the loading scheme for the first Nm trucks based on a greedy algorithm, enabling the quickest determination of the loading scheme when there are many cargo boxes to be loaded.

[0111] The following section details the process of determining the packing scheme for the target vehicle based on the greedy algorithm and the tree search algorithm.

[0112] Figure 4 This is a flowchart illustrating a method for determining a packing scheme for a target vehicle, as provided in an embodiment of this application; Figure 4 As shown, the method includes:

[0113] Step S401: Determine the packing method for the first container to be loaded and create the corresponding node.

[0114] Figure 5 This is a schematic diagram of a search tree structure provided in an embodiment of this application; as shown... Figure 5As shown, the search tree contains a root node with multiple first child nodes. Each first child node represents a packing method for the first container. Since there may be multiple packing methods for a single container, a greedy strategy can be used to determine the packing method for the first container. Second child nodes exist under each first child node, and so on, resulting in multiple packing methods for each container. Once the packing method for the first container is determined, the node to be created is selected from the multiple first child nodes.

[0115] Repeat steps S402 and S403 below until no new nodes are added, and obtain the packing plan for the target vehicle based on the multiple nodes currently created:

[0116] Step S402: Select the next cargo box to be loaded based on the available space of the target vehicle, determine the loading method of the currently selected cargo box, and create a corresponding node for each loading method. The multiple nodes created belong to the child nodes of the node corresponding to the previous cargo box to be loaded; the number of multiple nodes created is less than the search width.

[0117] After determining the node corresponding to the first cargo container, the nodes corresponding to the second, third, and so on can be determined sequentially. When determining the node for each cargo container, the loading method of the cargo container to be loaded is first determined, and a node is created for each loading method. For example, when determining the node corresponding to the second cargo container, if there are 5 loading methods, a node can be created for each loading method.

[0118] It's important to note that the number of nodes created for each container to be loaded cannot exceed the search width. When the number of nodes exceeds the search width, the node with the lowest priority must be identified and deleted. For example, if the limit is 4, only the loading schemes corresponding to the first 4 nodes found in the search will be considered, ensuring that the optimal loading scheme for the container to be loaded is obtained within a limited time. During the search, larger containers are always prioritized, thus allowing for the acquisition of the most optimal loading schemes.

[0119] Step S403: Select the node with the highest priority from the multiple nodes of the currently selected cargo container to be loaded.

[0120] When determining the node corresponding to the container to be loaded from multiple nodes, the priorities of the nodes are compared, and the node with the highest priority is determined as the node corresponding to the container to be loaded. The highest priority indicates that the local loading plan is the current optimal plan.

[0121] When no new nodes are added, it means that the target vehicle is fully loaded. Based on each determined node, the loading method of the cargo box corresponding to each node can be determined.

[0122] The greedy algorithm determines the packing scheme for a given container once the node corresponding to that container is determined, without considering other packing methods for that container.

[0123] The above method can determine the packing method of the target vehicle. Based on the greedy algorithm, the local optimal packing scheme can be determined at a relatively fast speed. By limiting the search width, the amount of data to be calculated can be reduced, and packing schemes with higher potential can be searched first.

[0124] Based on the above embodiments, the process of determining the node with the highest or lowest priority will be described in detail.

[0125] Optionally, the method further includes:

[0126] For each node, determine the total volume of wasted space, the average volume of loaded containers, and the component of the center coordinate of the loaded containers along a preset axis under the local packing scheme corresponding to that node.

[0127] Once a node is determined through the search algorithm, the corresponding cargo box and the placement of cargo boxes placed before it can be identified. Therefore, the total volume of wasted space under the current partial loading scheme can be determined; this total volume can be the difference between the truck's volume and the sum of the volumes of all cargo boxes. The average volume of all loaded cargo boxes can also be calculated, based on the volume of each individual cargo box. Furthermore, the component of the center coordinates of the loaded cargo boxes along a preset axis can be calculated, where the preset axis here represents the a-axis, i.e., the direction extending horizontally from the origin towards the unloading port.

[0128] The score for a node is obtained by weighted summing of the total volume of the wasted space, the average volume of the loaded containers, and the components of the center coordinates of the loaded containers along a preset axis.

[0129] By assigning different weights to the total volume of wasted space, the average volume of loaded containers, and the component of the center coordinate of the loaded containers along a preset axis, and then summing these weights, the score for that node can be obtained. The weights can be adjusted according to the actual situation. A higher weight indicates greater emphasis on the corresponding influencing factor. For example, a higher weight corresponding to the total volume of wasted space indicates greater emphasis on the impact of the total volume of wasted space on priority.

[0130] The node with the highest or lowest priority is determined based on the score of each node; where the priority of a node is positively correlated with its score.

[0131] In this process, after determining the score of each node, the node with the highest score is designated as the node with the highest priority, and the node with the lowest score is designated as the node with the lowest priority.

[0132] By determining the priority of nodes through the above-mentioned node scoring method, the priority of each node can be intuitively measured, and the node with the highest or lowest priority can be quickly identified.

[0133] The process of determining the child nodes of the current node is explained in detail below.

[0134] Optionally, the method further includes:

[0135] When the target vehicle has available space to accommodate at least one cargo box, it is determined whether there is a first type of cargo box among the cargo boxes to be loaded; the first type of cargo box is a kit; if there is a first type of cargo box to be loaded, several first type of cargo boxes to be loaded are stacked in the length and height directions of the cargo boxes to obtain a stacked complex block; the complex block is placed in the available space, and if the placement is successful, the complex block is determined as a child node of the node corresponding to the previous cargo box to be loaded; if the placement is unsuccessful, the complex block is regenerated.

[0136] When determining child nodes, the system first checks if there is available space in the current cargo container. If so, the next cargo container to be loaded can be selected from the list of containers to be loaded. When determining the next cargo container to be loaded, priority is given to complete sets, such as air conditioners consisting of an outdoor unit and an indoor unit, which form a set. Since sets need to be placed together and are relatively large, they can be placed first. If smaller cargo containers are placed first, the available cargo space will be fragmented, making it impossible to place larger cargo containers, thus improving space utilization.

[0137] When it is determined that there are first-type cargo boxes such as kits, several cargo boxes can be stacked along their length and height to obtain a complex block. Since cargo boxes are usually long and narrow, with the length much greater than the width, the width of the combined complex block has a greater impact on the overall volume. Furthermore, by placing fewer cargo boxes along the width, space can be freed up for other types of cargo boxes, improving space utilization. When stacking, the scheme with more cargo boxes is preferred.

[0138] One approach is to try placing the stacked complex block into available space. If the placement is successful, it means that the complex block is a child node of the node corresponding to the previous cargo box to be loaded. If the placement fails, the cargo box stacking will continue to obtain a new complex block.

[0139] In the above steps, by grouping similar cargo boxes into complex blocks, the number of placements can be reduced, and the efficiency of generating packing plans can be improved. By prioritizing the placement of complex blocks composed of sets, the space utilization rate of trucks can be improved.

[0140] Optionally, the method further includes:

[0141] If there are no first-type cargo boxes to be loaded, determine if there are second-type cargo boxes to be loaded; the second-type cargo boxes are loose parts; if there are second-type cargo boxes to be loaded, stack several second-type cargo boxes to be loaded in the length and height directions of the cargo boxes to obtain a stacked simple block; place the simple block in the available space, if the placement is successful, the simple block is determined as a child node of the node corresponding to the previous cargo box to be loaded; if the placement is unsuccessful, regenerate the simple block.

[0142] When no type 1 cargo box exists, individual components can continue to be loaded, such as refrigerators, washing machines, and water heaters from electrical appliances. When considering individual components, priority is given to larger cargo boxes, which are then combined into simple blocks. For example, a simple block consisting of several refrigerators can be loaded first. The process of combining individual components into simple blocks is similar to the process of combining complete sets into complex blocks, and will not be elaborated here. The process of identifying a simple block as a child node of the node corresponding to the previous cargo box to be loaded is also similar to the process of identifying a complex block as a child node of the node corresponding to the previous cargo box to be loaded, and will not be elaborated here.

[0143] The process of determining at least one third packing scheme for the last m vehicles is described in detail below.

[0144] Optionally, determining at least one third packing scheme from the plurality of second packing schemes includes:

[0145] The space utilization rate and geometric center position of the cargo box are determined according to the placement method of the cargo box in each second packing scheme; at least one third packing scheme is determined according to the space utilization rate and / or the geometric center position of the cargo box; the third packing scheme is a second packing scheme in which the space utilization rate and / or the geometric center position of the cargo box meets the preset requirements.

[0146] After determining multiple second-packing schemes for the final m trucks, a third-packing scheme can be selected. The third-packing scheme is at least one of the second-packing schemes where the space utilization rate and / or the geometric center position of the cargo boxes meets preset requirements. When determining the third-packing scheme, the space utilization rate and geometric center of the cargo boxes under each second-packing scheme's placement method can be determined first. The geometric center of the cargo box refers to the geometric center of all cargo boxes already loaded in the vehicle. By comparing the space utilization rate and / or the geometric center of the cargo boxes corresponding to each second-packing scheme, a third-packing scheme that satisfies the preset requirements in both space utilization rate and / or the geometric center of the cargo boxes is obtained. There can be multiple third-packing schemes.

[0147] Among them, the space utilization rate and / or the geometric center of the cargo box meeting the preset requirements means that the space utilization rate is greater than the preset space utilization rate, and the geometric center of the cargo box is close to the lower left corner of the cargo box space.

[0148] By comparing the space utilization rate and / or the geometric center position of each second packing scheme, a globally optimized packing scheme for the last m trucks can be obtained, improving the packing rate.

[0149] Figure 6 This is a schematic diagram of the structure of a packing task processing device 60 provided in an embodiment of this application, as shown below. Figure 6 As shown, the device includes:

[0150] The acquisition module 610 is used to acquire packing task information; the packing task information includes: cargo box information and truck information;

[0151] The first determining module 620 is used to determine the first loading scheme for the first Nm trucks based on the cargo box information and truck information using a greedy algorithm and a tree search algorithm, and to obtain the total volume of the remaining cargo boxes to be loaded corresponding to the first loading scheme; where N is the number of trucks required to load all cargo boxes; the Nm trucks are the Nm trucks with the largest available volume; the tree search algorithm refers to a tree search algorithm with a limited search width that satisfies the preset cargo box placement rules;

[0152] The second determining module 630 is used to determine multiple truck combinations based on the total volume of the remaining cargo boxes to be loaded. Each truck combination includes m trucks. A tree search algorithm is used to determine multiple second packing schemes corresponding to each truck combination. At least one third packing scheme is determined from the multiple second packing schemes. The third packing scheme is a packing scheme among the second packing schemes that meets preset conditions.

[0153] The combination module 640 is used to combine at least one third packing scheme with the first packing scheme respectively to obtain at least one final packing scheme.

[0154] Optionally, the cargo box information includes the total volume of the cargo boxes currently to be loaded, and the truck information includes the volume of each truck currently available; when the first determining module 620 determines the first loading scheme for the first Nm trucks using a greedy algorithm and a tree search algorithm based on the cargo box information and truck information, it is specifically used for:

[0155] Repeat the following steps until the volume of the cargo box to be loaded is less than the preset volume, to obtain the first loading plan for the first Nm trucks:

[0156] If the total volume of the cargo boxes to be loaded is greater than or equal to the preset volume, the target vehicle is determined; the preset volume is the sum of the volumes of m trucks with the largest current volume;

[0157] The packing scheme for the target vehicle is determined using the greedy algorithm and the tree search algorithm.

[0158] Optionally, when the first determining module 620 determines the packing scheme for the target vehicle using the greedy algorithm and the tree search algorithm, it is specifically used for:

[0159] Determine the packing method for the first container to be loaded and create the corresponding node;

[0160] Repeat the following steps until no new nodes are created, and obtain the packing plan for the target vehicle based on the currently created nodes:

[0161] Select the next cargo box to be loaded based on the available space of the target vehicle, determine the loading method of the currently selected cargo box, and create a corresponding node for each loading method. Multiple nodes created belong to the child nodes of the node corresponding to the previous cargo box to be loaded; the number of multiple nodes created is less than the search width.

[0162] Select the node with the highest priority from the multiple nodes of the currently selected cargo containers to be loaded.

[0163] Optionally, the apparatus further includes: a scoring calculation module, used for:

[0164] For each node, determine the total volume of wasted space, the average volume of loaded containers, and the component of the center coordinate of the loaded containers along a preset axis under the local packing scheme corresponding to that node.

[0165] The score for the node is obtained by weighted summing of the total volume of the wasted space, the average volume of the loaded cargo boxes, and the components of the center coordinates of the loaded cargo boxes along a preset axis.

[0166] The node with the highest or lowest priority is determined based on the score of each node; where the priority of a node is positively correlated with its score.

[0167] Optionally, the device further includes a segmentation module for:

[0168] When the target vehicle has available space to accommodate at least one cargo box, it is determined whether there is a first type of cargo box among the cargo boxes to be loaded; the first type of cargo box is a kit.

[0169] If there are first-type cargo boxes to be loaded, then stack several first-type cargo boxes to be loaded in the length and height directions of the cargo boxes to obtain a stacked complex block;

[0170] The complex block is placed in the available space. If the placement is successful, the complex block is designated as a child node of the node corresponding to the previous cargo box to be loaded. If the placement fails, the complex block is regenerated.

[0171] Optionally, the segmentation module is further configured to:

[0172] If there are no first-type cargo containers to be loaded, determine if there are second-type cargo containers to be loaded; the second-type cargo containers are loose parts.

[0173] If there are second-type cargo boxes to be loaded, stack several second-type cargo boxes to be loaded in the length and height directions of the cargo boxes to obtain a simple block after stacking;

[0174] The simple block is placed in the available space. If the placement is successful, the simple block is designated as a child node of the node corresponding to the previous cargo box to be loaded. If the placement fails, the simple block is regenerated.

[0175] Optionally, when determining at least one third packing scheme from the plurality of second packing schemes, the second determining module is specifically used for:

[0176] The space utilization rate and geometric center position of the cargo box are determined according to the placement method of the cargo box in each second packing scheme.

[0177] At least one third packing scheme is determined based on the space utilization rate and / or the geometric center position of the container; the third packing scheme is a second packing scheme in which the space utilization rate and / or the geometric center position of the container meets preset requirements.

[0178] The packing task processing apparatus provided in this application can execute the packing task processing method provided in any embodiment of this application, and has the corresponding functional modules and beneficial effects of the execution method.

[0179] Figure 7 This is a schematic diagram of the structure of a packing task processing device 70 provided in an embodiment of this application, as shown below. Figure 7 As shown, the packing task processing device includes a memory 710 and at least one processor 720.

[0180] The memory 710 stores computer-executed instructions;

[0181] The at least one processor 720 executes computer execution instructions stored in the memory 710, causing the at least one processor 720 to perform actions to implement this application. Figures 2 to 5 The corresponding embodiment provides a packing task processing method.

[0182] The memory 710 and the processor 720 are connected via a bus 730.

[0183] For relevant instructions, please refer to the corresponding text. Figures 2-5 The relevant descriptions and effects corresponding to the steps will be understood, and will not be elaborated on here.

[0184] This application also provides a readable storage medium storing execution instructions. When at least one processor of the air conditioning control device executes the execution instructions, the packing task processing method in the above embodiments is implemented.

[0185] This application also provides a program product including executable instructions stored in a readable storage medium. At least one processor of a packing task processing apparatus can read the executable instructions from the readable storage medium, and the at least one processor executes the executable instructions to cause the packing task processing apparatus to implement the packing task processing methods provided in the various embodiments described above.

[0186] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules 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 apparatuses or modules may be electrical, mechanical, or other forms.

[0187] The modules described as separate components may or may not be physically separate. Similarly, the components shown as modules may or may not be physical modules; they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected to achieve the purpose of this embodiment, depending on actual needs.

[0188] Furthermore, the functional modules in the various embodiments of this application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The integrated module can be implemented in hardware or in a combination of hardware and software functional modules.

[0189] The integrated modules implemented as software functional modules described above can be stored in a computer-readable storage medium. These software functional modules, stored in a storage medium, include several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute some steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0190] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of this application, and not to limit them; although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that the protection scope of this application is obviously not limited to these specific embodiments. Without departing from the principles of this application, those skilled in the art can make equivalent changes or substitutions to the relevant technical features, and the technical solutions after these changes or substitutions will all fall within the protection scope of this application.

Claims

1. A method of processing a boxing task, characterized by, The method comprises: obtaining a loading task information; the loading task information comprises: container information and truck information; determining a first loading scheme of the first N-m trucks according to the container information and the truck information through a greedy algorithm and a tree search algorithm, and obtaining a total volume of the remaining containers to be loaded corresponding to the first loading scheme; wherein N is the number of trucks required to load all containers; the N-m trucks are the N-m trucks with the largest volume that can be used at present; the tree search algorithm represents a tree search algorithm with a limited search width under a preset container placement rule; determining a plurality of truck combinations according to the total volume of the remaining containers to be loaded, each truck combination comprising m trucks, determining a plurality of second loading schemes corresponding to each truck combination through the tree search algorithm, and determining at least one third loading scheme from the plurality of second loading schemes; the third loading scheme is a loading scheme in the second loading scheme that meets a preset condition; wherein the sum of the volumes of the m trucks is greater than the total volume of the remaining containers to be loaded; combining at least one third loading scheme with the first loading scheme respectively to obtain at least one final loading scheme; and displaying the at least one final loading scheme to a user so that the user can select a loading scheme suitable for his own loading habit according to his needs. The container information comprises a total volume of containers to be loaded at present, and the truck information comprises the volumes of the trucks that can be used at present; the first loading scheme of the first N-m trucks is determined according to the container information and the truck information through a greedy algorithm and a tree search algorithm, comprising: repeating the following steps until the total volume of the containers to be loaded at present is less than a preset volume to obtain the first loading scheme of the first N-m trucks: if the total volume of the containers to be loaded at present is greater than or equal to the preset volume, determining a target vehicle; the preset volume is the sum of the volumes of the m trucks with the largest volume that can be used at present; and determining a loading scheme of the target vehicle through the greedy algorithm and the tree search algorithm; determining at least one third loading scheme from the plurality of second loading schemes, comprising: determining a space utilization rate and a geometric center position of the containers corresponding to each second loading scheme according to the placement mode of the containers in the second loading scheme; and determining at least one third loading scheme according to the space utilization rate and the geometric center position of the containers; the third loading scheme is a second loading scheme whose space utilization rate and geometric center position of the containers meet a preset requirement.

2. The method of claim 1, wherein, determining a loading scheme of the target vehicle through the greedy algorithm and the tree search algorithm, comprising: determining a loading mode of a first container to be loaded, and creating a corresponding node; repeating the following steps until there is no new node to obtain the loading scheme of the target vehicle according to the plurality of nodes created at present: selecting a next container to be loaded according to the available space of the target vehicle, determining a loading mode of the selected container to be loaded, and creating a corresponding node for each loading mode; the plurality of created nodes are child nodes of the node corresponding to the last container to be loaded; the number of the plurality of created nodes is less than the search width; selecting a node with the highest priority from the plurality of nodes of the selected container to be loaded.

3. The method of claim 2, wherein, The method further comprises: For each node, determining the total volume of wasted space, the average volume of loaded containers, and the component of the center coordinate of the loaded containers along the direction of the preset axis under the local container loading scheme corresponding to the node; Weighted summing the total volume of wasted space, the average volume of loaded containers, and the component of the center coordinate of the loaded containers along the direction of the preset axis to obtain the score of the node; Determining the node with the highest or lowest priority according to the score of each node; wherein the priority of the node is positively correlated with the score of the node.

4. The method of claim 2, wherein, The method further comprises: When the target vehicle has available space to accommodate at least one container, determining whether there is a first type of container among the containers to be loaded; the first type of container is a nested machine; If there is a first type of container to be loaded, stacking a plurality of first type of containers to be loaded in the length direction and the height direction of the container to obtain a stacked complex block; Placing the complex block in the available space, if the placement is successful, determining the complex block as a sub-node of the node corresponding to the last container to be loaded; if the placement is unsuccessful, regenerating the complex block.

5. The method of claim 4, wherein, The method further comprises: If there is no first type of container to be loaded, determining whether there is a second type of container to be loaded; the second type of container is a loose piece; If there is a second type of container to be loaded, stacking a plurality of second type of containers to be loaded in the length and height directions of the container to obtain a stacked simple block; Placing the simple block in the available space, if the placement is successful, determining the simple block as a sub-node of the node corresponding to the last container to be loaded; if the placement is unsuccessful, regenerating the simple block.

6. A case packing task processing apparatus characterized by comprising: The device comprises: An acquisition module configured to acquire container loading task information; the container loading task information comprises container information and truck information; A first determination module configured to determine a first container loading scheme of the first N-m trucks and obtain the total volume of the remaining containers to be loaded corresponding to the first container loading scheme according to the container information and the truck information by using a greedy algorithm and a tree search algorithm; wherein N is the number of trucks required to load all containers; the first N-m trucks are the N-m trucks with the largest volume that can be used at present; the tree search algorithm represents a tree search algorithm with a limited search width under a preset container placement rule; A second determination module configured to determine a plurality of truck combinations according to the total volume of the remaining containers to be loaded, each truck combination comprising m trucks, determine a plurality of second container loading schemes corresponding to each truck combination by using the tree search algorithm, and determine at least one third container loading scheme from the plurality of second container loading schemes; the third container loading scheme is a container loading scheme that meets a preset condition among the second container loading schemes; wherein the sum of the volumes of the m trucks is greater than the total volume of the remaining containers to be loaded; A combination module configured to combine at least one third container loading scheme with the first container loading scheme respectively to obtain at least one final container loading scheme, and display the at least one final container loading scheme to a user so that the user can select a container loading scheme suitable for his / her container loading habit according to his / her needs. The container information includes a total volume of containers to be loaded currently, and the truck information includes volumes of the trucks available currently; The first determining module is specifically configured to: Repeat the following steps until the total volume of the containers to be loaded currently is less than a preset volume, and obtain the first loading scheme of the first N-m trucks: if the total volume of the containers to be loaded currently is greater than or equal to the preset volume, determine a target truck; the preset volume is a sum of volumes of m trucks with the largest volumes currently; and determine the loading scheme of the target truck by using the greedy algorithm and the tree search algorithm; The second determining module is specifically configured to: Determine a space utilization and a geometric center position of the containers according to a placement manner of the containers in each second loading scheme; and determine at least one third loading scheme according to the space utilization and the geometric center position of the containers; the third loading scheme is a second loading scheme whose space utilization and geometric center position of the containers meet preset requirements.

7. A case packing task processing apparatus characterized by comprising: Comprise: a memory and at least one processor; The memory stores computer execution instructions; The at least one processor executes the computer execution instructions stored in the memory, so that the at least one processor executes the loading task processing method according to any one of claims 1-5.

8. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer execution instructions, and when the processor executes the computer execution instructions, the loading task processing method according to any one of claims 1-5 is realized.

Images