Express mail sorting method, device, equipment and storage medium

Abstract

The present application discloses a method, device, equipment and storage medium for express mail sorting, the method comprising obtaining historical sorting data within a predetermined time period; counting the quantity and frequency of each sorting flow in the historical sorting data at each time granularity in the predetermined time period; determining the bottom-line index of each sorting flow according to the quantity and frequency of each sorting flow, and sorting each sorting flow according to the size of the bottom-line index; selecting a bottom-line number of sorting flows from the sorting according to the minimum value of the bottom-line index and assigning them to the same bottom-line grid. The above scheme concentrates the uncertainty risk of the flow direction, does not need to assign a unique grid to each flow direction, improves the resource utilization of the sorting equipment, and thus reduces the demand for equipment.

Description

Technical Field

[0001] The present invention relates to the field of logistics technology, and in particular to express mail sorting methods, devices, equipment and storage media. Background Art

[0002] With the development of society, consumers nowadays tend to shop online. The increase in online shopping has directly led to a large increase in express parcels and the rapid development of the express industry. Some domestic parcel sorting transfer stations generally use sorting machines to sort a large number of express parcels. When sorting express parcels, the transfer station will follow a certain sorting plan, and each grid of the sorting equipment is responsible for sorting the parcels in its coverage direction.

[0003] However, due to the huge differences in the volume and frequency of express parcels in different directions, some directions have a large volume and a high frequency of express parcels, while some directions have a small volume and a low frequency of express parcels. For sorting equipment, if the covered flow does not appear, the corresponding sorting grid will be vacant, resulting in reduced sorting efficiency and waste of resources. Summary of the invention

[0004] In view of the above-mentioned defects or deficiencies in the prior art, it is desired to provide a parcel sorting method, device, equipment and storage medium to solve the problem in the prior art that each sorting flow direction is assigned a sorting grid, resulting in vacant sorting grids and causing waste of resources.

[0005] In a first aspect, an embodiment of the present application provides a method for sorting express mails, the method comprising:

[0006] Obtain historical sorting data within a predetermined time period;

[0007] Counting the number and frequency of each sorting flow direction in the historical sorting data at each time granularity in the predetermined time period;

[0008] Determine the bottom-line index of each sorting flow direction according to the quantity of each piece and the frequency of each sorting flow direction, and sort the sorting flow directions according to the size of the bottom-line index;

[0009] A minimum value of the bottom-line index is selected from the sorting to allocate a bottom-line number of sorting flows to the same bottom-line grid.

[0010] Furthermore, the bottom-line number is the maximum m value that satisfies the following relationship:

[0011]

[0012]

[0013] Among them, F ijis the frequency corresponding to the jth time granularity of the ith sorting flow direction, a is the number of slots of the sorting cabinet corresponding to the bottom slot, c is the slot magnification coefficient of the sorting cabinet, C ij is the number of pieces corresponding to the jth time granularity of the ith sorting flow direction, b is the sorting efficiency of the sorting cabinet, and d is the sorting efficiency coefficient of the compartment cabinet.

[0014] Furthermore, the bottom line index is determined according to the following relationship:

[0015]

[0016] Among them, I i is the bottom line index of the i-th sorting flow direction, C ij is the number of pieces corresponding to the jth time granularity of the i-th sorting flow direction, F ij is the frequency corresponding to the jth time granularity of the i-th sorting flow direction.

[0017] Furthermore, the objects sorted in the bottom compartment are sorted a second time, and the second time sorting includes:

[0018] The sorting flow directions of the sorting objects are scanned in sequence, and each sorting flow direction is assigned a secondary sorting grid. When any secondary sorting grid reaches the maximum load, the sorting objects in the secondary sorting grid that has reached the maximum load are cleared, and the current sorting flow direction obtained by scanning and different from other sorting flow directions is assigned to the cleared secondary sorting grid.

[0019] Furthermore, the secondary sorting includes:

[0020] The sorting flow directions of the objects to be sorted are scanned in sequence, and each sorting flow direction is assigned a secondary sorting grid. When the Nth sorting flow direction is currently scanned and N is greater than the total number of secondary sorting grids of the sorting cabinet, any secondary sorting grid is cleared, and the Nth sorting flow direction is assigned to the cleared secondary sorting grid.

[0021] In a second aspect, the present invention provides an express mail sorting device, the device comprising:

[0022] An acquisition unit, used for acquiring historical sorting data within a predetermined time period;

[0023] A statistical unit, used for counting the number and frequency of each sorting flow direction in the historical sorting data at each time granularity in the predetermined time period;

[0024] A sorting flow direction sorting unit, used to determine the bottom-line index of each sorting flow direction according to the quantity and frequency of each piece on each sorting flow direction, and sort the sorting flow directions according to the size of the bottom-line index;

[0025] The allocation unit is used to select a minimum value of the bottom-line index from the sorting and allocate them to the same bottom-line grid.

[0026] Furthermore, it also includes:

[0027] The bottom-line number calculation unit is used to determine the maximum m value that satisfies the following relationship as the bottom-line number,

[0028]

[0029]

[0030] Among them, F ij is the frequency corresponding to the jth time granularity of the ith sorting flow direction, a is the number of slots of the sorting cabinet corresponding to the bottom slot, c is the slot magnification coefficient of the sorting cabinet, C ij is the number of pieces corresponding to the jth time granularity of the ith sorting flow direction, b is the sorting efficiency of the sorting cabinet, and d is the sorting efficiency coefficient of the compartment cabinet.

[0031] Furthermore, it also includes:

[0032] The bottom-line index calculation unit is used to determine the bottom-line index according to the following relationship:

[0033]

[0034] Among them, I i is the bottom line index of the i-th sorting flow direction, C ij is the number of pieces corresponding to the jth time granularity of the i-th sorting flow direction, F ij is the frequency corresponding to the jth time granularity of the i-th sorting flow direction.

[0035] Furthermore, it also includes:

[0036] The secondary sorting unit is used to scan and obtain the sorting flow directions of the sorting objects in sequence, and each sorting flow direction is assigned a secondary sorting grid. When any secondary sorting grid reaches the maximum load capacity, the sorting objects in the secondary sorting grid that has reached the maximum load capacity are cleared, and the current sorting flow direction obtained by scanning and different from other sorting flow directions is assigned to the cleared secondary sorting grid.

[0037] Furthermore, it also includes:

[0038] The secondary sorting unit is used to scan and obtain the sorting flow directions of the objects to be sorted in sequence, and each sorting flow direction is assigned a secondary sorting grid. When the Nth sorting flow direction is currently scanned and N is greater than the total number of secondary sorting grids in the sorting cabinet, any secondary sorting grid is cleared, and the Nth sorting flow direction is assigned to the cleared secondary sorting grid.

[0039] In a third aspect, the present invention provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above method when executing the computer program.

[0040] In a fourth aspect, the present invention provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the above method when executed by a processor.

[0041] The above scheme sorts the sorting flows according to the size of the bottom-line index determined by the quantity and frequency corresponding to each time granularity of each sorting flow, and selects the bottom-line number of sorting flows from the sorting with the minimum value of the bottom-line index and allocates them to the same bottom-line grid. That is, the sorting flows with small quantity and low frequency are unified to the same grid, which concentrates the uncertainty risk of the flow. There is no need to allocate a unique grid for each flow, which improves the resource utilization of the sorting equipment and reduces the demand for equipment. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Other features, objects and advantages of the present application will become more apparent by reading the detailed description of non-limiting embodiments made with reference to the following drawings:

[0043] Figure 1 A schematic diagram of a flow chart of a method for sorting express mail provided in an embodiment of the present invention;

[0044] Figure 2 A schematic diagram of the principle of an express mail sorting device provided in an embodiment of the present invention;

[0045] Figure 3 A schematic diagram of the principle of an express mail sorting device provided by another embodiment of the present invention;

[0046] Figure 4 A schematic diagram of the principle of an express mail sorting device provided in yet another embodiment of the present invention;

[0047] Figure 5 A schematic diagram of the structure of a computer system suitable for implementing a reservation device in an embodiment of the present application is shown. DETAILED DESCRIPTION

[0048] The present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the relevant invention, rather than to limit the invention. It is also necessary to explain that, for ease of description, only the parts related to the invention are shown in the accompanying drawings.

[0049] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0050] Please refer to Figure 1 , Figure 1 A flow chart of the express mail sorting method provided in an embodiment of the present application is shown.

[0051] like Figure 1 As shown, the method includes:

[0052] S1: Obtain historical sorting data within a predetermined time period;

[0053] In the embodiment of the present application, the method of obtaining the historical sorting quantity within a predetermined time period can be, for example, directly obtained from the transfer field service center, or transmitted through the network, or transferred through other transfer servers. The historical sorting data at least includes the sorting flow direction and sorting time of the sorting object.

[0054] The predetermined time period may be, but is not limited to, 30 days, 60 days, 90 days, etc.

[0055] S2: Counting the number and frequency of each sorting flow direction in the historical sorting data at each time granularity in the predetermined time period;

[0056] After obtaining the historical sorting data, the sorting flow directions are counted to obtain the number of sorting flow directions in the historical sorting data and which sorting flow directions they are. The predetermined time period is divided into multiple time periods, each time period is a time granularity, and the corresponding quantity C and frequency F of each sorting flow direction in each time granularity are counted.

[0057] For example, the scheduled time period is 30 days and the time granularity is 1 day. When the sorting equipment has been sorting for 30 days, the total number of sorting flows in these 30 days, the number of sorting objects corresponding to each time granularity in each sorting flow and the frequency of occurrence are counted.

[0058] The quantity and frequency of each sorting flow in the corresponding time granularity are shown in the following table:

[0059] Quantity <![CDATA[T1]]> <![CDATA[T2]]> … <![CDATA[T n ]]> frequency <![CDATA[T1]]> <![CDATA[T2]]> … <![CDATA[T n ]]> <![CDATA[D1]]> <![CDATA[C 11 ]]> <![CDATA[C 12 ]]> … <![CDATA[C 1n ]]> <![CDATA[D1]]> <![CDATA[F 11 ]]> <![CDATA[F 12 ]]> … <![CDATA[F 1n ]]> <![CDATA[D2]]> <![CDATA[C 21 ]]> <![CDATA[C 22 ]]> … <![CDATA[C 2n ]]> <![CDATA[D2]]> <![CDATA[F 21 ]]> <![CDATA[F 22 ]]> … <![CDATA[F 2n ]]> … … … … … … … … … … <![CDATA[D m ]]> <![CDATA[C m1 ]]> <![CDATA[C m2 ]]> … <![CDATA[C mn ]]> <![CDATA[D m ]]> <![CDATA[F m1 ]]> <![CDATA[F m2 ]]> … <![CDATA[F mn ]]>

[0060] T in the above table j is the jth time granularity, D i is the i-th sorting flow direction, C ij is the number of pieces at the jth time granularity of the i-th sorting flow direction, F ij is the frequency of the jth time granularity of the i-th sorting flow direction, i = 1, 2, 3...m; j = 1, 2, 3...n.

[0061] S3: determining the bottom-line index of each sorting flow direction according to the quantity of each piece and the frequency of each sorting flow direction, and sorting the sorting flow directions according to the bottom-line index;

[0062] The bottom line index is used to characterize the uncertainty of the appearance of sorting objects in the corresponding sorting flow within a predetermined time period. The larger the bottom line index, the smaller the uncertainty. The smaller the uncertainty, the more sorting objects appear in the corresponding sorting flow and the greater the probability of their appearance. On the contrary, the smaller the bottom line index, the greater the uncertainty. The greater the uncertainty, the fewer sorting objects appear in the corresponding sorting flow and the smaller the probability of their appearance. That is, the bottom line index is positively correlated with the number and frequency of the corresponding sorting flow. That is, the larger the number of pieces, the larger the bottom line index of the corresponding sorting flow. Similarly, the larger the frequency, the larger the bottom line index of the corresponding sorting flow. After determining the bottom line index of each sorting flow, sort each sorting flow according to the size of the bottom line index. The sorting method can be in ascending order or descending order.

[0063] As an implementable method, the bottom line index can be determined according to the following relationship:

[0064]

[0065] Among them, I i is the bottom line index of the i-th sorting flow direction, C ij is the number of pieces corresponding to the jth time granularity of the i-th sorting flow direction, F ij is the frequency corresponding to the jth time granularity of the i-th sorting flow direction.

[0066] S4: selecting a minimum value of the bottom-line index from the sorting and allocating them to the same bottom-line grid.

[0067] For example, there are 180 sorting directions in total, and the 180 sorting directions are sorted in ascending order of the bottom-line index. If the bottom-line number is 100, the first 100 sorting directions are selected as the bottom-line directions, and a bottom-line grid is assigned to the bottom-line directions. The sorting object is, for example, express delivery.

[0068] Of course, the 180 sorting directions can also be sorted in descending order of the bottom-line index. If the bottom-line number is 100, the last 100 sorting directions are selected as the bottom-line directions, and a bottom-line grid is allocated to the bottom-line directions.

[0069] As an implementable manner, except for the sorting flow directions assigned to the same bottom grid, each of the other sorting flow directions can be assigned a sorting grid. Of course, other flow directions can also be sorted according to other predetermined sorting schemes based on predetermined sorting requirements.

[0070] The above scheme sorts the sorting flows according to the size of the bottom-line index determined by the quantity and frequency corresponding to each time granularity of each sorting flow, and selects the bottom-line number of sorting flows from the sorting with the minimum value of the bottom-line index and allocates them to the same bottom-line grid. That is, the sorting flows with small quantity and low frequency are unified to the same grid, which concentrates the uncertainty risk of the flow. There is no need to allocate a unique grid for each flow, which improves the resource utilization of the sorting equipment and reduces the demand for equipment.

[0071] Furthermore, the bottom-line number is the maximum value of m that satisfies the following relationship:

[0072]

[0073]

[0074] Among them, F ij is the frequency corresponding to the jth time granularity of the ith sorting flow direction, a is the number of slots of the sorting cabinet corresponding to the bottom slot, c is the slot magnification coefficient of the sorting cabinet (which can be set or adjusted based on experience), C ij is the number of pieces corresponding to the jth time granularity of the ith sorting flow direction, b is the sorting efficiency of the sorting cabinet, and d is the sorting efficiency coefficient of the grid cabinet (which can be set or adjusted based on experience). The above sorting cabinet is a sorting cabinet that performs secondary sorting on the sorting objects of the 100 sorting flows allocated to the bottom grid in the above embodiment. Generally, in order to save resources, the number of grids of the sorting cabinet is less than the number of sorting flows allocated to the bottom grid.

[0075] Furthermore, the objects sorted in the bottom compartment are sorted a second time, and the second time sorting includes:

[0076] The sorting flow directions of the sorting objects are scanned in sequence, and each sorting flow direction is assigned a secondary sorting grid. When any secondary sorting grid reaches the maximum load, the sorting objects in the secondary sorting grid that has reached the maximum load are cleared, and the current sorting flow direction obtained by scanning that is different from other sorting flow directions is assigned to the cleared secondary sorting grid.

[0077] For example, the sorting cabinet has 30 secondary sorting slots, and the sorting objects in the bottom slots have 50 sorting directions. The sorting correspondences are scanned in turn to obtain the sorting directions of the sorting objects. Each time a sorting direction is obtained, a secondary sorting slot is assigned to the newly obtained sorting direction in the sorting cabinet. As the sorting proceeds, if a secondary sorting slot reaches the maximum load, the sorting objects in the secondary sorting slot that has reached the maximum load are cleared, and the current sorting direction obtained by the next scan that is different from other sorting directions is assigned to the cleared secondary sorting slot. In other words, if a secondary sorting slot is full, the sorting objects in the secondary sorting slot are cleared, and the sorting direction of the secondary sorting slot is reconfigured. With this solution, the sorting capacity of the sorting cabinet can be maximized, and the sorting efficiency of the sorting correspondence in the bottom slot can be improved.

[0078] Furthermore, the objects sorted in the bottom compartment are sorted a second time, and the second time sorting includes:

[0079] The sorting flow directions of the objects to be sorted are scanned in sequence, and each sorting flow direction is assigned a secondary sorting grid. When the Nth sorting flow direction is currently scanned and N is greater than the total number of secondary sorting grids of the sorting cabinet, any secondary sorting grid is cleared, and the Nth sorting flow direction is assigned to the cleared secondary sorting grid.

[0080] In actual secondary sorting, there is such a situation that the sorting cabinet has 30 secondary sorting slots, and the sorting objects in the bottom slots have 50 sorting directions. The sorting objects are scanned in turn to obtain the sorting directions of the sorting objects. Each time a sorting direction is obtained, a secondary sorting slot is allocated to the newly obtained sorting direction in the sorting cabinet. As the sorting proceeds, when the 31st sorting direction is scanned, the 30 secondary sorting slots are not full. At this time, in order to continue the sorting, any secondary sorting slot is cleared, and the 31st sorting direction is allocated to the cleared secondary sorting slot. If the 32nd sorting direction is scanned as the sorting proceeds, any secondary sorting slot is cleared again, and the 32nd sorting direction is allocated to the cleared secondary sorting slot. If a new sorting direction is obtained by scanning, the secondary sorting slots are allocated in the same way as above. By adopting this solution, the sorting capacity of the sorting cabinet can be maximized, the sorting efficiency corresponding to the sorting in the bottom grid can be improved, and the flexibility of sorting can be improved.

[0081] It should be noted that although the operations of the method of the present invention are described in a specific order in the drawings, this does not require or imply that the operations must be performed in this specific order, or that all the operations shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps.

[0082] Further, refer to Figure 2 , Figure 2 The schematic diagram of the principle of an express mail sorting device according to an embodiment of the present application is shown. The device can be applied to sorting express mail packages.

[0083] like Figure 2 As shown, the device includes: an acquisition unit 1, used for acquiring historical sorting data within a predetermined time period; a statistical unit 2, used for counting the number of pieces and the frequency of each sorting flow in the historical sorting data in each time granularity of the predetermined time period; a sorting flow direction sorting unit 3, used for determining the bottom-line index of each sorting flow according to the number of pieces and the frequency on each sorting flow, and sorting each sorting flow according to the size of the bottom-line index; an allocation unit 4, used for selecting a bottom-line number of sorting flow directions from the sorting according to the minimum value of the bottom-line index and allocating them to the same bottom grid.

[0084] The device is used to implement the method of the above embodiment. Its working principle and effect can be found in the above method embodiment, which will not be described in detail here.

[0085] Furthermore, if Figure 3 The method further includes: a bottom-line number calculation unit 5, which is used to determine the maximum m value that satisfies the following relationship as the bottom-line number,

[0086]

[0087]

[0088] Among them, F ij is the frequency corresponding to the jth time granularity of the ith sorting flow direction, a is the number of slots of the sorting cabinet corresponding to the bottom slot, c is the slot magnification coefficient of the sorting cabinet, C ij is the number of pieces corresponding to the jth time granularity of the ith sorting flow direction, b is the sorting efficiency of the sorting cabinet, and d is the sorting efficiency coefficient of the compartment cabinet.

[0089] Furthermore, if Figure 4 As shown, it also includes: a secondary sorting unit 6, which is used to scan and obtain the sorting flow directions of the sorting objects in sequence, and each sorting flow direction is assigned a secondary sorting grid. When any secondary sorting grid reaches the maximum load capacity, the sorting objects in the secondary sorting grid that has reached the maximum load capacity are emptied, and the current sorting flow direction obtained by scanning and different from other sorting flow directions is assigned to the emptied secondary sorting grid.

[0090] Furthermore, the secondary sorting unit 6 is also used to scan and obtain the sorting flow directions of the objects to be sorted in sequence, and each sorting flow direction is assigned a secondary sorting grid. When the Nth sorting flow direction is currently scanned and N is greater than the total number of secondary sorting grids in the sorting cabinet, any secondary sorting grid is cleared, and the Nth sorting flow direction is assigned to the cleared secondary sorting grid.

[0091] Reference below Figure 5 , which shows a schematic diagram of the structure of a computer system for determining a sorting site 500 suitable for implementing an embodiment of the present application.

[0092] like Figure 5 As shown, the computer system 500 includes a central processing unit (CPU) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage part 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the system 500 are also stored. The CPU 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0093] The following components are connected to the I / O interface 505: an input section 506 including a keyboard, a mouse, etc.; an output section 507 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 508 including a hard disk, etc.; and a communication section 509 including a network interface card such as a LAN card, a modem, etc. The communication section 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to the I / O interface 505 as needed. A removable medium 511, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 510 as needed, so that a computer program read therefrom is installed into the storage section 508 as needed.

[0094] In particular, according to the embodiments of the present disclosure, the above reference Figure 1 The described process may be implemented as a computer software program. For example, an embodiment of the present disclosure includes a method for sorting express mail, which includes a computer program tangibly embodied on a machine-readable medium, and the method includes a method for executing Figure 1 In such an embodiment, the computer program may be downloaded and installed from a network via the communication section 509 , and / or installed from the removable medium 511 .

[0095] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of the code, and the aforementioned module, program segment, or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0096] The units or modules involved in the embodiments described in the present application may be implemented by software or hardware. The units or modules described may also be set in a processor. For example, they may be described as: a processor includes an acquisition unit, a statistics unit, and a sorting flow direction sorting unit. The names of these units or modules do not, in some cases, constitute limitations on the units or modules themselves. For example, the acquisition unit may also be described as "a unit for acquiring historical sorting data within a predetermined time period."

[0097] As another aspect, the present application further provides a computer-readable storage medium, which may be the computer-readable storage medium included in the aforementioned device in the above embodiment; or may be a computer-readable storage medium that exists independently and is not assembled into the device. The computer-readable storage medium stores one or more programs, and the aforementioned programs are used by one or more processors to execute the method described in the present application for express mail sorting.

[0098] The above description is only a preferred embodiment of the present application and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the present application is not limited to the technical solution formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the aforementioned inventive concept. For example, the above features are replaced with the technical features with similar functions disclosed in this application (but not limited to) by each other to form a technical solution.

Claims

1. A method for sorting express mail, characterized in that: The method includes: Acquire historical sorting data within a predetermined time period; the historical sorting data at least includes the sorting flow direction and sorting time of the sorting object; Counting the number and frequency of each sorting flow direction in the historical sorting data at each time granularity in the predetermined time period; According to the quantity and frequency of each sorting flow direction, a bottom-line index of each sorting flow direction is determined, and the sorting flow directions are sorted according to the size of the bottom-line index, wherein the bottom-line index is used to characterize the uncertainty of the occurrence of sorting objects in the corresponding sorting flow direction within a predetermined time period; Selecting a minimum number of sorting flows from the sorting based on the minimum value of the bottom-line index and assigning them to the same bottom-line grid; The bottom number is the maximum m value that satisfies the following relationship: Among them, F ij is the frequency corresponding to the jth time granularity of the ith sorting flow direction, a is the number of slots of the sorting cabinet corresponding to the bottom slot, c is the slot magnification coefficient of the sorting cabinet, C ij is the number of pieces corresponding to the jth time granularity of the ith sorting flow direction, b is the sorting efficiency of the sorting cabinet, and d is the sorting efficiency coefficient of the sorting cabinet; the sorting cabinet is a sorting cabinet that performs secondary sorting on the sorting objects allocated to the bottom grid, and the number of grids of the sorting cabinet is less than the number of sorting flows allocated to the bottom grid; The bottom line index is determined according to the following relationship: Among them, I i is the bottom line index of the i-th sorting flow direction, C ij is the number of pieces corresponding to the jth time granularity of the i-th sorting flow direction, F ij is the frequency corresponding to the jth time granularity of the i-th sorting flow direction.

2. The express mail sorting method according to claim 1, characterized in that: The objects sorted in the bottom compartment are sorted for a second time, and the second sorting includes: The sorting flow directions of the sorting objects are scanned in sequence, and each sorting flow direction is assigned a secondary sorting grid. When any secondary sorting grid reaches the maximum load, the sorting objects in the secondary sorting grid that has reached the maximum load are cleared, and the current sorting flow direction obtained by scanning and different from other sorting flow directions is assigned to the cleared secondary sorting grid.

3. The express mail sorting method according to claim 1, characterized in that: The objects sorted in the bottom compartment are sorted for a second time, and the second sorting includes: The sorting flow directions of the objects to be sorted are scanned in sequence, and each sorting flow direction is assigned a secondary sorting grid. When the Nth sorting flow direction is currently scanned and N is greater than the total number of secondary sorting grids in the sorting cabinet, any secondary sorting grid is cleared, and the Nth sorting flow direction is assigned to the cleared secondary sorting grid.

4. An express mail sorting device, characterized in that: The device includes: An acquisition unit, used for acquiring historical sorting data within a predetermined time period; the historical sorting data at least includes the sorting flow direction and sorting time of the sorting object; A statistical unit, used for counting the number and frequency of each sorting flow direction in the historical sorting data at each time granularity in the predetermined time period; A sorting flow direction sorting unit is used to determine the bottom-line index of each sorting flow direction according to the quantity and frequency of each sorting flow direction, and sort the sorting flow directions according to the size of the bottom-line index, wherein the bottom-line index is used to characterize the uncertainty of the occurrence of sorting objects in the corresponding sorting flow direction within a predetermined time period; An allocating unit, configured to select a minimum value of the bottom-line index from the sorting and allocate the sorting flows to the same bottom-line grid; The bottom number is the maximum m value that satisfies the following relationship: Among them, F ij is the frequency corresponding to the jth time granularity of the ith sorting flow direction, a is the number of slots of the sorting cabinet corresponding to the bottom slot, c is the slot magnification coefficient of the sorting cabinet, C ij is the number of pieces corresponding to the jth time granularity of the ith sorting flow direction, b is the sorting efficiency of the sorting cabinet, and d is the sorting efficiency coefficient of the sorting cabinet; the sorting cabinet is a sorting cabinet that performs secondary sorting on the sorting objects allocated to the bottom grid, and the number of grids of the sorting cabinet is less than the number of sorting flows allocated to the bottom grid; Also includes: The bottom-line index calculation unit is used to determine the bottom-line index according to the following relationship: Among them, I i is the bottom line index of the i-th sorting flow direction, C ij is the number of pieces corresponding to the jth time granularity of the i-th sorting flow direction, F ij is the frequency corresponding to the jth time granularity of the i-th sorting flow direction.

5. A computer device comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, the method according to any one of claims 1 to 3 is implemented.

6. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 3 is implemented.

Images