A sorting container information processing method, device, electronic device and storage medium

Abstract

The embodiments of the present invention are applicable to the field of logistics technology and provide a sorting container information processing method, device, electronic device and storage medium, wherein the sorting container information processing method includes: associating each picking task in a set task set with a corresponding first identifier; the first identifier represents a container for placing a delivery package corresponding to the picking task; all picking tasks in the set task set correspond to the same delivery site; based on all the determined first identifiers, the total volume of all containers corresponding to the set task set is determined; based on the total volume, at least one second identifier is determined; each second identifier of the at least one second identifier represents a transport vehicle used to transport all or part of the containers; establishing an association relationship between all the determined first identifiers and the at least one second identifier, so as to allocate corresponding transport vehicles to all containers corresponding to the set task set based on the association relationship.

Description

Technical Field

[0001] The present invention relates to the field of logistics technology, and in particular to a method, device, electronic device and storage medium for processing information of a sorting container. Background Art

[0002] In the related art, when processing picking tasks, the sorting center distributes the packages related to the picking tasks to the delivery stations according to the delivery addresses. In the related art, when the number of picking tasks increases sharply, there is a problem of untimely processing of picking tasks, which affects the processing timeliness of customer orders. Summary of the Invention

[0003] To solve the above problems, embodiments of the present invention provide a sorting container information processing method, device, electronic device, and storage medium to at least solve the problem in related technologies of untimely sorting task processing when the number of picking tasks surges.

[0004] The technical solution of the present invention is achieved as follows:

[0005] In a first aspect, an embodiment of the present invention provides a method for processing sorting container information, the method comprising:

[0006] Associating each picking task in the set task set with a corresponding first identifier; the first identifier represents a container for placing the delivery package corresponding to the picking task; all picking tasks in the set task set correspond to the same delivery station;

[0007] Determining the total volume of all containers corresponding to the set task set based on all determined first identifiers;

[0008] determining at least one second identifier based on the total volume; each second identifier of the at least one second identifier represents a transport vehicle used to transport all or part of the containers;

[0009] An association relationship is established between all the determined first identifiers and the at least one second identifier, so as to allocate corresponding transport vehicles to all containers corresponding to the set task set based on the association relationship.

[0010] In the above solution, determining the total volume of all containers corresponding to the set task set based on all determined first identifiers includes:

[0011] The total volume is determined based on a first volume, a second volume of the delivery packages corresponding to each picking task in the set task set, the number of all containers, and a first coefficient of each container in all containers; the first volume represents the capacity of each container in all containers; and the first coefficient represents the ratio of the total volume of all delivery packages placed in the container to the first volume.

[0012] In the above solution, the method further includes:

[0013] For all picking tasks received in the first time period, all the picking tasks are divided based on the delivery sites to obtain at least one task set; the set task set is any one of the at least one task set.

[0014] In the above solution, the method further includes:

[0015] Determine at least one node associated with a first container; one of the at least one node represents a delivery station that receives or ships the first container; the first container is a container in any one of the at least one node;

[0016] When any one of the at least one node receives or ships the first container, the inventory information of the first container in the at least one node is modified; the inventory information at least represents the transportation status of the first container.

[0017] In the above solution, the method further includes:

[0018] determining a first predicted value of a number of picking tasks received by at least one of the at least one nodes within a second time period;

[0019] determining a second predicted value of the total volume of all containers corresponding to the first predicted value;

[0020] Based on the second predicted value, a first number of containers required for the first predicted value is determined.

[0021] In the above solution, the method further includes:

[0022] Determining a second quantity; the second quantity represents an inventory quantity of the container in the corresponding node;

[0023] In the case where the second quantity is less than the first quantity, an early warning message is sent; the early warning message is used to prompt the corresponding node to replenish the inventory quantity of the container based on the first quantity.

[0024] In a second aspect, an embodiment of the present invention provides a method for processing sorting container information, the method comprising:

[0025] Determine at least one node associated with a first container; one of the at least one node represents a delivery station that receives or ships the first container; the first container is a container in any one of the at least one node; the container is used to place delivery packages corresponding to the picking task;

[0026] When any one of the at least one node receives or ships the first container, the inventory information of the first container in the at least one node is modified; the inventory information at least represents the transportation status of the first container.

[0027] In the above solution, the method further includes:

[0028] determining a first predicted value of a number of picking tasks received by at least one of the at least one nodes within a second time period;

[0029] determining a second predicted value of the total volume of all containers corresponding to the first predicted value;

[0030] Based on the second predicted value, a first number of containers required for the first predicted value is determined.

[0031] In the above solution, the method further includes:

[0032] Determining a second quantity; the second quantity represents an inventory quantity of the container in the corresponding node;

[0033] In the case where the second quantity is less than the first quantity, an early warning message is sent; the early warning message is used to prompt the corresponding node to replenish the inventory quantity of the container based on the first quantity.

[0034] In a third aspect, an embodiment of the present invention provides a sorting container information processing device, the device comprising:

[0035] a first associating module, configured to associate each picking task in a set task set with a corresponding first identifier; the first identifier represents a container for placing a delivery package corresponding to the picking task; and all picking tasks in the set task set correspond to the same delivery site;

[0036] A first determining module is configured to determine the total volume of all containers corresponding to the set task set based on all determined first identifiers;

[0037] A second determining module is configured to determine at least one second identifier based on the total volume; each second identifier in the at least one second identifier represents a transport vehicle used to transport all or part of the containers;

[0038] The second associating module is configured to establish an associative relationship between all the determined first identifiers and the at least one second identifier, so as to allocate corresponding transport vehicles to all the containers corresponding to the set task set based on the associative relationship.

[0039] In a fourth aspect, an embodiment of the present invention provides a sorting container information processing device, the device comprising:

[0040] A third determination module is configured to determine at least one node associated with a first container; one of the at least one nodes represents a delivery station that receives or ships the first container; the first container is a container in any one of the at least one nodes; the container is used to place delivery packages corresponding to the picking task;

[0041] The modification module is configured to modify inventory information of the first container in the at least one node when any one of the at least one node receives or ships the first container; the inventory information at least represents a transportation status of the first container.

[0042] In a fifth aspect, an embodiment of the present invention provides an electronic device comprising a processor and a memory, wherein the processor and the memory are connected to each other, wherein the memory is used to store a computer program, the computer program comprising program instructions, and the processor is configured to call the program instructions to execute the steps of the sorting container information processing method provided in the first aspect of the embodiment of the present invention.

[0043] In a sixth aspect, an embodiment of the present invention provides a computer-readable storage medium, comprising: the computer-readable storage medium storing a computer program. When the computer program is executed by a processor, the computer program implements the steps of the method for processing sorting container information provided in the first aspect of the embodiment of the present invention.

[0044] An embodiment of the present invention associates each picking task in a set of picking tasks with a corresponding first identifier, and based on all the determined first identifiers, determines the total volume of all containers corresponding to the set of picking tasks. Based on the total volume, at least one second identifier is determined, and an association is established between all the determined first identifiers and the at least one second identifier, so that corresponding transport vehicles are assigned to all containers corresponding to the set of picking tasks based on the association. The first identifier represents a container for placing the delivery parcel corresponding to the picking task, all picking tasks in the set of picking tasks correspond to the same delivery site, and each of the at least one second identifier represents a transport vehicle for transporting all or part of the containers. In an embodiment of the present invention, the delivery parcel corresponding to each picking task is placed in the container corresponding to the delivery site at the warehouse, thereby avoiding the time-consuming problem of delivery parcels passing through a sorting center. An association is also established between the container and the transport vehicle, and the container can be directly loaded into the corresponding transport vehicle based on the association, shortening the shipping time of the delivery parcel, improving the processing efficiency of the picking tasks, and thus shortening the processing time of customer orders. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 This is a schematic diagram of the implementation flow of a method for processing sorting container information provided by an embodiment of the present invention;

[0046] Figure 2 This is a schematic diagram of the implementation flow of another method for processing sorting container information provided by an embodiment of the present invention;

[0047] Figure 3 This is a schematic diagram of the implementation flow of another method for processing sorting container information provided by an embodiment of the present invention;

[0048] Figure 4 This is a schematic diagram of the implementation flow of another method for processing sorting container information provided by an embodiment of the present invention;

[0049] Figure 5 This is a schematic diagram of the implementation flow of a method for processing sorting container information provided by an embodiment of the present invention;

[0050] Figure 6 This is a schematic diagram of the implementation flow of another method for processing sorting container information provided by an embodiment of the present invention;

[0051] Figure 7 This is a schematic diagram of the implementation flow of another method for processing sorting container information provided by an embodiment of the present invention;

[0052] Figure 8 This is a schematic diagram of a sorting container information processing flow provided by an application embodiment of the present invention;

[0053] Figure 9This is a schematic diagram of a sorting container information processing flow provided by an application embodiment of the present invention;

[0054] Figure 10 is a schematic diagram of a sorting container information processing device provided by an embodiment of the present invention;

[0055] Figure 11 is a schematic diagram of a sorting container information processing device provided by an embodiment of the present invention;

[0056] Figure 12 FIG. 1 is a schematic diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0057] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. All other embodiments obtained by ordinary technicians in this field based on the embodiments of the present invention without making any creative efforts shall fall within the scope of protection of the present invention.

[0058] In related technologies, after a customer places an order on an e-commerce platform, the platform assigns a picking task to a warehouse near the customer's delivery address. For example, if the customer's order is for a location near Hubei or Hunan, the platform assigns the picking task to a warehouse in Central China. The warehouse then packages the goods for the picking task and sends them to the delivery station corresponding to the delivery address through logistics. The delivery station then makes the final delivery, delivering the package to the customer.

[0059] In related technologies, after warehouses produce delivery packages, all of them need to be sorted one by one by a sorting center. During special promotional events, such as Singles' Day (Singles' Day), warehouses receive a large number of picking tasks. The sorting center cannot process all of these delivery packages in a timely manner, which affects the processing time of customer orders.

[0060] In order to address the shortcomings of the above-mentioned related technologies, an embodiment of the present invention provides a method for processing sorting container information, which can at least improve the processing efficiency of picking tasks. To illustrate the technical solution of the present invention, a specific embodiment is provided below.

[0061] Figure 1 This is a schematic diagram of the implementation process of a sorting container information processing method provided by an embodiment of the present invention. The execution subject of the sorting container information processing method is an electronic device, which includes a desktop computer, a laptop computer, and a server. Figure 1 , the sorting container information processing method includes:

[0062] S101, each picking task in a set task set is associated with a corresponding first identifier; the first identifier represents a container for placing the delivery package corresponding to the picking task; all picking tasks in the set task set correspond to the same delivery site.

[0063] In one embodiment of the present invention, all picking tasks received in the first time period are divided based on the delivery sites to obtain at least one task set; the set task set is any one of the at least one task set.

[0064] For example, all picking tasks received during the first period could be all picking tasks issued by the e-commerce platform that the warehouse received that day. The warehouse then divides all picking tasks by delivery station, assigning picking tasks for the same delivery station to the same task set. For example, picking tasks for addresses within 5 kilometers of a delivery station could be grouped as picking tasks for the same delivery station. This way, at least one task set is generated based on the delivery station, and the picking tasks in each task set correspond to the same delivery station.

[0065] The set task set is any one of the at least one task set, and each picking task in the set task set is associated with a corresponding first identifier, where the first identifier represents a container for placing a delivery package corresponding to the picking task.

[0066] Here, the container is used to place the delivery package. For example, the container can be a transfer bag that can be recycled multiple times. After each delivery is completed, the container is recycled and reused. This not only reduces the cost of purchasing containers for the warehouse and is environmentally friendly, but also reduces the damage rate of delivery packages to a certain extent.

[0067] Each container has a first identifier printed on its outer surface. For example, the first identifier can be a barcode. Each container has a unique first identifier, and the first identifiers of each container are different. Delivery packages placed in the same container are assigned to the same delivery location. The delivery packages corresponding to all picking tasks in the set task set are placed in one or more containers, and the picking tasks associated with each container are recorded. Each picking task is associated with a corresponding first identifier. By reading the first identifier of a container, it is possible to determine which delivery packages corresponding to the picking tasks are placed in that container.

[0068] In practice, before picking, the warehouse first divides the picking tasks for the same delivery station into multiple task sets. During picking, the warehouse categorizes the delivery packages into multiple containers according to the task sets, placing only packages from the same delivery station in a container. The first identifier of the container is then associated with the picking task corresponding to the delivery package placed in the container. Since the delivery packages in a container all belong to the same delivery station, they are placed into the corresponding container at the warehouse, eliminating the time-consuming process of delivering packages through a sorting center. The sorting center only needs to sort the delivery packages in the container, eliminating the need to remove the delivery packages from the container for separate sorting, which improves sorting efficiency and accuracy.

[0069] S102: Determine the total volume of all containers corresponding to the set task set based on all determined first identifiers.

[0070] When the warehouse produces delivery packages corresponding to picking tasks, it measures the volume of each package and associates it with the corresponding picking task. This allows the first identifier to be used to determine the volume of all packages in the corresponding container, thereby obtaining the total volume of all packages in that container. By calculating the total volume of the packages in each container, the total volume of all containers corresponding to the set task set can be determined.

[0071] In one embodiment, determining the total volume of all containers corresponding to the set task set based on all determined first identifiers includes:

[0072] The total volume is determined based on a first volume, a second volume of the delivery packages corresponding to each picking task in the set task set, the number of all containers, and a first coefficient of each container in all containers; the first volume represents the capacity of each container in all containers; and the first coefficient represents the ratio of the total volume of all delivery packages placed in the container to the first volume.

[0073] Specifically, in practical applications, the total volume can be determined according to the following formula.

[0074]

[0075] Among them, k represents the identification of the warehouse, j represents the identification of the distribution station, V jk Indicates the total volume of all containers corresponding to the set task set, V ijk N represents the volume (second volume) of the delivery package corresponding to the i-th picking task in the set task set. The second volume can be measured by a volume measuring device; jk Indicates the number of all containers corresponding to the set task set, V0 represents the first volume, and the volume of each container is the same. tk represents the first coefficient, The first coefficient is the average value of the first coefficient for each container. α1 and α2 represent the influence coefficients. α1 represents the influence coefficient of the total volume of delivered packages, taking into account the effects of package stacking, irregular stacking, and package irregularities. α2 represents the influence coefficient of the number of containers.

[0076] Based on the above formula, the total volume of all containers corresponding to the set task set can be calculated.

[0077] S103 : Determine at least one second identifier based on the total volume; each second identifier in the at least one second identifier represents a transport vehicle used to transport all or part of the containers.

[0078] In practice, each warehouse has a delivery vehicle that transports and delivers packages. Information about the currently parked delivery vehicles, such as vehicle model, capacity, and number, is recorded in real time. After a delivery package is placed in a container, the delivery vehicle must transport all containers corresponding to a set task set to the same delivery station. Delivery vehicles range from large to medium-sized, and different models have varying capacities. To save transportation costs, it's important to maximize the utilization of the delivery vehicle's capacity.

[0079] Here, each transport vehicle has a unique second identifier. In one embodiment, each second identifier is associated with the transport capacity of the corresponding transport vehicle. This association information is recorded in a database to facilitate information query and retrieval. In this way, the transport capacity of the corresponding transport vehicle can be determined based on the second identifier, and the corresponding second identifier can also be queried based on the transport capacity.

[0080] At least one second identifier is determined based on the total volume, and the transport vehicle corresponding to the at least one second identifier transports all containers corresponding to the set task set to the delivery site. Specifically, in actual application, the total volume V jk The transport volume VC corresponding to vehicle model u u Determine which transport vehicles are to transport all containers corresponding to the set task set, ie, determine at least one second identifier.

[0081] The specific process includes:

[0082] In V jk When the transport volume is greater than or equal to the transport volume of the transport vehicle with the largest transport volume (vehicle model is max), the following judgment is made:

[0083] If V jk -wVC max ≥VC max , then record w+1 transport vehicles with the vehicle model of max; if V jk -wVCmax <VC max , then judge VC x <(V jk -wVC max ) <VC x+1 , then record one transport vehicle with model x+1. Here, x∈(1, 2, 3, ..., max). As the vehicle model number increases, the corresponding transport vehicle's transport capacity increases. Transport vehicles with the same model have the same transport capacity. In this way, a total of w+1 transport vehicles with model max and one transport vehicle with model x+1 are selected.

[0084] If V jk When the transport volume is less than or equal to the transport volume of the transport vehicle with the smallest transport volume (vehicle model is 1), a transport vehicle with vehicle model 1 is selected cumulatively.

[0085] If V jk When the transport volume is greater than the transport volume of the transport vehicle with the smallest transport volume (vehicle model is 1) and less than the transport volume of the transport vehicle with the largest transport volume (vehicle model is max), the VC x <V jk <VC x+1 , then a total of 1 transport vehicle with vehicle model x+1 is selected.

[0086] After determining the required vehicle model, since the vehicle volume of each vehicle model is known, each second identifier corresponds to a vehicle volume, and a single vehicle volume may correspond to multiple second identifiers. The corresponding second identifier is determined based on the vehicle volume. Based on the number of required vehicle models, the required number of second identifiers are selected from the determined second identifiers as at least one second identifier corresponding to the total volume. When selecting the required number of second identifiers from the determined second identifiers, it is necessary to exclude those already selected by other task sets and then select the required number of second identifiers from the remaining second identifiers, for example, by random selection.

[0087] Based on the above method, at least one second identifier corresponding to the total volume can be determined.

[0088] S104: establishing an association relationship between all the determined first identifiers and the at least one second identifier, so as to allocate corresponding transport vehicles to all the containers corresponding to the set task set based on the association relationship.

[0089] An association relationship is established between all the determined first identifiers and at least one second identifier, so that corresponding transport vehicles can be directly allocated to all containers corresponding to the set task set based on the above association relationship.

[0090] After the containers are placed in the transport vehicles, the containers placed in each transport vehicle are recorded, and the corresponding relationship between the picking task, the first identifier and the second identifier is recorded. In this way, it is possible to directly query which container the corresponding delivery package is in and which transport vehicle is transporting the delivery package based on the picking task.

[0091] An embodiment of the present invention associates each picking task in a set of picking tasks with a corresponding first identifier, and based on all the determined first identifiers, determines the total volume of all containers corresponding to the set of picking tasks. Based on the total volume, at least one second identifier is determined, and an association is established between all the determined first identifiers and the at least one second identifier, so that corresponding transport vehicles are assigned to all containers corresponding to the set of picking tasks based on the association. The first identifier represents a container for placing the delivery parcel corresponding to the picking task, all picking tasks in the set of picking tasks correspond to the same delivery site, and each of the at least one second identifier represents a transport vehicle for transporting all or part of the containers. In an embodiment of the present invention, the delivery parcel corresponding to each picking task is placed in the container corresponding to the delivery site at the warehouse, thereby avoiding the time-consuming problem of delivery parcels passing through a sorting center. An association is also established between the container and the transport vehicle, and the container can be directly loaded into the corresponding transport vehicle based on the association, shortening the shipping time of the delivery parcel, improving the processing efficiency of the picking tasks, and thus shortening the processing time of customer orders.

[0092] In actual applications, recyclable containers can be used in various transportation links of logistics, and the containers can be managed at the same time. For example, the transportation status of containers in the warehouse must be recorded. At the same time, it is also necessary to predict the container demand in the warehouse in the future, replenish container inventory in time, and ensure the balance of container demand.

[0093] refer to Figure 2 In one embodiment, the sorting container information processing method further includes:

[0094] S201, determining at least one node associated with a first container; one of the at least one node represents a delivery site that receives or ships the first container; the first container is a container in any one of the at least one node.

[0095] Here, one of the at least one nodes represents a delivery site that receives or ships the first container. The delivery site includes the shipping warehouse, receiving warehouse, and transit site for the first container. For example, if the first container is shipped from the first warehouse to the first delivery site, the at least one node associated with the first container includes the first warehouse and the first delivery site.

[0096] S202: When any one of the at least one node receives or ships the first container, modify the inventory information of the first container in the at least one node; the inventory information at least represents the transportation status of the first container.

[0097] When any one of the at least one nodes receives or ships the first container, the inventory information of the first container in the at least one node is modified. For example, if the at least one node associated with the first container includes a first warehouse and a first distribution site, after the warehouse ships the first container, the inventory information of the first container in the warehouse is modified to a "delivery in transit" state, where the "delivery in transit" state indicates that the first container is in the process of being shipped from the warehouse to the distribution site. Simultaneously, the inventory information of the first container in the distribution site is modified to a "in transit pending" state, where the "in transit pending" state indicates that the first container is in transit from the warehouse to the distribution site.

[0098] In actual applications, the transportation status of containers in the warehouse may include "in-warehouse maintenance", "normal in-warehouse", "in-transit out of warehouse", "in-transit waiting to be received" and "scrapped status", etc. The normal status in-warehouse indicates that the container can be used normally in the warehouse; the in-warehouse maintenance indicates that the corresponding container in the warehouse is damaged; the in-transit out of warehouse status means that after the container is shipped from the upstream node, it is marked as the in-transit out of warehouse status at the upstream node, indicating that the corresponding container is on the way from the upstream node to the downstream node; the in-transit waiting to be received status means that after the upstream node is shipped, the downstream node is marked as the in-transit waiting to be received status, indicating that the corresponding container is on the way from the upstream node to the downstream node; the scrapped status indicates that the corresponding container in the warehouse cannot be used.

[0099] For example, the upstream node can be a warehouse, and the downstream node can be a distribution site. After a container is shipped from the upstream node, one item is added to the upstream node's "Outbound In Transit" inventory category, and one item is added to the downstream node's "In Transit Pending In" inventory category. After downstream inspection, both the upstream node's "Outbound In Transit" and the downstream node's "In Transit Pending In" inventory are reduced by one, the upstream node's "Normal Inventory" is reduced by one, and the downstream node's "Normal Inventory" is increased by one.

[0100] By managing the containers in each link of logistics according to the above scheme, in addition to knowing the transportation status of the containers, the containers can also be recycled, saving logistics costs and avoiding the loss of containers.

[0101] refer to Figure 3 In one embodiment, the sorting container information processing method further includes:

[0102] S301: Determine a first predicted value of the number of picking tasks received by at least one node among at least one node in a second time period.

[0103] Here, at least one node is mainly aimed at each shipping warehouse under the e-commerce platform, and the second period is a certain time period in the future, such as determining the first predicted value of the first picking task quantity received by the Central China warehouse tomorrow.

[0104] Specifically, the number of picking tasks a node will receive during a certain time period in the future can be predicted based on the node's historical data. For example, if it is necessary to predict the number of picking tasks a first node will receive during an upcoming promotional holiday, the prediction can be made based on the number of picking tasks the first node received during promotional holidays last year and / or the year before. For example, a weighted calculation can be performed on the number of picking tasks the first node received during historical promotional holidays, and the resulting value can be used as the first predicted value for the number of picking tasks the first node will receive during the upcoming promotional holiday.

[0105] S302: Determine a second predicted value of the total volume of all containers corresponding to the first predicted value.

[0106] Based on the number of second picking tasks received in at least one third time period and the total volume of all corresponding containers, a second prediction value of the total volume of all containers corresponding to the first prediction value is determined.

[0107] Here, the third time period is a historical time period. According to the number of second picking tasks received in multiple third time periods and the total volume of all corresponding containers, the correspondence between the total volume and the number of picking tasks can be obtained. Here, the correspondence is a linear function. According to the correspondence, the second predicted value of the total volume of all containers corresponding to the first predicted value can be determined.

[0108] Specifically, in one embodiment, the correspondence between the total volume and the number of picking tasks can be expressed by an objective function:

[0109] Y tk =mX tk +n

[0110] Among them, k represents the identity of the warehouse, Y tk represents the total volume of all containers corresponding to the predicted day t (the second predicted value); X tk represents the predicted number of all picking tasks on day t (the first predicted value); m and n are the regression parameters of the above objective function.

[0111] Combining the least squares method to solve the regression parameters, the objective function is as follows:

[0112]

[0113] in, represents the total volume of all containers corresponding to the sth day (historical data), X skIndicates the number of second picking tasks on day s (historical data).

[0114] After solving the function, we get:

[0115]

[0116]

[0117] in, Represents the average number of second picking tasks within days 1-S (historical data); Represents the average value of the total volume of all containers corresponding to days 1-5 (historical data).

[0118] Through the above objective function, a second predicted value of the total volume of all containers corresponding to the first predicted value can be calculated.

[0119] S303: Determine a first quantity of containers required for the first predicted value based on the second predicted value.

[0120] After obtaining the second predicted value, the number of containers required to place the delivery packages corresponding to the first predicted value can be estimated based on the second predicted value. Specifically, the first number of containers required for the first predicted value can be determined based on the volume of each container and the second predicted value.

[0121] In one embodiment, determining a first quantity of containers required for the first predicted value based on the second predicted value includes:

[0122] The first quantity is determined based on the second predicted value, a first coefficient, and a first volume; the first coefficient is represented by the ratio of the total volume of all delivery packages placed in the container to the first volume; the first volume is the volume of each container, where the volume of all containers is the same, namely V0.

[0123] In practical applications, the first quantity can be determined according to the following objective function:

[0124]

[0125]

[0126]

[0127] Among them, N tk represents the first number of containers required on the predicted t day, represents the average value of the first coefficient up to the tth day, P tk represents the first coefficient of the t-th day, ∑ i V itkrepresents the total volume corresponding to the tth day, and V0 represents the capacity of the container.

[0128] Based on the above objective function, a first number of containers required for the first predicted value can be calculated.

[0129] refer to Figure 4 In the above embodiment, the sorting container information processing method further includes:

[0130] S401, determining a second quantity; the second quantity represents the inventory quantity of the container in the corresponding node.

[0131] Get the second quantity of the container in the corresponding node, that is, the inventory quantity of the container.

[0132] S402: When the second quantity is less than the first quantity, send an early warning message; the early warning message is used to prompt the corresponding node to replenish the inventory quantity of the container based on the first quantity.

[0133] Based on the predicted first quantity of containers, the system determines whether the container inventory at the corresponding node can meet the transportation demand. If the second quantity is less than the first quantity, an alert is sent, prompting the corresponding node to replenish container inventory based on the first quantity. For example, containers can be allocated from other nodes or a new batch of containers can be purchased.

[0134] By predicting the demand quantity of containers for a node in advance, the inventory quantity of containers in the corresponding node can be replenished in a timely manner to avoid affecting the processing time of customer orders due to insufficient container inventory. It can also control the inventory quantity of containers in the node and reduce the logistics costs of the warehouse.

[0135] Figure 5 This is a schematic diagram of the implementation process of a sorting container information processing method provided by an embodiment of the present invention. The execution subject of the sorting container information processing method is an electronic device, which includes a desktop computer, a laptop computer, and a server. Figure 5 , the sorting container information processing method includes:

[0136] S501, determining at least one node associated with a first container; one of the at least one node represents a delivery site that receives or ships the first container; the first container is a container in any one of the at least one node; the container is used to place delivery packages corresponding to the picking task.

[0137] Here, one of the at least one nodes represents a delivery site that receives or ships the first container. The delivery site includes the shipping warehouse, receiving warehouse, and transit site for the first container. For example, if the first container is shipped from the first warehouse to the first delivery site, the at least one node associated with the first container includes the first warehouse and the first delivery site.

[0138] S502: When any one of the at least one node receives or ships the first container, modify the inventory information of the first container in the at least one node; the inventory information at least represents the transportation status of the first container.

[0139] When any one of the at least one nodes receives or ships the first container, the inventory information of the first container in the at least one node is modified. For example, if the at least one node associated with the first container includes a first warehouse and a first distribution site, after the warehouse ships the first container, the inventory information of the first container in the warehouse is modified to a "delivery in transit" state, where the "delivery in transit" state indicates that the first container is in the process of being shipped from the warehouse to the distribution site. Simultaneously, the inventory information of the first container in the distribution site is modified to a "in transit pending" state, where the "in transit pending" state indicates that the first container is in transit from the warehouse to the distribution site.

[0140] refer to Figure 6 In one embodiment, the sorting container information processing method further includes:

[0141] S601: Determine a first predicted value of the number of picking tasks received by at least one node among at least one node in a second time period.

[0142] Here, at least one node is mainly aimed at each shipping warehouse under the e-commerce platform, and the second period is a certain time period in the future, such as determining the first predicted value of the first picking task quantity received by the Central China warehouse tomorrow.

[0143] Specifically, the number of picking tasks a node will receive during a certain time period in the future can be predicted based on the node's historical data. For example, if it is necessary to predict the number of picking tasks a first node will receive during an upcoming promotional holiday, the prediction can be made based on the number of picking tasks the first node received during promotional holidays last year and / or the year before. For example, a weighted calculation can be performed on the number of picking tasks the first node received during historical promotional holidays, and the resulting value can be used as the first predicted value for the number of picking tasks the first node will receive during the upcoming promotional holiday.

[0144] S602: Determine a second predicted value of the total volume of all containers corresponding to the first predicted value.

[0145] Based on the number of second picking tasks received in at least one third time period and the total volume of all corresponding containers, a second prediction value of the total volume of all containers corresponding to the first prediction value is determined.

[0146] Here, the third time period is a historical time period. According to the number of second picking tasks received in multiple third time periods and the total volume of all corresponding containers, the correspondence between the total volume and the number of picking tasks can be obtained. Here, the correspondence is a linear function. According to the correspondence, the second predicted value of the total volume of all containers corresponding to the first predicted value can be determined.

[0147] Specifically, in one embodiment, the correspondence between the total volume and the number of picking tasks can be expressed by an objective function:

[0148] Y tk =mX tk +n

[0149] Among them, k represents the identity of the warehouse, Y tk represents the total volume of all containers corresponding to the predicted day t (the second predicted value); X tk represents the predicted number of all picking tasks on day t (the first predicted value); m and n are the regression parameters of the above objective function.

[0150] Combining the least squares method to solve the regression parameters, the objective function is as follows:

[0151]

[0152] in, represents the total volume of all containers corresponding to the sth day (historical data), X sk Indicates the number of second picking tasks on day s (historical data).

[0153] After solving the function, we get:

[0154]

[0155]

[0156] in, Represents the average number of second picking tasks within days 1-S (historical data); Represents the average value of the total volume of all containers corresponding to days 1-5 (historical data).

[0157] Through the above objective function, a second predicted value of the total volume of all containers corresponding to the first predicted value can be calculated.

[0158] S603: Determine a first quantity of containers required for the first predicted value based on the second predicted value.

[0159] After obtaining the second predicted value, the number of containers required to place the delivery packages corresponding to the first predicted value can be estimated based on the second predicted value. Specifically, the first number of containers required for the first predicted value can be determined based on the volume of each container and the second predicted value.

[0160] In one embodiment, determining a first quantity of containers required for the first predicted value based on the second predicted value includes:

[0161] The first quantity is determined based on the second predicted value, a first coefficient, and a first volume; the first coefficient is represented by the ratio of the total volume of all delivery packages placed in the container to the first volume; the first volume is the volume of each container, where the volume of all containers is the same, namely V0.

[0162] In practical applications, the first quantity can be determined according to the following objective function:

[0163]

[0164]

[0165]

[0166] Among them, N tk represents the first number of containers required on the predicted t day, represents the average value of the first coefficient up to the tth day, P tk represents the first coefficient of the t-th day, ∑ i V itk represents the total volume corresponding to the tth day, and V0 represents the capacity of the container.

[0167] Based on the above objective function, a first number of containers required for the first predicted value can be calculated.

[0168] refer to Figure 7 In one embodiment, the sorting container information processing method further includes:

[0169] S701, determine a second quantity; the second quantity represents the inventory quantity of the container in the corresponding node.

[0170] Get the second quantity of the container in the corresponding node, that is, the inventory quantity of the container.

[0171] S702: When the second quantity is less than the first quantity, send an early warning message; the early warning message is used to prompt the corresponding node to replenish the inventory quantity of the container based on the first quantity.

[0172] Based on the predicted first quantity of containers, the system determines whether the container inventory at the corresponding node can meet the transportation demand. If the second quantity is less than the first quantity, an alert is sent, prompting the corresponding node to replenish container inventory based on the first quantity. For example, containers can be allocated from other nodes or a new batch of containers can be purchased.

[0173] By predicting the demand quantity of containers for a node in advance, the inventory quantity of containers in the corresponding node can be replenished in a timely manner to avoid affecting the processing time of customer orders due to insufficient container inventory. It can also control the inventory quantity of containers in the node and reduce the logistics costs of the warehouse.

[0174] refer to Figure 8 , Figure 8 This is a schematic diagram of a process for sorting container information processing provided by an application embodiment of the present invention. The process for sorting container information processing includes:

[0175] First, based on the delivery addresses corresponding to the picking tasks, the picking tasks are divided according to the delivery sites, and the picking tasks for the same delivery site are grouped into the same task set. This results in at least one task set, which is defined as a task set within the at least one task set. Then, a picking operator picks the ordered items from the same delivery site and hands them over to a packing operator for packing. The resulting delivery packages are then volume-measured and labeled. The packing operator places the delivery packages into at least one container according to the delivery sites. All delivery packages in a container belong to the same delivery site, and the association between the first identifier of the container and the picking tasks corresponding to the delivery packages in the container is recorded. The container containing the delivery packages is then sealed and placed into an automatic sorting device. Based on all determined first identifiers, the automatic sorting device determines the total volume of all containers corresponding to the set task set. Based on the total volume, the automatic sorting device determines at least one second identifier, and establishes an association between all determined first identifiers and the at least one second identifier. Based on the association, the automatic sorting device sorts all containers corresponding to the set task set to corresponding transport vehicles.

[0176] refer to Figure 9 , Figure 9 This is a schematic diagram of a process for sorting container information processing provided by an application embodiment of the present invention. The process for sorting container information processing includes:

[0177] S901: Divide all picking tasks according to distribution sites to obtain at least one task set.

[0178] The picking tasks in the same task set correspond to the same distribution sites.

[0179] S902: Pick the goods corresponding to the picking task according to the task set.

[0180] For example, for a set task set, the commodities corresponding to the picking tasks in the set task set are picked out.

[0181] S903: Pack and measure the volume of the picked goods.

[0182] The goods are packaged and packed in courier bags or courier boxes to obtain delivery packages, and the volume of the packaged delivery packages is measured.

[0183] S904: Associate the picking task with the first identifier of the container.

[0184] Each picking task in the set task set is associated with a corresponding first identifier; the first identifier represents a container for placing the delivery package corresponding to the picking task.

[0185] S905, placing the delivery package into the associated container.

[0186] When placing delivery packages into associated containers, if there are many packages, a single container may not be able to hold all the packages corresponding to the set task set. In this embodiment of the present invention, delivery packages are loaded starting with the first container. Once the first container is full, the second container is used to load delivery packages, continuing until all packages corresponding to the set task set have been loaded into the containers. In this case, if the last container cannot be filled, no more delivery packages will be added to it. The containers are then sealed so that all delivery packages in the same container correspond to the same delivery destination.

[0187] S906: Encapsulate the container.

[0188] S907: Determine the total volume of all containers corresponding to the set task set.

[0189] S908: Determine at least one second identifier based on the total volume.

[0190] Each second identifier of the at least one second identifier represents a transport vehicle used to transport all or part of the containers.

[0191] S909: Establish an association relationship between all the determined first identifiers and at least one second identifier.

[0192] S910: Allocate corresponding transport vehicles to all containers corresponding to the set task set based on the association relationship.

[0193] In this application embodiment, the warehouse directly places the delivery packages corresponding to each picking task into the container corresponding to the delivery station, thus avoiding the time-consuming process of delivering packages through the sorting center. Furthermore, an association is established between the containers and transport vehicles, and the containers can be directly loaded into the corresponding transport vehicles based on this association. This shortens the delivery time of the delivery packages, improves the processing efficiency of picking tasks, and thus reduces the processing time of customer orders.

[0194] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.

[0195] It will be understood that when used in this specification and the appended claims, the terms “comprises” and “comprising” indicate the presence of described features, integers, steps, operations, elements and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof.

[0196] It should be noted that the technical solutions described in the embodiments of the present invention can be arbitrarily combined without conflict.

[0197] In addition, in the embodiments of the present invention, “first”, “second”, etc. are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0198] refer to Figure 10 , Figure 10 Schematic diagram of a sorting container information processing device provided by an embodiment of the present invention, such as Figure 10 As shown, the device includes: a first associating module, a first determining module, a second determining module and a second associating module.

[0199] a first associating module, configured to associate each picking task in a set task set with a corresponding first identifier; the first identifier represents a container for placing a delivery package corresponding to the picking task; and all picking tasks in the set task set correspond to the same delivery site;

[0200] A first determining module is configured to determine the total volume of all containers corresponding to the set task set based on all the determined first identifiers;

[0201] A second determining module is configured to determine at least one second identifier based on the total volume; each second identifier in the at least one second identifier represents a transport vehicle used to transport all or part of the containers;

[0202] The second associating module is configured to establish an associative relationship between all the determined first identifiers and the at least one second identifier, so as to allocate corresponding transport vehicles to all the containers corresponding to the set task set based on the associative relationship.

[0203] The first determining module is specifically configured to:

[0204] The total volume is determined based on a first volume, a second volume of the delivery packages corresponding to each picking task in the set task set, the number of all containers, and a first coefficient of each container in all containers; the first volume represents the capacity of each container in all containers; and the first coefficient represents the ratio of the total volume of all delivery packages placed in the container to the first volume.

[0205] The device further comprises:

[0206] The division module is used to divide all the picking tasks received in the first time period based on the distribution site to obtain at least one task set; the set task set is any one of the at least one task set.

[0207] The device further comprises:

[0208] a node determination module, configured to determine at least one node associated with a first container; wherein one of the at least one node represents a delivery station for receiving or delivering the first container; and the first container is a container in any one of the at least one node;

[0209] The inventory modification module is configured to modify inventory information of the first container in the at least one node when any one of the at least one node receives or ships the first container; the inventory information at least represents a transportation status of the first container.

[0210] The device further comprises:

[0211] a first prediction module, configured to determine a first prediction value of a number of picking tasks received by at least one of the at least one node within a second time period;

[0212] a second prediction module, configured to determine a second prediction value of the total volume of all containers corresponding to the first prediction value;

[0213] A third prediction module is configured to determine a first quantity of containers required for the first prediction value based on the second prediction value.

[0214] The device further comprises:

[0215] An inventory determination module, configured to determine a second quantity; the second quantity represents the inventory quantity of the container in the corresponding node;

[0216] The sending module is used to send an early warning message when the second quantity is less than the first quantity; the early warning message is used to prompt the corresponding node to replenish the inventory quantity of the container based on the first quantity.

[0217] refer to Figure 11 , Figure 11 Schematic diagram of a sorting container information processing device provided by an embodiment of the present invention, such as Figure 11 As shown, the device includes: a third determining module and a modifying module.

[0218] A third determination module is configured to determine at least one node associated with a first container; one of the at least one nodes represents a delivery station that receives or ships the first container; the first container is a container in any one of the at least one nodes; the container is used to place delivery packages corresponding to the picking task;

[0219] The modification module is configured to modify inventory information of the first container in the at least one node when any one of the at least one node receives or ships the first container; the inventory information at least represents a transportation status of the first container.

[0220] In actual application, the first association module, the first determination module, the second determination module and the second association module can be implemented by a processor in an electronic device, such as a central processing unit (CPU), a digital signal processor (DSP), a microcontroller unit (MCU) or a programmable gate array (FPGA).

[0221] It should be noted that the aforementioned embodiments of the sorting container information processing device, when performing sorting container information processing, illustrate the division of the aforementioned modules only as an example. In actual applications, the aforementioned processing can be distributed among different modules as needed, i.e., the internal structure of the device can be divided into different modules to complete all or part of the aforementioned processing. Furthermore, the sorting container information processing device and the sorting container information processing method embodiments provided in the aforementioned embodiments share the same concept. The specific implementation process is detailed in the method embodiments and will not be further elaborated here.

[0222] Based on the hardware implementation of the above program modules, and in order to implement the method of the embodiment of the present application, the embodiment of the present application also provides an electronic device. Figure 12 This is a schematic diagram of the hardware structure of the electronic device according to the embodiment of the present application. Figure 12 As shown, the electronic equipment includes:

[0223] Communication interface, capable of exchanging information with other devices such as network equipment;

[0224] The processor is connected to the communication interface to implement information exchange with other devices and is used to execute the methods provided by one or more technical solutions on the electronic device side when running a computer program. The computer program is stored in the memory.

[0225] Of course, in actual applications, the various components in the electronic device are coupled together through a bus system. It is understood that the bus system is used to achieve connection and communication between these components. In addition to the data bus, the bus system also includes a power bus, a control bus, and a status signal bus. However, for the sake of clarity, Figure 12 Various buses are labeled as bus systems.

[0226] The memory in the embodiments of the present application is used to store various types of data to support the operation of the electronic device. Examples of such data include: any computer program used to operate on the electronic device.

[0227] It is understood that the memory can be volatile memory or non-volatile memory, or can include both volatile and non-volatile memory. Among them, non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), magnetic random access memory (FRAM), flash memory, magnetic surface memory, optical disk, or compact disc read-only memory (CD-ROM); magnetic surface memory can be magnetic disk memory or tape memory. Volatile memory can be random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), synchronous static random access memory (SSRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct rambus random access memory (DRRAM).The memory 130 described in the embodiments of the present application is intended to include, but is not limited to, these and any other suitable types of memories.

[0228] The methods disclosed in the above embodiments of the present application can be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. During implementation, the steps of the above methods can be completed by hardware integrated logic circuits in the processor or instructions in software form. The above processor may be a general-purpose processor, a DSP, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The processor can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in the embodiments of the present application can be directly embodied as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium, which is located in a memory. The processor reads the program in the memory and completes the steps of the above methods in combination with its hardware.

[0229] Optionally, when the processor executes the program, it implements the corresponding processes implemented by the electronic device in each method of the embodiments of the present application, which will not be described here for the sake of brevity.

[0230] In an exemplary embodiment, the present application also provides a storage medium, namely, a computer storage medium, specifically a computer-readable storage medium, including, for example, a first memory storing a computer program, wherein the computer program can be executed by a processor of an electronic device to perform the steps of the aforementioned method. The computer-readable storage medium can be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface storage, optical disk, or CD-ROM.

[0231] In the several embodiments provided in this application, it should be understood that the disclosed devices, electronic devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as: multiple units or components can be combined, or can be integrated into another system, or some features can be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical or other forms.

[0232] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0233] In addition, all functional units in the embodiments of the present application can be integrated into one processing unit, or each unit can be a separate unit, or two or more units can be integrated into one unit; the above-mentioned integrated units can be implemented in the form of hardware or in the form of hardware plus software functional units.

[0234] Those skilled in the art will understand that all or part of the steps of implementing the above-mentioned method embodiment can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps of the above-mentioned method embodiment; and the aforementioned storage medium includes: mobile storage devices, ROM, RAM, disks or optical disks, etc. Various media that can store program codes.

[0235] Alternatively, if the above-mentioned integrated unit of the present application is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium and includes a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROM, RAM, magnetic disks or optical disks.

[0236] It should be noted that the technical solutions described in the embodiments of the present application can be combined arbitrarily without conflict.

[0237] In addition, in the examples of this application, "first", "second", etc. are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0238] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A method for processing sorting container information, characterized in that: The method comprises: Associating each picking task in a set task set with a corresponding first identifier; the first identifier represents a container for placing delivery packages corresponding to the picking task; all picking tasks in the set task set correspond to the same delivery site; the set task set includes all picking tasks corresponding to the delivery site received within a first time period; the delivery packages include packages produced after packaging the goods corresponding to the picking tasks, and delivery packages placed in the same container correspond to the same delivery site; Determining the total volume of all containers corresponding to the set task set based on all determined first identifiers; Determining at least one second identifier based on the total volume; each of the at least one second identifier represents a transport vehicle used to transport all or part of the containers; all containers corresponding to the set task set are transported to the delivery site by the transport vehicle corresponding to the at least one second identifier; Establishing an association relationship between all the determined first identifiers and the at least one second identifier, so as to sort all the containers corresponding to the set task set at the sorting center based on the association relationship and load them into corresponding transport vehicles; wherein, The determining of at least one second identifier based on the total volume includes: Determining, based on the total volume and the transport capacity corresponding to at least one vehicle model, at least one vehicle model capable of transporting all the containers and the number of vehicles corresponding to each vehicle model; the vehicle model being the model corresponding to all vehicles capable of transporting containers at the delivery station; At least one second identifier is determined based on the vehicle model and the number of vehicles, each second identifier being associated with a transport volume of the transport vehicle.

2. The method according to claim 1, characterized in that The determining, based on all the determined first identifiers, the total volume of all containers corresponding to the set task set includes: The total volume is determined based on a first volume, a second volume of the delivery packages corresponding to each picking task in the set task set, the number of all containers, and a first coefficient of each container in all containers; the first volume represents the capacity of each container in all containers; and the first coefficient represents the ratio of the total volume of all delivery packages placed in the container to the first volume.

3. The method according to claim 1, characterized in that The method further comprises: For all picking tasks received in the first time period, all the picking tasks are divided based on the delivery sites to obtain at least one task set; the set task set is any one of the at least one task set.

4. The method according to claim 1, wherein The method further comprises: Determine at least one node associated with a first container; one of the at least one node represents a delivery station that receives or ships the first container; the first container is a container in any one of the at least one node; When any one of the at least one node receives or ships the first container, the inventory information of the first container in the at least one node is modified; the inventory information at least represents the transportation status of the first container.

5. The method according to claim 4, characterized in that The method further comprises: determining a first predicted value of a number of picking tasks received by at least one of the at least one nodes within a second time period; determining a second predicted value of the total volume of all containers corresponding to the first predicted value; Based on the second predicted value, a first number of containers required for the first predicted value is determined.

6. The method according to claim 5, characterized in that The method further comprises: Determining a second quantity; the second quantity represents an inventory quantity of the container in the corresponding node; In the case where the second quantity is less than the first quantity, an early warning message is sent; the early warning message is used to prompt the corresponding node to replenish the inventory quantity of the container based on the first quantity.

7. A sorting container information processing device, characterized in that: include: A first associating module, configured to associate each picking task in a set task set with a corresponding first identifier; The first identifier represents a container for placing delivery packages corresponding to the picking tasks; all picking tasks in the set task set correspond to the same delivery site; the set task set includes all picking tasks corresponding to the delivery site received within a first time period; the delivery packages include packages produced after packaging the goods corresponding to the picking tasks, and the delivery packages placed in the same container correspond to the same delivery site; A first determining module is configured to determine the total volume of all containers corresponding to the set task set based on all determined first identifiers; A second determining module is configured to determine at least one second identifier based on the total volume; each second identifier in the at least one second identifier represents a transport vehicle used to transport all or part of the containers; All containers corresponding to the set task set are transported to the delivery site by the transport vehicle corresponding to the at least one second identifier; The second association module is configured to establish an association relationship between all the determined first identifiers and the at least one second identifier, so as to sort all the containers corresponding to the set task set at the sorting center based on the association relationship and load them into corresponding transport vehicles; wherein, The second determination module is specifically used to determine at least one vehicle model capable of transporting all the containers and the number of vehicles corresponding to each vehicle model based on the total volume and the transport volume corresponding to at least one vehicle model; the vehicle model is the model corresponding to all vehicles capable of transporting containers at the distribution site; based on the vehicle model and the number of vehicles, at least one second identifier is determined, and each second identifier is associated with the transport volume of the transport vehicle.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the sorting container information processing method according to any one of claims 1 to 6 is implemented.

9. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, wherein the computer program includes program instructions, and when the program instructions are executed by a processor, the processor executes the sorting container information processing method according to any one of claims 1 to 6.

Images