WO2020164319A1 - 一种拣货方法和装置 - Google Patents

一种拣货方法和装置 Download PDF

Info

Publication number
WO2020164319A1
WO2020164319A1 PCT/CN2019/129232 CN2019129232W WO2020164319A1 WO 2020164319 A1 WO2020164319 A1 WO 2020164319A1 CN 2019129232 W CN2019129232 W CN 2019129232W WO 2020164319 A1 WO2020164319 A1 WO 2020164319A1
Authority
WO
WIPO (PCT)
Prior art keywords
picking
transport vehicle
idle
pickers
parking point
Prior art date
Application number
PCT/CN2019/129232
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 US17/425,236 priority Critical patent/US11816632B2/en
Publication of WO2020164319A1 publication Critical patent/WO2020164319A1/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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G06Q10/063114—Status monitoring or status determination for a person or group
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • 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
    • 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/083—Shipping
    • 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

Definitions

  • the present invention relates to the field of computer technology, in particular to a picking method and device.
  • the first category one picker completes all picking, that is, one person independently completes the picking task he received.
  • the picking path is the order of the main channel where the storage location of the picking task is located.
  • the second category multiple pickers complete a picking task by relay, that is, each picker is responsible for a part of the area, so that each picker can perform the picking task in the area in which it is responsible, and the previous picker completes
  • the picking tasks in your own area can be passed to the picking personnel behind through the conveyor line.
  • the embodiments of the present invention provide a picking method and device, which can solve the problem of low picking efficiency in the prior art.
  • a picking method which includes obtaining order information to form a picking task; according to the degree of coincidence between the picking storage positions between the picking tasks, Associate one or more picking tasks to the same transport vehicle; obtain all picking storage positions of the picking task of the transport vehicle, and then calculate the path of the transport vehicle; wherein the path includes at least one picking parking point, Each picking parking point corresponds to at least one picking storage location; receiving the location information of the idle pickers and the picking parking point where the transport truck is currently located, calculating the idle picking personnel matching the transport truck, and sending the information to the idle picker Pickers send picking tasks associated with transport vehicles for execution.
  • obtain order information to form a picking task including:
  • the judgment result if it is greater than the preset time difference threshold, according to the type of business, pre-group the orders with the latest departure time from the current time greater than the preset time difference threshold, and then group according to the degree of order overlap, and save the ungrouped orders Orders will be grouped later; if it is less than or equal to the preset time difference threshold, according to the type of business, pre-group the orders with the latest departure time and the current time less than or equal to the preset time difference threshold, and then group them according to the degree of order overlap. Then divide the ungrouped orders into a group.
  • the location information of idle pickers after receiving the location information of idle pickers, it includes:
  • calculate the transport vehicles that match the idle pickers including:
  • the idle pickers According to the location information of the picking parking point and idle pickers where the transport truck is currently located, calculate the idle pickers closest to the location of the transport truck.
  • the picking task associated with the transport truck after sending the picking task associated with the transport truck to the idle picking personnel for execution, it includes:
  • control the transport vehicle to travel to the next picking parking point; if there is no next picking parking point, control the transport vehicle to travel to the destination location.
  • a picking device which includes a building module for acquiring order information to build a picking task; an association module for picking storage between picking tasks. The degree of coincidence of the channel where the location is located, associates one or more picking tasks to the same transport vehicle; the picking module is used to obtain all the picking storage positions of the picking task of the transport vehicle, and then calculate the path of the transport vehicle; , The path includes at least one picking parking point, and each picking parking point corresponds to at least one picking storage location; receiving the location information of idle pickers and the picking parking point where the transport truck is currently located, and calculating and The idle pickers matching the transport vehicles send the picking tasks associated with the transport vehicles to the idle pickers for execution.
  • the building module obtains order information to build a picking task, including:
  • the judgment result if it is greater than the preset time difference threshold, according to the type of business, pre-group the orders with the latest departure time from the current time greater than the preset time difference threshold, and then group according to the degree of order overlap, and save the ungrouped orders Orders will be grouped later; if it is less than or equal to the preset time difference threshold, according to the type of business, pre-group the orders with the latest departure time and the current time less than or equal to the preset time difference threshold, and then group them according to the degree of order overlap. Then divide the ungrouped orders into a group.
  • the picking module receives the location information of idle pickers, it includes:
  • the picking module calculates the transport vehicles matching the idle pickers, including:
  • the idle pickers According to the location information of the picking parking point and idle pickers where the transport truck is currently located, calculate the idle pickers closest to the location of the transport truck.
  • the picking module sends the picking tasks associated with the transport truck to the idle pickers for execution, the following includes:
  • control the transport vehicle to travel to the next picking parking point; if there is no next picking parking point, control the transport vehicle to travel to the destination location.
  • an electronic device including:
  • One or more processors are One or more processors;
  • Storage device for storing one or more programs
  • the one or more processors implement the method described in any of the foregoing picking embodiments.
  • a computer-readable medium on which a computer program is stored, and the program is executed by a processor to implement any of the above-mentioned methods based on the picking embodiment.
  • the present invention obtains order information to form a picking task; according to the degree of coincidence of the picking storage space between the picking tasks, one or more picks
  • the cargo task is related to the same transport vehicle; all the picking storage positions of the transport vehicle’s picking task are obtained, and then the path of the transport vehicle is calculated; the location information of the idle pickers and the picking parking point where the transport vehicle is currently located are received, and the calculation
  • the idle picker matched with the transport vehicle sends the picking task associated with the transport vehicle to the idle picker for execution. Therefore, the present invention scientifically plans the path of the transport vehicle by introducing the combination of the transport vehicle supporting the picking container and the picking personnel, reduces the invalid walking distance of the pickers, and improves the efficiency of the picking operation.
  • Fig. 1 is a schematic diagram of the main flow of the picking method according to the first embodiment of the present invention
  • FIG. 2 is a schematic diagram of the main flow of the picking method according to the reference embodiment of the present invention.
  • Fig. 3 is a schematic diagram of the main process of organizing a picking task according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of the main modules of the picking device according to an embodiment of the present invention.
  • FIG. 5 is an exemplary system architecture diagram to which the embodiment of the present invention can be applied.
  • Fig. 6 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.
  • Fig. 1 is a schematic diagram of the main flow of the picking method according to the first embodiment of the present invention.
  • the picking method may include:
  • Step S101 Obtain order information to form a picking task.
  • the latest out of the warehouse time in the order information can be extracted to determine whether the latest out of the order time from the current time is greater than the preset time difference threshold. Then, according to the judgment result, if it is greater than the preset time difference threshold, according to the type of business, pre-group the orders with the latest departure time from the current time greater than the preset time difference threshold, and then group them according to the degree of order coincidence, and save Grouped orders will be grouped later.
  • pre-group the orders with the latest departure time from the current time less than or equal to the preset time difference threshold and then group the orders according to the degree of overlap, and then group the ungrouped orders The orders are grouped together.
  • step S102 one or more picking tasks are associated with the same transport vehicle according to the degree of coincidence of the aisles where the picking storage positions are located between the picking tasks.
  • the transport vehicle can be an AGV trolley, and the AGV trolley can be an autonomous vehicle that assists in picking. It can enter the aisle and stay in front of the storage location, and can walk independently according to the path of its own picking task. .
  • Step S103 Obtain all the picking storage positions of the picking task of the transport truck, and then calculate the path of the transport truck.
  • the transport vehicle can reach the corresponding picking parking point according to the path.
  • the path includes at least one picking parking point, and each picking parking point corresponds to at least one picking storage space.
  • the destination location of the transport truck refers to the destination after picking is completed in the warehouse.
  • the destination of the warehouse to be reached after picking may be different or the same, and can be associated with a transport
  • the orders on the cart have the same warehouse destination after picking.
  • orders with a business type of internal distribution and orders with return can be pre-grouped, that is, the final order is completed in the same place in the warehouse for subsequent processing.
  • the internal distribution order refers to a merchandise transfer order
  • the return order refers to an order to return goods to a supplier.
  • Step S104 Receive the location information of the idle pickers and the picking parking point where the transport truck is currently located, calculate the idle pickers matching the transport truck, and send the picking tasks associated with the transport truck to the idle pickers carried out.
  • step S104 after receiving the location information of the idle pickers, it can first determine whether there is a transport vehicle with a picking task that is close to the outbound time. If there is a transport that has a picking task that is close to the outbound time, The car sends the picking task line information of the approaching outbound time and the picking task line information that matches the storage position of the approaching outbound time picking task for execution. Of course, if there is no transport vehicle with a picking task close to the outbound time limit, the idle picker closest to the location of the transport vehicle is calculated, and the picking task row associated with the transport vehicle that matches the picking storage position is sent Information to execute.
  • the present invention combines the transport vehicle and the picking personnel to complete the picking task.
  • the combined method enables the transport vehicle to go deep next to the picking storage position in the picking channel, and the picking personnel only need to pick Once the picking task near the cargo parking point is completed, the transport truck can leave and go to the next picking parking location.
  • the pickers do not need to follow along. Therefore, the pickers can continue to pick the goods to other transport vehicles nearby. Pickers have more time to pick goods, resulting in higher picking efficiency.
  • Fig. 2 is a schematic diagram of the main flow of the picking method according to the reference embodiment of the present invention.
  • the picking method may include:
  • Step S201 Obtain order information to form a picking task.
  • the picking task is to combine orders to form a picking task according to order attributes, thereby improving picking efficiency.
  • Each order corresponds to a picking task line, and n picking task lines form a picking task.
  • each picking task line can include information such as storage location number, product number, and quantity.
  • the specific implementation process may include:
  • Step S301 Extract the latest time to leave the warehouse in the order information.
  • Step S302 It is judged whether the latest time the order is out of the library and the current time are greater than the preset time difference threshold, if it is greater than the preset time difference threshold, proceed to step S303, otherwise proceed to step S306.
  • the latest time the order is out of the library and the current time is greater than the preset time difference threshold, it means that the order may not be rushed out of the library. If the latest time the order is out of the library and the current time is less than or equal to the preset time difference threshold, Explain that the order may be out of stock in a hurry.
  • Step S303 According to the type of business, pre-group the orders whose latest time to leave the warehouse is greater than the preset time difference threshold from the current time.
  • orders of different business types can be pre-grouped together, and the destinations after picking in the warehouse are the same, that is, although the business types are different, the warehouse destinations to be reached after picking are the same.
  • orders with a business type of internal distribution and orders with return can be pre-grouped together, that is, the final order completion will arrive at the same place in the warehouse for subsequent processing.
  • the internal distribution order refers to a merchandise transfer order
  • the return order refers to an order to return goods to a supplier.
  • Step S304 Calculate the coincidence degree for the orders in the pre-grouping group, and group the orders with the coincidence degree greater than the preset coincidence degree threshold.
  • the order may include one commodity or multiple commodities. If only one commodity is included, the coincidence degree can be calculated based on the commodity attribute value. Preferably, the coincidence degree of the storage position of the commodity can be calculated. If the order includes multiple commodities, it can be calculated according to the degree of coincidence of the order lines between the orders. Preferably, the degree of coincidence of the commodity category attributes in the order lines between the orders can be calculated.
  • the order line refers to that the order includes multiple commodities, that is, the order information of each commodity forms an order line. For example: an order includes three order lines: product one, product two, and product three.
  • Step S305 Save the ungrouped orders whose latest time to leave the library is greater than the preset time difference threshold from the current time, and return to step S301.
  • the ungrouped orders whose latest time to leave the warehouse is greater than the preset time difference threshold from the current time can be saved, and after obtaining a new order, return to step S301, that is, the process of grouping with the new order .
  • step S301 that is, orders that may not be grouped with the latest out of the library time and the current time greater than the preset time difference threshold become the latest out of the library time and the current time less than or equal to the preset Orders with a time difference threshold.
  • Step S306 Pre-group the orders whose latest time to leave the library and the current time is less than or equal to the preset time difference threshold according to the type of business.
  • orders of different business types can be pre-grouped together, and the destinations after picking in the warehouse are the same, that is, although the business types are different, the warehouse destinations to be reached after picking are the same.
  • orders with internal distribution and orders with return can be pre-grouped together.
  • the internal distribution order refers to a merchandise transfer order
  • the return order refers to an order to return goods to a supplier.
  • Step S307 Calculate the coincidence degree for the orders in the pre-grouping group, and group the orders with the coincidence degree greater than the preset coincidence degree threshold.
  • the order may include one commodity or multiple commodities. If only one commodity is included, the coincidence degree can be calculated based on the commodity attribute value. Preferably, the coincidence degree of the commodity picking storage position can be calculated. If the order includes multiple commodities, it can be calculated according to the degree of coincidence of the order lines between the orders. Preferably, the degree of coincidence of the commodity category attributes in the order lines between the orders can be calculated.
  • the order line refers to that the order includes multiple commodities, that is, the order information of each commodity forms an order line. For example: an order includes three order lines: product one, product two, and product three.
  • Step S308 Group the ungrouped orders whose latest time to leave the warehouse is less than or equal to the preset time difference threshold from the current time.
  • Step S202 Calculate the coincidence degree of the aisles where the picking storage positions are located between the picking tasks.
  • the order is included in the picking task, and the picking storage location of the order can be determined for different commodities, and then the channel can be determined.
  • Step S203 Associate the picking tasks with the coincidence degree greater than the preset aisle coincidence degree threshold to the same transport vehicle.
  • all the IDs of picking tasks whose coincidence degree is greater than the preset channel coincidence degree threshold can be associated with the ID of a transport vehicle.
  • Step S204 according to the outbound priority, the transport vehicles are allocated to the picking tasks associated with the same transport vehicle.
  • the outbound priority means that the smaller the time difference between the latest outbound time of the order and the current time in the picking task on the transport truck, the higher the priority of the picking task associated with the same transport truck, that is, the transportation will be allocated first
  • the truck is associated with the picking task of the same transport truck.
  • Step S205 Obtain all the picking storage positions assigned to the picking task of the transport vehicle, as well as the current location and destination location of the transport vehicle.
  • the destination location of the transport truck is determined according to the business type of the order in the picking task assigned to the transport truck, and can generally be linked to the business type of the order in the picking task on the same transport truck.
  • the warehouse designated destination location to be reached after the warehouse picking is completed is the same for subsequent work.
  • Step S206 Obtain the current warehouse traffic map, and calculate the path of the transport vehicle.
  • the current warehouse traffic map can be used to avoid congested locations, and calculate the least time-consuming path for the transport vehicle to pass through all the picking storage locations from the current location to the destination location.
  • step S207 the transport vehicle arrives at the corresponding picking parking point according to its path, and receives the picking parking point where the transport vehicle is currently located.
  • the picking parking point may correspond to multiple picking storage positions. Further, picking parking points can be set on the aisle according to the number of picking storage spaces that can be completed by pickers. Among them, if the aisle is a two-way street, the picking parking point is on the carriageway in the direction of the transport vehicle. Furthermore, the center of the area including the picking storage space that can be completed by the pickers can be calculated, and the center is on the aisle, then it is used as the picking parking point.
  • Step S208 Receive location information of idle pickers.
  • the position of the picker will be before a picking storage position, that is, when the picker arrives at a picking storage position to complete the picking, the current location will be uploaded (the picker is free at this time) ) To request picking.
  • step S209 it is determined whether there is a transport vehicle with a picking task that is close to the outbound time. If there is, then step S210 and step S211 are performed, otherwise, step S212 and S213 are performed.
  • the picking task near the outbound time limit means that the picking task includes orders whose outbound time and the current time are less than or equal to the minimum time difference threshold.
  • Step S210 Associate the transport vehicle of the picking task near the outbound time with the idle pickers, and send the picking task line information near the outbound time to the idle pickers for execution.
  • the ID in the sent line information of the picking task near the outbound time is associated with the ID of the idle picker.
  • the picking personnel holds the mobile terminal device and can receive the picking task line information.
  • step S210 the distance between the idle pickers and the transport vehicles of the picking task that is close to the outbound time can be judged first. If the distance is greater than the preset maximum distance, the nearest The information of the picking task line of the outbound time is sent to the picker closest to the current position of the transporter of the picking task near the outbound time, that is, the picker closest to the current position of the transporter of the picking task near the outbound time The personnel suspends the picking task and accepts the picking task line information of the near outbound time.
  • the transport vehicle of the picking task near the outbound time is associated with the idle pickers, and the picking task line information near the outbound time is sent.
  • Step S211 Send the picking task line information that matches the storage location of the picking task near the outbound time to the idle pickers, and perform step S214.
  • the picking task line that matches the location of the picking task near the outbound time refers to that the storage position of the picking task row on the transport vehicle is in the area where the storage location of the near outbound time picking task is located.
  • the area can be preset according to actual needs and warehouse conditions.
  • the area may be the area where the storage location near the time-efficient picking task is located.
  • Step S212 Calculate the idle pickers closest to the location of the transport truck to associate the transport truck with the idle pickers.
  • the closest distance between the location of the idle picker and the picking parking point of the transport truck is calculated to associate the transport truck with the idle picker.
  • step S213 the picking task line matching the location of the picking personnel is notified to the picking personnel, and step S214 is executed.
  • the picking task row that matches the location of the picker means that the storage location of the picking task row on the transport vehicle is in the area where the location of the picker is located.
  • the area can be preset according to actual needs and warehouse conditions. For example, the aisle where the picking personnel is located can be used as the area.
  • step S214 it is determined that the picking task line allocated to the idle pickers on the transport truck is completed.
  • the transport vehicle and the picking personnel execute the assigned picking task line together, that is, the transport vehicle and the picking personnel arrive at the storage position corresponding to the picking task line to pick the goods.
  • radio frequency is the abbreviation of radio frequency, which means the electromagnetic frequency that can radiate into space, and the frequency range is from 300khz to 30ghz.
  • Step S215 disassociate the transport vehicle from the idle pickers, and determine whether the transport vehicle has the next picking parking point according to its path, if yes, return to step S207, otherwise the transport vehicle reaches the destination location according to its path and exits Process.
  • FIG. 4 is a picking device according to an embodiment of the present invention.
  • the picking device 400 includes a building module 401, an association module 402, and a picking module 403.
  • the building module 401 obtains order information to build a picking task.
  • the associating module 402 associates one or more picking tasks to the same transport vehicle according to the degree of coincidence between the picking storage locations between the picking tasks.
  • the picking module 403 obtains all the picking storage positions of the picking task of the transport truck, and then calculates the path of the transport vehicle; wherein, the path includes at least one picking parking point, and each picking parking point corresponds to At least one picking storage space; receiving the location information of the idle pickers and the picking parking point where the transport truck is currently located, calculating the idle picking personnel matching the transport truck, and sending the idle picking personnel associated with the transport truck Picking tasks to perform.
  • the building module 401 can obtain order information through the following process to build a picking task:
  • the picking module 403 After the picking module 403 receives the location information of the idle pickers, it can determine whether there is a transport vehicle with a picking task that is close to the outbound time. According to the judgment result, if there is a transport vehicle with a picking task that is close to the outbound time, then the picking task line information that is close to the outbound time and the picking task line information that matches the storage position of the near-out time picking task are sent To execute. If it does not exist, calculate the idle picker closest to the location of the transport vehicle, and send the picking task line information associated with the transport vehicle that matches the picking storage position to the idle picker for execution.
  • the picking module 403 calculates the transport vehicles that match the idle pickers, including: calculating the distance to the transport vehicle based on the picking parking point where the transport vehicle is currently located and the location information of the idle pickers The nearest idle picker.
  • the picking module 403 sends the picking task associated with the transport vehicle to the idle picker for execution, it includes: determining the completion of the picking task associated with the transport vehicle, and determining that the transport vehicle is based on its Whether the route has the next picking parking point; if there is the next picking parking point, control the transport vehicle to drive to the next picking parking point; if there is no next picking parking point, control the The transport vehicle drives to the destination location.
  • FIG. 5 shows an exemplary system architecture 500 of a picking method or a picking device to which an embodiment of the present invention can be applied.
  • the system architecture 500 may include terminal devices 501, 502, 503, a network 504, and a server 505.
  • the network 504 is used to provide a medium for communication links between the terminal devices 501, 502, 503 and the server 505.
  • the network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, and so on.
  • the user can use the terminal devices 501, 502, 503 to interact with the server 505 via the network 504 to receive or send messages and so on.
  • Various communication client applications may be installed on the terminal devices 501, 502, and 503, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only examples).
  • the terminal devices 501, 502, and 503 may be various electronic devices that have a display screen and support web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and so on.
  • the server 505 may be a server that provides various services, for example, a back-end management server (just an example) that provides support for shopping websites browsed by users using the terminal devices 501, 502, and 503.
  • the background management server can analyze and process the received product information query request and other data, and feed back the processing results (such as target push information, product information-only examples) to the terminal device.
  • the picking method provided by the embodiment of the present invention is generally executed by the server 505, and accordingly, the picking device is generally set in the server 505.
  • terminal devices, networks, and servers in FIG. 5 are merely illustrative. According to implementation needs, there can be any number of terminal devices, networks and servers.
  • FIG. 6 shows a schematic structural diagram of a computer system 600 suitable for implementing the terminal device of the embodiment of the present invention.
  • the terminal device shown in FIG. 6 is only an example, and should not bring any limitation to the function and application scope of the embodiment of the present invention.
  • the computer system 600 includes a central processing unit (CPU) 601, which can be based on a program stored in a read only memory (ROM) 602 or a program loaded from the storage part 1008 into a random access memory (RAM) 603 And perform various appropriate actions and processing.
  • ROM read only memory
  • RAM random access memory
  • various programs and data required for the operation of the system 600 are also stored.
  • the CPU601, ROM602, and RAM603 are connected to each other through a bus 604.
  • An input/output (I/O) interface 605 is also connected to the bus 604.
  • the following components are connected to the I/O interface 605: an input part 606 including a keyboard, a mouse, etc.; an output part 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc. and speakers, etc.; a storage part 608 including a hard disk, etc. ; And a communication section 609 including a network interface card such as a LAN card, a modem, etc. The communication section 609 performs communication processing via a network such as the Internet.
  • the driver 610 is also connected to the 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, etc., is installed on the drive 610 as needed, so that the computer program read from it is installed into the storage part 608 as needed.
  • the process described above with reference to the flowchart can be implemented as a computer software program.
  • the disclosed embodiments of the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart.
  • the computer program may be downloaded and installed from the network through the communication part 609, and/or installed from the removable medium 611.
  • the central processing unit (CPU) 601 the above-mentioned functions defined in the system of the present invention are executed.
  • the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two.
  • the computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, 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 with 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 above.
  • the computer-readable storage medium may be any tangible medium that contains or stores a program, and the program may be used by or in combination with an instruction execution system, apparatus, or device.
  • a computer-readable signal medium may include a data signal propagated in a baseband or as a part of a carrier wave, and a computer-readable program code is carried therein. This propagated data signal can take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the computer-readable signal medium may also be any computer-readable medium other than the computer-readable storage medium.
  • the computer-readable medium may send, propagate, or transmit the program for use by or in combination with the instruction execution system, apparatus, or device .
  • the program code contained on the computer-readable medium can be transmitted by any suitable medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.
  • each block in the flowchart or block diagram may represent a module, program segment, or part of the code, and the above-mentioned module, program segment, or part of the code contains one or more for realizing the specified logic function Executable instructions.
  • the functions marked in the block may also occur in a different order from the order marked in the drawings. For example, two blocks shown in succession can actually be executed substantially in parallel, or they can sometimes be executed in the reverse order, depending on the functions involved.
  • each block in the block diagram or flowchart, and the combination of blocks in the block diagram or flowchart can be implemented by a dedicated hardware-based system that performs the specified functions or operations, or can be It is realized by a combination of dedicated hardware and computer instructions.
  • the modules involved in the described embodiments of the present invention can be implemented in software or hardware.
  • the described module can also be set in the processor, for example, it can be described as: a processor includes a building module, an association module and a picking module. Among them, the names of these modules do not constitute a limitation on the module itself under certain circumstances.
  • the present invention also provides a computer-readable medium.
  • the computer-readable medium may be included in the device described in the foregoing embodiment; or it may exist alone without being assembled into the device.
  • the above-mentioned computer-readable medium carries one or more programs.
  • the device includes: acquiring order information to form a picking task; The degree of coincidence of the channel where the cargo storage location is located, associates one or more picking tasks to the same transport vehicle; obtains all the picking storage locations of the picking task of the transport vehicle, and then calculates the path of the transport vehicle; wherein, the path At least one picking parking point is included in each picking parking point, and each picking parking point corresponds to at least one picking storage space; receiving the location information of the idle pickers and the picking parking point where the transport truck is currently located, and calculating the matching parking point for the transport truck
  • the idle pickers send the picking tasks associated with the transport truck to the idle pickers for execution.

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Strategic Management (AREA)
  • General Physics & Mathematics (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Warehouses Or Storage Devices (AREA)

Abstract

一种拣货方法和装置，涉及计算机技术领域。该方法包括：获取订单信息，以组建拣货任务(S101)；根据拣货任务之间的拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车(S102)；获取运输车的拣货任务的所有拣货储位，进而计算运输车的路径(S103)；其中，所述路径中包括至少一个拣货停车点，每个所述拣货停车点对应至少一个拣货储位；接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行(S104)。所述方法能够解决现有技术中拣货作业效率低下的问题。

Description

一种拣货方法和装置 技术领域
本发明涉及计算机技术领域，尤其涉及一种拣货方法和装置。
背景技术
在仓库对订单进行履约的过程中，把多个订单组合到一起形成一个拣货任务单，然后分给拣货人员，执行拣货任务。目前传统的执行拣货任务的方式可以分为两大类：
第一类：一个拣货人员完成全部拣货，即一个人独立完成自己领到的拣货任务，拣货路径是拣货任务的储位所在的主通道的顺序。
第二类：多个拣货人员接力完成一个拣货任务，即每个拣货人员负责部分区域，这样每个拣货人员就可以执行自己负责区域内的拣货任务，前面的拣货人员完成自己区域的拣货任务后可以通过输送线传递给后面的拣货人员。
在实现本发明过程中，发明人发现现有技术中至少存在如下问题：
在根据拣货任务单执行拣货任务时，完全用人力，一个拣货人员完成整个拣货任务。或者通过输送线，把拣货任务接力完成。而一个拣货人员独立完成全部拣货任务的方式会导致人员无效行走距离过长，接力拣货一定程度上减少无效行走距离，但是输送线在仓库里面部署实施时不方便灵活。
发明内容
有鉴于此，本发明实施例提供一种拣货方法和装置，能够解决现有技术中拣货作业效率低下的问题。
为实现上述目的，根据本发明实施例的一个方面，提供了一种拣货方法，包括获取订单信息，以组建拣货任务；根据拣货任务之间的 拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车；获取运输车的拣货任务的所有拣货储位，进而计算运输车的路径；其中，所述路径中包括至少一个拣货停车点，每个所述拣货停车点对应至少一个拣货储位；接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行。
可选地，获取订单信息，以组建拣货任务，包括：
提取订单信息中的最迟出库时间，判断订单最迟出库时间距离当前时间是否大于预设时间差阈值；
根据判断结果，如果大于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间大于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，并保存未被分组的订单待后续进行分组；如果小于或等于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间小于或等于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，然后将未被分组的订单分成一组。
可选地，接收空闲拣货人员的位置信息之后，包括：
判断是否存在具有临近出库时效的拣货任务的运输车，若存在则发送临近出库时效的拣货任务行信息和与临近出库时效拣货任务的储位相匹配的拣货任务行信息以执行；
若不存在则计算与运输车的位置距离最近的空闲拣货人员，向所述空闲拣货人员发送所述运输车关联的与拣货储位相匹配的拣货任务行信息以执行。
可选地，计算与空闲拣货人员匹配的运输车，包括：
根据运输车当前所在的拣货停车点和空闲拣货人员的位置信息，计算与运输车的位置距离最近的空闲拣货人员。
可选地，向所述空闲拣货人员发送与运输车关联的拣货任务以执 行之后，包括：
确定执行完成与运输车关联的拣货任务，判断所述运输车根据其路径是否具有下一个拣货停车点；
如果具有下一个拣货停车点，则控制所述运输车行驶至所述下一个拣货停车点；如果不具有下一个拣货停车点，则控制所述运输车行驶至目的地位置。
另外，根据本发明实施例的一个方面，提供了一种拣货装置，包括组建模块，用于获取订单信息，以组建拣货任务；关联模块，用于根据拣货任务之间的拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车；拣货模块，用于获取运输车的拣货任务的所有拣货储位，进而计算运输车的路径；其中，所述路径中包括至少一个拣货停车点，每个所述拣货停车点对应至少一个拣货储位；接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行。
可选地，所述组建模块获取订单信息，以组建拣货任务，包括：
提取订单信息中的最迟出库时间，判断订单最迟出库时间距离当前时间是否大于预设时间差阈值；
根据判断结果，如果大于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间大于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，并保存未被分组的订单待后续进行分组；如果小于或等于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间小于或等于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，然后将未被分组的订单分成一组。
可选地，所述拣货模块接收空闲拣货人员的位置信息之后，包括：
判断是否存在具有临近出库时效的拣货任务的运输车，若存在则发送临近出库时效的拣货任务行信息和与临近出库时效拣货任务的储 位相匹配的拣货任务行信息以执行；
若不存在则计算与运输车的位置距离最近的空闲拣货人员，向所述空闲拣货人员发送所述运输车关联的与拣货储位相匹配的拣货任务行信息以执行。
可选地，所述拣货模块计算与空闲拣货人员匹配的运输车，包括：
根据运输车当前所在的拣货停车点和空闲拣货人员的位置信息，计算与运输车的位置距离最近的空闲拣货人员。
可选地，所述拣货模块向所述空闲拣货人员发送与运输车关联的拣货任务以执行之后，包括：
确定执行完成与运输车关联的拣货任务，判断所述运输车根据其路径是否具有下一个拣货停车点；
如果具有下一个拣货停车点，则控制所述运输车行驶至所述下一个拣货停车点；如果不具有下一个拣货停车点，则控制所述运输车行驶至目的地位置。
根据本发明实施例的另一个方面，还提供了一种电子设备，包括：
一个或多个处理器；
存储装置，用于存储一个或多个程序，
当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现上述任一拣货实施例所述的方法。
根据本发明实施例的另一个方面，还提供了一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现上述任一基于拣货实施例所述的方法。
上述发明中的一个实施例具有如下优点或有益效果：本发明通过获取订单信息，以组建拣货任务；根据拣货任务之间的拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车；获取运 输车的拣货任务的所有拣货储位，进而计算运输车的路径；接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行。因此，本发明通过引入托着拣货容器的运输车和拣货人员结合的方式，科学规划运输车的路径，减少拣货人员的无效行走距离，提升拣货作业效率。
上述的非惯用的可选方式所具有的进一步效果将在下文中结合具体实施方式加以说明。
附图说明
附图用于更好地理解本发明，不构成对本发明的不当限定。其中：
图1是根据本发明第一实施例的拣货方法的主要流程的示意图；
图2是根据本发明可参考实施例的拣货方法的主要流程的示意图；
图3是根据本发明实施例的组建拣货任务的主要流程的示意图；
图4是根据本发明实施例的拣货装置的主要模块的示意图；
图5是本发明实施例可以应用于其中的示例性系统架构图；
图6是适于用来实现本发明实施例的终端设备或服务器的计算机系统的结构示意图。
具体实施方式
以下结合附图对本发明的示范性实施例做出说明，其中包括本发明实施例的各种细节以助于理解，应当将它们认为仅仅是示范性的。因此，本领域普通技术人员应当认识到，可以对这里描述的实施例做出各种改变和修改，而不会背离本发明的范围和精神。同样，为了清楚和简明，以下的描述中省略了对公知功能和结构的描述。
图1是根据本发明第一实施例的拣货方法的主要流程的示意图，所述拣货方法可以包括：
步骤S101，获取订单信息，以组建拣货任务。
在一个进一步地实施例中，组建拣货任务的时候，可以提取订单信息中的最迟出库时间，判断订单最迟出库时间距离当前时间是否大于预设时间差阈值。然后，根据判断结果，如果大于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间大于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，并保存未被分组的订单待后续进行分组。
如果小于或等于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间小于或等于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，然后将未被分组的订单分成一组。
步骤S102，根据拣货任务之间的拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车。
较佳地，运输车可以采用的是AGV小车，而所述的AGV小车可以是辅助拣货的自动行走的车辆，可以进入通道并在储位前面停留，可以按照自己拣货任务的路径独立行走。
步骤S103，获取运输车的拣货任务的所有拣货储位，进而计算运输车的路径。
较佳地，计算运输车的路径之后，运输车便可以根据所述路径到达对应的拣货停车点。其中，所述路径中包括至少一个拣货停车点，每个所述拣货停车点对应至少一个拣货储位。那么，步骤S104在计算与运输车匹配的空闲拣货人员的时候，则可以计算拣货停车点的与运输车匹配的空闲拣货人员。
在实施例中，运输车目的地位置是指在仓库拣货完成后的目的地，根据不同的业务类型拣货完成后所要到达的仓库目的地可能不同也可 能相同，而能够关联到一辆运输车上的订单其拣货完成后所要到达的仓库目的地相同。例如：业务类型为内配的订单和退供的订单可以预分组到一起，即最终订单完成都是到达仓库的同一个地方等待后续的处理。其中，所述的内配订单是指商品移库订单，所述的退供订单是指退货给供应商订单。
步骤S104，接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行。
作为进一步地实施例，步骤S104在接收空闲拣货人员的位置信息之后，可以先判断是否存在具有临近出库时效的拣货任务的运输车，若存在具有临近出库时效的拣货任务的运输车则发送临近出库时效的拣货任务行信息和与临近出库时效拣货任务的储位相匹配的拣货任务行信息以执行。当然，若不存在具有临近出库时效的拣货任务的运输车则计算与运输车的位置距离最近的空闲拣货人员，发送所述运输车关联的与拣货储位相匹配的拣货任务行信息以执行。
值得说明的是，在执行完成运输车关联的与拣货储位相匹配的拣货任务，则可以判断该运输车根据其路径是否具有下一个拣货停车点。根据判断结果，如果具有下一个拣货停车点，则控制所述运输车行驶至所述下一个拣货停车点。如果不具有下一个拣货停车点，则控制所述运输车行驶至目的地位置。
根据上面所述的各种实施例，本发明将运输车和拣货人员结合起来完成拣货任务，结合的方式使运输车深入拣货通道内拣货储位旁边，而拣货人员只要把拣货停车点附近的拣货任务完成就可以让运输车离开去下一个拣货停车点，拣货人员不必跟着走，因此拣货人员可以继续在附近进行拣货给另外的运输车，从而可以使拣货人员具有了更多的时间拣货，产生更高的拣货效率。
图2是根据本发明可参考实施例的拣货方法的主要流程的示意图，所述拣货方法可以包括：
步骤S201，获取订单信息，以组建拣货任务。
在实施例中，所述的拣货任务是根据订单属性，把订单组合在一起形成拣货任务，从而提高拣货效率。每一个订单对应一个拣货任务行，而n个拣货任务行形成一个拣货任务。其中，每个拣货任务行可以包括储位编号、商品编号、数量等信息。优选地，可以具体的实施过程包括：
步骤S301：提取订单信息中的最迟出库时间。
步骤S302：判断订单最迟出库时间距离当前时间是否大于预设时间差阈值，若大于则进行步骤S303，否则进行步骤S306。
在实施例中，若订单最迟出库时间距离当前时间大于预设的时间差阈值则说明该订单可能不急于出库，若订单最迟出库时间距离当前时间小于或等于预设的时间差阈值则说明该订单可能急于出库。
步骤S303：根据业务类型，将最迟出库时间距离当前时间大于预设时间差阈值的订单进行预分组。
在实施例中，不同业务类型的订单能够预分组到一起，主要可以采用其在仓库拣货完成后的目的地相同，即虽然业务类型不同但拣货完成后的所要到达的仓库目的地相同。例如：业务类型为内配的订单和退供的订单则可以预分组到一起，即最终订单完成都是到达仓库的同一个地方等待后续的处理。其中，所述的内配订单是指商品移库订单，所述的退供订单是指退货给供应商订单。
步骤S304：对预分组组内的订单计算重合度，将重合度大于预设重合度阈值的订单分组在一起。
较佳地，订单可以包括一件商品或者多种商品，如果只包括一件商品在计算重合度时则可以根据商品属性值计算，优选地，可以计算商品储位的重合度。如果订单包括了多种商品，则可以根据订单之间订单行的重合度进行计算，优选地，可以计算订单之间订单行中商品品类属性的重合度。其中，所述的订单行是指订单中包括多种商品，即每种商品的订单信息形成一个订单行。例如：一个订单包括三个订单行：商品一、商品二、商品三。
步骤S305：保存没有被分组的最迟出库时间距离当前时间大于预设时间差阈值的订单，返回步骤S301。
在实施例中，可以将没有被分组的最迟出库时间距离当前时间大于预设时间差阈值的订单保存下来，待获取新的订单之后，返回步骤S301，即可以跟新的订单进行分组的过程。
或者，不等待获取新的订单，就返回步骤S301，即可能没有被分组的最迟出库时间距离当前时间大于预设时间差阈值的订单变为了最迟出库时间距离当前时间小于或等于预设时间差阈值的订单。
步骤S306：根据业务类型，将最迟出库时间距离当前时间小于或等于预设时间差阈值的订单进行预分组。
在实施例中，不同业务类型的订单能够预分组到一起，主要可以采用其在仓库拣货完成后的目的地相同，即虽然业务类型不同但拣货完成后的所要到达的仓库目的地相同。例如：业务类型为内配的订单和退供的订单则可以预分组到一起。其中，所述的内配订单是指商品移库订单，所述的退供订单是指退货给供应商订单。
步骤S307：对预分组组内的订单计算重合度，将重合度大于预设 重合度阈值的订单分组在一起。
较佳地，订单可以包括一件商品或者多种商品，如果只包括一件商品在计算重合度时则可以根据商品属性值计算，优选地，可以计算商品拣货储位的重合度。如果订单包括了多种商品，则可以根据订单之间订单行的重合度进行计算，优选地，可以计算订单之间订单行中商品品类属性的重合度。其中，所述的订单行是指订单中包括多种商品，即每种商品的订单信息形成一个订单行。例如：一个订单包括三个订单行：商品一、商品二、商品三。
步骤S308：将没有被分组的最迟出库时间距离当前时间小于或等于预设时间差阈值的订单分组在一起。
步骤S202，计算拣货任务之间的拣货储位所在通道的重合度。
在实施例中，拣货任务中包括了订单，而订单针对不同的商品可以确定其拣货储位，进而可以确定通道。
步骤S203，将重合度大于预设通道重合度阈值的拣货任务关联同一辆运输车。
较佳地，可以将重合度大于预设通道重合度阈值的拣货任务的所有ID与一辆运输车的ID进行关联。
步骤S204，根据出库优先级，对关联同一辆运输车的拣货任务分配运输车。
在实施例中，出库优先级是指运输车上拣货任务中订单最迟出库时间距离当前时间的时间差越小则关联同一辆运输车的拣货任务优先级越高，即先分配运输车给该关联同一辆运输车的拣货任务。
步骤S205，获取分配了运输车的拣货任务的所有拣货储位，以及当前运输车的位置和目的地位置。
在实施例中，运输车的目的地位置是根据运输车被分配的拣货任务中订单的业务类型决定，一般能够被关联到同一辆运输车上的拣货任务中订单的业务类型所指向的仓库拣货完成所要到达的仓库指定目的地位置相同，以便后续工作。
步骤S206，获取当前的仓库交通地图，计算运输车的路径。
在实施例中，可以利用当前的仓库交通地图，避开拥堵位置，计算运输车从当前位置至目的地位置经过所有拣货储位耗时最少的路径。
步骤S207，运输车根据其路径到达对应的拣货停车点，接收运输车当前所在的拣货停车点。
在实施例中，所述的拣货停车点可以对应多个拣货储位。进一步地，拣货停车点可以根据拣货人员能够完成的拣货储位的数量，在通道上设置。其中，如果通道为双行道，则拣货停车点在运输车行驶方向的行车道上。更进一步地，可以计算包括有拣货人员能够完成的拣货储位的区域的中心，且该中心在通道上，则作为拣货停车点。
步骤S208，接收空闲拣货人员的位置信息。
较佳地，一般情况下拣货人员的位置都会是一个拣货储位前，即当拣货人员到达一个拣货储位完成拣货，便会上传当前位置(此时该拣货人员为空闲)，进而请求执行拣货。
步骤S209，判断是否存在具有临近出库时效的拣货任务的运输车，若存在则进行步骤S210和步骤S211，否则进行步骤S212和S213。
在实施例中，所述的临近出库时效的拣货任务是指拣货任务中包括了出库时间距离当前时间的时间差小于或等于最小时间差阈值的订单。
步骤S210，将所述临近出库时效的拣货任务的运输车与空闲拣货人员关联，并向空闲拣货人员发送临近出库时效的拣货任务行信息以执行。
较佳地，将发送的临近出库时效的拣货任务行信息中的ID与空闲拣货人员的ID进行关联。在实施例中，拣货人员持有移动终端设备，可以接收拣货任务行信息。
还值得说明的是，在执行步骤S210时，可以先判断空闲拣货人员距离所述临近出库时效的拣货任务的运输车的距离，如果该距离大于预设的最大距离，则需要将临近出库时效的拣货任务行信息发送给距离临近出库时效的拣货任务的运输车当前位置最近的拣货人员，即距离临近出库时效的拣货任务的运输车当前位置最近的拣货人员暂停拣货任务，接受所述临近出库时效的拣货任务行信息。
当然，如果该距离小于或等于预设的最大距离，则将所述临近出库时效的拣货任务的运输车与空闲拣货人员关联，并发送临近出库时效的拣货任务行信息。
步骤S211，将与临近出库时效拣货任务的储位相匹配的拣货任务行信息发送给空闲拣货人员，执行步骤S214。
在实施例中，所述与临近出库时效拣货任务位置相匹配的拣货任 务行是指运输车上拣货任务行的储位在临近出库时效拣货任务的储位所在区域内。其中，所述区域可以根据实际需求和仓库情况进行预先设置，例如可以以临近出库时效拣货任务的储位所在通道为区域。
步骤S212，计算与运输车的位置距离最近的空闲拣货人员，以将该运输车与空闲拣货人员关联。
在实施例中，计算空闲拣货人员的位置与运输车拣货停车点距离最近的，以将该运输车与空闲拣货人员关联。
步骤S213，将与该拣货人员所在位置点相匹配的拣货任务行通知给该拣货人员，执行步骤S214。
在实施例中，所述与该拣货人员所在位置点相匹配的拣货任务行是指运输车上拣货任务行的储位在拣货人员位置点所在区域内。其中，所述区域可以根据实际需求和仓库情况进行预先设置，例如可以以拣货人员位置点所在通道为区域。
步骤S214，确定运输车上分配给空闲拣货人员的拣货任务行执行完成。
在实施例中，运输车和拣货人员一起执行分配的拣货任务行，即运输车和拣货人员一起到达拣货任务行对应的储位进行拣货。
空闲拣货人员每当完成一项拣货任务行便可以在运输车上的触屏或者在RF上提交。其中，射频(RF)是radio frequency的缩写，表示可以辐射到空间的电磁频率，频率范围从300khz～30ghz之间。
步骤S215，解除运输车与空闲拣货人员的关联，判断该运输车根据其路径是否具有下一个拣货停车点，若是则返回步骤S207，否则该 运输车根据其路径到达目的地位置，退出该流程。
图4是根据本发明实施例的拣货装置，如图4所示，所述拣货装置400包括组建模块401、关联模块402和拣货模块403。其中，组建模块401获取订单信息，以组建拣货任务。关联模块402根据拣货任务之间的拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车。之后，拣货模块403获取运输车的拣货任务的所有拣货储位，进而计算运输车的路径；其中，所述路径中包括至少一个拣货停车点，每个所述拣货停车点对应至少一个拣货储位；接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行。
在一个较佳地实施例中，所述组建模块401可以通过如下过程获取订单信息，以组建拣货任务：
提取订单信息中的最迟出库时间，判断订单最迟出库时间距离当前时间是否大于预设时间差阈值。之后，根据判断结果，如果大于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间大于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，并保存未被分组的订单待后续进行分组。当然，如果小于或等于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间小于或等于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，然后将未被分组的订单分成一组。
作为一个可参考的实施例，所述拣货模块403在接收空闲拣货人员的位置信息之后，可以判断是否存在具有临近出库时效的拣货任务的运输车。根据判断结果，如果存在具有临近出库时效的拣货任务的运输车，则发送临近出库时效的拣货任务行信息和与临近出库时效拣货任务的储位相匹配的拣货任务行信息以执行。若不存在则计算与运输车的位置距离最近的空闲拣货人员，向所述空闲拣货人员发送所述 运输车关联的与拣货储位相匹配的拣货任务行信息以执行。
值得说明的是，所述拣货模块403计算与空闲拣货人员匹配的运输车，包括：根据运输车当前所在的拣货停车点和空闲拣货人员的位置信息，计算与运输车的位置距离最近的空闲拣货人员。
进一步地，所述拣货模块403向所述空闲拣货人员发送与运输车关联的拣货任务以执行之后，包括：确定执行完成与运输车关联的拣货任务，判断所述运输车根据其路径是否具有下一个拣货停车点；如果具有下一个拣货停车点，则控制所述运输车行驶至所述下一个拣货停车点；如果不具有下一个拣货停车点，则控制所述运输车行驶至目的地位置。
需要说明的是，在本发明所述拣货方法和所述拣货装置在具体实施内容上具有相应关系，故重复内容不再说明。
图5示出了可以应用本发明实施例的拣货方法或拣货装置的示例性系统架构500。
如图5所示，系统架构500可以包括终端设备501、502、503，网络504和服务器505。网络504用以在终端设备501、502、503和服务器505之间提供通信链路的介质。网络504可以包括各种连接类型，例如有线、无线通信链路或者光纤电缆等等。
用户可以使用终端设备501、502、503通过网络504与服务器505交互，以接收或发送消息等。终端设备501、502、503上可以安装有各种通讯客户端应用，例如购物类应用、网页浏览器应用、搜索类应用、即时通信工具、邮箱客户端、社交平台软件等(仅为示例)。
终端设备501、502、503可以是具有显示屏并且支持网页浏览的 各种电子设备，包括但不限于智能手机、平板电脑、膝上型便携计算机和台式计算机等等。
服务器505可以是提供各种服务的服务器，例如对用户利用终端设备501、502、503所浏览的购物类网站提供支持的后台管理服务器(仅为示例)。后台管理服务器可以对接收到的产品信息查询请求等数据进行分析等处理，并将处理结果(例如目标推送信息、产品信息--仅为示例)反馈给终端设备。
需要说明的是，本发明实施例所提供的拣货方法一般由服务器505执行，相应地，拣货装置一般设置于服务器505中。
应该理解，图5中的终端设备、网络和服务器的数目仅仅是示意性的。根据实现需要，可以具有任意数目的终端设备、网络和服务器。
下面参考图6，其示出了适于用来实现本发明实施例的终端设备的计算机系统600的结构示意图。图6示出的终端设备仅仅是一个示例，不应对本发明实施例的功能和使用范围带来任何限制。
如图6所示，计算机系统600包括中央处理单元(CPU)601，其可以根据存储在只读存储器(ROM)602中的程序或者从存储部分1008加载到随机访问存储器(RAM)603中的程序而执行各种适当的动作和处理。在RAM603中，还存储有系统600操作所需的各种程序和数据。CPU601、ROM602以及RAM603通过总线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 (20)

  1. 一种拣货方法，其特征在于，包括：
    获取订单信息，以组建拣货任务；
    根据拣货任务之间的拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车；
    获取运输车的拣货任务的所有拣货储位，进而计算运输车的路径；其中，所述路径中包括至少一个拣货停车点，每个所述拣货停车点对应至少一个拣货储位；
    接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行。
  2. 根据权利要求1所述的方法，其特征在于，获取订单信息，以组建拣货任务，包括：
    提取订单信息中的最迟出库时间，判断订单最迟出库时间距离当前时间是否大于预设时间差阈值；
    根据判断结果，如果大于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间大于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，并保存未被分组的订单待后续进行分组；如果小于或等于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间小于或等于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，然后将未被分组的订单分成一组。
  3. 根据权利要求1所述的方法，其特征在于，接收空闲拣货人员的位置信息之后，包括：
    判断是否存在具有临近出库时效的拣货任务的运输车，若存在则发送临近出库时效的拣货任务行信息和与临近出库时效拣货任务的储位相匹配的拣货任务行信息以执行；
    若不存在则计算与运输车的位置距离最近的空闲拣货人员，向所述空闲拣货人员发送所述运输车关联的与拣货储位相匹配的拣货任务行信息以执行。
  4. 根据权利要求1所述的方法，其特征在于，计算与运输车匹配的空闲拣货人员，包括：
    根据运输车当前所在的拣货停车点和空闲拣货人员的位置信息，计算与运输车的位置距离最近的空闲拣货人员。
  5. 根据权利要求1-4中任一项所述的方法，其特征在于，向所述空闲拣货人员发送与运输车关联的拣货任务以执行之后，包括：
    确定执行完成与运输车关联的拣货任务，判断所述运输车根据其路径是否具有下一个拣货停车点；
    如果具有下一个拣货停车点，则控制所述运输车行驶至所述下一个拣货停车点；如果不具有下一个拣货停车点，则控制所述运输车行驶至目的地位置。
  6. 一种拣货装置，其特征在于，包括：
    组建模块，用于获取订单信息，以组建拣货任务；
    关联模块，用于根据拣货任务之间的拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车；
    拣货模块，用于获取运输车的拣货任务的所有拣货储位，进而计算运输车的路径；其中，所述路径中包括至少一个拣货停车点，每个所述拣货停车点对应至少一个拣货储位；接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行。
  7. 根据权利要求6所述的装置，其特征在于，所述组建模块获取订单信息，以组建拣货任务，包括：
    提取订单信息中的最迟出库时间，判断订单最迟出库时间距离当 前时间是否大于预设时间差阈值；
    根据判断结果，如果大于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间大于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，并保存未被分组的订单待后续进行分组；如果小于或等于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间小于或等于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，然后将未被分组的订单分成一组。
  8. 根据权利要求6所述的装置，其特征在于，所述拣货模块接收空闲拣货人员的位置信息之后，包括：
    判断是否存在具有临近出库时效的拣货任务的运输车，若存在则发送临近出库时效的拣货任务行信息和与临近出库时效拣货任务的储位相匹配的拣货任务行信息以执行；
    若不存在则计算与运输车的位置距离最近的空闲拣货人员，向所述空闲拣货人员发送所述运输车关联的与拣货储位相匹配的拣货任务行信息以执行。
  9. 根据权利要求6所述的装置，其特征在于，所述拣货模块计算与运输车匹配的空闲拣货人员，包括：
    根据运输车当前所在的拣货停车点和空闲拣货人员的位置信息，计算与运输车的位置距离最近的空闲拣货人员。
  10. 根据权利要求6-9中任一项所述的装置，其特征在于，所述拣货模块向所述空闲拣货人员发送与运输车关联的拣货任务以执行之后，包括：
    确定执行完成与运输车关联的拣货任务，判断所述运输车根据其路径是否具有下一个拣货停车点；
    如果具有下一个拣货停车点，则控制所述运输车行驶至所述下一个拣货停车点；如果不具有下一个拣货停车点，则控制所述运输车行驶至目的地位置。
  11. 一种电子设备，其特征在于，包括：
    一个或多个处理器；
    存储装置，用于存储一个或多个程序，
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如下方法：
    获取订单信息，以组建拣货任务；
    根据拣货任务之间的拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车；
    获取运输车的拣货任务的所有拣货储位，进而计算运输车的路径；其中，所述路径中包括至少一个拣货停车点，每个所述拣货停车点对应至少一个拣货储位；
    接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行。
  12. 根据权利要求11所述的电子设备，其特征在于，
    获取订单信息，以组建拣货任务，包括：
    提取订单信息中的最迟出库时间，判断订单最迟出库时间距离当前时间是否大于预设时间差阈值；
    根据判断结果，如果大于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间大于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，并保存未被分组的订单待后续进行分组；如果小于或等于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间小于或等于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，然后将未被分组的订单分成一组。
  13. 根据权利要求11所述的电子设备，其特征在于，
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现：
    接收空闲拣货人员的位置信息之后：
    判断是否存在具有临近出库时效的拣货任务的运输车，若存在则发送临近出库时效的拣货任务行信息和与临近出库时效拣货任务的储位相匹配的拣货任务行信息以执行；
    若不存在则计算与运输车的位置距离最近的空闲拣货人员，向所述空闲拣货人员发送所述运输车关联的与拣货储位相匹配的拣货任务行信息以执行。
  14. 根据权利要求11所述的电子设备，其特征在于，
    计算与运输车匹配的空闲拣货人员，包括：
    根据运输车当前所在的拣货停车点和空闲拣货人员的位置信息，计算与运输车的位置距离最近的空闲拣货人员。
  15. 根据权利要求11-14中任一项所述的电子设备，其特征在于，
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现：
    向所述空闲拣货人员发送与运输车关联的拣货任务以执行之后，
    确定执行完成与运输车关联的拣货任务，判断所述运输车根据其路径是否具有下一个拣货停车点；
    如果具有下一个拣货停车点，则控制所述运输车行驶至所述下一个拣货停车点；如果不具有下一个拣货停车点，则控制所述运输车行驶至目的地位置。
  16. 一种计算机可读介质，其上存储有计算机程序，其特征在于，所述程序被处理器执行时实现如下方法：
    获取订单信息，以组建拣货任务；
    根据拣货任务之间的拣货储位所在通道的重合度，将一个或多个拣货任务关联至同一辆运输车；
    获取运输车的拣货任务的所有拣货储位，进而计算运输车的路径；其中，所述路径中包括至少一个拣货停车点，每个所述拣货停车点对 应至少一个拣货储位；
    接收空闲拣货人员的位置信息以及运输车当前所在的拣货停车点，计算与运输车匹配的空闲拣货人员，向所述空闲拣货人员发送与运输车关联的拣货任务以执行。
  17. 根据权利要求16所述的计算机可读介质，其特征在于，
    获取订单信息，以组建拣货任务，包括：
    提取订单信息中的最迟出库时间，判断订单最迟出库时间距离当前时间是否大于预设时间差阈值；
    根据判断结果，如果大于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间大于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，并保存未被分组的订单待后续进行分组；如果小于或等于预设时间差阈值则根据业务类型，将最迟出库时间距离当前时间小于或等于预设时间差阈值的订单进行预分组，再根据订单的重合度进行分组，然后将未被分组的订单分成一组。
  18. 根据权利要求16所述的计算机可读介质，其特征在于，所述程序被处理器执行时实现：
    接收空闲拣货人员的位置信息之后：
    判断是否存在具有临近出库时效的拣货任务的运输车，若存在则发送临近出库时效的拣货任务行信息和与临近出库时效拣货任务的储位相匹配的拣货任务行信息以执行；
    若不存在则计算与运输车的位置距离最近的空闲拣货人员，向所述空闲拣货人员发送所述运输车关联的与拣货储位相匹配的拣货任务行信息以执行。
  19. 根据权利要求16所述的计算机可读介质，其特征在于，
    计算与运输车匹配的空闲拣货人员，包括：
    根据运输车当前所在的拣货停车点和空闲拣货人员的位置信息，计算与运输车的位置距离最近的空闲拣货人员。
  20. 根据权利要求16-19中任一项所述的计算机可读介质，其特征在于，
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现：
    向所述空闲拣货人员发送与运输车关联的拣货任务以执行之后，
    确定执行完成与运输车关联的拣货任务，判断所述运输车根据其路径是否具有下一个拣货停车点；
    如果具有下一个拣货停车点，则控制所述运输车行驶至所述下一个拣货停车点；如果不具有下一个拣货停车点，则控制所述运输车行驶至目的地位置。
PCT/CN2019/129232 2019-02-12 2019-12-27 一种拣货方法和装置 WO2020164319A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US17/425,236 US11816632B2 (en) 2019-02-12 2019-12-27 Goods pickup method and device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910111158.9A CN111553548B (zh) 2019-02-12 2019-02-12 一种拣货方法和装置
CN201910111158.9 2019-02-12

Publications (1)

Publication Number Publication Date
WO2020164319A1 true WO2020164319A1 (zh) 2020-08-20

Family

ID=72003713

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/129232 WO2020164319A1 (zh) 2019-02-12 2019-12-27 一种拣货方法和装置

Country Status (3)

Country Link
US (1) US11816632B2 (zh)
CN (1) CN111553548B (zh)
WO (1) WO2020164319A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112906996A (zh) * 2021-05-06 2021-06-04 牧星机器人(江苏)有限公司 仓储拣货优化方法、仓储拣货系统及仓储运营系统

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11699114B2 (en) * 2020-09-21 2023-07-11 Walmart Apollo, Llc Automated robotic pre-staging of prioritized pick up orders for non-notifying customers of a retail store
CN113762839A (zh) * 2020-09-22 2021-12-07 北京京东乾石科技有限公司 货物处理方法和装置
CN113822509B (zh) * 2020-11-09 2023-11-03 北京京东振世信息技术有限公司 一种组单方法和装置
CN112488546A (zh) * 2020-12-08 2021-03-12 炬星科技（深圳）有限公司 辅助选路方法、装置、设备及可读存储介质
CN112633794A (zh) * 2020-12-17 2021-04-09 北京京东振世信息技术有限公司 一种分拣容器信息处理方法、装置、电子设备及存储介质
CN114506615A (zh) * 2022-03-02 2022-05-17 厦门荆艺软件股份有限公司 一种仓库拣货方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107235276A (zh) * 2017-06-05 2017-10-10 北京京东尚科信息技术有限公司 货物搬运方法和装置
CN108100548A (zh) * 2017-11-10 2018-06-01 北京科捷物流有限公司 一种仓储机器人自动分拣方法及分拣系统
US20180229950A1 (en) * 2017-02-13 2018-08-16 General Electric Company System and method for handling automobiles at a distribution site
CN108861276A (zh) * 2018-07-26 2018-11-23 昆山岩古风智能科技有限公司 一种基于agv跟随式仓库拣货方法
CN108921327A (zh) * 2018-06-06 2018-11-30 北京极智嘉科技有限公司 应用于货到人系统的货架搬运方法、装置及系统

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2005206281A (ja) * 2004-01-20 2005-08-04 Hitachi Ltd オーダー統合制御システム、オーダー統合制御方法、およびオーダー統合制御プログラム
CN104881768A (zh) * 2015-05-25 2015-09-02 北京京东尚科信息技术有限公司 一种订单分拣出库的任务处理方法及装置
US9805324B2 (en) * 2015-09-16 2017-10-31 Sas Institute Inc. Computer-implemented system for modeling an allocated resource
US10380534B2 (en) * 2016-03-11 2019-08-13 Route4Me, Inc. Autonomous supply and distribution chain
US10589931B2 (en) * 2016-09-30 2020-03-17 Staples, Inc. Hybrid modular storage fetching system
US10683171B2 (en) * 2016-09-30 2020-06-16 Staples, Inc. Hybrid modular storage fetching system
CN106845674A (zh) * 2016-12-15 2017-06-13 北京京东尚科信息技术有限公司 拣货路径确定方法和装置
US20180197137A1 (en) * 2017-01-11 2018-07-12 Wal-Mart Stores, Inc. Systems and methods for facilitating delivery of products ordered over the internet to customers from product stocking facilities
CN108320041A (zh) * 2017-01-16 2018-07-24 北京京东尚科信息技术有限公司 分配集合单的方法、装置、电子设备和可读存储介质
CN106809586B (zh) * 2017-03-28 2019-08-30 北京京东尚科信息技术有限公司 用于确定拣货路径的方法和装置
CN109146350A (zh) * 2017-06-28 2019-01-04 菜鸟智能物流控股有限公司 一种仓库的发货操作执行方法和装置
CA3074289C (en) * 2017-08-31 2023-09-26 Crc R&D, Llc Management of vehicular traffic at a facility having allocable space resources
CN107583882B (zh) * 2017-09-30 2018-09-25 武汉智能装备工业技术研究院有限公司 一种物流配送货物全自动分拣包装系统及其方法
CN108846609A (zh) * 2018-06-15 2018-11-20 北京极智嘉科技有限公司 基于订单任务的拣选方法、装置、服务器和介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180229950A1 (en) * 2017-02-13 2018-08-16 General Electric Company System and method for handling automobiles at a distribution site
CN107235276A (zh) * 2017-06-05 2017-10-10 北京京东尚科信息技术有限公司 货物搬运方法和装置
CN108100548A (zh) * 2017-11-10 2018-06-01 北京科捷物流有限公司 一种仓储机器人自动分拣方法及分拣系统
CN108921327A (zh) * 2018-06-06 2018-11-30 北京极智嘉科技有限公司 应用于货到人系统的货架搬运方法、装置及系统
CN108861276A (zh) * 2018-07-26 2018-11-23 昆山岩古风智能科技有限公司 一种基于agv跟随式仓库拣货方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112906996A (zh) * 2021-05-06 2021-06-04 牧星机器人(江苏)有限公司 仓储拣货优化方法、仓储拣货系统及仓储运营系统

Also Published As

Publication number Publication date
CN111553548A (zh) 2020-08-18
CN111553548B (zh) 2024-05-17
US20220092524A1 (en) 2022-03-24
US11816632B2 (en) 2023-11-14

Similar Documents

Publication Publication Date Title
WO2020164319A1 (zh) 一种拣货方法和装置
WO2018196525A1 (zh) 货物搬运方法和装置
JP7136921B2 (ja) 商品棚を搬送する方法および装置
US12039472B2 (en) Method and device for scheduling automated guided vehicle
CN109902990A (zh) 一种供应链物流配送线路规划系统
CN112785215B (zh) 一种生成拣货路径的方法和装置
CN113673932A (zh) 一种物流网络规划方法和装置
CN111044062B (zh) 路径规划、推荐方法和装置
CN111461383A (zh) 规划配送路径的方法和装置
CN110703758A (zh) 一种路径规划方法和装置
CN113222205B (zh) 一种路径规划的方法和装置
CN112785212B (zh) 一种运输设备管理方法和装置
CN109978213A (zh) 一种任务路径规划方法和装置
CN113128743A (zh) 一种拣货路径规划方法和装置
CN107085754B (zh) 信息输出方法和装置
CN113919734A (zh) 订单配送方法和装置
CN113627858A (zh) 一种仓库缓存位点的确定方法和装置
CN113762573B (zh) 一种物流网络优化方法和装置
CN111461430A (zh) 用于生成路线信息的方法及装置
CN113642742A (zh) 拣货任务组合的方法和装置
CN110826751B (zh) 一种拣货的方法和装置
CN110274593B (zh) 一种路径规划的方法和装置
CN112529346A (zh) 任务分配方法和装置
CN111767351A (zh) 确定搬运机器人停车点的方法和装置
CN113762566B (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: 19914795

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 01/12/2021)

122 Ep: pct application non-entry in european phase

Ref document number: 19914795

Country of ref document: EP

Kind code of ref document: A1