WO2019047523A1 - 用于分拣货物的方法和装置 - Google Patents

用于分拣货物的方法和装置 Download PDF

Info

Publication number
WO2019047523A1
WO2019047523A1 PCT/CN2018/082687 CN2018082687W WO2019047523A1 WO 2019047523 A1 WO2019047523 A1 WO 2019047523A1 CN 2018082687 W CN2018082687 W CN 2018082687W WO 2019047523 A1 WO2019047523 A1 WO 2019047523A1
Authority
WO
WIPO (PCT)
Prior art keywords
goods
sorting unit
order
sorted
target sorting
Prior art date
Application number
PCT/CN2018/082687
Other languages
English (en)
French (fr)
Inventor
陈鲲
Original Assignee
北京京东尚科信息技术有限公司
北京京东世纪贸易有限公司
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 北京京东尚科信息技术有限公司, 北京京东世纪贸易有限公司 filed Critical 北京京东尚科信息技术有限公司
Priority to US16/636,047 priority Critical patent/US11325780B2/en
Publication of WO2019047523A1 publication Critical patent/WO2019047523A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G1/00—Storing articles, individually or in orderly arrangement, in warehouses or magazines
    • B65G1/02—Storage devices
    • B65G1/04—Storage devices mechanical
    • B65G1/137—Storage devices mechanical with arrangements or automatic control means for selecting which articles are to be removed
    • B65G1/1373—Storage devices mechanical with arrangements or automatic control means for selecting which articles are to be removed for fulfilling orders in warehouses
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management

Definitions

  • the present application relates to the field of computer technology, and in particular to the field of warehousing logistics technology, and more particularly to a method and apparatus for sorting goods.
  • warehousing and logistics technology is also particularly important.
  • how to quickly sort out the goods indicated by the order from the warehouse is a technical problem involved in the warehousing logistics technology.
  • the existing sorting method of goods is usually to assign the order to the sorting unit with the least number of orders to be sorted.
  • this method has the problem of low sorting efficiency.
  • an embodiment of the present application provides a method for sorting goods, where the method includes: acquiring an order to be allocated; and determining, for each target sorting unit of the plurality of target sorting units, at least one of the following : the number of orders to be sorted by the target sorting unit, the number of goods to be sorted, or the number of goods to be sorted between the target sorting unit and the above-mentioned order to be dispensed, wherein the number of goods sorted is indicated by the order to be dispensed
  • the quantity of the same kind of goods between the goods and the goods to be sorted of the target sorting unit at least one of the following items based on each target sorting unit: number of orders to be sorted, number of goods to be sorted, or number of types of goods And selecting the target sorting unit; and assigning the to-be-allocated order to the selected target sorting unit, so that the selected target sorting unit sorts out the goods indicated by the to-be-allocated order.
  • an embodiment of the present application provides an apparatus for sorting goods, where the apparatus includes: an acquiring unit configured to acquire an order to be allocated; and a determining unit configured to be used in a plurality of target sorting units Each target sorting unit determines at least one of: the number of orders to be sorted of the target sorting unit, the number of goods to be sorted, or the number of goods to be sorted between the target sorting unit and the order to be dispensed, Wherein, the cargo type coincidence number is the same quantity of the goods type as the goods indicated by the order to be allocated and the goods to be sorted by the target sorting unit; the selecting unit is configured to use at least one of the following according to each target sorting unit : the number of orders to be sorted, the number of goods to be sorted, or the number of goods to be sorted, the target sorting unit is selected; the allocation unit is configured to allocate the above-mentioned order to be allocated to the selected target sorting unit for selection The target sorting unit sorts out the goods indicated by
  • an embodiment of the present application provides an apparatus, where the apparatus includes: one or more processors; and a storage device, configured to store one or more programs, when the one or more programs are one or more of the foregoing
  • the processor when executed, causes the one or more processors described above to implement the method of the first aspect.
  • an embodiment of the present application provides a computer readable storage medium having stored thereon a computer program, the program being implemented by the processor to implement the method of the first aspect.
  • the method and device for sorting goods provided by the embodiment of the present application, by analyzing the existing to-be-sorted orders of the target sorting unit, and selecting some relevant information based on the to-be-sorted orders of the respective target sorting units,
  • the target sorting unit that allocates the order, and sorts the goods indicated by the order to be dispensed by using the selected target sorting unit, thereby improving the sorting efficiency of the goods.
  • FIG. 1 is an exemplary system architecture diagram to which the present application can be applied;
  • FIG. 2 is a flow chart of one embodiment of a method for sorting goods in accordance with the present application
  • FIG. 3 is a schematic diagram of an application scenario of a method for sorting goods according to the present application.
  • 4A is a flow chart of still another embodiment of a method for sorting goods in accordance with the present application.
  • 4B is a schematic illustration of an example of step 405
  • Figure 5 is a schematic structural view of one embodiment of an apparatus for sorting goods according to the present application.
  • FIG. 6 is a schematic structural diagram of a computer system suitable for implementing an electronic device of an embodiment of the present application.
  • FIG. 1 shows an exemplary system architecture 100 of an embodiment of a method for sorting goods or for sorting goods that can be applied to the present application.
  • system architecture 100 can include sorting units 101, 102, 103, network 104, and order distribution server 105.
  • the network 104 is used to provide a medium for the communication link between the sorting units 101, 102, 103 and the order distribution server 105.
  • Network 104 may include various types of connections, such as wired, wireless communication links, fiber optic cables, and the like.
  • the sorting units 101, 102, 103 can interact with the order distribution server 105 via the network 104 to receive or send messages and the like.
  • the sorting unit can send information about the order to be sorted to the order distribution server, which is an order that is assigned to the sorting device but the sorting device is not sorted.
  • the sorting units 101, 102, 103 can also control the sorting device to sort out the goods indicated by the order to be sorted.
  • the sorting unit may be a robot for sorting goods.
  • the order distribution server 105 may be a server that provides various services, for example, can receive new orders, analyze new orders and pending orders, and assign new orders to the order distribution server of the sorting unit.
  • the order distribution server can analyze and process the related data of the received new order, and feed back the processing result (for example, a new order assigned to the sorting unit) to the sorting unit.
  • the method for sorting goods provided by the embodiments of the present application is generally performed by the order distribution server 105. Accordingly, the apparatus for sorting goods is generally disposed in the order distribution server 105.
  • a flow 200 of one embodiment of a method for sorting goods in accordance with the present application is illustrated.
  • the above method for sorting goods includes the following steps:
  • Step 201 Acquire an order to be allocated.
  • the electronic device on which the method for sorting goods is run (for example, the order distribution server shown in FIG. 1) can acquire an order to be dispensed locally or by other electronic devices.
  • the user can submit a new order to the order processing server, and the order processing server can determine from which warehouse the goods indicated in the order are sorted, and then the order processing server can send the order to the order allocation server of the determined warehouse.
  • the order processing server and the order distribution server may be the same electronic device.
  • the order to be allocated may be one or more.
  • the to-be-allocated order may be determined by acquiring pending order information of the pending order, where the pending order information may include priority information and time information. And determining whether the to-be-processed order is determined as the to-be-allocated order according to the foregoing priority information and whether the interval duration between the time indicated by the time information and the current time is greater than a preset duration threshold.
  • the above-mentioned pending order is determined as an order to be dispensed based on the priority information.
  • the pending order is determined as an order to be allocated.
  • the priority information may include information indicating that the order is a rush order or a normal order, and the rush order may be an order to be assigned based on the priority information.
  • the normal order For a normal order, if the interval between the time indicated by the time information of the normal order (which may be the order time or the order time) and the current time is greater than the preset duration threshold, the normal order is determined as the order to be allocated. . It can be understood that if the interval between the time indicated by the time information of the ordinary order and the current time is greater than the preset duration threshold, it indicates that the pending order may be placed for a longer period of time and should be allocated as soon as possible, otherwise the order may be caused. Delivery delay.
  • Step 202 Determine, for each of the plurality of target sorting units, at least one item: the number of orders to be sorted of the target sorting unit, the number of goods to be sorted, or the target sorting unit to be sorted The number of goods in the order between the orders is overlapped.
  • the electronic device on which the method for sorting goods is run may determine the following for each of the plurality of target sorting units. At least one item: the number of orders to be sorted of the target sorting unit, the number of items to be sorted, or the number of goods to be sorted between the target sorting unit and the order to be dispensed.
  • the target sorting unit may be a unit capable of completing the sorting task of the goods indicated by the order.
  • Each target sorting unit can sort the goods indicated by one or more orders.
  • the target sorting unit may include a movable sorting robot, the sorting robot may move in the warehouse, and multiple shelves are placed in the warehouse, and the sorting robot may be from the shelf. Sort the goods on.
  • the target sorting unit may include a sorting robot that sorts in situ, and the rack in the warehouse may be transported by the transport robot to the sorting robot that sorts in situ. Nearby, the sorting robot for sorting in situ sorts the goods required to be sorted from the shelf.
  • the target sorting unit may include various cargo sorting tools that are operated by the sorter, such as may include, but are not limited to, a small forklift traveling in the warehouse and Place the container for the sorted goods.
  • the order assigned to the target sorting unit may have been sorted or may not have been sorted. If the order is assigned to the target sorting unit and the target sorting unit has not sorted the order, the order can be called the order to be sorted by the target sorting unit.
  • the number of orders to be sorted and the number of items to be sorted may be determined according to the to-be-sorted order that has been allocated to the target sorting unit but the target sorting unit has not been sorted.
  • the classification of the types of goods can be pre-classified according to actual experience.
  • shampoos and shower gels can be classified as daily necessities; all brands of shampoos can also be classified as shampoos; Different brands of shampoos are classified as different shampoo types.
  • the type of goods can be identified according to the goods. As an example, it is possible to distinguish whether the goods are of the same kind according to the Stock Keeping Unit (SKU), and the same kind of goods if the SKUs are the same, and different types of acquisition if the SKUs are different.
  • SKU Stock Keeping Unit
  • the cargo type coincidence number is the same number of cargo types as the goods indicated by the order to be dispensed and the goods to be sorted by the target sorting unit.
  • two types of goods are indicated in the order to be dispensed, namely shampoo and shower gel.
  • Three kinds of goods are indicated in the to-be-sorted order of the target sorting unit A, namely shampoo, shower gel and biscuits, and the same goods to be dispensed with the target sorting unit A are shampoo and shower gel.
  • Two kinds of goods, namely shower gel and biscuit, are indicated in the to-be-sorted order of the target sorting unit B, and the same goods type in the target sorting unit B is the shower gel. Therefore, it can be concluded that the number of coincidences of the goods to be dispensed with the target sorting unit A is 2, and the number of coincidences of the goods to be dispensed with the target sorting unit B is 1.
  • Step 203 Select a target sorting unit based on at least one of the following target sorting units: the number of orders to be sorted, the number of types of goods to be sorted, or the number of sorts of goods.
  • the electronic device on which the method for sorting goods is run may be based on at least one of the following target sorting units: the number of orders to be sorted, Select the target sorting unit by the number of sorted goods or the number of sorts of goods.
  • step 203 may be implemented by: finding and selecting a target sorting unit with the smallest number of orders to be sorted.
  • step 203 may be implemented by: finding and selecting a target sorting unit having the largest number of coincidences of the goods.
  • Step 204 Assign the to-be-allocated order to the selected target sorting unit.
  • the electronic device on which the method for sorting goods is run may allocate the above-mentioned order to be allocated to the selected target sorting unit for selection.
  • the target sorting unit sorts out the goods indicated by the above-mentioned order to be dispensed.
  • FIG. 3 is a schematic diagram of an application scenario of a method for sorting goods according to the present embodiment.
  • the order distribution server 301 may first acquire an order to be allocated; thereafter, the order distribution server may determine at least one of the following for each of the plurality of target sorting units: the target point The number of orders to be sorted, the number of goods to be sorted, or the number of goods to be sorted between the target sorting unit and the order to be dispensed, as shown by 302 in FIG.
  • the order distribution server may Based on at least one of the following target sorting units: the number of orders to be sorted, the number of goods to be sorted, or the number of types of goods to be sorted, the target sorting unit is selected, as shown by 303 in FIG. 3; and then, the order is allocated.
  • the server may allocate the above-mentioned to-be-allocated order to the selected target sorting unit 305, as shown by 304 in FIG. 3; finally, the selected target sorting unit 305 may sort out the goods indicated by the to-be-allocated order.
  • the method provided by the above embodiment of the present application selects the target to be sorted by the target sorting unit, and selects the target sorting of the order to be dispensed based on some related information of the to-be-sorted order of each target sorting unit.
  • the unit, the selected target sorting unit sorts the goods indicated by the order to be allocated, and improves the sorting efficiency of the goods.
  • the process 400 of the method for sorting goods includes the following steps:
  • step 401 an order to be allocated is obtained.
  • an electronic device for example, the order distribution server shown in FIG. 1 on which the method for sorting goods is run can acquire an order to be dispensed.
  • the order to be allocated may be plural.
  • Step 402 For each target sorting unit of the plurality of target sorting units, determine the number of orders to be sorted, the number of types of goods to be sorted, and the target sorting unit of the target sorting unit and the order to be allocated respectively The number of goods in the room overlaps.
  • the electronic device on which the method for sorting goods is run may determine the target sorting unit for each of the plurality of target sorting units. The number of orders to be sorted by the target sorting unit, the number of goods to be sorted, and the number of goods sorted by the target sorting unit and the order to be dispensed respectively.
  • the target sorting unit may be all sorting units in the warehouse.
  • a plurality of sorting units may be disposed in the warehouse, and the sorting unit is correspondingly provided with a slot for placing the to-be-sorted order indication assigned to the sorting unit.
  • the goods, the sorting unit can sort the goods indicated by the order to be sorted from the shelf into the slots.
  • the order sorting unit has already bound the information of the order to be sorted with the slot, that is, the goods indicated by the order to be sorted have been placed in this slot, or the goods indicated by the order to be sorted are in the division. After it is sorted, it will be placed in this slot. Then, this slot can be called the occupied slot.
  • the number of occupied slots in the warehouse can be determined as the number of occupied slots.
  • the target sorting unit may be selected from the sorting unit of the warehouse by using the following method: according to the number of slots corresponding to the sorting unit The number of occupied slots in the warehouse and the number of orders to be allocated determine the number of open. From the plurality of sorting units, the number of sorting units is selected to be turned on. The selected sorting unit is determined as the target sorting unit.
  • sorting unit 1 there are five sorting units in the warehouse, numbered as sorting unit 1, sorting unit 2, sorting unit 3, sorting unit 4, sorting unit 5.
  • the number of slots in each sorting unit is 10, and 3 slots in the corresponding slot for each sorting unit are occupied slots. If the number of orders to be allocated is 20, 20 unoccupied slots (free slots) are required for calculation.
  • a sorting unit can be randomly selected. If the number of free slots is less than the number of orders to be allocated, one sorting unit can be selected until the total number of free slots in the selected sorting unit is not less than the number of orders to be allocated.
  • the selected sorting unit is determined as the target sorting unit.
  • three sorting units need to be selected as the target sorting unit.
  • the number of coincidences of the goods between the to-be-allocated order and each target sorting unit may be determined.
  • Step 403 Find a target sorting unit whose number of orders to be sorted is smaller than a threshold of the order to be sorted.
  • the electronic device on which the method for sorting goods is run (for example, the order distribution server shown in FIG. 1) can find the target sorting unit whose number of orders to be sorted is smaller than the threshold of the order to be sorted.
  • step 403 may be two types, one is not found, and the situation will be performed step 404, step 405 and step 406; one is found, and the situation will be executed step 407 .
  • Step 404 in response to not finding the target sorting unit whose number of orders to be sorted is smaller than the threshold of the order to be sorted, for each target sorting unit, according to the number of types of goods to be sorted according to the target sorting unit and to be allocated The number of goods in the order between the orders is coincident, and the sorting degree of the goods of the target sorting unit and the order to be dispensed is determined.
  • the electronic device on which the method for sorting goods is run may respond to the target that the number of orders to be sorted is less than the threshold of the order to be sorted.
  • a sorting unit for each target sorting unit, determining the target sorting unit and the to-be-allocated order according to the number of the goods to be sorted of the target sorting unit and the number of the goods to be sorted with the order to be dispensed
  • the type of cargo is coincident.
  • the number of coincidences between the to-be-allocated order and each cargo sorting unit of each target sorting unit may be determined; for the plurality of target sorting units Each target sorting unit determines the coincidence degree of the goods sorting unit and the goods to be dispensed according to the number of the goods to be sorted of the target sorting unit and the number of the goods to be assigned to the order to be allocated.
  • the number of goods to be assigned to order A is 4, the number of goods to be assigned to order B is 5, and the number of goods to be sorted in the target sorting unit C to be sorted is 6, and the target sorting unit D
  • the number of goods to be sorted is 8.
  • the number of coincidences of the goods to be dispensed between the order A and the target sorting unit C is 1, and the number of coincidences of the goods to be dispensed and the target sorting unit D is 2.
  • the number of coincidences of the goods to be dispensed between the order B and the target sorting unit C is 3, and the number of coincidences of the goods to be dispensed with the target sorting unit D is 4.
  • the ratio of the number of types of goods to the number of types of goods of the target sorting unit may be determined as the degree of coincidence of the types of goods.
  • the second square of the number of goods to be sorted of the target sorting unit may be first obtained, and then the ratio of the number of the goods of the sort to the square of the above-mentioned quadratic is determined as the goods.
  • the manner of squared the number of goods to be sorted can enlarge the difference of the base number of the goods to be sorted by the target sorting unit, and the sorting efficiency can be improved relative to the method of not taking the square.
  • the number of goods to be sorted in the target sorting unit A is 3, the number of goods to be sorted in the target sorting unit B is 6, and the type of goods to be dispensed between the order C and the target sorting unit A coincides.
  • the number is 1, and the number of coincidences of the goods to be dispensed between the order C and the target sorting unit B is 2.
  • the ratio of the number of goods type coincidence number 1 to the number of goods to be sorted 3 may be determined as the degree of coincidence of the goods type between the order C to be dispensed and the target sorting unit A, that is, 1/3.
  • the ratio of the number of types of goods to be sorted to the number of types of goods to be sorted 6 can be determined as the degree of coincidence of the type of goods between the order C to be dispensed and the target sorting unit B, which is also 1/3.
  • the ratio is the same at this time, the number of types of goods to be sorted in the target sorting unit A is small, and the sorting of fewer types can be completed, and the target sorting unit B has more items to be sorted, and more picks are needed.
  • the category can complete the sorting task.
  • the square of the number of goods to be sorted of the target sorting unit is first obtained, it is determined that the sorting degree of the goods between the order C to be dispensed and the target sorting unit A is 1/9. It is determined that the degree of coincidence of the goods type between the order C to be allocated and the target sorting unit B is 1/18. Thereby, the target sorting unit with higher execution efficiency can be selected.
  • the target sorting unit having the highest degree of coincidence with the item type of the order to be dispensed may be selected. This assignment to be assigned is then assigned to the target sorting unit with the highest degree of coincidence.
  • Step 405 Select the to-be-allocated order and the target sorting unit with the highest product type coincidence according to the determined sorting degree of the goods.
  • the electronic device on which the method for sorting goods is run (for example, the order allocation server to be allocated shown in FIG. 1) can select the highest degree of coincidence of the goods according to the determined sorting degree of the goods.
  • the order to be assigned and the target sorting unit can select the highest degree of coincidence of the goods according to the determined sorting degree of the goods.
  • FIG. 4B is a schematic diagram illustrating an example of the step 405, the cargo type coincidence degree between the order to be allocated C and the target sorting unit A is 1/9, and the order C and the target to be allocated are allocated.
  • the sorting degree of the cargo type between the picking units B is 1/18; the coincidence degree of the cargo type between the order D to be dispensed and the target sorting unit A is 1/6, between the order D to be dispensed and the target sorting unit B
  • the cargo type coincidence is 1/4. Therefore, the to-be-allocated order and the target sorting unit having the highest cargo type coincidence are the to-be-allocated order D and the target sorting unit B.
  • step 406 the selected order to be allocated is allocated to the selected target sorting unit.
  • the electronic device on which the method for sorting goods is run may allocate the selected order to be allocated to the selected target sorting unit,
  • the selected target sorting unit sorts the goods indicated by the selected order to be dispensed.
  • the order C to be dispensed may be assigned to the target sorting unit B, and the goods indicated by the order C to be sorted are sorted by the target sorting unit B for sorting by the target sorting unit B. Assign the goods indicated by order C.
  • Step 407 In response to finding the target sorting unit whose number of orders to be sorted is smaller than the threshold of the to-be-ordered order, assign the to-be-allocated order to the found target sorting unit.
  • the electronic device on which the method for sorting goods is run can respond to find the target number of the number of orders to be sorted that is smaller than the threshold of the order to be sorted.
  • the sorting unit allocates the to-be-allocated order to the found target sorting unit.
  • the target sorting unit 1 the target sorting unit 2, and the target sorting unit 3, respectively.
  • the threshold of the order to be sorted is 3, the number of orders to be sorted by the target sorting unit 1 is 4, the number of orders to be sorted by the target sorting unit 2 is 2, and the number of orders to be sorted by the target sorting unit 3 is 5.
  • the order to be allocated can be allocated to the target sorting unit 2 whose number of orders to be sorted is smaller than the threshold of the order to be sorted. It can be understood that, before calculating the coincidence degree of the goods, the order to be allocated is allocated to the target sorting unit with a small number of orders to be sorted, which can reduce the calculation amount while improving the overall sorting efficiency.
  • the flow 400 of the method for sorting goods in the present embodiment highlights the to-be-allocated order and the target sorting unit with the highest sorting of the sorted goods, as compared with the embodiment corresponding to FIG. A step of.
  • the solution described in this embodiment can further improve the efficiency of sorting goods.
  • the present application provides an embodiment of an apparatus for sorting goods, the apparatus embodiment corresponding to the method embodiment shown in FIG.
  • the device can be specifically applied to various electronic devices.
  • the apparatus 500 for sorting goods described above in this embodiment includes an obtaining unit 501, a determining unit 502, a selecting unit 503, and an allocating unit 504.
  • the obtaining unit is configured to acquire an order to be allocated
  • the determining unit is configured to determine, for each target sorting unit of the plurality of target sorting units, at least one of the following: the target sorting unit to be sorted The number of orders, the number of goods to be sorted, or the number of goods to be sorted between the target sorting unit and the above-mentioned order to be dispensed, wherein the number of goods type coincides with the goods to be dispensed and the target sorting unit The number of the same kind of goods between the picking goods; the selecting unit is configured to use at least one of the following items according to each target sorting unit: the number of orders to be sorted, the number of goods to be sorted, or the number of sorts of goods, and the target points are selected.
  • a distribution unit configured to allocate the above-mentioned to allocate the
  • step 201 the specific processing of the obtaining unit 501, the determining unit 502, the selecting unit 503, and the allocating unit 504 and the technical effects thereof may be respectively referred to step 201, step 202, step 203 in the corresponding embodiment of FIG. 2, and The related description of step 204 will not be repeated here.
  • the selecting unit is further configured to: search for a target sorting unit whose number of orders to be sorted is smaller than a threshold of the order to be sorted; and determine the number of orders to be sorted in response to not finding the number of orders to be sorted a target sorting unit smaller than the threshold of the order to be sorted, and for each target sorting unit, the target is determined according to the number of goods to be sorted of the target sorting unit and the number of goods to be sorted with the order to be allocated
  • the sorting unit overlaps with the goods of the above-mentioned order to be dispensed.
  • the selecting unit is further configured to: select a target sorting unit that has the highest degree of coincidence with the item type of the order to be allocated.
  • the to-be-allocated order is a plurality of to-be-allocated orders; and the selecting unit is further configured to: determine, for each of the plurality of to-be-allocated orders, an order to be allocated The number of the goods to be dispensed coincides with each cargo type of each target sorting unit; for each of the plurality of target sorting units, the number of goods to be sorted according to the target sorting unit and The number of the goods of the order to be dispensed is coincident, and the sorting degree of the sorting unit of the target and the order of the goods to be dispensed is determined.
  • the selecting unit is further configured to: select an item to be allocated and a target sorting unit with the highest product type coincidence according to the determined sorting degree of the goods; and the foregoing allocation The unit is further configured to: allocate the selected order to be allocated to the selected target sorting unit, so that the selected target sorting unit sorts out the goods indicated by the selected order to be allocated.
  • the selecting unit is further configured to: sort, according to the target sorting unit that finds that the number of orders to be sorted is smaller than a threshold of the order to be sorted, sorting the searched target The unit allocates the above-mentioned order to be allocated.
  • a plurality of sorting units are disposed in the warehouse, and the sorting unit is correspondingly provided with a slot for placing the indication of the order to be sorted assigned to the sorting unit.
  • the cargo device further includes an opening unit (not shown) configured to: the method further comprises: determining to open according to the number of slots corresponding to the sorting unit, the number of occupied slots of the warehouse, and the number of orders to be allocated a number; from the plurality of sorting units, selecting a number of sorting units to be opened; and determining the sorting unit to be the target sorting unit.
  • the acquiring unit is further configured to: obtain pending order information of the to-be-processed order, where the to-be-processed order information includes priority information and time information; Whether the level information and the interval time between the time indicated by the time information and the current time are greater than a preset time threshold determine whether the above-mentioned pending order is determined as the above-mentioned order to be allocated.
  • FIG. 6 a block diagram of a computer system 600 suitable for use in implementing the electronic device of the embodiments of the present application is shown.
  • the electronic device shown in FIG. 6 is merely an example, and should not impose any limitation on the function and scope of use of the embodiments of the present application.
  • computer system 600 includes a central processing unit (CPU) 601 that can be loaded into a program in random access memory (RAM) 603 according to a program stored in read only memory (ROM) 602 or from storage portion 608. And perform various appropriate actions and processes.
  • RAM random access memory
  • ROM read only memory
  • RAM random access memory
  • various programs and data required for the operation of the system 600 are also stored.
  • the CPU 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604.
  • An input/output (I/O) interface 605 is also coupled to bus 604.
  • the following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, etc.; an output portion 607 including, for example, a cathode ray tube (CRT), a liquid crystal display (LCD), and the like, and a storage portion 608 including a hard disk or the like. And a communication portion 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the Internet.
  • Driver 610 is also coupled to I/O interface 605 as needed.
  • a removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory or the like, is mounted on the drive 610 as needed so that a computer program read therefrom is installed into the storage portion 608 as needed.
  • an embodiment of the present disclosure includes a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for executing the method illustrated in the flowchart.
  • the computer program can be downloaded and installed from the network via communication portion 609, and/or installed from removable media 611.
  • the central processing unit (CPU) 601 the above-described functions defined in the method of the present application are performed.
  • the computer readable medium described above may be a computer readable signal medium or a computer readable storage medium or any combination of the two.
  • the computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the foregoing.
  • a computer readable storage medium may be any tangible medium that can contain or store a program, which can be used by or in connection with an instruction execution system, apparatus or device.
  • a computer readable signal medium may include a data signal that is propagated in the baseband or as part of a carrier, carrying computer readable program code. Such propagated data signals can take a variety of forms including, but not limited to, electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the computer readable signal medium can also be any computer readable medium other than a computer readable storage medium, which can transmit, propagate, or transport a program for use by or in connection with the instruction execution system, apparatus, or device.
  • Program code embodied on a computer readable medium can be transmitted by any suitable medium, including but not limited to wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
  • each block of the flowchart or block diagram can represent a module, a program segment, or a portion of code that includes one or more of the logic functions for implementing the specified.
  • Executable instructions It should also be noted that in some implementations of substitutions, the functions noted in the blocks may also occur in a different order than that illustrated in the drawings. For example, two successively represented blocks may in fact be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending upon the functionality involved.
  • each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts can be implemented in a dedicated hardware-based system that performs the specified function or operation. Or it can be implemented by a combination of dedicated hardware and computer instructions.
  • the units involved in the embodiments of the present application may be implemented by software or by hardware.
  • the described unit may also be provided in a processor, for example, as a processor including an acquisition unit, a determination unit, a selection unit, and an allocation unit.
  • the name of these units does not constitute a limitation on the unit itself in some cases.
  • the obtaining unit may also be described as “a unit that acquires an order to be allocated”.
  • the present application also provides a computer readable medium, which may be included in the apparatus described in the above embodiments, or may be separately present and not incorporated into the apparatus.
  • the computer readable medium carries one or more programs, when the one or more programs are executed by the device, causing the device to: acquire an order to be dispensed; for each target sorting unit of the plurality of target sorting units Determining at least one of the following: the number of orders to be sorted of the target sorting unit, the number of goods to be sorted, or the number of goods to be sorted between the target sorting unit and the order to be dispensed, wherein the number of goods is coincident The number of the same type of goods between the goods indicated by the order to be allocated and the goods to be sorted by the target sorting unit; at least one of the following based on the sorting unit of each target: number of orders to be sorted, type of goods to be sorted The number or the type of the goods is coincident, and the target sorting unit is selected; the order

Abstract

本申请实施例公开了用于分拣货物的方法和装置。该方法的一具体实施方式包括：获取待分配订单；对于多个目标分拣单元中的每个目标分拣单元，确定以下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或该目标分拣单元与该待分配订单之间的货物种类重合数；基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元；将该待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出该待分配订单所指示的货物。该实施方式提高了分拣效率。

Description

用于分拣货物的方法和装置
相关申请的交叉引用
本专利申请要求于2017年9月7日提交的、申请号为201710799055.7、申请人为北京京东尚科信息技术有限公司和北京京东世纪贸易有限公司、发明名称为“用于分拣货物的方法和装置”的中国专利申请的优先权，该申请的全文以引用的方式并入本申请中。
技术领域
本申请涉及计算机技术领域，具体涉及仓储物流技术领域，尤其涉及用于分拣货物的方法和装置。
背景技术
随着电子商务的不断发展，仓储物流技术也显得尤为重要。在订单量巨大的情况下，如何将订单所指示的货物从仓库中快速分拣出来，是仓储物流技术所涉及的技术问题。
现有的货物分拣方式，通常是将订单分配至待分拣订单数最少的分拣单元，但是，这种方式存在着分拣效率较低的问题。
发明内容
本申请实施例的目的在于提出一种改进的用于分拣货物的方法和装置，来解决以上背景技术部分提到的技术问题。
第一方面，本申请实施例提供了一种用于分拣货物的方法，上述方法包括：获取待分配订单；对于多个目标分拣单元中的每个目标分拣单元，确定以下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或该目标分拣单元与上述待分配订单之间的货物种类重合数，其中，货物种类重合数为待分配订单所指示的货物与目标分拣单元的待分拣货物之间相同的货物种类的数量；基于各个目标分拣单 元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元；将上述待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出上述待分配订单所指示的货物。
第二方面，本申请实施例提供了一种用于分拣货物的装置，上述装置包括：获取单元，配置用于获取待分配订单；确定单元，配置用于对于多个目标分拣单元中的每个目标分拣单元，确定以下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或该目标分拣单元与上述待分配订单之间的货物种类重合数，其中，货物种类重合数为待分配订单所指示的货物与目标分拣单元的待分拣货物之间相同的货物种类的数量；选取单元，配置用于基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元；分配单元，配置用于将上述待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出上述待分配订单所指示的货物。
第三方面，本申请实施例提供了一种设备，上述设备包括：一个或多个处理器；存储装置，用于存储一个或多个程序，当上述一个或多个程序被上述一个或多个处理器执行时，使得上述一个或多个处理器实现如第一方面的方法。
第四方面，本申请实施例提供了一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现如第一方面的方法。
本申请实施例提供的用于分拣货物的方法和装置，通过分析目标分拣单元已有的待分拣订单，基于各个目标分拣单元的待分拣订单的一些相关信息，选出执行待分配订单的目标分拣单元，利用选出的目标分拣单元分拣待分配订单指示的货物，提高了货物分拣效率。
附图说明
通过阅读参照以下附图所作的对非限制性实施例所作的详细描述，本申请的其它特征、目的和优点将会变得更明显：
图1是本申请可以应用于其中的示例性系统架构图；
图2是根据本申请的用于分拣货物的方法的一个实施例的流程图；
图3是根据本申请的用于分拣货物的方法的一个应用场景的示意图；
图4A是根据本申请的用于分拣货物的方法的又一个实施例的流程图；
图4B是对步骤405的举例说明的示意图；
图5是根据本申请的用于分拣货物的装置的一个实施例的结构示意图；
图6是适于用来实现本申请实施例的电子设备的计算机系统的结构示意图。
具体实施方式
下面结合附图和实施例对本申请作进一步的详细说明。可以理解的是，此处所描述的具体实施例仅仅用于解释相关发明，而非对该发明的限定。另外还需要说明的是，为了便于描述，附图中仅示出了与有关发明相关的部分。
需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本申请。
图1示出了可以应用本申请的用于分拣货物的方法或用于分拣货物的装置的实施例的示例性系统架构100。
如图1所示，系统架构100可以包括分拣单元101、102、103，网络104和订单分配服务器105。网络104用以在分拣单元101、102、103和订单分配服务器105之间提供通信链路的介质。网络104可以包括各种连接类型，例如有线、无线通信链路或者光纤电缆等等。
分拣单元101、102、103可以通过网络104与订单分配服务器105交互，以接收或发送消息等。例如，分拣单元可以向订单分配服务器发送待分拣订单的相关信息，待分拣订单是分配至分拣设备、但分拣 设备未分拣完毕的订单。
分拣单元101、102、103还可以控制分拣设备分拣出待分拣订单所指示的货物。作为示例，分拣单元可以是用于分拣货物的机器人。
订单分配服务器105可以是提供各种服务的服务器，例如可以接收新订单，并对新订单和待分拣订单进行分析，将新订单分配至分拣单元的订单分配服务器。订单分配服务器可以对接收到的新订单的相关数据进行分析等处理，并将处理结果(例如将分配给分拣单元的新订单)反馈给分拣单元。
需要说明的是，本申请实施例所提供的用于分拣货物的方法一般由订单分配服务器105执行，相应地，用于分拣货物的装置一般设置于订单分配服务器105中。
应该理解，图1中的分拣单元、网络和订单分配服务器的数目仅仅是示意性的。根据实现需要，可以具有任意数目的分拣单元、网络和订单分配服务器。
继续参考图2，其示出了根据本申请的用于分拣货物的方法的一个实施例的流程200。上述的用于分拣货物的方法，包括以下步骤：
步骤201，获取待分配订单。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的订单分配服务器)可以本地或其它电子设备获取待分配订单。
通常，用户可以向订单处理服务器提交一个新订单，订单处理服务器可以确定从哪个仓库分拣出订单中指示的货物，然后，订单处理服务器可以将此订单发送至所确定的货仓的订单分配服务器。需要说明的是，订单处理服务器和订单分配服务器可能是同一电子设备。
在本实施例中，待分配订单可以是一个也可以是多个。
在本实施例的一些可选的实现方式中，待分配订单可以是通过以下方式确定的：获取待处理订单的待处理订单信息，在这里，待处理订单信息可以包括优先级信息和时间信息。根据上述优先级信息以及上述时间信息所指示的时间与当前时间之间的间隔时长是否大于预设 时长阈值，确定是否将上述待处理订单确定为上述待分配订单。
作为示例，可以根据优先级信息，确定是否将上述待处理订单确定为待分配订单。响应于确定不将上述待处理订单确定为待分配订单，确定上述时间与当前时间之间的间隔时长是否大于预设时长阈值。响应于确定上述间隔时长大于预设时长阈值，将上述待处理订单确定为待分配订单。
作为示例，优先级信息可以包括指示订单为紧急订单或普通订单的信息，可以根据优先级信息，将紧急订单为待分配订单。对于普通订单，如果这个普通订单的时间信息所指示的时间(可以是下单时间或接单时间)与当前时间之间的间隔时长大于预设时长阈值，则将此普通订单确定为待分配订单。可以理解，如果这个普通订单的时间信息所指示的时间与当前时间之间的间隔时长大于预设时长阈值，说明此待处理订单可能被放置的时间较长，应尽快分配，否则可能导致订单货物配送延迟。
步骤202，对于多个目标分拣单元中的每个分拣单元，确定一下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或待目标分拣单元与待分配订单之间的货物种类重合数。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的订单分配服务器)可以对于多个目标分拣单元中的每个目标分拣单元，确定以下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或该目标分拣单元与上述待分配订单之间的货物种类重合数。
在本实施例中，目标分拣单元可以是能够完成订单所指示的货物的分拣任务的单元。每个目标分拣单元可以分拣一个或多个订单所指示的货物。
在本实施例的一些可选的实现方式中，上述目标分拣单元可以包括可移动的分拣机器人，分拣机器人可以在货仓中移动，货仓中放置多个货架，分拣机器人可以从货架上分拣货物。
在本实施例的一些可选的实现方式中，上述目标分拣单元可以包括在原地进行分拣的分拣机器人，货仓中的货架可以由搬运机器人搬 运至在原地进行分拣的分拣机器人附近，以供在原地进行分拣的分拣机器人将待分拣订单中需要的货物从货架中分拣出来。
在本实施例的一些可选的实现方式中，目标分拣单元可以包括由分拣人员操作的各种货物分拣工具，例如可以包括但不限于在货仓中行驶的小铲车和用于放置分拣出的货物的容器。
可以理解，分配至目标分拣单元的订单，目标分拣单元可能已经分拣完毕，也可能还未分拣完毕。如果订单分配至目标分拣单元、目标分拣单元又没分拣完毕该订单，则此订单即可以称为目标分拣单元的待分拣订单。
在本实施例中，可以根据已分配至该目标分拣单元、但该目标分拣单元未分拣完毕的待分拣订单，确定待分拣订单数和待分拣货物种类数。
需要说明的是，货物种类的分类可以是根据实际经验预先分类的，作为示例，洗发水和沐浴露可以归为日用品一类；还可以将所有品牌的洗发水归为洗发水一类；还可以将不同品牌的洗发水归为不同的洗发水种类。
需要说明的是，可以根据货物标识得货物种类。作为示例，可以根据货物的库存量单位(Stock Keeping Unit，SKU)区分货物是否是同一种类，如果SKU相同，则为同一种货物，如果SKU不同，则为不同种类的获取。
在本实施例中，货物种类重合数为待分配订单所指示的货物与目标分拣单元的待分拣货物之间相同的货物种类的数量。
作为示例，待分配订单中指示了2种货物，分别为洗发水和沐浴露。目标分拣单元A的待分拣订单中指示了3种货物，分别是洗发水、沐浴露和饼干，待分配订单与目标分拣单元A相同的货物种类为洗发水和沐浴露。目标分拣单元B的待分拣订单中指示了2种货物，分别是沐浴露和饼干，待分配订单与目标分拣单元B中的相同的货物种类为沐浴露。因此，可以得出，待分配订单与目标分拣单元A的货物种类重合数为2，待分配订单与目标分拣单元B的货物种类重合数为1。
步骤203，基于各个目标分拣单元的以下至少一项：待分拣订单 数、待分拣货物种类种类数或货物种类重合数，选取目标分拣单元。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的订单分配服务器)可以基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类种类数或货物种类重合数，选取目标分拣单元。
在本实施例的一些可选的实现方式中，步骤203可以通过以下方式实现：查找并选取待分拣订单数最小的目标分拣单元。
在本实施例的一些可选的实现方式中，步骤203可以通过以下方式实现：查找并选取货物种类重合数最大的目标分拣单元。
步骤204，将待分配订单分配至选取出的目标分拣单元。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的订单分配服务器)可以将上述待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出上述待分配订单所指示的货物。
继续参见图3，图3是根据本实施例的用于分拣货物的方法的应用场景的一个示意图。在图3的应用场景中，订单分配服务器301可以首先获取待分配订单；之后，订单分配服务器可以对于多个目标分拣单元中的每个目标分拣单元，确定以下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或该目标分拣单元与上述待分配订单之间的货物种类重合数，如图3中的302所示；再后，订单分配服务器可以基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元，如图3中的303所示；再后，订单分配服务器可以将上述待分配订单分配至选取出的目标分拣单元305，如图3中的304所示；最后，选取出的目标分拣单元305可以分拣出上述待分配订单所指示的货物。
本申请的上述实施例提供的方法，通过分析目标分拣单元已有的待分拣订单，基于各个目标分拣单元的待分拣订单的一些相关信息，选出执行待分配订单的目标分拣单元，选出的目标分拣单元分拣待分配订单指示的货物，提高了货物分拣效率。
进一步参考图4A，其示出了用于分拣货物的方法的又一个实施例的流程400。该用于分拣货物的方法的流程400，包括以下步骤：
步骤401，获取待分配订单。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的订单分配服务器)可以获取待分配订单。
在本实施例中，待分配订单可以是多个。
步骤402，对于多个目标分拣单元中的每个目标分拣单元，确定该目标分拣单元的待分拣订单数、待分拣货物种类数和该目标分拣单元分别与待分配订单之间的货物种类重合数。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的订单分配服务器)可以对于多个目标分拣单元中的每个目标分拣单元，确定该目标分拣单元的待分拣订单数、待分拣货物种类数和该目标分拣单元分别与待分配订单之间的货物种类重合数。
在本实施例的一些可选的实现方式中，目标分拣单元可以是货仓中的所有分拣单元。
在本实施例的一些可选的实现方式中，货仓中可以设置有多个分拣单元，分拣单元对应设置有槽位，槽位用于放置分配至分拣单元的待分拣订单指示的货物，分拣单元可以将待分拣订单指示的货物从货架上分拣至槽位中。
可以理解，如果订单分拣单元已经将待分拣订单与槽位的信息进行绑定，即这个槽位中已经放置有待分拣订单所指示的货物，或者，待分拣订单指示的货物在分拣出来后将会放置到这个槽位中，那么，可以这个槽位可以称为已占用槽位。可以将货仓中已占用槽位的数量确定为已占用槽位数。
在本实施例的一些可选的实现方式中，可以在步骤402之前，可以利用以下方式，从货仓的分拣单元中，选取出目标分拣单元：根据根据分拣单元对应的槽位数、货仓的已占用槽位数以及待分配订单数，确定开启数目。从上述多个分拣单元中，选取开启数目个分拣单元。将选取出的分拣单元，确定为目标分拣单元。
作为示例，货仓中有5个分拣单元，编号分别为分拣单元1、分 拣单元2、分拣单元3、分拣单元4、分拣单元5。每个分拣单元对应的槽位数为10个，每个分拣单元对应设置的槽位中有3个槽位为已占用槽位。如果待分配订单数为20，则需要20个未占用槽位(空闲槽位)进行计算。可以随机选取一个分拣单元，如果空闲槽位数量小于待分配订单数，则可以再选取一个分拣单元，直到选取的分拣单元的空闲槽位总数不小于待分配订单数。将选取出的分拣单元确定为目标分拣单元。在这里，需要选取出3个分拣单元作为目标分拣单元。
在本实施例中，对于上述多个待分配订单中的每个待分配订单，可以确定该待分配订单与各个目标分拣单元之间的货物种类重合数。
步骤403，查找待分拣订单数小于待分拣订单阈值的目标分拣单元。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的订单分配服务器)可以查找待分拣订单数小于待分拣订单阈值的目标分拣单元。
需要说明的是，步骤403的查找结果，可能有两种，一种是未查找到，这种情况将执行步骤404、步骤405和步骤406；一种是查找到了，这种情况将执行步骤407。
步骤404，响应于未查找出待分拣订单数小于待分拣订单阈值的目标分拣单元，对于每个目标分拣单元，根据该目标分拣单元的待分拣货物种类数和与待分配订单之间的货物种类重合数，确定该目标分拣单元与待分配订单的货物种类重合度。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的订单分配服务器)可以响应于未查找出待分拣订单数小于待分拣订单阈值的目标分拣单元，对于每个目标分拣单元，根据该目标分拣单元的待分拣货物种类数和与上述待分配订单之间的货物种类重合数，确定该目标分拣单元与上述待分配订单的货物种类重合度。
在本实施例中，可以对于上述多个待分配订单中的每个待分配订单，确定该待分配订单与各个目标分拣单元的各个货物种类重合数；对于上述多个目标分拣单元中的每个目标分拣单元，根据该目标分拣单元的待分拣货物种类数以及与该待分配订单的货物种类重合数，确 定该目标分拣单元与该待分配订单的货物种类重合度。
作为示例，待分配订单A的货物种类数为4，待分配订单B的货物种类数为5，目标分拣单元C的待分拣订单的待分拣货物种类数为6，目标分拣单元D的待分拣订单的货物种类数为8。其中，待分配订单A与目标分拣单元C的货物种类重合数为1，待分配订单A与目标分拣单元D的货物种类重合数为2。待分配订单B与目标分拣单元C的货物种类重合数为3，待分配订单B与目标分拣单元D的货物种类重合数为4。
在本实施例的一些可选的实现方式中，可以将货物种类重合数与目标分拣单元的货物种类数的比值，确定为货物种类重合度。
在本实施例的一些可选的实现方式中，可以先求取目标分拣单元的待分拣货物种类数的二次方，然后将货物种类重合数与上述二次方的比值，确定为货物种类重合度。需要说明的是，这种针对待分拣货物种类数取平方的的方式，可以放大目标分拣单元需要分拣的货物的基数的差异，相对于不取平方的方式，可以提高分拣效率。
作为示例，假设目标分拣单元A的待分拣货物种类数为3，目标分拣单元B的待分拣货物种类数为6，待分配订单C与目标分拣单元A之间的货物种类重合数为1，待分配订单C与目标分拣单元B之间的货物种类重合数为2。
作为示例，可以将货物种类重合数1与待分拣货物种类数3的比值，确定为待分配订单C与目标分拣单元A之间的货物种类重合度，即1/3。可以将货物种类重合数2与待分拣货物种类数6的比值，确定为待分配订单C与目标分拣单元B之间的货物种类重合度，也是1/3。虽然此时比值相同，但是，目标分拣单元A的待分拣货物种类数较少，拣选较少种类即可完成，而目标分拣单元B的待分拣货物较多，需要拣选较多的种类才能完成分拣任务。对比而言，如果利用先求取目标分拣单元的待分拣货物种类数的二次方的方式，确定为待分配订单C与目标分拣单元A之间的货物种类重合度为1/9，确定为待分配订单C与目标分拣单元B之间的货物种类重合度为1/18。从而可以选取出执行效率更高的目标分拣单元。
在本实施例的一些可选的实现方式中，可以选取与待分配订单货物种类重合度最高的目标分拣单元。然后将这个待分配订单分配给与它重合度最高的目标分拣单元。
步骤405，根据所确定的货物种类重合度，选取货物种类重合度最高的待分配订单和目标分拣单元。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的待分配订单分配服务器)可以根据所确定的货物种类重合度，选取货物种类重合度最高的待分配订单和目标分拣单元。
作为示例，如图4B所示，图4B是对步骤405的举例说明的示意图，待分配订单C与目标分拣单元A之间的货物种类重合度为1/9，待分配订单C与目标分拣单元B之间的货物种类重合度为1/18；待分配订单D与目标分拣单元A之间的货物种类重合度为1/6，待分配订单D与目标分拣单元B之间的货物种类重合度为1/4。因此，货物种类重合度最高的待分配订单与目标分拣单元为待分配订单D与目标分拣单元B。
需要说明的是，选出货物种类重合度最高的待分配订单和目标分拣单元进行分配后，所有的目标分拣单元与其它未分配的待分配订单之间的货物种类重合度将发生变化，一对一分配可以提高每次分配的准确性。
步骤406，将选取出的待分配订单分配至选取出的目标分拣单元。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例如图1所示的订单分配服务器)可以将选取出的待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣选取出的待分配订单所指示的货物。
作为示例，在步骤405的例子中，可以将待分配订单C分配至目标分拣单元B，由目标分拣单元B分拣待分配订单C指示的货物，以供目标分拣单元B分拣待分配订单C所指示的货物。
步骤407，响应于查找出待分拣订单数小于待分拣订单阈值的目标分拣单元，向查找出的目标分拣单元分配待分配订单。
在本实施例中，用于分拣货物的方法运行于其上的电子设备(例 如图1所示的订单分配服务器)可以响应于查找出待分拣订单数小于待分拣订单阈值的目标分拣单元，向查找出的目标分拣单元分配待分配订单。
作为示例，对于三个目标分拣单元，分别为目标分拣单元1、目标分拣单元2、目标分拣单元3。待分拣订单阈值为3，目标分拣单元1的待分拣订单数为4，目标分拣单元2的待分拣订单数为2，目标分拣单元3的待分拣订单数为5。则可以将待分配订单分配给待分拣订单数小于待分拣订单阈值的目标分拣单元2。可以理解，在计算货物种类重合度之前，将待分配订单分配给待分拣订单数交少的目标分拣单元，可以在提高整体分拣效率的同时减少计算量。
从图4A中可以看出，与图2对应的实施例相比，本实施例中的用于分拣货物的方法的流程400突出了选取货物种类重合度最高的待分配订单和目标分拣单元的步骤。由此，本实施例描述的方案可以进一步提高货物分拣效率。
进一步参考图5，作为对上述各图所示方法的实现，本申请提供了一种用于分拣货物的装置的一个实施例，该装置实施例与图2所示的方法实施例相对应，该装置具体可以应用于各种电子设备中。
如图5所示，本实施例上述的用于分拣货物的装置500包括：获取单元501、确定单元502、选取单元503和分配单元504。其中，获取单元，配置用于获取待分配订单；确定单元，配置用于对于多个目标分拣单元中的每个目标分拣单元，确定以下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或该目标分拣单元与上述待分配订单之间的货物种类重合数，其中，货物种类重合数为待分配订单所指示的货物与目标分拣单元的待分拣货物之间相同的货物种类的数量；选取单元，配置用于基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元；分配单元，配置用于将上述待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出上述待分配订单所指示的货物。
在本实施例中，获取单元501、确定单元502、选取单元503和分配单元504的具体处理及其所带来的技术效果可分别参考图2对应实施例中步骤201、步骤202、步骤203以及步骤204的相关说明，在此不再赘述。
在本实施例的一些可选的实现方式中，上述选取单元，还配置用于：查找待分拣订单数小于待分拣订单阈值的目标分拣单元；响应于未查找出待分拣订单数小于待分拣订单阈值的目标分拣单元，对于每个目标分拣单元，根据该目标分拣单元的待分拣货物种类数和与上述待分配订单之间的货物种类重合数，确定该目标分拣单元与上述待分配订单的货物种类重合度。
在本实施例的一些可选的实现方式中，上述选取单元，还配置用于：选取与上述待分配订单货物种类重合度最高的目标分拣单元。
在本实施例的一些可选的实现方式中，上述待分配订单为多个待分配订单；以及上述选取单元，还配置用于：对于上述多个待分配订单中的每个待分配订单，确定该待分配订单与各个目标分拣单元的各个货物种类重合数；对于上述多个目标分拣单元中的每个目标分拣单元，根据该目标分拣单元的待分拣货物种类数以及与该待分配订单的货物种类重合数，确定该目标分拣单元与该待分配订单的货物种类重合度。
在本实施例的一些可选的实现方式中，上述选取单元，还配置用于：根据所确定的货物种类重合度，选取货物种类重合度最高的待分配订单和目标分拣单元；以及上述分配单元，还配置用于：将选取出的待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出选取出的待分配订单所指示的货物。
在本实施例的一些可选的实现方式中，上述选取单元，还配置用于：响应于查找出待分拣订单数小于待分拣订单阈值的目标分拣单元，向查找出的目标分拣单元分配上述待分配订单。
在本实施例的一些可选的实现方式中，货仓中设置有多个分拣单元，分拣单元对应设置有槽位，槽位用于放置分配至分拣单元的待分拣订单指示的货物，上述装置还包括开启单元(未示出)，配置用于： 所述方法还包括：根据分拣单元对应的槽位数、货仓的已占用槽位数以及待分配订单数，确定开启数目；从所述多个分拣单元中，选取开启数目个分拣单元；将选取出的分拣单元，确定为目标分拣单元。
在本实施例的一些可选的实现方式中，上述获取单元，还配置用于：获取待处理订单的待处理订单信息，其中，上述待处理订单信息包括优先级信息和时间信息；根据上述优先级信息以及上述时间信息所指示的时间与当前时间之间的间隔时长是否大于预设时长阈值，确定是否将上述待处理订单确定为上述待分配订单。
需要说明的是，本实施例提供的用于分拣货物的装置中各单元的实现细节和技术效果可以参考本申请中其它实施例的说明，在此不再赘述。
下面参考图6，其示出了适于用来实现本申请实施例的电子设备的计算机系统600的结构示意图。图6示出的电子设备仅仅是一个示例，不应对本申请实施例的功能和使用范围带来任何限制。
如图6所示，计算机系统600包括中央处理单元(CPU)601，其可以根据存储在只读存储器(ROM)602中的程序或者从存储部分608加载到随机访问存储器(RAM)603中的程序而执行各种适当的动作和处理。在RAM 603中，还存储有系统600操作所需的各种程序和数据。CPU 601、ROM 602以及RAM 603通过总线604彼此相连。输入/输出(I/O)接口605也连接至总线604。
以下部件连接至I/O接口605：包括键盘、鼠标等的输入部分606；包括诸如阴极射线管(CRT)、液晶显示器(LCD)等以及扬声器等的输出部分607；包括硬盘等的存储部分608；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分609。通信部分609经由诸如因特网的网络执行通信处理。驱动器610也根据需要连接至I/O接口605。可拆卸介质611，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器610上，以便于从其上读出的计算机程序根据需要被安装入存储部分608。
特别地，根据本公开的实施例，上文参考流程图描述的过程可以 被实现为计算机软件程序。例如，本公开的实施例包括一种计算机程序产品，其包括承载在计算机可读介质上的计算机程序，该计算机程序包含用于执行流程图所示的方法的程序代码。在这样的实施例中，该计算机程序可以通过通信部分609从网络上被下载和安装，和/或从可拆卸介质611被安装。在该计算机程序被中央处理单元(CPU)601执行时，执行本申请的方法中限定的上述功能。
需要说明的是，本申请上述的计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质或者是上述两者的任意组合。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的更具体的例子可以包括但不限于：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本申请中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。而在本申请中，计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：无线、电线、光缆、RF等等，或者上述的任意合适的组合。
附图中的流程图和框图，图示了按照本申请各种实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段、或代码的一部分，该模块、程序段、或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实 现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图和/或流程图中的每个方框、以及框图和/或流程图中的方框的组合，可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本申请实施例中所涉及到的单元可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的单元也可以设置在处理器中，例如，可以描述为：一种处理器包括获取单元、确定单元、选取单元和分配单元。其中，这些单元的名称在某种情况下并不构成对该单元本身的限定，例如，获取单元还可以被描述为“获取待分配订单的单元”。
作为另一方面，本申请还提供了一种计算机可读介质，该计算机可读介质可以是上述实施例中描述的装置中所包含的；也可以是单独存在，而未装配入该装置中。上述计算机可读介质承载有一个或者多个程序，当上述一个或者多个程序被该装置执行时，使得该装置：获取待分配订单；对于多个目标分拣单元中的每个目标分拣单元，确定以下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或该目标分拣单元与上述待分配订单之间的货物种类重合数，其中，货物种类重合数为待分配订单所指示的货物与目标分拣单元的待分拣货物之间相同的货物种类的数量；基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元；将上述待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出上述待分配订单所指示的货物。
以上描述仅为本申请的较佳实施例以及对所运用技术原理的说明。本领域技术人员应当理解，本申请中所涉及的发明范围，并不限于上述技术特征的特定组合而成的技术方案，同时也应涵盖在不脱离上述发明构思的情况下，由上述技术特征或其等同特征进行任意组合而形成的其它技术方案。例如上述特征与本申请中公开的(但不限于)具有类似功能的技术特征进行互相替换而形成的技术方案。

Claims (11)

  1. 一种用于分拣货物的方法，其特征在于，所述方法包括：
    获取待分配订单；
    对于多个目标分拣单元中的每个目标分拣单元，确定以下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或该目标分拣单元与所述待分配订单之间的货物种类重合数，其中，货物种类重合数为待分配订单所指示的货物与目标分拣单元的待分拣货物之间相同的货物种类的数量；
    基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元；
    将所述待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出所述待分配订单所指示的货物。
  2. 根据权利要求1所述的方法，其特征在于，所述基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元，包括：
    查找待分拣订单数小于待分拣订单阈值的目标分拣单元；
    响应于未查找出待分拣订单数小于待分拣订单阈值的目标分拣单元，对于每个目标分拣单元，根据该目标分拣单元的待分拣货物种类数和与所述待分配订单之间的货物种类重合数，确定该目标分拣单元与所述待分配订单的货物种类重合度。
  3. 根据权利要求2所述的方法，其特征在于，所述基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元，还包括：
    选取与所述待分配订单货物种类重合度最高的目标分拣单元。
  4. 根据权利要求3所述的方法，其特征在于，所述待分配订单为多个待分配订单；以及
    所述确定该目标分拣单元与所述待分配订单的货物种类重合度，包括：
    对于所述多个待分配订单中的每个待分配订单，确定该待分配订单与各个目标分拣单元的各个货物种类重合数；对于所述多个目标分拣单元中的每个目标分拣单元，根据该目标分拣单元的待分拣货物种类数以及与该待分配订单的货物种类重合数，确定该目标分拣单元与该待分配订单的货物种类重合度。
  5. 根据权利要求4所述的方法，其特征在于，所述选取与所述待分配订单货物种类重合度最高的目标分拣单元，包括：
    根据所确定的货物种类重合度，选取货物种类重合度最高的待分配订单和目标分拣单元；以及
    所述将所述待分配订单分配至选取出的目标分拣单元，包括：
    将选取出的待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出选取出的待分配订单所指示的货物。
  6. 根据权利要求2-5中任一项所述的方法，其特征在于，所述基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元，包括：
    响应于查找出待分拣订单数小于待分拣订单阈值的目标分拣单元，向查找出的目标分拣单元分配所述待分配订单。
  7. 根据权利要求6所述的方法，其特征在于，货仓中设置有多个分拣单元，分拣单元对应设置有槽位，槽位用于放置分配至分拣单元的待分拣订单指示的货物，所述方法还包括：
    根据分拣单元对应的槽位数、货仓的已占用槽位数以及待分配订单数，确定开启数目；
    从所述多个分拣单元中，选取开启数目个分拣单元；
    将选取出的分拣单元，确定为目标分拣单元。
  8. 根据权利要求7所述的方法，其特征在于，所述获取待分配订单，包括：
    获取待处理订单的待处理订单信息，其中，所述待处理订单信息包括优先级信息和时间信息；
    根据所述优先级信息以及所述时间信息所指示的时间与当前时间之间的间隔时长是否大于预设时长阈值，确定是否将所述待处理订单确定为所述待分配订单。
  9. 一种用于分拣货物的装置，其特征在于，所述装置包括：
    获取单元，配置用于获取待分配订单；
    确定单元，配置用于对于多个目标分拣单元中的每个目标分拣单元，确定以下至少一项：该目标分拣单元的待分拣订单数、待分拣货物种类数或该目标分拣单元与所述待分配订单之间的货物种类重合数，其中，货物种类重合数为待分配订单所指示的货物与目标分拣单元的待分拣货物之间相同的货物种类的数量；
    选取单元，配置用于基于各个目标分拣单元的以下至少一项：待分拣订单数、待分拣货物种类数或货物种类重合数，选取目标分拣单元；
    分配单元，配置用于将所述待分配订单分配至选取出的目标分拣单元，以供选取出的目标分拣单元分拣出所述待分配订单所指示的货物。
  10. 一种设备，其特征在于，所述设备包括：
    一个或多个处理器；
    存储装置，用于存储一个或多个程序，
    当所述一个或多个程序被所述一个或多个处理器执行时，使得所述一个或多个处理器实现如权利要求1-8中任一所述的方法。
  11. 一种计算机可读存储介质，其上存储有计算机程序，其特征在于，该程序被处理器执行时实现如权利要求1-8中任一所述的方法。
PCT/CN2018/082687 2017-09-07 2018-04-11 用于分拣货物的方法和装置 WO2019047523A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/636,047 US11325780B2 (en) 2017-09-07 2018-04-11 Method and device for sorting cargo

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710799055.7A CN109472523B (zh) 2017-09-07 2017-09-07 用于分拣货物的方法和装置
CN201710799055.7 2017-09-07

Publications (1)

Publication Number Publication Date
WO2019047523A1 true WO2019047523A1 (zh) 2019-03-14

Family

ID=65634558

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/082687 WO2019047523A1 (zh) 2017-09-07 2018-04-11 用于分拣货物的方法和装置

Country Status (3)

Country Link
US (1) US11325780B2 (zh)
CN (1) CN109472523B (zh)
WO (1) WO2019047523A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112785213A (zh) * 2019-11-07 2021-05-11 北京京东振世信息技术有限公司 一种仓库拣货单的组建方法和装置
CN115156090A (zh) * 2022-05-31 2022-10-11 北京旷视机器人技术有限公司 料箱分配方法、电子设备及存储介质

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109647719B (zh) * 2017-10-11 2020-07-31 北京京东振世信息技术有限公司 用于分拣货物的方法和装置
CN111822366B (zh) * 2019-04-17 2022-06-07 北京旷视机器人技术有限公司 货物处理方法、装置及存储介质
CN110245890B (zh) * 2019-05-28 2022-04-12 深圳市海柔创新科技有限公司 货品分拣方法及货品分拣系统
CN110334994A (zh) * 2019-07-03 2019-10-15 广州品唯软件有限公司 一种播种位预分配方法、装置、计算机设备及存储介质
CN111754152A (zh) * 2019-09-24 2020-10-09 北京京东乾石科技有限公司 货到人仓库的货架调度方法、装置、电子设备及介质
CN110929981B (zh) * 2019-10-14 2022-09-27 北京旷视机器人技术有限公司 一种订单分配方法、装置、系统及存储介质
CN111080187A (zh) * 2019-11-13 2020-04-28 北京旷视机器人技术有限公司 订单分配方法、装置、计算机设备和存储介质
CN112862386A (zh) * 2019-11-27 2021-05-28 北京京东乾石科技有限公司 货物拣选方法及货物拣选装置
CN113450044A (zh) * 2020-03-26 2021-09-28 北京京东乾石科技有限公司 用于工作站的订单处理方法及订单处理装置
CN113762664A (zh) * 2020-06-22 2021-12-07 北京京东乾石科技有限公司 拣货任务的分配方法、装置及计算机可读介质
CN113762831A (zh) * 2020-08-07 2021-12-07 北京京东乾石科技有限公司 一种自动化进行物品分播的方法、装置和存储介质
US11176513B1 (en) 2020-10-28 2021-11-16 Coupang Corp. Systems and computerized methods for optimizing item retrieval allocation efficiencies
CN113335809A (zh) * 2021-05-14 2021-09-03 深圳市海柔创新科技有限公司 货物分拣方法、控制终端及其货物自动分拣系统
CN113537893A (zh) * 2021-07-19 2021-10-22 北京京东振世信息技术有限公司 订单处理方法、装置、设备和计算机可读介质
CN114212436A (zh) * 2021-12-07 2022-03-22 河南省日立信股份有限公司 仓库原材料物料分拣存取系统及其分拣方法
CN115660380B (zh) * 2022-12-08 2023-08-15 无锡凯乐士科技有限公司 货到人拣选的订单处理方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013083145A1 (de) * 2011-12-09 2013-06-13 Daimler Ag Verfahren zum betreiben einer produktionsanlage
CN104751272A (zh) * 2015-03-04 2015-07-01 径圆（上海）信息技术有限公司 智能订单调度方法、服务器、电动车、移动终端及系统
CN105858045A (zh) * 2016-06-03 2016-08-17 北京极智嘉科技有限公司 货物自动拣选系统和货物自动拣选方法
CN106185152A (zh) * 2016-08-03 2016-12-07 北京极智嘉科技有限公司 货物拣选方法、货物拣选系统和计算装置
CN107089464A (zh) * 2017-06-12 2017-08-25 苏州寅初信息科技有限公司 一种智能仓库的货物自动分拣方法及其系统

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0244805B1 (en) * 1986-05-09 1992-12-09 Kao Corporation Method of sorting goods and system therefor
US20090112675A1 (en) * 2007-10-31 2009-04-30 Jeff Servais Automated order fulfillment system and method
CN103679417A (zh) * 2013-11-20 2014-03-26 苏州得尔达国际物流有限公司 一种库存自动分拣系统和方法
US9244713B1 (en) * 2014-05-13 2016-01-26 Nutanix, Inc. Method and system for sorting and bucketizing alerts in a virtualization environment
EP3163520A1 (de) * 2015-10-30 2017-05-03 Deutsche Post AG Koordination einer leistungserbringung
CN106311615B (zh) * 2016-09-14 2019-04-30 上海极络智能科技有限公司 分层货物拣选方法、系统和计算装置
CN106897852A (zh) * 2017-01-27 2017-06-27 华南理工大学 用于物流的订单排序优化方法
CN106892233B (zh) * 2017-02-23 2019-06-04 北京京东尚科信息技术有限公司 用于商品仓储布局的方法、装置、电子设备和存储介质
CN106934580B (zh) * 2017-03-21 2020-07-31 北京京东乾石科技有限公司 库存控制方法以及装置
CN107025533A (zh) * 2017-03-29 2017-08-08 上海极络智能科技有限公司 货物拣选方法、货物拣选系统、计算装置和计算机可读存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013083145A1 (de) * 2011-12-09 2013-06-13 Daimler Ag Verfahren zum betreiben einer produktionsanlage
CN104751272A (zh) * 2015-03-04 2015-07-01 径圆（上海）信息技术有限公司 智能订单调度方法、服务器、电动车、移动终端及系统
CN105858045A (zh) * 2016-06-03 2016-08-17 北京极智嘉科技有限公司 货物自动拣选系统和货物自动拣选方法
CN106185152A (zh) * 2016-08-03 2016-12-07 北京极智嘉科技有限公司 货物拣选方法、货物拣选系统和计算装置
CN107089464A (zh) * 2017-06-12 2017-08-25 苏州寅初信息科技有限公司 一种智能仓库的货物自动分拣方法及其系统

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112785213A (zh) * 2019-11-07 2021-05-11 北京京东振世信息技术有限公司 一种仓库拣货单的组建方法和装置
CN112785213B (zh) * 2019-11-07 2023-09-26 北京京东振世信息技术有限公司 一种仓库拣货单的组建方法和装置
CN115156090A (zh) * 2022-05-31 2022-10-11 北京旷视机器人技术有限公司 料箱分配方法、电子设备及存储介质
CN115156090B (zh) * 2022-05-31 2024-04-05 北京旷视机器人技术有限公司 料箱分配方法、电子设备及存储介质

Also Published As

Publication number Publication date
CN109472523B (zh) 2022-09-30
US20200239234A1 (en) 2020-07-30
US11325780B2 (en) 2022-05-10
CN109472523A (zh) 2019-03-15

Similar Documents

Publication Publication Date Title
WO2019047523A1 (zh) 用于分拣货物的方法和装置
CN109647719B (zh) 用于分拣货物的方法和装置
CN106980955B (zh) 用于输出信息的方法和装置
CN106875148B (zh) 用于为物品确定存放位置的方法和装置
CN108595157B (zh) 区块链数据的处理方法、装置、设备和存储介质
WO2018188473A1 (zh) 订单处理方法、装置、服务器和存储介质
US20180181911A1 (en) Data object allocation method and apparatus and electronic device
CN109840648B (zh) 用于输出储位信息的方法和装置
WO2019056640A1 (zh) 订单处理方法及装置
CN110371548B (zh) 一种货物入库方法和装置
CN111523977B (zh) 波次订单集合的创建方法、装置、计算设备和介质
CN110929981B (zh) 一种订单分配方法、装置、系统及存储介质
CN111507651A (zh) 应用于人机混合仓库的订单数据处理方法和装置
CN110659760A (zh) 用于仓库储位的配置方法和系统
CN110889656A (zh) 一种仓库规则配置方法和装置
CN113988485A (zh) 站点到货量预测方法、装置、电子设备和计算机可读介质
WO2024041056A1 (zh) 储位分配方法和装置、电子设备、计算机可读介质
CN112150051B (zh) 物品上架的方法和装置
CN111768136A (zh) 库存调度方法和装置
CN113379173B (zh) 为仓库商品标记标签的方法和装置
CN112441364B (zh) 一种自动化仓库的容器入库或回库方法和装置
CN112474368B (zh) 货物拣选方法、装置、设备和计算机可读介质
CN112446754A (zh) 用于处理订单的方法和装置
CN113592396A (zh) 物品出库方法、装置、电子设备和计算机可读介质
CN109902847B (zh) 预测分库订单量的方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18854547

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 19/08/2020)

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 19/08/2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18854547

Country of ref document: EP

Kind code of ref document: A1