Order picking location assignment method, put wall and electronic device

Abstract

An order picking location assignment method, a put wall and an electronic device, which are used for reasonably assigning picking positions to orders and improving order picking efficiency. The method comprises: on the basis of the frequency of appearance of items to be picked in orders to be picked, calculating the degree of hotness of each item to be picked; on the basis of the degrees of hotness of the items to be picked, selecting from among the orders to be picked the hottest order as a seed order, the seed order containing a great number of hot items to be picked; and, on the basis of the similarity between each order to be picked and the seed order, assigning picking locations. The present application can concentrate as much as possible picking locations of hot items to be picked, helping to reduce the workload of transferring the items to be picked and improving picking efficiency.

Description

Order sorting location allocation method, seeding wall and electronic device TECHNICAL FIELD

[0001] The present application relates to the technical field of logistics, in particular to an order sorting location allocation method, a seeding wall and an electronic device.

[0002] BACKGROUND

[0003] In the process of warehouse-out operation of logistics, in order to improve the efficiency of picking, multiple orders are grouped into a wave, and then the order content is summarized for centralized picking. Since the items corresponding to different orders are transported together, the mixed items need to be separated according to the orders. The process of sorting items according to orders is called seeding.

[0004] Since the seeding work needs to constantly transport items and place the items in the corresponding order packaging location, if the order sorting location allocation is unreasonable, the transportation workload in the seeding work will be greatly increased, and the sorting efficiency will be reduced.

[0005] At present, there is no technical scheme in the prior art for reasonably allocating a sorting location for an order to improve the order sorting efficiency. SUMMARY

[0006] Therefore, the present application is dedicated to providing an order sorting location allocation method, a seeding wall and an electronic device to reasonably allocate a sorting location for an order and improve the order sorting efficiency.

[0007] In a first aspect, an embodiment of the present application provides an order sorting location allocation method, comprising:

[0008] obtaining each of a plurality of to-be-sorted orders, wherein the to-be-sorted order includes to-be-sorted items;

[0009] assigning a heat score to the to-be-sorted items according to the occurrence frequency of the to-be-sorted items in the to-be-sorted orders, wherein the to-be-sorted items with a high heat score have a higher occurrence frequency in the to-be-sorted orders than the to-be-sorted items with a low heat score;

[0010] calculating an aggregated score of each to-be-sorted order according to the to-be-sorted items and the corresponding heat score, and taking the to-be-sorted order with the highest aggregated score as a seed order;

[0011] calculating the similarity between each to-be-sorted order and the seed order, and allocating a sorting location to the to-be-sorted order according to the similarity.

[0012] Optionally, calculating the aggregated score of each to-be-sorted order according to the to-be-sorted items and the corresponding heat score, and taking the to-be-sorted order with the highest aggregated score as a seed order, comprises:

[0013] For each to-be-sorted order, a product of a quantity of each to-be-sorted item in each to-be-sorted order and a corresponding hotness score is calculated, and a sum of all products is taken as an aggregated score of the to-be-sorted order;

[0014] The to-be-sorted order with the highest aggregated score is taken as a seed order.

[0015] Optionally, a similarity between each to-be-sorted order and the seed order is calculated, including:

[0016] A same similarity initial value is assigned to a plurality of to-be-sorted orders;

[0017] At least one of the following rules S1-S3 is selected as a basis to operate on the similarity initial value of each to-be-sorted order, to obtain the similarity between each to-be-sorted order and the seed order;

[0018] Rule S1: When the same to-be-sorted item appears in the seed order and the to-be-sorted order, the similarity between the to-be-sorted order and the seed order is increased by a first preset value;

[0019] Rule S2: When the to-be-sorted item appearing in the seed order does not appear in the to-be-sorted order, the similarity between the to-be-sorted order and the seed order is decreased by a second preset value;

[0020] Rule S3: When the to-be-sorted item appearing in the to-be-sorted order does not appear in the seed order, the similarity between the to-be-sorted order and the seed order is decreased by a third preset value.

[0021] Optionally, a sorting location is assigned to the to-be-sorted order according to the similarity, including:

[0022] An optimal sorting location is obtained;

[0023] The to-be-sorted order with a high similarity is assigned to a sorting location closer to the optimal sorting location than the to-be-sorted order with a low similarity, and the optimal sorting location is assigned to the seed order.

[0024] Optionally, a method for assigning a sorting location to a to-be-sorted order on a seeding wall is provided;

[0025] The seeding wall is a layered structure, and each layer includes at least one seeding slot, and each seeding slot can be assigned to perform sorting of one to-be-sorted order.

[0026] Optionally, the optimal sorting location is obtained, including:

[0027] An order sorting mode is obtained;

[0028] According to the order sorting mode, a seeding slot position matched with the order sorting mode is calculated and taken as the optimal sorting location.

[0029] Optionally, the order sorting mode comprises a manual sorting mode or an automatic robot sorting mode.

[0030] In a second aspect, the embodiments of the present application provide a seeding wall, which is used to provide sorting positions for the order sorting position allocation method of the first aspect.

[0031] Optionally, the seeding wall is a layered structure, and each layer comprises at least one seeding slot, and each seeding slot can be allocated to perform sorting of one to-be-sorted order.

[0032] Optionally, the seeding slot is further configured to bind a new seeding slot to perform sorting of one to-be-sorted order.

[0033] Optionally, the seeding slot is further configured to record and display information of to-be-sorted items in the to-be-sorted order.

[0034] Optionally, the seeding slot is further configured to establish a corresponding relationship between the new seeding slot and the to-be-sorted order corresponding to the seeding slot, and modify the information of to-be-sorted items recorded by the seeding slot and the new seeding slot, so that the information of to-be-sorted items recorded by the seeding slot and the new seeding slot constitutes the to-be-sorted order.

[0035] In a third aspect, the embodiments of the present application provide an electronic device, comprising a memory and a processor.

[0036] The memory is connected with the processor and is configured to store a program.

[0037] The processor is configured to realize the order sorting position allocation method of the first aspect by running the program in the memory.

[0038] In a fourth aspect, the present application provides a method for sorting items, comprising: allocating a sorting position for a to-be-sorted order according to the order sorting position allocation method of the first aspect, and sorting to-be-sorted items corresponding to the to-be-sorted order according to the sorting position.

[0039] In a fifth aspect, the present application provides a non-transitory computer readable storage medium, characterized in that a computer program is stored on the non-transitory computer readable storage medium, and the computer program is executed by a processor to realize the method of the first aspect and the second aspect.

[0040] The application provides an order sorting location allocation method, the popularity of each to-be-sorted item is calculated according to the occurrence frequency of the to-be-sorted item in a to-be-sorted order, and the most popular order is selected as a seed order from each to-be-sorted order according to the popularity of the to-be-sorted item. The seed order includes a large number of popular to-be-sorted items, and the sorting location is allocated according to the similarity between each to-be-sorted order and the seed order, so that the sorting locations of the popular to-be-sorted items can be concentrated as much as possible, thereby reducing the transportation workload of the to-be-sorted items and improving the sorting efficiency.

[0041] BRIEF DESCRIPTION OF DRAWINGS

[0042] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiments or prior art description. Obviously, the drawings in the following description are only part of the embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor on the basis of the provided drawings.

[0043] Fig. 1 is a flowchart of an order sorting location allocation method provided by an embodiment of the present application.

[0044] Fig. 2 is a structural schematic diagram of an electronic device provided by an embodiment of the present application.

[0045] Implementation of the present application

[0046] The technical solutions in the embodiments of the present application will be described clearly and completely in combination with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor are within the scope of protection of the present application.

[0047] In the logistics industry, especially in e-commerce warehousing, express delivery center, manufacturing distribution center and other scenarios, the "sowing wall (Put Wall)" (also known as "sorting wall" or "sowing type sorting system") is a kind of efficient and accurate order sorting technology. Its core purpose is to quickly and accurately sort the bulk goods according to the specific needs of multiple orders into the corresponding order container (such as express bag, turnover box).

[0048] In the logistics industry (especially in the warehousing and sorting link), the sowing box (also known as the sorting box or the order box) is the core component of the sowing wall. It is a kind of container with intelligent identification, usually placed in the grid of the sowing wall, representing an independent order or distribution destination, used for temporarily storing and collecting all goods of the order.

[0049] The first embodiment of the present application provides an order sorting location allocation method, as shown in FIG. 1, which can include the following steps:

[0050] Step 101, obtaining each of a plurality of to-be-sorted orders, the to-be-sorted order including a to-be-sorted item.

[0051] The logistics system will perform a considerable number of transportation tasks every day. During the execution of the transportation tasks, batch sorting of the transportation tasks is performed at the logistics node in batches, which can greatly improve the work efficiency of the logistics node.

[0052] Each transportation task corresponds to a transportation order recording the relevant information of the transportation task. Based on the transportation order, the transportation task can be queried and positioned. The information recorded in the transportation order at least includes the item required to be transported by the transportation order.

[0053] In the logistics node, the transportation order includes two types of already-sorted orders and to-be-sorted orders. The item required to be transported in the to-be-sorted order is referred to as a to-be-sorted item.

[0054] Step 102, according to the occurrence frequency of the to-be-sorted item in the to-be-sorted order, assigning a heat score to the to-be-sorted item, the to-be-sorted item with a high heat score has a higher occurrence frequency in the to-be-sorted order than the to-be-sorted item with a low heat score.

[0055] Firstly, the definition of the occurrence frequency of the to-be-sorted item in the to-be-sorted order needs to be clarified. For example, order No. 1 requires transportation of 9 items A. The occurrence frequency of item A can be understood as "item A appears in order No. 1", and the occurrence frequency of item A is +1; or it can be understood as "item A appears 9 times in order No. 1", and the occurrence frequency of item A is +9. Therefore, the optional definition of the occurrence frequency in the present embodiment is only related to the number of types of to-be-sorted items in the to-be-sorted order, and is not related to the number of requirements of to-be-sorted items in the to-be-sorted order; the other definition is related to the requirement of the to-be-sorted item in the order.

[0056] For the case that the same to-be-picked item appears multiple times in a batch of to-be-picked orders, it can be considered that the to-be-picked item of this model has a high degree of popularity. The above two definitions of "occurrence frequency" can both describe the popularity of a certain item in a batch of orders. Therefore, in this embodiment, one of the two definitions can be selected according to actual needs to calculate the occurrence frequency. For example, a common sorting method in a standardized sorting process is to sort one item at a time. For example, for a batch of orders, each to-be-picked item is stored in a separate zone before sorting, and the first time the item A is transported from the first zone where only item A is stored, and a sufficient number of item A is transported and distributed to each to-be-picked order that includes item A. The next time the item B is transported from the second zone where only item B is stored, and so on. Since as long as item A exists, the transport of item A will be performed once, and the number of items A in the order will not affect the number of transports (ignoring the case that the total number of items A is so large that a sufficient number of items A cannot be transported at one time). Therefore, in this sorting method, the number of items in the order is basically not considered, and the definition of the occurrence frequency is more suitable for the definition that "relates to the number of types of to-be-picked items in the to-be-picked order, and is irrelevant to the number of to-be-picked items".

[0057] In order to more accurately describe the popularity of the to-be-picked item, the occurrence frequency of the to-be-picked item in the to-be-picked order is used as the basis to quantify the popularity in the form of popularity points.

[0058] For example, the correspondence between the minimum inventory unit SKU and the to-be-picked item is established. The popularity of each SKU is determined according to the number of times the same SKU is hit by different to-be-picked orders. If 3 to-be-picked orders include item A, and if 4 to-be-picked orders include item B, then the popularity of item B is greater than that of item A, and the popularity points of item B are greater than those of item A.

[0059] The specific rules for assigning popularity points can be set according to actual conditions. For example, in the above example, item B can be assigned a popularity point of 100, and item A can be assigned a popularity point of 99.

[0060] Step 103, according to the to-be-picked item and the corresponding popularity points, calculating the aggregate score of each to-be-picked order, and taking the to-be-picked order with the highest aggregate score as the seed order.

[0061] In the foregoing steps, the popularity points of each item that appears in this batch of to-be-picked orders have been determined. Further, for each order, the popularity of each to-be-picked item in the order is aggregated to obtain the aggregate score corresponding to each order.

[0062] The aggregation score describes the quantity of popular to-be-picked items in the order corresponding to the aggregation score. Whether the aggregation score specifically describes the specific quantity or the specific category number of popular to-be-picked items in the corresponding order needs to be determined in combination with the definition of the "occurrence frequency" in step 102. The to-be-picked order with the highest aggregation score includes the most popular to-be-picked items. The order is taken as a seed order for subsequent position allocation.

[0063] Step 104, calculating the similarity of each to-be-picked order in the plurality of to-be-picked orders to the seed order, and allocating a picking position to the to-be-picked order according to the similarity.

[0064] Since the seed order includes the most popular to-be-picked items, the seed order is taken as the center, and the picking position is allocated according to the similarity of other to-be-picked orders to the seed order, so that the orders including the same to-be-picked items can be placed in reasonable picking positions as much as possible, and the unreasonable situation that a large amount of carrying time and distance are wasted for placing the item A due to the long distance between the picking positions of the No. 1 order and the No. 2 order is reduced.

[0065] Firstly, the similarity of the seed order to itself is the highest, so the picking position of the seed order is determined first. Then, the picking positions of other to-be-picked orders are allocated according to the similarity of the other to-be-picked orders to the seed order. The high similarity indicates that the transportation demand of the order is similar to that of the seed order, and the picking position of the order should be close to that of the seed order to reduce the carrying workload. The low similarity indicates that many to-be-picked items in the order do not appear in the seed order, and additional carrying and picking are needed for the order during picking, so the picking position of the order should be far away from that of the seed order to make room for other to-be-picked orders that can be similar to the seed order and can be efficiently processed.

[0066] The second embodiment of the present application further limits the order picking position allocation method in the first embodiment in more detail and concretely. Part or all of the technical features in the second embodiment can be combined, replaced, etc. with the first embodiment, so as to obtain more feasible order picking position allocation methods.

[0067] The order picking position allocation method in the second embodiment of the present application will be described in detail as follows:

[0068] Optionally, the aggregation score of each to-be-picked order is calculated according to the to-be-picked items and the corresponding heat score, and the to-be-picked order with the highest aggregation score is taken as the seed order, including: for each to-be-picked order, the product of the quantity of each to-be-picked item in the to-be-picked order and the corresponding heat score is calculated, and the sum of all products is taken as the aggregation score of the to-be-picked order; and the to-be-picked order with the highest aggregation score is taken as the seed order.

[0069] The embodiment provides a specific implementation method for calculating the aggregation score. The aggregation score of the order to be sorted is calculated according to the quantity of the items to be sorted in the order and the corresponding hotness score.

[0070] For example, the hotness score of item A is 100 points, the hotness score of item B is 99 points, and the first order includes 9 items A and 1 item B. According to the aggregation score calculation method in the embodiment, the aggregation score of the first order is 9*100+99=999 points.

[0071] Since the calculation parameter of the aggregation score includes the quantity of the items to be sorted in the order, if the occurrence frequency in the first embodiment selects the definition mode “related to the quantity of the items to be sorted”, and the hotness score of the item to be sorted is related to the quantity of the items to be sorted in the order, when the aggregation score is calculated in the embodiment, the quantity of the items to be sorted is multiplied again, which can significantly amplify the influence of the parameter “quantity of the items to be sorted” on the selection of the seed order. Therefore, when the aggregation score calculation method in the embodiment is applied, a reasonable occurrence frequency definition needs to be selected according to actual needs.

[0072] Optionally, the similarity between each order to be sorted and the seed order is calculated, including: assigning a same initial value of similarity to all orders to be sorted; selecting at least one of the following rules S1-S3 as a basis to operate on the initial value of similarity of each order to be sorted, to obtain the similarity between each order to be sorted and the seed order; rule S1: when the same item to be sorted appears in the seed order and the order to be sorted, increasing a first preset value to the similarity between the order to be sorted and the seed order; rule S2: when the item to be sorted appearing in the seed order does not appear in the order to be sorted, decreasing a second preset value to the similarity between the order to be sorted and the seed order; rule S3: when the item to be sorted appearing in the order to be sorted does not appear in the seed order, decreasing a third preset value to the similarity between the order to be sorted and the seed order.

[0073] The embodiment provides an implementation method for calculating the similarity, and specifically provides three optional specific rules for calculating the similarity between the order to be sorted and the seed order.

[0074] The rules S1-S3 are exemplified as follows: when the seed order and the order to be sorted both include item A, it indicates that the seed order and the order to be sorted are relatively similar, which meets the rule S1, and the similarity between the seed order and the order to be sorted should be appropriately increased. When the seed order includes item B and the order to be sorted does not include item B, or when the seed order does not include item C and the order to be sorted includes item C, it indicates that the seed order and the order to be sorted are different, which meets the rule S2 or the rule S3, and the similarity between the seed order and the order to be sorted should be appropriately decreased.

[0075] The following examples of a simultaneous execution rule S1-S3 specifically illustrate the calculation of similarity:

[0076] There is a seed order A (including SKU1, 2, 3, 4), and a to-be-picked order B (including SKU2, 3, 4, 5);

[0077] When A has B, set each same SKU +2 points, totaling +6 points;

[0078] When A has B, set each A has B no SKU-1 points, totaling-1 points;

[0079] When A has B, set each A has B no SKU-2 points, totaling-2 points;

[0080] The similarity score of the to-be-picked order B and the seed order A is finally +6-1+2=3 points.

[0081] Optionally, the picking location is assigned to the to-be-picked order according to the similarity, including: obtaining an optimal picking location; and assigning the picking location to the to-be-picked order according to the similarity, the distance between the to-be-picked order with high similarity and the optimal picking location is less than the distance between the to-be-picked order with low similarity and the optimal picking location.

[0082] Since the seed order has the highest heat, the picking work of the seed order will include a large number of high-heat to-be-picked items, and since the seed order is definitely 100% similar to itself, the seed order will be assigned to the optimal picking location. The seed order includes a large number of popular to-be-picked items, and the seed order is in the optimal picking location, which is beneficial to save the picking workload of popular to-be-picked items.

[0083] Then, the picking location of the other orders is assigned according to the similarity with the seed order, the higher the similarity, the more the picking work of the order and the seed order can be combined, for example, for the seed order A (including SKU1, 2, 3, 4) and the to-be-picked order B (including SKU2, 3, 4, 5), both orders have SKU2, 3, 4, if the to-be-picked order B is arranged next to the seed order A, the SKU2, 3, 4 items can be carried at one time without moving, and these to-be-picked items can be conveniently and quickly picked to the adjacent picking locations of the two orders.

[0084] Therefore, placing the orders with higher similarity to the seed order closer to the seed order picking location can improve the picking efficiency.

[0085] For example, assume that the seed order is A

[0086] A (1, 2, 3, 4), C (1, 2, 3), similarity score 5 points;

[0087] A(1, 2, 3, 4), D(3, 4, 5, 6), similarity score 0;

[0088] A(1, 2, 3, 4), E(5, 6, 7), similarity score -10;

[0089] Including the above order B, the similarity ranking of these orders is C, B, D, E, so the sorting position of the to-be-picked order C is closest to the seed order, the to-be-picked order B is second, the to-be-picked order D is third, and the to-be-picked order E is farthest from the seed order position.

[0090] Optionally, the order picking position allocation method is used to allocate a picking position for a to-be-picked order on a seeding wall; the seeding wall is a layered structure, each layer includes at least one seeding slot, and each seeding slot can be allocated for picking a to-be-picked order.

[0091] The embodiment provides that a seeding wall with multiple layers and multiple columns can be used to standardize order picking work. Each layer of the seeding wall includes at least one seeding slot, and the seeding slot is specifically a container that can accommodate a to-be-picked item. For example, a 2*3 seeding wall has a two-layer structure, each layer includes three seeding slots, and the picking of six transportation orders can be performed at the same time.

[0092] Optionally, the optimal picking position is obtained, including: obtaining an order picking mode; and calculating a seeding slot position matched with the order picking mode as the optimal picking position according to the order picking mode.

[0093] The embodiment provides a specific implementation manner of obtaining the optimal picking position. Specifically, the picking mode needs to be determined first, for example, if the logistics node is manual picking, in order to reduce the burden of the picking personnel, the picking personnel should try to reduce the work such as bending over and standing on tiptoe. Therefore, the seeding wall slot matched with the manual picking mode is generally the slot in the middle layer of the seeding wall, and in order to reduce the risk of falling, the slot in the middle of each layer is preferentially selected.

[0094] The above example including orders A-E is continued to be described, if the seeding wall has three layers and the total number of slots in each layer is 10, the above five orders will be allocated to the middle slots, i.e., the 3, 4, 5, 6, and 7 seeding slots in the second layer. Then the similarity ranking of the five orders is A, C, B, D, and E, and the final position allocation result can be that the 3rd slot is the seed order A, the 4th slot is the to-be-picked order C, the 5th slot is the to-be-picked order B, the 6th slot is the to-be-picked order D, and the 7th slot is the to-be-picked order E.

[0095] If the logistics node is an automated robot sorting, the seeding wall grid matching the automated sorting mode can be set according to the physical characteristics of the robot, for example, the robot with lifting and carrying function lowers to the lowest height to reduce the center of gravity and ensure the driving temperature when carrying the to-be-sorted items from the centralized storage area to the seeding wall each time, and then the matching seeding wall grid can be set as the middle grid of the lowermost layer of the seeding wall.

[0096] The third embodiment of the present application provides a seeding wall for providing a sorting position for the order sorting position allocation method of the first embodiment.

[0097] The present embodiment proposes that the order sorting work can be standardized by using the seeding wall.

[0098] Optionally, the seeding wall is a layered structure, each layer includes at least one seeding grid, and each seeding grid can be allocated for sorting a to-be-sorted order; and the seeding grid is also used to bind a new seeding grid for sorting a to-be-sorted order.

[0099] For a multi-layer and multi-column seeding wall, since the space of each seeding grid is limited, there may be a case that the order is not sorted completely and the grid space is filled. The present embodiment proposes that in this case, a new seeding grid can be bound, and the two seeding grids are used for sorting the same to-be-sorted order.

[0100] For example, the to-be-sorted items are scanned, and it is prompted that two items need to be seeded in grid one, but it is found that the seeding container space of grid one is insufficient, and only one item can be placed. At this time, a new seeding grid can be bound to place the second item.

[0101] In addition, the seeding wall can also support real-time packaging function. When a new seeding box is bound, the front full seeding box is pushed along the connection structure, such as a conveyor belt, to the review operation position. After the full box moves to the review operation position, the review work can be performed to determine that the sorting in the seeding grid is correct, without waiting for all sorting work to be completed before the review and packaging can be performed.

[0102] Optionally, the seeding grid is also used to record and display the information of the to-be-sorted items in the to-be-sorted order; the seeding grid is also used to establish the corresponding relationship between the new seeding grid and the to-be-sorted order corresponding to the seeding grid; and the information of the to-be-sorted items recorded by the seeding grid and the new seeding grid is modified, so that the sum of the information of the to-be-sorted items recorded by the seeding grid and the new seeding grid constitutes the to-be-sorted order.

[0103] The embodiment provides that after determining which sowing grid hole is used for sorting of which order, the sowing grid hole can record and display information of the to-be-sorted items in the corresponding to-be-sorted order, for example, names and quantities of the to-be-sorted items.

[0104] The embodiment also provides a more detailed binding new sowing box implementation mode. Optionally, the operation can be performed through the display device on the sowing grid hole.

[0105] For example, it is prompted that two items need to be sowed in the first grid hole, but it is found that the sowing container of the first grid hole is insufficient in space and can only put down one item. The operation is performed on the display device of the full sowing grid hole, triggering quantity modification, and the sorting work of part of the to-be-sorted items is allocated to a new sowing grid hole. After the modification is successful, the modified quantity is transmitted to the new sowing grid hole, and the new sowing grid hole displays the corresponding quantity of the sorted items.

[0106] The fourth embodiment of the present application also provides an electronic device, as shown in FIG. 2, the device comprises:

[0107] a memory 200 and a processor 210;

[0108] The memory 200 is connected with the processor 210, and is used for storing programs;

[0109] The processor 210 is used for realizing the logistics management method disclosed in any of the above embodiments by running the programs stored in the memory 200.

[0110] Specifically, the above electronic device can further comprise a bus, a communication interface 220, an input device 230 and an output device 240.

[0111] The processor 210, the memory 200, the communication interface 220, the input device 230 and the output device 240 are connected with each other through the bus. Wherein:

[0112] The bus can include a channel for transmitting information between various components of the computer system.

[0113] The processor 210 can be a general-purpose processor, for example, a general-purpose central processing unit (CPU), a microprocessor, etc., or can be an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling execution of programs of the present application. It can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a ready-to-use programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component.

[0114] The processor 210 can include a main processor, and can also include a baseband chip, a modem, etc.

[0115] The memory 200 stores programs for implementing the technical solutions of the present application, and can also store operating systems and other key services. Specifically, the programs can include program codes, and the program codes include computer operation instructions. More specifically, the memory 200 can include a read-only memory (ROM), other types of static storage devices that can store static information and instructions, a random access memory (RAM), other types of dynamic storage devices that can store information and instructions, a disk memory, a flash, and the like.

[0116] The input device 230 can include devices that receive data and information input by a user, such as a keyboard, a mouse, a camera, a scanner, a light pen, a voice input device, a touch screen, a pedometer, or a gravity sensor, and the like.

[0117] The output device 240 can include devices that allow information to be output to a user, such as a display screen, a printer, a speaker, and the like.

[0118] The communication interface 220 can include devices such as a transceiver, to communicate with other devices or communication networks, such as an Ethernet, a radio access network (RAN), a wireless local area network (WLAN), and the like.

[0119] The processor 210 executes programs stored in the memory 200 and calls other devices, which can be used to implement each step of any one of the logistics management methods provided by the above-described embodiments.

[0120] The embodiments of the present application also provide a method for sorting items, which includes: assigning a sorting location to a to-be-sorted order according to the order sorting location assignment method of the above-described embodiments, and sorting items corresponding to the to-be-sorted order according to the sorting location.

[0121] The embodiments of the present application provide a non-transitory computer-readable storage medium, characterized in that a computer program is stored thereon, and the computer program is executed by a processor to implement the method of the above-described embodiments.

[0122] For each of the above method embodiments, in order to simply describe, they are all expressed as a combination of a series of actions, but those skilled in the art should know that the present application is not limited to the order of the actions described, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should know that the embodiments described in the specification all belong to preferred embodiments, and the actions and modules involved are not necessarily required by the present application.

[0123] It should be noted that each of the embodiments in the specification is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between embodiments can be mutually referred to.

[0124] The steps in the method of each embodiment of the application can be adjusted, combined and deleted in sequence according to actual needs. The technical features described in each embodiment can be replaced or combined.

[0125] The modules and sub-modules in the device and terminal of each embodiment of the application can be combined, divided and deleted according to actual needs.

[0126] In several embodiments provided by the application, it should be understood that the disclosed terminal, device and method can be implemented by other ways. For example, the terminal embodiments described above are only schematic, for example, the division of modules or sub-modules is only a logical function division, and actual implementation can have another division manner, for example, a plurality of sub-modules or modules can be combined or integrated into another module, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the shown or discussed mutual ones can be indirect coupling or communication connection through some interfaces, devices or modules, and can be electrical, mechanical or other forms.

[0127] The modules or sub-modules described as separate components can or can not be physically separated, and the components of the modules or sub-modules can or can not be physical modules or sub-modules, that is, they can be located in one place, or can be distributed to a plurality of network modules or sub-modules. According to actual needs, some or all of the modules or sub-modules can be selected to achieve the purpose of the embodiment scheme.

[0128] In addition, each functional module or sub-module in each embodiment of the application can be integrated in one processing module, or each module or sub-module can exist physically, or two or more modules or sub-modules can be integrated in one module. The integrated module or sub-module can be realized in the form of hardware or in the form of software functional module or sub-module.

[0129] Those skilled in the art will further appreciate that the units and algorithm steps of the various examples described in connection with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various examples have been described herein in terms of their functionality, their composition, and their manner of operation. Whether such functionality is implemented in hardware or software depends on the particular application and design constraints imposed on the overall system. Skilled persons can implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

[0130] The steps of a method or algorithm described in connection with the embodiments disclosed herein can be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module can reside in random access memory (RAM), flash memory, read-only memory (ROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

[0131] Finally, it should be noted that the terms "first", "second", and the like, herein do not denote any order, quantity, combination, or importance, but rather are used to distinguish one element from another, and are more especially used for the purpose of identification in claims. In addition, the terms "comprises", "comprising", or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but can include other elements not expressly listed or inherent to such process, method, article, or apparatus. In addition, the terms "includes", "including", or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that includes a list of elements does not include only those elements but can include other elements not expressly listed or inherent to such process, method, article, or apparatus.

[0132] The above description of disclosed embodiments provides enabling disclosure sufficient for others to practice the application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and generic principles defined herein can be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A method for allocating order sorting locations, characterized in that, include: Obtain each of a plurality of orders to be sorted, wherein the orders to be sorted include items to be sorted; Based on the frequency of occurrence of the items to be sorted in the sorting order, a popularity score is assigned to each item to be sorted. Items with higher popularity scores appear more frequently in the sorting order than items with lower popularity scores. Based on the items to be sorted and their corresponding popularity scores, calculate the aggregation score for each order to be sorted, and use the order with the highest aggregation score as the seed order. Calculate the similarity between each of the plurality of orders to be sorted and the seed order, and assign a sorting position to the orders to be sorted based on the similarity.

2. The order sorting location allocation method according to claim 1, characterized in that, The process involves calculating the aggregate score for each order to be sorted based on the items to be sorted and their corresponding popularity scores, and then using the order with the highest aggregate score as the seed order. This includes: For each of the sorting orders, calculate the product of the quantity of each sorting item in each sorting order and the corresponding heat score, and sum all the products as the aggregate score of the sorting order. The order with the highest aggregation score is designated as the seed order.

3. The order sorting location allocation method according to claim 1 or 2, characterized in that, The calculation of the similarity between each order to be sorted and the seed order includes: Assign the same initial similarity value to the multiple orders to be sorted; Based on at least one of the following rules S1-S3, the initial similarity value of each order to be sorted is calculated to obtain the similarity between each order to be sorted and the seed order. Rule S1: When the same items to be sorted appear in the seed order and the order to be sorted, increase the similarity between the order to be sorted and the seed order by a first preset value; Rule S2: When the items to be sorted in the seed order do not appear in the order to be sorted, reduce the similarity between the order to be sorted and the seed order by a second preset value; Rule S3: When the items to be sorted in the order to be sorted do not appear in the seed order, reduce the similarity between the order to be sorted and the seed order by a third preset value.

4. The order sorting location allocation method according to any one of claims 1 to 3, characterized in that, Assigning sorting locations to the orders to be sorted based on the similarity includes: Obtain the optimal sorting location; The sorting positions are assigned to the orders to be sorted based on the similarity. The distance between the orders to be sorted with high similarity and the optimal sorting position is less than the distance between the orders to be sorted with low similarity and the optimal sorting position. The optimal sorting position is then assigned to the seed order.

5. The order sorting location allocation method according to claim 4, characterized in that, The method is used to assign sorting positions on the seeding wall for the orders to be sorted; The seeding wall has a layered structure, with each layer including at least one seeding grid, and each seeding grid can be assigned to sort one of the orders to be sorted.

6. The order sorting location allocation method according to claim 5, characterized in that, The process of obtaining the optimal sorting position includes: Obtain the order sorting method; Based on the order sorting method, calculate the seeding grid position that matches the order sorting method and use it as the optimal sorting position.

7. The order sorting location allocation method according to claim 6, characterized in that, The order sorting methods include manual sorting or automated robot sorting.

8. A method for sorting items, comprising: The order sorting location allocation method according to any one of claims 1 to 7 is used to allocate sorting locations to orders to be sorted; The items to be sorted are sorted according to the sorting location corresponding to the order to be sorted.

9. A seeding wall, characterized in that, The seeding wall is used to provide a sorting location for the order sorting location allocation method according to any one of claims 1 to 7.

10. The seeding wall according to claim 9, characterized in that, The seeding wall has a layered structure, with each layer including at least one seeding grid, and each seeding grid can be assigned to sort an order to be sorted.

11. The seeding wall according to claim 10, characterized in that, The seeding grid is also used to bind new seeding grids for sorting a single order.

12. The seeding wall according to claim 10 or 11, characterized in that, The seeding grid is also used to record and display information about the items to be sorted in the order to be sorted.

13. The seeding wall according to any one of claims 10 to 12, characterized in that, The sowing grid is also used to establish a correspondence between the new sowing grid and the order to be sorted corresponding to the sowing grid; and to modify the information of the items to be sorted recorded in the sowing grid and the new sowing grid, so that the sum of the information of the items to be sorted recorded in the sowing grid and the new sowing grid constitutes the order to be sorted.

14. An electronic device, characterized in that, Including memory and processor; The memory is connected to the processor and is used to store programs; The processor is configured to implement the method as described in any one of claims 1 to 8 by running a program in the memory.

15. A non-transitory computer-readable storage medium, characterized in that, It stores a computer program thereon, which, when executed by a processor, implements the method as described in any one of claims 1 to 8.

Images