CN110826960B - Order picking method, device, equipment and computer readable medium - Google Patents

Order picking method, device, equipment and computer readable medium Download PDF

Info

Publication number
CN110826960B
CN110826960B CN201910974882.4A CN201910974882A CN110826960B CN 110826960 B CN110826960 B CN 110826960B CN 201910974882 A CN201910974882 A CN 201910974882A CN 110826960 B CN110826960 B CN 110826960B
Authority
CN
China
Prior art keywords
picking
relay
junction
storage area
goods
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910974882.4A
Other languages
Chinese (zh)
Other versions
CN110826960A (en
Inventor
韩海明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Zhenshi Information Technology Co Ltd
Original Assignee
Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Zhenshi Information Technology Co Ltd filed Critical Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority to CN201910974882.4A priority Critical patent/CN110826960B/en
Publication of CN110826960A publication Critical patent/CN110826960A/en
Application granted granted Critical
Publication of CN110826960B publication Critical patent/CN110826960B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Economics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Operations Research (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Quality & Reliability (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Tourism & Hospitality (AREA)
  • Databases & Information Systems (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Remote Sensing (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)

Abstract

The invention discloses a goods picking method, a goods picking device, goods picking equipment and a computer readable medium, and relates to the technical field of warehousing. One embodiment of the method comprises: splitting the picking task list into a plurality of relay picking task lists according to the storage area, and determining the picking sequence of the relay picking task lists; after one relay picking task list is finished, searching for a junction in a preset junction address library according to the position identification, the storage area and the storage area of the next relay picking task list of the relay picking task list; receiving a message that a picking receptacle is at the intersection, the picking receptacle containing the goods in the one relay picking order; and receiving the message that the picking container is picked at the cross point, and searching the cross point again in a preset cross point address base. The goods in different reserves can be selected and place same container in this embodiment, reduces the use quantity of container, can reduce warehouse manufacturing cost simultaneously.

Description

Order picking method, device, equipment and computer readable medium
Technical Field
The invention relates to the technical field of warehousing, in particular to a goods picking method, a goods picking device, goods picking equipment and a computer readable medium.
Background
In warehousing, sorting in different areas is a common way of sorting. When the goods sorting is carried out in the subareas, the goods pickers in all the subareas are only responsible for the goods sorting tasks of the areas to which the goods pickers belong, the goods in the areas to which the goods pickers belong in a group of the goods sorting tasks are sorted and placed into a container, and then the container is conveyed to the confluence area.
The containers are placed in an unordered state after reaching the confluence area, and the containers loaded with goods in the same group of goods picking tasks are placed in the same confluence storage position by staff, namely confluence personnel, in the confluence area, and the group of goods picking tasks are completed after the goods in the same group of goods picking tasks are collected.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
for the subregion goods of choosing, a container is selected to place to goods in the storage area, and the goods in different storage areas can not be selected and place same container, has increased the container use quantity, and then has increased warehouse manufacturing cost.
Disclosure of Invention
In view of the above, embodiments of the present invention provide a picking method, apparatus, device and computer readable medium, in which goods in different storage areas can be picked and placed in the same container, so as to reduce the number of containers used and reduce the warehouse production cost.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of picking a product, including:
splitting the picking task list into a plurality of relay picking task lists according to the storage area, and determining the picking sequence of the relay picking task lists;
after one relay picking task list is finished, searching for a junction in a preset junction address library according to the position identification, the storage area and the storage area of the next relay picking task list of the relay picking task list;
receiving a message that a picking receptacle is at the intersection, the picking receptacle containing the goods in the one relay picking order;
and receiving the message that the picking container is picked at the cross point, and searching the cross point again in a preset cross point address base.
The method further comprises the following steps:
dividing the handover rule in the handover rule configuration file into identifiers of different levels, wherein the handover rule comprises a position identifier, a storage area, a relay storage area and a handover point of the relay picking task list;
inserting the identifiers of different levels into a multi-branch tree as tree nodes according to the sequence from high level to low level, wherein leaf nodes of the multi-branch tree are junction points;
and taking the multi-branch tree as the preset intersection point address library.
The picking order is generated according to the volume of the goods in the goods order to be picked and the volume of the picking container.
Said receiving a message that a picking container has been at said intersection, further comprising:
determining that the cross-over point is consistent with the assigned cross-over point, and increasing the number of relay picking task lists of the cross-over point by one;
the receiving the message that the picking container has been picked at the intersection, further comprising:
the number of the relay picking task lists of the junction is reduced by one.
The method further comprises the following steps: and monitoring the number of the relay picking task lists of the junction, and sending a prompt message comprising the number.
After searching for the junction in the preset junction address library, the method further comprises the following steps: and sending prompt information comprising the junction.
Said receiving a message that a picking container has been at said intersection, comprising:
sending a reminder message including the intersection point and an identification of the picking receptacle.
According to a second aspect of embodiments of the present invention, there is provided a pick-up device comprising:
the sorting module is used for sorting the picking task lists into a plurality of relay picking task lists according to the storage area and determining the picking sequence of the relay picking task lists;
the searching module is used for searching the junction in a preset junction address library according to the position identifier of one relay picking task list, the storage area and the storage area of the next relay picking task list after the relay picking task list is finished;
a receiving module for receiving a message that a picking receptacle has been at the intersection, the picking receptacle containing the goods in the one relay picking order;
receiving a message that the picking container has been picked at the junction.
According to a third aspect of embodiments of the present invention there is provided a pick-up electronic device comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method as described above.
According to a fourth aspect of embodiments of the present invention, there is provided a computer readable medium, on which a computer program is stored, which when executed by a processor, implements the method as described above.
One embodiment of the above invention has the following advantages or benefits: the picking task list is divided into a plurality of relay picking task lists according to the storage area, and the picking order of the relay picking task lists is determined; after one relay picking task list is finished, searching for a junction in a preset junction address library according to the position identification, the storage area and the storage area of the next relay picking task list of the relay picking task list; receiving a message that the picking container is at the junction, and loading the picking container with goods in a relay picking task list; receiving a message that the picking container has been picked at the intersection, and searching the preset intersection address base for the intersection again. Because the goods in different reserves can be selected and place same container, reduce the use quantity of container, can reduce warehouse manufacturing cost simultaneously.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic illustration of warehouse area partitioning according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of the main flow of a method of picking a product according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating an exemplary process for setting up a contact address bank according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a multi-way tree according to an embodiment of the present invention;
FIG. 5 is a flow chart illustrating monitoring of a junction according to an embodiment of the present invention;
FIG. 6 is a schematic flow chart diagram of a method of picking a product according to an embodiment of the present invention;
fig. 7 is a schematic diagram of the principal structure of a pick-up device according to an embodiment of the invention;
FIG. 8 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 9 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In the warehouse environment with both manual picking and machine picking, goods on the same manifest are scattered in the manual picking area and the machine picking area respectively, and different picking modes result in that all picking cannot be completed by the same person.
Generally, a sorting container in a machine sorting area and a sorting container in a manual sorting area are subjected to confluence operation in a partition sorting mode, and sorting is finally completed. For the district goods picking, the goods in one storage area are picked and placed into one container, and the goods in different storage areas cannot be picked and placed into the same container, so that the use number of the containers is increased. In addition, the labor cost of the confluence post is increased. Thereby increasing warehouse production costs.
In order to solve the technical problem that goods in different storage areas cannot be picked and placed in the same container and the using number of the containers is increased, the following technical scheme in the embodiment of the invention can be adopted.
Referring to fig. 1, fig. 1 is a schematic diagram of warehouse area division according to an embodiment of the present invention, which includes storage areas a to L and a relay interface area. The relay interface section includes 6 interface points. Taking bin I as an example, the exemplary depicted bin I includes 12 bin shelves on which goods may be placed.
Referring to fig. 2, fig. 2 is a schematic diagram of a main flow of a picking method according to an embodiment of the present invention, picking a picking container loaded with a relay picking order sheet at an intersection, and picking the goods in the next relay picking order sheet to the picking container. The execution subject of each step in fig. 2 may be a background server. As shown in fig. 2, the method specifically includes the following steps:
s201, dividing the picking task list into a plurality of relay picking task lists according to the storage area, and determining the picking sequence of the relay picking task lists.
A quantity of orders to be picked is selected, and a picking order may be generated taking into account the volume of the picking containers and the volume of items in the orders to be picked. As an example, if the volume of the picking receptacle is 1 cubic meter, the volume of the goods in the to-be-picked manifest 1 is 0.4 cubic meter, the volume of the goods in the to-be-picked manifest 2 is 0.3 cubic meter, and the volume of the goods in the to-be-picked manifest 3 is 0.5 cubic meter, then the to-be-picked manifest 1 and the to-be-picked manifest 3 may be selected to generate a picking order sheet.
The picking task list comprises a plurality of goods to be picked, and the picking task list can be split into a plurality of relay picking task lists according to the storage areas where the goods are stored. And respectively enabling goods to be picked in the picking task list PK001 to belong to 3 storage areas, and splitting the picking task list PK001 into 3 relay picking task lists. The identifications of the relay picking task list are respectively as follows: PK001-1, PK001-2 and PK 001-3. And selecting the task sheet PK001 as a relay task sheet group number.
Due to the fact that a plurality of relay picking task lists exist, the picking sequence of the relay picking task lists can be determined according to the storage area. As an example, the picking order is split into 3 baton picking order by storage area. The goods in the relay picking order sheet 1 are stored in the storage area 1, the goods in the relay picking order sheet 2 are stored in the storage area 2, and the goods in the relay picking order sheet 3 are stored in the storage area 3. The order of the storage area 1, the storage area 2 and the storage area 3 is used as the picking order of the 3 relay picking tasks. The specific order of picking is as follows: a relay picking task list 1, a relay picking task list 2 and a relay picking task list 3.
S202, after a relay picking task list is finished, according to the position identification and the storage area of one relay picking task list and the storage area of the next relay picking task list, the junction is searched in a preset junction address library.
The goods picker receives a relay goods picking task sheet, places all goods under the relay goods picking task sheet in a picking container, and marks the relay goods picking task sheet as a goods picking completion state after goods picking is completed.
After one relay picking task sheet is finished, the database is inquired according to the relay task sheet group number of the relay picking task sheet to obtain the next relay picking task sheet. As an example, PK001 is the relay order group number, and the identification and picking order of the relay picking order are: PK001-1, PK001-2 and PK 001-3. After the relay picking task sheet PK001-1 is finished, the database is inquired according to the PK001, and the next relay picking task sheet is acquired as PK 001-2.
In the embodiment of the invention, the goods in the relay picking order sheets can be placed in the same picking container, and the picking container which already comprises the goods in one relay picking order sheet needs to be placed at the junction so as to place the goods in the next relay picking order sheet in the picking container.
Then, the intersection can be searched in the preset intersection address base according to the position identifier of one relay picking task list, the storage area and the storage area of the next relay picking task list. The preset access point address library stores the corresponding relation among the position identification, the storage area and the access point.
In one embodiment of the present invention, the bank of contact addresses may be set up in the following manner.
Referring to fig. 3, fig. 3 is a schematic flow chart of setting a contact point address library according to an embodiment of the present invention, which specifically includes:
s301, dividing the handover rule in the handover rule configuration file into different levels of identifiers, wherein the handover rule comprises a position identifier, a storage area, a relay storage area and a handover point of the relay picking task list.
And identifying the intersection points among different warehouses, different merchants, different bill types and different front and back storage areas, and dividing the intersection points into a cross-connection rule according to a fixed sequence. As an example: the handover rules for warehouse number w1, merchant s1, document type r1, storage area z1, relay storage area z2 with j1 are as follows: w1-s1-r1-z1-z2-j 1. Where the warehouse number, merchant, and document type are referred to as location identifiers.
For each intersection point, a corresponding intersection rule is identified. And writing the handover rule into a handover rule configuration file.
And encrypting the rule configuration file into a ciphertext through an asymmetric encryption algorithm and storing the ciphertext. The ciphertext is then decrypted by a corresponding asymmetric decryption algorithm.
The transfer rule comprises a position identifier, a storage area, a relay storage area and a transfer point of the relay picking task list. The handover rules may be divided into different levels of identification. As an example, the following designations are respectively, from high level to low level: w1, s1, r1, z1, z2, j 1.
S302, inserting the identifiers of different levels into the multi-branch tree as tree nodes according to the sequence from high level to low level, wherein the leaf nodes of the multi-branch tree are cross points.
First, there is a root node "-" of the multi-way tree, and the identifiers are inserted into the multi-way tree as tree nodes in the order from high level to low level. As an example, the identifications from high level to low level are respectively: w1, s1, r1, z1, z2, j 1. Then, the following tree nodes are inserted into the multi-branch tree, the root node "-" of the multi-branch tree, then w1 is used as a tree node, s1 is used as a tree node under w1, r1 is used as a tree node under s1, z1 is used as a tree node under r1, z2 is used as a tree node under z1, and j1 is used as a leaf node of z 2.
When inserting the identifier, if there is already the same node under the same root node, then it is not necessary to re-insert, and the loop is repeated, so as to generate the multi-way tree shown in fig. 4.
Referring to fig. 4, fig. 4 is a schematic diagram of a multi-way tree according to an embodiment of the present invention. In fig. 4, the root node of the multi-branch tree belongs to 3 tree nodes, and each tree node belongs to a plurality of nodes. The left branch is defined by the following handover rule: w1-s1-r1-z1-z2-j 1.
S303, taking the multi-branch tree as a preset junction point address base.
And taking the multi-branch tree established based on the handover rule as a preset handover point address base. It will be appreciated that the predetermined bank of contact addresses may be established in other ways. Such as: and establishing a table of corresponding relations among the intersection points, the position marks and the storage areas.
In one embodiment of the invention, the junction point is searched in the preset junction point address base according to the position identifier of one relay picking task list, the storage area and the storage area of the next relay picking task list. For example, the junction may be obtained by querying a predetermined junction address bank based on the location identifier, the current storage area, and the storage area of the next relay picking order.
S203, receiving the information that the picking container is at the junction point, and loading the picking container with goods in a relay picking task list.
To alert the picker of the accurate placement of the picking containers, a prompt message including the point of delivery may be sent to the picker. As an example, after determining the point of intersection, a prompt including the point of intersection is sent to the picker's mobile terminal.
And the order picker places the picking containers including the goods in the relay picking task list at the cross point according to the prompt information. The picker scans the number bar code of the interface point, identifying the interface point to confirm that a picking container has been placed at the interface point.
Then the junction sends a message to the back-end server that the picking container is already at the junction. The background server receives a message that the picking container is already at the intersection. Wherein, the picking container is loaded with goods in a relay picking task list.
S204, receiving the information that the picking container is picked up at the cross-point, and searching the cross-point again in the preset cross-point address base.
The picker may pick the picking container at the junction to pick the next item in the relayed picking order to the picking container. Then, if the database is queried according to the relay task single group number and the next relay picking task list can be obtained, S201 to S204 can be executed again until the next relay picking task list is obtained unsuccessfully.
In one embodiment of the invention, after a picking container of goods in one relay picking order is placed at the junction, a prompt message including the identification of the junction and the picking container may be sent to a picker of another relay picking order. To prompt the picker that the picking container is placed at the delivery point and to request timely pick.
The junction sends a message to the background server that the picking container has been picked at the junction. The background server receives the information that the picking container is picked up at the junction, and the background server can search the junction again in the preset junction address base.
In the above embodiment, after the picking containers have been loaded with the goods in one relay picking order, the picking containers may be placed at the junction point, so that the picking containers are loaded with the goods in another relay picking order, and the goods in different storage areas can be picked and placed in the same picking container, thereby improving the utilization rate of the picking containers and reducing the number of the picking containers used. The labor cost of the confluence post is reduced, the production efficiency is not reduced, and the production cost of the warehouse can be reduced.
In one embodiment of the invention, the junction may need to be monitored in order to ensure that picking containers are accurately delivered at the junction in a timely manner.
Referring to fig. 5, fig. 5 is a schematic flow chart of monitoring a junction according to an embodiment of the present invention, which specifically includes the following steps:
s501, determining that the cross-connection point is consistent with the assigned cross-connection point, and increasing the quantity of the relay picking tasks of the cross-connection point by one.
After searching for the delivery point in the predetermined delivery point address library, the picker responsible for picking may receive a prompt including the delivery point. Therefore, the picking personnel can place the picking containers loaded with the relay picking task single goods in the prompted delivery point according to the prompt information.
The picker needs to determine whether the pick container is at an intersection consistent with the intersection designated in the prompt. As an example, the order picker scans the identifier of the delivery point where the picking container is located, and if the identifier of the delivery point is consistent with the designated delivery point, the delivery point is bound with the picking container, thereby indicating that the picking container is placed at the delivery point; if the mark of the located delivery point is different from the designated delivery point, the situation that the picking personnel places the picking container incorrectly is indicated, and the picking container needs to be placed again according to the prompt information.
And determining that the cross point of the picking container is consistent with the assigned cross point, and recording the single quantity of the relay picking tasks of the cross point by the background server by one. The purpose of recording the number of the relay picking task lists in the delivery point is to monitor each relay picking task list in real time and prompt a picker to pick up picking containers at the delivery point in time.
It will be appreciated that the number of relay picking order sheets at the junction is the same as the number of picking receptacles, with one picking receptacle representing one relay picking order sheet.
S502, after the picking containers are picked up at the junction, the number of the relay picking task lists of the junction is reduced by one.
After the picking containers loaded with the goods in the relay picking order sheet are placed at the delivery point, prompt information can be sent to the picker, and the prompt information can comprise the identification of the delivery point and the picking containers so as to prompt the picker to pick the picking containers with the identification at the delivery point. As one example, the picker scans the identification of the picking container at the point of intersection to pick up the picking container.
After the picking member receives the picking container, the background server records the relay picking task list number of the delivery point and reduces one.
The quantity of the relay picking task lists of the cross points can be monitored in real time at each cross point, so that the picking progress of the relay picking task lists can be obtained on one hand; in another aspect, the backlog of the cross-over point may be known to adjust the number of pickers. As one example, a prompt message may be sent to the picker, including the number of pick order delivery points.
Referring to fig. 6, fig. 6 is a schematic flow chart of a picking method according to an embodiment of the present invention, which specifically includes the following steps:
s601, establishing a picking task list.
And establishing a picking task list according to the volume of the goods in the goods list to be picked and the volume of the picking container.
TABLE 1
Picking order Storage house Business company Document type Task state
1 w1 s1 r1 Unfinished
2 w1 s1 r1 Unfinished
Table 1 is a schematic diagram of the order picking order, which includes two order picking orders, namely order picking order 1 and order picking order 2.
TABLE 2
Picking order Manifest for goods Storage area Storage position SKU Quantity of picking Task state
1 1 A A1 1 1 Unfinished
1 2 A A2 1 1 Unfinished
1 1 B B1 3 1 Unfinished
2 3 A A3 1 1 Unfinished
2 4 A A4 1 1 Unfinished
2 3 B B2 3 1 Unfinished
Table 2 is a detailed view of the items on the pick order form, including: pick order form, manifest, storage area, storage location, SKU, pick number and task status.
S602, splitting the picking task list into a plurality of relay picking task lists.
The picking order may be split into a plurality of relay picking order sheets according to the storage area, and the picking order of the plurality of relay picking order sheets may be identified. As one example, the picking order may be identified in a relay order.
TABLE 3
Figure BDA0002233267620000111
Referring to table 3, table 3 is a table for splitting the picking order sheet in table 1 into two relay picking order sheets. The relay picking task list can acquire that the original picking task 1 is divided into two relay picking task lists, namely 1-1 and 1-2.
TABLE 4
Figure BDA0002233267620000112
Referring to table 4, table 4 shows that the picking task list in table 1 is divided into three relay picking task lists according to the storage area
And S603, executing the relay picking task list.
And the order picker picks the goods in the relay picking task order to a picking container.
And S604, judging whether the next relay picking task list exists or not.
And (4) selecting all goods in the relay picking task list to a picking container, and judging whether a next relay picking task list exists or not based on the current relay picking task list number and the relay task list group number.
If the next relay picking task list exists, executing S605; if there is no next relay picking task, S608 is executed.
S605, searching for an intersection.
And searching for the junction in a preset junction address library according to the position identification, the storage area and the storage area of the next relay picking task list of the current relay picking task list.
TABLE 5
Storage house Business company Document type Storage area Relay storage area Handover location
w1 s1 r1 Reservoir A Reservoir B j1
w1 s2 r1 Reservoir A Reservoir B j2
w1 s1 r1 Reservoir A Reservoir B j3
w1 s1 r2 Reservoir B Reservoir C j4
Referring to table 5, table 5 shows the related information searched from the preset access point address library.
S606, placing the picking container at the junction.
The picker places the picking containers at the interface based on the prompt including the interface.
And S607, picking the picking container, and picking the goods in the next relay picking task list to the picking container.
And picking the picking containers at the delivery point by the order picker according to prompt information comprising the identifications of the delivery order and the picking containers, and picking the goods in the next relay picking task order to the picking containers.
And after the next relay picking task list is finished, returning to the step S604.
At the junction, the number of relay picking order sheets is monitored and a prompt message including the number of relay picking order sheets may be sent.
TABLE 6
Junction point State of contact point Number of relay picking order
j1 Open and open 2
j2 Open and open 1
Referring to table 6, table 6 is a cross-point monitoring table including cross-points, cross-point status, and the number of relay picking order sheets. The junction state includes open and closed. Open means that picking containers can be handed over normally. Closing means stopping delivery of the picking container.
And S608, rechecking the delivery.
In the case that there is no next relay picking order, it is indicated that all the relay picking order sheets are completed, that is, the picking container is loaded with the goods in all the relay picking order sheets. The goods in the selected container are checked and then directly delivered.
Referring to fig. 7, fig. 7 is a schematic diagram of a main structure of a picking device according to an embodiment of the present invention, the picking device may implement a picking method, and as shown in fig. 7, the picking device specifically includes:
the splitting module 701 is configured to split the picking task order into a plurality of relay picking task orders according to the storage area, and determine a picking order of the plurality of relay picking task orders.
The searching module 702 is configured to search for the intersection in the preset intersection address library according to the location identifier of one relay picking task order, the storage area, and the storage area of the next relay picking task order after one relay picking task order is completed.
A receiving module 703, configured to receive a message that a picking container is at a junction, where the picking container loads a cargo in a relay picking order;
a message is received that a picking container has been picked at the point of intersection.
In an embodiment of the present invention, the system further includes an establishing module 704, configured to divide the handover rule in the handover rule configuration file into different levels of identifiers, where the handover rule includes a location identifier, a storage area, a relay storage area, and a handover point of the relay picking task order;
according to the sequence from high level to low level, the marks of different levels are inserted into the multi-branch tree as tree nodes, and leaf nodes of the multi-branch tree are junction points;
and taking the multi-branch tree as a preset intersection point address library.
In one embodiment of the invention, the picking order is generated from the volume of the goods in the order to be picked and the volume of the picking container.
In an embodiment of the present invention, the system further includes a monitoring module 705, configured to determine that the intersection is consistent with the assigned intersection, and the number of the relay picking task lists of the intersection is increased by one;
after the picking containers are picked by the junction, the number of the relay picking task lists of the junction is reduced by one.
In an embodiment of the present invention, the monitoring module 705 is further configured to monitor the number of baton picking orders at the intersection and send a prompt message including the number.
In an embodiment of the present invention, the monitoring module 705 is further configured to send a prompt including the intersection point.
In one embodiment of the invention, monitoring module 705 is further configured to send a prompt including an identification of the intersection and the picking receptacle.
Fig. 8 illustrates an exemplary system architecture 800 for a picking method or device to which embodiments of the present invention may be applied.
As shown in fig. 8, the system architecture 800 may include terminal devices 801, 802, 803, a network 804, and a server 805. The network 804 serves to provide a medium for communication links between the terminal devices 801, 802, 803 and the server 805. Network 804 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 801, 802, 803 to interact with a server 805 over a network 804 to receive or send messages or the like. The terminal devices 801, 802, 803 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 801, 802, 803 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 805 may be a server that provides various services, such as a back-office management server (for example only) that supports shopping-like websites browsed by users using the terminal devices 801, 802, 803. The backend management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (for example, target push information, product information — just an example) to the terminal device.
It should be noted that the picking method provided by the embodiment of the present invention is generally performed by the server 805, and accordingly, the picking device is generally disposed in the server 805.
It should be understood that the number of terminal devices, networks, and servers in fig. 8 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 9, shown is a block diagram of a computer system 900 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 9 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 9, the computer system 900 includes a Central Processing Unit (CPU)901 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)902 or a program loaded from a storage section 908 into a Random Access Memory (RAM) 903. In the RAM 903, various programs and data necessary for the operation of the system 900 are also stored. The CPU 901, ROM 902, and RAM 903 are connected to each other via a bus 904. An input/output (I/O) interface 905 is also connected to bus 904.
The following components are connected to the I/O interface 905: an input portion 906 including a keyboard, a mouse, and the like; an output section 907 including components such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card, a modem, or the like. The communication section 909 performs communication processing via a network such as the internet. The drive 910 is also connected to the I/O interface 905 as necessary. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 910 as necessary, so that a computer program read out therefrom is mounted into the storage section 908 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 909, and/or installed from the removable medium 911. The above-described functions defined in the system of the present invention are executed when the computer program is executed by a Central Processing Unit (CPU) 901.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a transmitting unit, an obtaining unit, a determining unit, and a first processing unit. The names of these units do not in some cases constitute a limitation to the unit itself, and for example, the sending unit may also be described as a "unit sending a picture acquisition request to a connected server".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:
splitting the picking task list into a plurality of relay picking task lists according to the storage area, and determining the picking sequence of the relay picking task lists;
after one relay picking task list is finished, searching for a junction in a preset junction address library according to the position identification, the storage area and the storage area of the next relay picking task list of the relay picking task list;
receiving a message that a picking receptacle is at the intersection, the picking receptacle containing the goods in the one relay picking order;
and receiving the message that the picking container is picked at the cross point, and searching the cross point again in a preset cross point address base.
According to the technical scheme of the embodiment of the invention, the picking task list is divided into a plurality of relay picking task lists according to the storage area, and the picking sequence of the relay picking task lists is determined; after one relay picking task list is finished, searching for a junction in a preset junction address library according to the position identification, the storage area and the storage area of the next relay picking task list of the relay picking task list; receiving a message that the picking container is at the junction, and loading the picking container with goods in a relay picking task list; receiving a message that the picking container has been picked at the intersection, and searching the preset intersection address base for the intersection again. Because the goods in different reserves can be selected and place same container, reduce the use quantity of container, can reduce warehouse manufacturing cost simultaneously.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (10)

1. A method of picking a product, comprising:
splitting the picking task list into a plurality of relay picking task lists according to a storage area, determining the picking sequence of the relay picking task lists, and placing the goods in the relay picking task lists in the same picking container;
after one relay picking task list is finished, searching for a junction point in a preset junction point address library according to the position identifier, the storage area and the storage area of the next relay picking task list of the relay picking task list, and taking a multi-branch tree established based on a junction rule as the preset junction point address library, wherein the junction rule comprises the position identifier, the storage area, the relay storage area and the junction point of the relay picking task list;
receiving a message that a picking receptacle is at the intersection, the picking receptacle containing the goods in the one relay picking order;
and receiving the message that the picking container is picked at the cross point, and searching the cross point again in a preset cross point address base.
2. A method of picking as claimed in claim 1, the method further comprising:
dividing the handover rule in the handover rule configuration file into different levels of identifiers;
inserting the identifiers of different levels into a multi-branch tree as tree nodes according to the sequence from high level to low level, wherein leaf nodes of the multi-branch tree are junction points;
and taking the multi-branch tree as the preset intersection point address library.
3. The picking method of claim 1, wherein the picking order is generated from the volume of the goods in the order to be picked and the volume of the picking container.
4. The method of picking in accordance with claim 1, wherein said receiving a message that a picking container has been at the interface point further comprises:
determining that the cross-over point is consistent with the assigned cross-over point, and increasing the number of relay picking task lists of the cross-over point by one;
the receiving the message that the picking container has been picked at the intersection, further comprising:
the number of the relay picking task lists of the junction is reduced by one.
5. A method of picking as claimed in claim 1, the method further comprising: and monitoring the number of the relay picking task lists of the junction, and sending a prompt message comprising the number.
6. The method of picking in claim 1, wherein after searching for the contact in the predetermined contact address library, further comprising: and sending prompt information comprising the junction.
7. The method of picking in accordance with claim 1, wherein said receiving a message that a picking container has been at the interface comprises:
sending a reminder message including the intersection point and an identification of the picking receptacle.
8. A device for picking a product, comprising:
the sorting module is used for sorting the picking task lists into a plurality of relay picking task lists according to the storage area, determining the picking sequence of the relay picking task lists, and placing the goods in the relay picking task lists in the same picking container;
the searching module is used for searching for the junction in a preset junction address library according to the position identifier, the storage area and the storage area of the next relay picking task list of the relay picking task list after the relay picking task list is finished, and taking a multi-branch tree established based on a junction rule as the preset junction address library, wherein the junction rule comprises the position identifier, the storage area, the relay storage area and the junction of the relay picking task list;
a receiving module for receiving a message that a picking receptacle has been at the intersection, the picking receptacle containing the goods in the one relay picking order;
receiving a message that the picking container has been picked at the junction.
9. A pick-up electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.
CN201910974882.4A 2019-10-14 2019-10-14 Order picking method, device, equipment and computer readable medium Active CN110826960B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910974882.4A CN110826960B (en) 2019-10-14 2019-10-14 Order picking method, device, equipment and computer readable medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910974882.4A CN110826960B (en) 2019-10-14 2019-10-14 Order picking method, device, equipment and computer readable medium

Publications (2)

Publication Number Publication Date
CN110826960A CN110826960A (en) 2020-02-21
CN110826960B true CN110826960B (en) 2021-05-25

Family

ID=69549079

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910974882.4A Active CN110826960B (en) 2019-10-14 2019-10-14 Order picking method, device, equipment and computer readable medium

Country Status (1)

Country Link
CN (1) CN110826960B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111709608B (en) * 2020-05-21 2024-03-29 金鹰国际货运代理有限公司上海第一分公司 Method and device for determining picking task, computer equipment and storage medium
CN113822509B (en) * 2020-11-09 2023-11-03 北京京东振世信息技术有限公司 Method and device for grouping sheets

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109359924A (en) * 2018-11-19 2019-02-19 炬星科技(深圳)有限公司 Logistics subregion picking method, device, terminal, system and storage medium based on robot
CN208932210U (en) * 2018-06-12 2019-06-04 北京京东尚科信息技术有限公司 The system for sorting cargo
CN109886625A (en) * 2019-01-30 2019-06-14 炬星科技(深圳)有限公司 Goods sorting method, device and storage medium
CN110245890A (en) * 2019-05-28 2019-09-17 深圳市海柔创新科技有限公司 Kinds of goods method for sorting and kinds of goods sorting system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103136651B (en) * 2013-01-15 2016-06-15 朱南 The system and method for the note issuance based on SOA and the intelligent identification of circulation, location, tracking, monitor and predict
US10981724B2 (en) * 2017-01-31 2021-04-20 Alert Innovation Inc. Packing by destination for automated fulfilled goods
KR102003949B1 (en) * 2018-12-24 2019-07-25 오충헌 Method for providing distribution service connecting buyer to seller through mid-distribution

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN208932210U (en) * 2018-06-12 2019-06-04 北京京东尚科信息技术有限公司 The system for sorting cargo
CN109359924A (en) * 2018-11-19 2019-02-19 炬星科技(深圳)有限公司 Logistics subregion picking method, device, terminal, system and storage medium based on robot
CN109886625A (en) * 2019-01-30 2019-06-14 炬星科技(深圳)有限公司 Goods sorting method, device and storage medium
CN110245890A (en) * 2019-05-28 2019-09-17 深圳市海柔创新科技有限公司 Kinds of goods method for sorting and kinds of goods sorting system

Also Published As

Publication number Publication date
CN110826960A (en) 2020-02-21

Similar Documents

Publication Publication Date Title
CN109772714B (en) Goods sorting method and device, storage medium and electronic equipment
CN110348771B (en) Method and device for order grouping of orders
CN113762858B (en) Inventory management method and device
CN110826960B (en) Order picking method, device, equipment and computer readable medium
CN106202416A (en) Table data write method and device, table data read method and device
CN111260270A (en) Method and device for improving order processing efficiency of store
CN110766349A (en) Tallying method and device
CN113128821A (en) Method and device for determining task
CN110689293B (en) Article delivery processing method and device
CN112101690A (en) Article sorting method and device
CN112551027A (en) Method and device for warehouse entry and exit of stacked boxes
CN113743847B (en) Rechecking method, device and system
CN113393193A (en) Warehouse-out method and device
CN113114776A (en) Data pushing method and device
CN111260271A (en) Method and device for shortening order picking time of store
CN110826948A (en) Warehouse product selection method and device
CN115390958A (en) Task processing method and device
CN112441364B (en) Container warehouse-in or warehouse-back method and device for automatic warehouse
CN113627837B (en) Goods collection positioning method and device
CN112009921B (en) Concentric polygonal warehouse and method and device for loading and unloading articles
CN114429273A (en) Method, device, equipment and computer readable medium for generating warehouse storage position adjustment task information
CN112785213B (en) Warehouse manifest picking construction method and device
CN112131894A (en) Method, system, glasses, device and computer readable medium for sorting articles
CN111260269A (en) Store order processing method and device for improving distribution efficiency
CN113537903B (en) Express receiving method and system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20210302

Address after: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080

Applicant after: Beijing Jingbangda Trading Co.,Ltd.

Address before: 100086 8th Floor, 76 Zhichun Road, Haidian District, Beijing

Applicant before: BEIJING JINGDONG SHANGKE INFORMATION TECHNOLOGY Co.,Ltd.

Applicant before: BEIJING JINGDONG CENTURY TRADING Co.,Ltd.

Effective date of registration: 20210302

Address after: 6 / F, 76 Zhichun Road, Haidian District, Beijing 100086

Applicant after: Beijing Jingdong Zhenshi Information Technology Co.,Ltd.

Address before: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080

Applicant before: Beijing Jingbangda Trading Co.,Ltd.

GR01 Patent grant
GR01 Patent grant