WO2021143510A1 - 确定任务的方法和装置 - Google Patents

确定任务的方法和装置 Download PDF

Info

Publication number
WO2021143510A1
WO2021143510A1 PCT/CN2020/140712 CN2020140712W WO2021143510A1 WO 2021143510 A1 WO2021143510 A1 WO 2021143510A1 CN 2020140712 W CN2020140712 W CN 2020140712W WO 2021143510 A1 WO2021143510 A1 WO 2021143510A1
Authority
WO
WIPO (PCT)
Prior art keywords
combination
picking
tasks
task
items
Prior art date
Application number
PCT/CN2020/140712
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 北京京东振世信息技术有限公司
Publication of WO2021143510A1 publication Critical patent/WO2021143510A1/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
    • 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/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/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders

Definitions

  • the present disclosure relates to the technical field of warehousing and logistics, and in particular to a method and device for determining tasks.
  • each picking task is relatively independent, and only one picking task is assigned to one user at the same time.
  • task 1 is only assigned to user 1
  • task 3 is only assigned to user 2
  • task 5 is only assigned to user 3.
  • the paths included in each picking task are separate paths, but the path included in task 1 and the path included in task 3 overlap.
  • the picking task includes a small number of items to be picked, or the number of storage spaces to be picked is small, only one picking task is assigned to one user. Therefore, it takes a long time to complete multiple picking tasks, and the picking efficiency is low. In addition, because the paths included in multiple picking tasks may overlap, the user has to travel a long distance to complete multiple picking tasks, which exacerbates the problem of low picking efficiency.
  • the embodiments of the present disclosure provide a method and device for determining a task, which improves the efficiency of picking.
  • a method for determining a task is provided.
  • determining the coincidence rate of items and storage positions between the tasks in the combination according to the picking tasks in the combination includes:
  • the quantity of the first storage place and the quantity of the first item are respectively determined
  • the sum of the number of storage positions to be picked included in each picking task in the combination is used as the third quantity.
  • determining the quantity of the first storage place and the quantity of the first item includes:
  • the quantity of the same storage position is determined as the quantity of the first storage position
  • the quantity of the same item is determined as the quantity of the first item.
  • combining the picking tasks in the target combination to obtain the target task includes:
  • the items to be picked and the number of items to be picked and the storage positions of the items to be picked are determined respectively to determine the items to be picked and the slaves of each key storage location in the set of key storage locations.
  • the path, as well as the number of items to be picked in each key storage location and the number of items picked from each key storage location in the set of key storage locations are taken as the target task.
  • generating a path according to the key storage location set includes:
  • the key storage location set The sequence of each key storage location
  • the path is generated according to the arrangement order of each key storage position.
  • the method for obtaining the first quantity of picking tasks includes:
  • the picking tasks belonging to the same packing operation performer, the same review operation performer, or the same sorting operation performer are selected as the first number of picking tasks.
  • the picking task carries the task type
  • the methods for obtaining the first quantity of picking tasks include:
  • the picking tasks with the same task type are selected as the first number of picking tasks.
  • the second number is the same as the task demand of the user.
  • an apparatus for determining a task is provided.
  • the combination unit is used to arbitrarily combine the first number of picking tasks to obtain multiple combinations; wherein, the number of picking tasks in each combination is a second number, and the first number is greater than the second number ;
  • the processing unit is configured to, for each combination, determine the coincidence rate of items and storage positions between tasks in the combination according to the picking tasks in the combination;
  • the selection unit is used to select the combination with the highest coincidence rate of items and storage positions between tasks from multiple combinations, as the target combination;
  • the merging unit is used to merge the picking tasks in the target combination to obtain the target task.
  • an electronic device is provided.
  • An electronic device of an embodiment of the present disclosure includes: one or more processors; a storage device, configured to store one or more programs, and when the one or more programs are executed by the one or more processors, The one or more processors are enabled to implement the method for determining tasks provided by the embodiments of the present disclosure.
  • a computer-readable medium is provided.
  • a computer-readable medium of an embodiment of the present disclosure has a computer program stored thereon, and when the program is executed by a processor, the method for determining a task provided by the embodiment of the present disclosure is implemented.
  • the first number of picking tasks are arbitrarily combined to obtain multiple combinations; wherein, the number of picking tasks in each combination is the second number, and The first quantity is greater than the second quantity; for each combination, according to the picking tasks in the combination, determine the coincidence rate of items and storage positions between the tasks in the combination; select tasks from multiple combinations The combination with the highest coincidence rate between the items and the storage space is regarded as the target combination; the picking tasks in the target combination are combined to obtain the target task.
  • the several picking tasks with the highest coincidence rate of items and storage positions are combined, and a user completes the combined target task at one time, thereby reducing the time it takes for the user to complete several picking tasks and shortening the user’s need to walk. Distance to improve the efficiency of picking.
  • Figure 1 is an example of an existing method for determining a task
  • Figure 2 is an example of a path in an existing method for determining a task
  • Fig. 3 is a schematic diagram of the main flow of a method for determining a task according to an embodiment of the present disclosure
  • Fig. 4 is an example of task types in a method for determining a task according to an embodiment of the present disclosure
  • FIG. 5 is an example of a user's task demand in a method for determining a task according to an embodiment of the present disclosure
  • FIG. 6 is an example of a method for determining a task according to another embodiment of the present disclosure.
  • FIG. 7 is an example of a path in a method for determining a task according to another embodiment of the present disclosure.
  • FIG. 8 is a schematic diagram of main units of an apparatus for determining a task according to an embodiment of the present disclosure
  • FIG. 9 is an exemplary system architecture diagram to which the embodiments of the present disclosure can be applied.
  • FIG. 10 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 disclosure.
  • an embodiment of the present disclosure provides a method for determining tasks. As shown in FIG. 3, the method includes:
  • Step S301 Arbitrarily combine the first number of picking tasks to obtain multiple combinations; wherein, the number of picking tasks in each combination is a second number, and the first number is greater than the second number.
  • the first quantity of picking tasks includes: picking task 1, picking task 2, picking task 3, and picking task 4.
  • the second number is 3.
  • picking task 1 picking task 2, picking task 3, and picking task 4, randomly select 3 picking tasks as a combination to obtain combination 1, combination 2, combination 3, and combination 4.
  • combination 1 includes: picking task 1, picking task 2 and picking task 3; combination 2 includes: picking task 1, picking task 2 and picking task 4; combination 3 includes: picking task 1, picking Goods task 3 and picking task 4; combination 4 includes: picking task 2, picking task 3 and picking task 4.
  • Step S302 For each combination, according to the picking tasks in the combination, determine the coincidence rate of the items and storage positions between the tasks in the combination.
  • a picking task can be generated based on one order or based on multiple orders.
  • Picking tasks include the items to be picked, the quantity of items to be picked, and the storage location of the items to be picked.
  • the storage position of the items to be picked can be determined according to the quantity of the items to be picked and the inventory of the warehouse.
  • the determination principles include: the existing first-in first-out principle or the existing scattered inventory clearing principle.
  • Step S303 From the multiple combinations, select the combination with the highest coincidence rate of the items and storage positions between the tasks as the target combination.
  • the coincidence rates of items and storage positions between tasks in all combinations are sorted in descending order, and the combination ranked first is taken as the target combination. Or, sort the coincidence rates of items and storage positions between tasks in all combinations in ascending order, and set the combination in the last position as the target combination.
  • Step S304 Combine the picking tasks in the target combination to obtain the target task.
  • the first number of picking tasks includes 4 different picking tasks.
  • the task demand of user a is 3. Arbitrarily combine 4 different picking tasks to get 4 combinations; the number of picking tasks in each combination is 3.
  • For each combination according to the picking tasks in the combination, determine the coincidence rate of items and storage locations between tasks in the combination; from multiple combinations, select the item and storage location between tasks with the highest coincidence rate
  • the combination of as the target combination; merge the picking tasks in the target combination to obtain target task 1, and assign target task 1 to user a. Since the number of picking tasks in the target combination is 3, after assigning target task 1 to user a, only one picking task remains, and this picking task is allocated to other users.
  • any combination of the 10 picking tasks will result in multiple combinations; each combination
  • the number of picking tasks in is the task demand of user b (the task demand of user b can be 5).
  • the picking tasks in the combination determine the coincidence rate of items and storage locations between tasks in the combination; from multiple combinations, select the item and storage location between tasks with the highest coincidence rate The combination of, as the target combination; merge the picking tasks in the target combination to obtain target task 2, and assign target task 2 to user b.
  • determining the coincidence rate of items and storage positions between the tasks in the combination includes:
  • the quantity of the first storage place and the quantity of the first item are respectively determined
  • the sum of the number of storage positions to be picked included in each picking task in the combination is used as the third quantity.
  • determining the quantity of the first storage place and the quantity of the first item includes:
  • the quantity of the same storage position is determined as the quantity of the first storage position
  • the quantity of the same item is determined as the quantity of the first item.
  • the item and storage location coincidence rate between tasks in the combination is determined, so that the number of items with the highest coincidence rate of the storage location is determined.
  • Picking tasks are merged, and one user completes the combined target task at one time, which further reduces the time it takes for the user to complete several picking tasks, further shortens the distance users need to travel, and further improves the efficiency of picking.
  • the picking tasks in the target combination are combined to obtain the target tasks, including:
  • the path, as well as the number of items to be picked in each key storage location and the number of items picked from each key storage location in the set of key storage locations are taken as the target task.
  • All picking tasks in the target combination include: picking task 1, picking task 2, and picking task 3.
  • Picking task 1 includes: items to be picked a, storage location to be picked 1, storage location to be picked 2, the quantity of items to be picked a picked from storage location 1 to be picked is 1, and storage location to be picked 2 is picked The number of items a to be picked is 2.
  • Picking task 2 includes: item b to be picked, storage location to be picked 1, and the quantity of item b picked from storage location 1 to be picked is 3; item a to be picked, storage location to be picked 2, from storage location to be picked The number of items a to be picked in position 2 is 4.
  • Picking task 3 includes: item a to be picked, storage location to be picked 2, storage location to be picked 3, quantity of item a to be picked from storage location 2 to be picked is 5, and storage location to be picked 3 The number of items a to be picked is 6.
  • De-duplication processing is performed on the storage positions to be picked included in picking task 1, the storage positions to be picked included in picking task 2 and the storage positions to be picked included in picking task 3 to obtain a set of key storage positions.
  • the set of key storage positions includes: To-be-sorted storage position 1, to-be-sorted storage position 2 and to-be-sorted storage position 3.
  • the order of the storage positions from front to back is: storage position to be picked 1, storage position to be picked 2 and storage position to be picked 3. Therefore, the path includes: storage position 1 to be picked, storage position 2 to be picked, and storage position 3 to be picked.
  • the items to be picked in the storage space 1 to be picked include: item a to be picked and item b to be picked. Picked from storage location 1 to be picked, the quantity of item a to be picked is 1, and the quantity of item b to be picked is 3.
  • the items to be picked in the storage position 3 to be picked include: items a to be picked. Picked from storage position 3 to be picked, the number of items a to be picked is 6.
  • the number of items to be picked is combined, which further reduces the time it takes for the user to complete several picking tasks. It further shortens the distance users need to travel, and further improves the efficiency of picking.
  • generating a path according to the key storage location set includes:
  • the key storage location set The sequence of each key storage location
  • the path is generated according to the arrangement order of each key storage position.
  • this key storage location can be arranged in another The previous key storage position can also be arranged after another key storage position.
  • the initial picking location is generally set to the warehouse entrance or warehouse exit. In this way, the user needs to travel a shorter distance, which improves the efficiency of picking.
  • the method for obtaining the first quantity of picking tasks includes:
  • the picking tasks belonging to the same packing operation performer, the same review operation performer, or the same sorting operation performer are selected as the first number of picking tasks.
  • each picking task has a unique packaging operation executor (the executor can be a packing table), a review operation executor (the executor can be a reviewer), and a sorting operation executor (the executor) Can be sorting personnel).
  • the executor can be a packing table
  • a review operation executor the executor can be a reviewer
  • a sorting operation executor the executor
  • the first 50 picking tasks there are 100 picking tasks, of which the first 50 picking tasks belong to the first party of the review operation, and the first 50 picking tasks are regarded as the first number of picking tasks, according to the figure
  • the embodiment shown in 3 is continuously allocated to each user until the first 50 picking tasks are allocated.
  • the last 50 picking tasks belong to the second party of the review operation, and the last 50 picking tasks are also regarded as the first number of picking tasks, and are continuously distributed to each user according to the embodiment shown in Figure 3, until the last 50 picks
  • the task is assigned.
  • the first party that belongs to the review operation and the second party that belongs to the review operation are different parties.
  • picking tasks belonging to the same packing operation performer, the same review operation performer, or the same sorting operation performer are selected as the first number of picking tasks. This shortens the distance the user walks, and further improves the efficiency of picking.
  • the picking task carries the task type
  • the methods for obtaining the first quantity of picking tasks include:
  • the picking tasks with the same task type are selected as the first number of picking tasks.
  • special picking tasks and ordinary picking tasks are generally allocated separately. Special picking tasks can be combined, ordinary picking tasks can be combined, and special picking tasks and ordinary picking tasks cannot be combined. The reason for this is that if the special picking task and the ordinary picking task are combined, the items to be picked included in the special picking task may be damaged during picking.
  • Special task 01 supports the same type combination, and also supports cross-type combination
  • Special task 03 supports the same type combination, and also supports cross-type combination
  • Special task 04 supports the same type combination, and also supports cross-type combination
  • Special task 05 supports the same type combination, but does not support cross-type combination.
  • special task 01, special task 03, and special task 04 are selected as the first number of picking tasks.
  • Normal task 02 can be directly assigned to users because it does not support combination.
  • Special task 05 can be combined with support of the same type, and does not support cross-type combination tasks, constituting the first number of picking tasks.
  • tasks that include beautifully packaged items to be picked are special tasks
  • tasks that include packing common items to be picked are ordinary tasks.
  • the second number is the same as the task demand of the user.
  • the user's task demand needs to refer to the number of picking containers and the total number of users. When there are fewer picking containers, the user's task demand is higher; when there are more picking containers, the user's task demand is less. When the total number of users is large, the task demand of each user is less; when the total number of users is small, the task demand of each user is more. In this way, the balance of task distribution is ensured.
  • the prerequisite for the second quantity to be the same as the user's demand is that the total number of tasks is sufficient. If the total number of tasks is not large, the second number should be reduced. In this way, the balance of task distribution is ensured.
  • the number of tasks allocated to the user is the same as the user's task demand, which improves the user's experience.
  • another embodiment of the present disclosure provides a method for determining tasks.
  • the first number of picking tasks include picking task 1, picking task 3, and picking task 5. From picking task 1, picking task 3, and picking task 5, randomly take 2 picking tasks as a combination to obtain combination 1, combination 2 and combination 3.
  • Combination 1 includes: picking task 1 and picking task 3;
  • Combination 2 includes: picking task 3 and picking task 5;
  • Combination 3 includes: picking task 1 and picking task 5.
  • the picking task 1 includes the items to be picked (the picking task 1 includes 5 types of items to be picked) and the storage positions of the items to be picked are as follows:
  • Item A 001 storage space, 002 storage space
  • Item B 003 storage space, 004 storage space
  • Item C 005 storage space, 006 storage space
  • Item D 007 storage space, 008 storage space
  • Picking task 3 includes the items to be picked (picking task 3 includes 3 types of items to be picked) and the storage positions of the items to be picked are as follows:
  • Item C 002 storage position, 003 storage position, 004 storage position;
  • Item D 005 storage position, 006 storage position, 007 storage position;
  • G items 013 storage, 014 storage, 015 storage, 016 storage.
  • Picking task 5 includes the items to be picked (picking task 5 includes 3 types of items to be picked) and the storage positions of the items to be picked are as follows:
  • H items 021 storage space, 022 storage space;
  • Both picking task 1 and picking task 3 in combination 1 include: 002 storage position, 003 storage position, 004 storage position, 005 storage position, 006 storage position and 007 storage position. Therefore, the number of the first storage positions of Combination 1 is 6. According to the picking task 1 in the combination 1, the item picked from the 007 storage slot is the D item, and the item picked from the 007 storage slot according to the picking task 3 in the combination 1 is also the D item. But according to each picking task in combination 1, the items picked from the other first storage positions are different. Therefore, the number of the first item of the combination 1 is one.
  • Both picking task 3 and picking task 5 in combination 2 include: 002 storage space. Therefore, the number of the first storage position of Combination 2 is one. According to the picking task 3 in the combination 2, the item picked from the 002 storage position is the C item, and the item picked from the 002 storage location according to the picking task 5 in the combination 2 is also the C item. Therefore, the number of the first item of combination 2 is one.
  • Both picking task 1 and picking task 5 in combination 3 include: 001 storage position, 002 storage position, 009 storage position and 010 storage position. Therefore, the number of the first storage positions of the combination 3 is 4.
  • the items picked from the 001 storage location according to the picking task 1 in the combination 3 are different from the items picked from the 001 storage location according to the picking task 5 in the combination 3, and the 002 storage location according to the picking task 1 in the combination 3
  • the picked items are different from the items picked from the 002 storage location according to the picking task 5 in combination 3.
  • the items picked from the 009 storage location according to the picking task 1 in combination 3 and the picking task in combination 3 5 The items picked from the 009 storage position are different, and the items picked from the 010 storage position according to the picking task 1 in the combination 3 are different from the items picked from the 010 storage position according to the picking task 5 in the combination 3. Therefore, the number of the first item of combination 3 is zero.
  • the coincidence rate of items and storage locations between tasks in Combination 1 is 0.35
  • the coincidence rate of items and storage locations between tasks in Combination 2 is 0.11
  • the coincidence rate of objects and storage locations between tasks in Combination 3 is 0.22. Therefore, the coincidence rate of items and storage positions between tasks in Combination 1 is the highest.
  • the picking task 1 and the picking task 3 in the combination 1 are merged to obtain the target task, and the target task is assigned to the user 1.
  • the storage positions to be picked included in the picking task 1, the storage positions to be picked included in the picking task 3, and the storage positions to be picked included in the picking task 5 are all located in the storage area 1.
  • the order of the storage positions to be picked included in picking task 1 001 storage position, 002 storage position, 003 storage position, 004 storage position, 005 storage position, 006 storage position, 007 Storage position, 008 storage position, 009 storage position, 010 storage position;
  • the order of the storage positions to be picked included in the pick task 3 002 storage position, 003 storage position, 004 storage position, 005 storage position, 006 storage position, 007 storage Position, 013 storage position, 014 storage position, 015 storage position, 016 storage position; at this time, the starting storage position of picking task 1 is 001 storage position, and the starting storage position of picking task 3 is 002 storage position.
  • the storage positions to be picked included in the picking task 1 and the storage positions to be picked included in the picking task 3 are sorted according to the coding order of the storage positions and the coding order of the lanes.
  • the sorting results are as follows: 001, 002, 003, 004, 005, 006, 007, 008, 009, 010, 013, 014, 015 Bit, 016 storage bit.
  • the sorted result is used as the path of the target task.
  • the starting storage position of the target task is 001 storage position
  • the 002 storage position is used as the intermediate storage position.
  • an embodiment of the present disclosure provides a device for determining a task. As shown in FIG. 8, the device includes:
  • the combination unit 801 is used to arbitrarily combine the first number of picking tasks to obtain multiple combinations; wherein, the number of picking tasks in each combination is a second number, and the first number is greater than the second number. quantity.
  • the processing unit 802 is configured to, for each combination, determine the coincidence rate of items and storage positions between tasks in the combination according to the picking tasks in the combination.
  • the selection unit 803 is configured to select the combination with the highest coincidence rate of the items and storage positions among the tasks from a plurality of combinations, as the target combination.
  • the merging unit 804 is used to merge the picking tasks in the target combination to obtain the target task.
  • the processing unit 802 is configured to:
  • the quantity of the first storage place and the quantity of the first item are respectively determined
  • the sum of the number of storage positions to be picked included in each picking task in the combination is used as the third quantity.
  • the processing unit 802 is configured to:
  • the quantity of the same storage position is determined as the quantity of the first storage position
  • the quantity of the same item is determined as the quantity of the first item.
  • the merging unit 804 is configured to:
  • the items to be picked and the number of items to be picked and the storage positions of the items to be picked are determined respectively to determine the items to be picked and the slaves of each key storage location in the set of key storage locations.
  • the path, as well as the number of items to be picked in each key storage location and the number of items picked from each key storage location in the set of key storage locations are taken as the target task.
  • the merging unit 804 is configured to:
  • the key storage location set The sequence of each key storage location
  • the path is generated according to the arrangement order of each key storage position.
  • the combining unit 801 is used to:
  • the picking tasks belonging to the same packing operation performer, the same review operation performer, or the same sorting operation performer are selected as the first number of picking tasks.
  • the picking task carries the task type
  • the combination unit 801 is used for:
  • the picking tasks with the same task type are selected as the first number of picking tasks.
  • the second number is the same as the task demand of the user.
  • FIG. 9 shows an exemplary system architecture 900 in which a method for determining a task or an apparatus for determining a task according to an embodiment of the present disclosure can be applied.
  • the system architecture 900 may include terminal devices 901, 902, and 903, a network 904, and a server 905.
  • the network 904 is used to provide a medium for communication links between the terminal devices 901, 902, and 903 and the server 905.
  • the network 904 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 901, 902, and 903 to interact with the server 905 via the network 904 to receive or send messages and so on.
  • Various communication client applications may be installed on the terminal devices 901, 902, 903, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only examples).
  • the terminal devices 901, 902, and 903 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 905 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 901, 902, and 903.
  • 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 method for determining the task provided by the embodiment of the present disclosure is generally executed by the server 905, and accordingly, the device for determining the task is generally set in the server 905.
  • terminal devices, networks, and servers in FIG. 9 are merely illustrative. There can be any number of terminal devices, networks, and servers according to implementation needs.
  • FIG. 10 shows a schematic structural diagram of a computer system 1000 suitable for implementing a terminal device of an embodiment of the present disclosure.
  • the terminal device shown in FIG. 10 is only an example, and should not bring any limitation to the function and scope of use of the embodiments of the present disclosure.
  • the computer system 1000 includes a central processing unit (CPU) 1001, which can be based on a program stored in a read only memory (ROM) 1002 or a program loaded from a storage part 1008 into a random access memory (RAM) 1003 And perform various appropriate actions and processing.
  • the RAM 1003 also stores various programs and data required for the operation of the system 1000.
  • the CPU 1001, the ROM 1002, and the RAM 1003 are connected to each other through a bus 1004.
  • An input/output (I/O) interface 1005 is also connected to the bus 1004.
  • the following components are connected to the I/O interface 1005: an input part 1006 including a keyboard, a mouse, etc.; an output part 1007 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and speakers, etc.; a storage part 1008 including a hard disk, etc. ; And a communication part 1009 including a network interface card such as a LAN card, a modem, and the like.
  • the communication section 1009 performs communication processing via a network such as the Internet.
  • the driver 1010 is also connected to the I/O interface 1005 as needed.
  • a removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 1010 as needed, so that the computer program read therefrom is installed into the storage portion 1008 as needed.
  • the process described above with reference to the flowchart can be implemented as a computer software program.
  • the embodiments disclosed in the present disclosure 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 1009, and/or installed from the removable medium 1011.
  • the central processing unit (CPU) 1001 the above-mentioned functions defined in the system of the present disclosure are executed.
  • the computer-readable medium shown in the present disclosure 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 a combination of any 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 removable 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.
  • a 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 unit, program segment, or part of code, and the above-mentioned unit, program segment, or part of code includes one or more for realizing the specified logical 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 one after another can actually be executed substantially in parallel, and 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 function or operation, or can be implemented by It is realized by a combination of dedicated hardware and computer instructions.
  • the units involved in the embodiments described in the present disclosure can be implemented in software or hardware.
  • the described unit may also be provided in the processor.
  • a processor includes a combining unit, a processing unit, a selection unit, and a combining unit.
  • the names of these units do not constitute a limitation on the unit itself under certain circumstances.
  • the processing unit can also be described as "For each combination, determine the combination according to the picking task in the combination.
  • the present disclosure also provides a computer-readable medium.
  • the computer-readable medium may be included in the device described in the above 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: any combination of the first number of picking tasks to obtain multiple combinations; wherein , The number of picking tasks in each combination is the second number, and the first number is greater than the second number; for each combination, according to the picking tasks in the combination, determine the number of tasks in the combination The coincidence rate of items and storage locations between tasks; from multiple combinations, select the combination with the highest coincidence rate of items and storage locations between tasks as the target combination; merge the picking tasks in the target combination to obtain the target task.
  • the first number of picking tasks are arbitrarily combined to obtain multiple combinations; wherein, the number of picking tasks in each combination is the second number, and the first number is greater than the first number.
  • the second quantity for each combination, according to the picking tasks in the combination, determine the coincidence rate of the items and storage positions between the tasks in the combination; select the items and the storage positions between the tasks from the multiple combinations.
  • the combination with the highest storage overlap rate is used as the target combination; the picking tasks in the target combination are combined to obtain the target task.
  • the several picking tasks with the highest coincidence rate of items and storage positions are combined, and a user completes the combined target task at one time, thereby reducing the time it takes for the user to complete several picking tasks and shortening the user’s need to walk. Distance to improve the efficiency of picking.

Landscapes

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

Abstract

一种确定任务的方法和装置，涉及仓储物流技术领域。该方法包括：对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数量，所述第一数量大于所述第二数量（S301）；对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率（S302）；从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合（S303）；对目标组合中的拣货任务进行合并，得到目标任务（S304）。该方法提高了拣货效率。

Description

确定任务的方法和装置
本申请要求2020年1月16日提交的中国专利申请号202010048469.8的优先权，其全部内容通过引用并入本文。
技术领域
本公开涉及仓储物流技术领域，尤其涉及一种确定任务的方法和装置。
背景技术
目前，每个拣货任务相对独立，同一时间点只分配一个拣货任务给一个用户。如图1所示，任务1只分配给用户1，任务3只分配给用户2，任务5只分配给用户3。另外，如图2所示，每个拣货任务包括的路径都是单独的路径，但任务1包括的路径和任务3包括的路径存在重叠。
在实现本公开过程中，发明人发现现有技术中至少存在如下问题：
即使拣货任务包括的待拣物品的种类较少，或者待拣储位的数量较少，也只分配一个拣货任务给一个用户。因而，完成多个拣货任务需消耗的时间较长，拣货效率低。另外，由于多个拣货任务包括的路径可能存在重叠的情况，导致用户完成多个拣货任务需行走的路程较长，更加剧了拣货效率低的问题。
发明内容
有鉴于此，本公开实施例提供一种确定任务的方法和装置，提高了拣货效率。
为实现上述目的，根据本公开实施例的一个方面，提供了一种确定任务的方法。
本公开实施例的确定任务的方法，包括：
对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数量，所述第一数量大于所述第二数量；
对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率；
从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合；
对目标组合中的拣货任务进行合并，得到目标任务。
在一个实施例中，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率，包括：
根据所述组合中的每个拣货任务包括的待拣物品和待拣物品的待拣储位，分别确定第一储位的数量与第一物品的数量；
将所述第一储位的数量与第三数量相除，得到储位重合率；将所述第一物品的数量与所述第三数量相除，得到物品重合率；
将所述储位重合率和所述物品重合率的和作为所述组合中任务之间的物品和储位重合率；
其中，将所述组合中的每个拣货任务包括的待拣储位的数量之和作为所述第三数量。
在一个实施例中，根据所述组合中的每个拣货任务包括的待拣物品和待拣物品的待拣储位，分别确定第一储位的数量与第一物品的数量，包括：
若所述组合中的每个拣货任务均包括同一储位，则将同一储位的数量确定为第一储位的数量；
若按照所述组合中的每个拣货任务从第一储位所拣的物品均相同，则将相同的物品的数量确定为第一物品的数量。
在一个实施例中，对目标组合中的拣货任务进行合并，得到目标任务，包括：
对目标组合中的所有拣货任务包括的待拣储位进行去重处理，得到关键储位集合，根据所述关键储位集合生成路径；
根据目标组合中的所有拣货任务包括的待拣物品、待拣物品的数量和待拣物品的待拣储位，分别确定所述关键储位集合中每个关键储位的待拣物品和从每个关键储位所拣的物品的数量；
将所述路径，以及所述关键储位集合中每个关键储位的待拣物品和从每个关键储位所拣的物品的数量作为目标任务。
在一个实施例中，根据所述关键储位集合生成路径，包括：
按照关键储位与拣货初始位置间的距离从短到长的顺序，或者，按照关键储位与所述拣货初始位置间的距离从长到短的顺序，确定所述关键储位集合中每个关键储位的排列顺序；
根据每个关键储位的排列顺序生成所述路径。
在一个实施例中，获取第一数量的拣货任务的方法，包括：
从多个拣货任务中，选择出属于同一打包操作执行方、同一复核操作执行方或者同一分拣操作执行方的拣货任务，作为第一数量的拣货任务。
在一个实施例中，拣货任务携带任务类型；
获取第一数量的拣货任务的方法，包括：
从多个拣货任务中，选择出所述任务类型相同的拣货任务，作为第一数量的拣货任务。
在一个实施例中，所述第二数量与所述用户的任务需求量相同。
为实现上述目的，根据本公开实施例的另一个方面，提供了一种确定任务的装置。
本公开实施例的确定任务的装置，包括：
组合单元，用于对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数量，所述第一数量大于所述第二数量；
处理单元，用于对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率；
选择单元，用于从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合；
合并单元，用于对目标组合中的拣货任务进行合并，得到目标任务。
为实现上述目的，根据本公开实施例的再一个方面，提供了一种电子设备。
本公开实施例的一种电子设备，包括：一个或多个处理器；存储装置，用于存储一个或多个程序，当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现本公开实施例提供的确定任务的方法。
为实现上述目的，根据本公开实施例的又一个方面，提供了一种计算机可读介质。
本公开实施例的一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现本公开实施例提供的确定任务的方法。
上述公开中的一个实施例具有如下优点或有益效果：对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数量，所述第一数量大于所述第二数量；对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品 和储位重合率；从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合；对目标组合中的拣货任务进行合并，得到目标任务。对物品和储位重合率最高的数个拣货任务进行合并，由一个用户一次性完成合并得到的目标任务，从而减少了用户完成数个拣货任务需消耗的时间，缩短了用户需行走的路程，提高了拣货效率。
上述的非惯用的可选方式所具有的进一步效果将在下文中结合具体实施方式加以说明。
附图说明
附图用于更好地理解本公开，不构成对本公开的不当限定。其中：
图1是现有的确定任务的方法的示例；
图2是现有的确定任务的方法中的路径的示例；
图3是根据本公开一实施例的确定任务的方法的主要流程的示意图；
图4是根据本公开一实施例的确定任务的方法中的任务类型的示例；
图5是根据本公开一实施例的确定任务的方法中的用户的任务需求量的示例；
图6是根据本公开另一实施例的确定任务的方法的示例；
图7是根据本公开另一实施例的确定任务的方法中的路径的示例；
图8是根据本公开实施例的确定任务的装置的主要单元的示意图；
图9是本公开实施例可以应用于其中的示例性系统架构图；
图10是适于用来实现本公开实施例的终端设备或服务器的计算机系统的结构示意图。
具体实施方式
以下结合附图对本公开的示范性实施例做出说明，其中包括本公 开实施例的各种细节以助于理解，应当将它们认为仅仅是示范性的。因此，本领域普通技术人员应当认识到，可以对这里描述的实施例做出各种改变和修改，而不会背离本公开的范围和精神。同样，为了清楚和简明，以下的描述中省略了对公知功能和结构的描述。
需要指出的是，在不冲突的情况下，本公开中的实施例以及实施例中的特征可以互相组合。
为了解决现有技术存在的问题，本公开一实施例提供了一种确定任务的方法，如图3所示，该方法包括：
步骤S301、对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数量，所述第一数量大于所述第二数量。
下面以一具体例子说明该步骤：第一数量的拣货任务包括：拣货任务1、拣货任务2、拣货任务3和拣货任务4。第二数量为3。
从拣货任务1、拣货任务2、拣货任务3和拣货任务4中，任意取3个拣货任务为一个组合，得到组合1、组合2、组合3和组合4。
其中，组合1包括：拣货任务1、拣货任务2和拣货任务3；组合2包括：拣货任务1、拣货任务2和拣货任务4；组合3包括：拣货任务1、拣货任务3和拣货任务4；组合4包括：拣货任务2、拣货任务3和拣货任务4。
步骤S302、对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率。
在该步骤中，具体实施时，一个拣货任务可以根据一个订单生成，也可以根据多个订单生成。拣货任务包括待拣物品、待拣物品的数量 和待拣物品的待拣储位。待拣物品的待拣储位可以根据待拣物品的数量和仓库的库存确定，确定原则包括：现有的先进先出原则或者现有的零散库存清零原则。
另外，该步骤的具体实施方式在下文中进行了详细介绍，在此不再赘述。
步骤S303、从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合。
在该步骤中，具体实施时，对所有组合中任务之间的物品和储位重合率按照从大到小的顺序进行排序，将排在第一位的组合作为目标组合。或者，对所有组合中任务之间的物品和储位重合率按照从小到大的顺序进行排序，将排在最后一位的组合作为目标组合。
步骤S304、对目标组合中的拣货任务进行合并，得到目标任务。
需说明的是，该步骤的具体实施方式在下文中进行了详细介绍，在此不再赘述。
下面以一具体例子说明，分配第一数量的拣货任务的过程：
第一数量的拣货任务包括4个不同的拣货任务。用户a的任务需求量为3。对4个不同的拣货任务进行任意组合，得到4个组合；每个组合中的拣货任务的数量为3。对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率；从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合；对目标组合中的拣货任务进行合并，得到目标任务1，将目标任务1分配给用户a。由于目标组合中的拣货任务的数量为3，因而，将目标任务1分配给用户a后，只剩下一个拣货任务，将这一个拣货任务分配给其他用户。
应理解的是，若第一数量较大，将目标任务1分配给用户a后，还剩下10个拣货任务，则对10个拣货任务进行任意组合，得到多个组合；每个组合中的拣货任务的数量为用户b的任务需求量(用户b的任务需求量可以为5)。对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率；从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合；对目标组合中的拣货任务进行合并，得到目标任务2，将目标任务2分配给用户b。
按照上述过程不断分配任务，直到把第一数量的拣货任务分配完。
在本公开实施例中，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率，包括：
根据所述组合中的每个拣货任务包括的待拣物品和待拣物品的待拣储位，分别确定第一储位的数量与第一物品的数量；
将所述第一储位的数量与第三数量相除，得到储位重合率；将所述第一物品的数量与所述第三数量相除，得到物品重合率；
将所述储位重合率和所述物品重合率的和作为所述组合中任务之间的物品和储位重合率；
其中，将所述组合中的每个拣货任务包括的待拣储位的数量之和作为所述第三数量。
在该实施例中，下面以一具体例子说明得到所述组合中任务之间的物品和储位重合率的过程：第一储位的数量为5，第一物品的数量为6，第三数量为20，所述组合中任务之间的物品和储位重合率＝5/20+6/20＝0.55。
下面以另一具体例子说明得到所述组合中任务之间的物品和储位重合率的过程：第一储位的数量为5，第一物品的数量为6，第三数量 为20，所述组合中任务之间的物品和储位重合率＝((5+6)×100％)/20＝55％。
在该实施例中，通过组合中的每个拣货任务包括的待拣物品和待拣物品的待拣储位，确定所述组合中任务之间的物品和储位重合率，从而对物品和储位重合率最高的数个拣货任务进行合并，由一个用户一次性完成合并得到的目标任务，进一步减少了用户完成数个拣货任务需消耗的时间，进一步缩短了用户需行走的路程，进一步提高了拣货效率。
在本公开实施例中，根据所述组合中的每个拣货任务包括的待拣物品和待拣物品的待拣储位，分别确定第一储位的数量与第一物品的数量，包括：
若所述组合中的每个拣货任务均包括同一储位，则将同一储位的数量确定为第一储位的数量；
若按照所述组合中的每个拣货任务从第一储位所拣的物品均相同，则将相同的物品的数量确定为第一物品的数量。
在该实施例中，通过同一储位和从第一储位所拣的相同物品，确定所述组合中任务之间的物品和储位重合率，从而对物品和储位重合率最高的数个拣货任务进行合并，由一个用户一次性完成合并得到的目标任务，进一步减少了用户完成数个拣货任务需消耗的时间，进一步缩短了用户需行走的路程，进一步提高了拣货效率。
在本公开实施例中，对目标组合中的拣货任务进行合并，得到目标任务，包括：
对目标组合中的所有拣货任务包括的待拣储位进行去重处理，得到关键储位集合，根据所述关键储位集合生成路径；
根据目标组合中的所有拣货任务包括的待拣物品、待拣物品的数量和待拣物品的待拣储位，分别确定所述关键储位集合中每个关键储 位的待拣物品和从每个关键储位所拣的物品的数量；
将所述路径，以及所述关键储位集合中每个关键储位的待拣物品和从每个关键储位所拣的物品的数量作为目标任务。
下面以一具体例子说明该实施例：
目标组合中的所有拣货任务包括：拣货任务1、拣货任务2和拣货任务3。
拣货任务1包括：待拣物品a，待拣储位1，待拣储位2，从待拣储位1所拣的待拣物品a的数量为1，从待拣储位2所拣的待拣物品a的数量为2。
拣货任务2包括：待拣物品b，待拣储位1，从待拣储位1所拣的待拣物品b的数量为3；待拣物品a，待拣储位2，从待拣储位2所拣的待拣物品a的数量为4。
拣货任务3包括：待拣物品a，待拣储位2，待拣储位3，从待拣储位2所拣的待拣物品a的数量为5，从待拣储位3所拣的待拣物品a的数量为6。
对拣货任务1包括的待拣储位、拣货任务2包括的待拣储位和拣货任务3包括的待拣储位进行去重处理，得到关键储位集合，关键储位集合包括：待拣储位1、待拣储位2和待拣储位3。储位从前到后的排列顺序为：待拣储位1、待拣储位2和待拣储位3。因而，路径包括：待拣储位1、待拣储位2和待拣储位3。
待拣储位1的待拣物品包括：待拣物品a和待拣物品b。从待拣储位1所拣，待拣物品a的数量为1，待拣物品b的数量为3。
待拣储位2的待拣物品包括：待拣物品a。从待拣储位2所拣，待拣物品a的数量为11(11＝2+4+5)。
待拣储位3的待拣物品包括：待拣物品a。从待拣储位3所拣，待拣物品a的数量为6。
将路径、待拣储位1、待拣储位2和待拣储位3的待拣物品和数量确定为目标任务。
在该实施例中，通过对目标组合中的所有拣货任务包括的待拣储位进行去重处理，待拣物品的数量进行合并，进一步减少了用户完成数个拣货任务需消耗的时间，进一步缩短了用户需行走的路程，进一步提高了拣货效率。
在本公开实施例中，根据所述关键储位集合生成路径，包括：
按照关键储位与拣货初始位置间的距离从短到长的顺序，或者，按照关键储位与所述拣货初始位置间的距离从长到短的顺序，确定所述关键储位集合中每个关键储位的排列顺序；
根据每个关键储位的排列顺序生成所述路径。
在该实施例中，需说明的是，若一个关键储位与拣货初始位置间的距离，等于另一个关键储位与拣货初始位置间的距离，则这个关键储位可以排列在另一个关键储位的前一个，也可以排列在另一个关键储位的后一个。另外，拣货初始位置一般设置为仓库入口或者仓库出口。如此，用户需行走的路程较短，提高了拣货效率。
在本公开实施例中，获取第一数量的拣货任务的方法，包括：
从多个拣货任务中，选择出属于同一打包操作执行方、同一复核操作执行方或者同一分拣操作执行方的拣货任务，作为第一数量的拣货任务。
在该实施例中，每个拣货任务均有唯一所属的打包操作执行方(执行方可以是打包台)、复核操作执行方(执行方可以是复核人员)和分拣操作执行方(执行方可以是分拣人员)。先对拣出的待拣物品和待拣物品的数量进行复核，再依次进行分拣和打包，打包完成后即可出库。
下面以一具体例子说明该实施例：拣货任务有100个，其中，前50个拣货任务属于复核操作执行方一，将前50个拣货任务作为第一数 量的拣货任务，按照图3所示实施例不断分配给各个用户，直到前50个拣货任务分配完。后50个拣货任务属于复核操作执行方二，将后50个拣货任务也作为第一数量的拣货任务，同样按照图3所示实施例不断分配给各个用户，直到后50个拣货任务分配完。其中，属于复核操作执行方一和属于复核操作执行方二是不同的执行方。
在该实施例中，从多个拣货任务中，选择出属于同一打包操作执行方、同一复核操作执行方或者同一分拣操作执行方的拣货任务，作为第一数量的拣货任务。从而缩短了用户行走的路程，进一步提高了拣货效率。
在本公开实施例中，拣货任务携带任务类型；
获取第一数量的拣货任务的方法，包括：
从多个拣货任务中，选择出所述任务类型相同的拣货任务，作为第一数量的拣货任务。
在该实施例中，一般会将特殊拣货任务和普通拣货任务分开分配，特殊拣货任务间可以组合，普通拣货任务间可以组合，特殊拣货任务和普通拣货任务不可以组合。之所以如此，是因为，若将特殊拣货任务和普通拣货任务组合，则在拣货时，可能对特殊拣货任务包括的待拣物品造成损害。
如图4所示，下面以一具体例子进行说明：
特殊任务01支持同类型组合，也支持跨类型组合；
普通任务02不支持同类型组合，也不支持跨类型组合；
特殊任务03支持同类型组合，也支持跨类型组合；
特殊任务04支持同类型组合，也支持跨类型组合；
特殊任务05支持同类型组合，不支持跨类型组合。
因而，从特殊任务01、普通任务02、特殊任务03、特殊任务04 和特殊任务05，选择出特殊任务01、特殊任务03和特殊任务04作为第一数量的拣货任务。普通任务02由于不支持组合，可以直接分配给用户。特殊任务05可以与支持同类型组合，且不支持跨类型组合的任务，构成第一数量的拣货任务。
下面以一具体例子说明特殊任务和普通任务：包括包装精美的待拣物品的任务是特殊任务，包括包装普通的待拣物品的任务是普通任务。
应理解的是，在不影响本公开实施例的情况下，本领域技术人员可以根据拣货任务的自身条件设置任务类型。例如，设置包括海鲜的任务的类型为：支持同类型组合，不支持跨类型组合；设置包括牙膏的任务的类型为：支持同类型组合，也支持跨类型组合。
在该实施例中，从多个拣货任务中，选择出任务类型相同的拣货任务，作为第一数量的拣货任务。从而按照任务类型分别完成不同的拣货任务，减少了对待拣物品的损害程度，提高了拣货质量。
在本公开实施例中，所述第二数量与所述用户的任务需求量相同。
在该实施例中，用户的任务需求量需要参考拣货容器的数量和用户总数。拣货容器较少时，用户的任务需求量较高；拣货容器较多时，用户的任务需求量较少。用户总数较多时，每个用户的任务需求量较少；用户总数较少时，每个用户的任务需求量较多。如此，保证了任务分配的均衡性。
应理解的是，第二数量与用户的需求量相同的前提条件是，任务的总量足够多。若任务的总量不多时，第二数量应有所降低。如此，保证了任务分配的均衡性。
如图5所示，用户的任务需求量为6。需说明的是，用户的任务需求量越大，每个组合中任务之间的物品和储位重合率越低，目标组合中的拣货任务进行合并时能合并的项目越少。因而，用户的任务需求量不宜太大。
在该实施例中，分配给用户的任务数量与用户的任务需求量相同，提高了用户的体验度。
为了解决现有技术存在的问题，本公开另一实施例提供了一种确定任务的方法。
该实施例中，第一数量的拣货任务包括拣货任务1、拣货任务3和拣货任务5。从拣货任务1、拣货任务3和拣货任务5中，任意取2个拣货任务作为一个组合，从而得到组合1、组合2和组合3。
组合1包括：拣货任务1和拣货任务3；
组合2包括：拣货任务3和拣货任务5；
组合3包括：拣货任务1和拣货任务5。
其中，拣货任务1包括的待拣物品(拣货任务1包括5种待拣物品)和待拣物品的待拣储位如下：
A物品，001储位、002储位；
B物品，003储位、004储位；
C物品，005储位、006储位；
D物品，007储位、008储位；
E物品，009储位、010储位。
拣货任务3包括的待拣物品(拣货任务3包括3种待拣物品)和待拣物品的待拣储位如下：
C物品，002储位、003储位、004储位；
D物品，005储位、006储位、007储位；
G物品，013储位、014储位、015储位、016储位。
拣货任务5包括的待拣物品(拣货任务5包括3种待拣物品)和待拣物品的待拣储位如下：
C物品，001储位、002储位、009储位、010储位；
H物品，021储位、022储位；
L物品，023储位、024储位。
组合1中的拣货任务1和拣货任务3均包括：002储位、003储位、004储位、005储位、006储位和007储位。因而，组合1的第一储位的数量为6。按照组合1中的拣货任务1从007储位所拣的物品是D物品，按照组合1中的拣货任务3从007储位所拣的物品也是D物品。但按照组合1中的每个拣货任务从其他第一储位所拣的物品不相同。因而，组合1的第一物品的数量为1。
组合1中的拣货任务1包括的待拣储位的数量是10，组合1中的拣货任务3包括的待拣储位的数量是10。因而组合1的第三数量＝10+10＝20，组合1中任务之间的物品和储位重合率＝(6+1)/20＝0.35。
组合2中的拣货任务3和拣货任务5均包括：002储位。因而，组合2的第一储位的数量为1。按照组合2中的拣货任务3从002储位所拣的物品是C物品，按照组合2中的拣货任务5从002储位所拣的物品也是C物品。因而，组合2的第一物品的数量为1。
组合2中的拣货任务3包括的待拣储位的数量是10，组合2中的拣货任务5包括的待拣储位的数量是8。因而，组合2的第三数量＝10+8＝18，组合2中任务之间的物品和储位重合率＝(1+1)/18＝0.11。
组合3中的拣货任务1和拣货任务5均包括：001储位、002储位、009储位和010储位。因而，组合3的第一储位的数量为4。按照组合 3中的拣货任务1从001储位所拣的物品与按照组合3中的拣货任务5从001储位所拣的物品不同，按照组合3中的拣货任务1从002储位所拣的物品与按照组合3中的拣货任务5从002储位所拣的物品不同，按照组合3中的拣货任务1从009储位所拣的物品与按照组合3中的拣货任务5从009储位所拣的物品不同，按照组合3中的拣货任务1从010储位所拣的物品与按照组合3中的拣货任务5从010储位所拣的物品不同。因而，组合3的第一物品的数量为0。
组合3中的拣货任务1包括的待拣储位的数量是10，组合3中的拣货任务5包括的待拣储位的数量是8。因而，组合3的第三数量＝10+8＝18，组合3中任务之间的物品和储位重合率＝(4+0)/18＝0.22。
组合1中任务之间的物品和储位重合率为0.35，组合2中任务之间的物品和储位重合率为0.11，组合3中任务之间的物品和储位重合率为0.22。因而，组合1中任务之间的物品和储位重合率最高。如图6所示，对组合1中的拣货任务1和拣货任务3进行合并，得到目标任务，将目标任务分配给用户1。将拣货任务5分配给用户3。另外，拣货任务1包括的待拣储位、拣货任务3包括的待拣储位和拣货任务5包括的待拣储位，均位于储区1。
拣货任务1和拣货任务3合并之前，拣货任务1包括的待拣储位的排序：001储位、002储位、003储位、004储位、005储位、006储位、007储位、008储位、009储位、010储位；拣货任务3包括的待拣储位的排序：002储位、003储位、004储位、005储位、006储位、007储位、013储位、014储位、015储位、016储位；此时，拣货任务1的起始储位是001储位，拣货任务3的起始储位是002储位。
如图7所示，对拣货任务1包括的待拣储位和拣货任务3包括的待拣储位，按照储位的编码顺序，并遵循巷道的编码顺序，进行排序，排序结果如下：001储位、002储位、003储位、004储位、005储位、 006储位、007储位、008储位、009储位、010储位、013储位、014储位、015储位、016储位。排序结果作为目标任务的路径。拣货任务1和拣货任务3合并之后，目标任务的起始储位是001储位，002储位作为中间储位。
上文结合图3-7对确定任务的方法进行了说明，下文结合图8对确定任务的装置进行说明。
为了解决现有技术存在的问题，本公开实施例提供了一种确定任务的装置，如图8所示，该装置包括：
组合单元801，用于对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数量，所述第一数量大于所述第二数量。
处理单元802，用于对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率。
选择单元803，用于从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合。
合并单元804，用于对目标组合中的拣货任务进行合并，得到目标任务。
在本公开实施例中，所述处理单元802用于：
根据所述组合中的每个拣货任务包括的待拣物品和待拣物品的待拣储位，分别确定第一储位的数量与第一物品的数量；
将所述第一储位的数量与第三数量相除，得到储位重合率；将所述第一物品的数量与所述第三数量相除，得到物品重合率；
将所述储位重合率和所述物品重合率的和作为所述组合中任务之间的物品和储位重合率；
其中，将所述组合中的每个拣货任务包括的待拣储位的数量之和作为所述第三数量。
在本公开实施例中，所述处理单元802用于：
若所述组合中的每个拣货任务均包括同一储位，则将同一储位的数量确定为第一储位的数量；
若按照所述组合中的每个拣货任务从第一储位所拣的物品均相同，则将相同的物品的数量确定为第一物品的数量。
在本公开实施例中，所述合并单元804用于：
对目标组合中的所有拣货任务包括的待拣储位进行去重处理，得到关键储位集合，根据所述关键储位集合生成路径；
根据目标组合中的所有拣货任务包括的待拣物品、待拣物品的数量和待拣物品的待拣储位，分别确定所述关键储位集合中每个关键储位的待拣物品和从每个关键储位所拣的物品的数量；
将所述路径，以及所述关键储位集合中每个关键储位的待拣物品和从每个关键储位所拣的物品的数量作为目标任务。
在本公开实施例中，所述合并单元804用于：
按照关键储位与拣货初始位置间的距离从短到长的顺序，或者，按照关键储位与所述拣货初始位置间的距离从长到短的顺序，确定所述关键储位集合中每个关键储位的排列顺序；
根据每个关键储位的排列顺序生成所述路径。
在本公开实施例中，所述组合单元801用于：
从多个拣货任务中，选择出属于同一打包操作执行方、同一复核操作执行方或者同一分拣操作执行方的拣货任务，作为第一数量的拣货任务。
在本公开实施例中，拣货任务携带任务类型；
所述组合单元801用于：
从多个拣货任务中，选择出所述任务类型相同的拣货任务，作为第一数量的拣货任务。
在本公开实施例中，所述第二数量与所述用户的任务需求量相同。
应理解的是，本公开实施例提供的确定任务的装置的各部件所执行的功能已经在上述实施例一种确定任务的方法中做了详细的介绍，这里不再赘述。
图9示出了可以应用本公开实施例的确定任务的方法或确定任务的装置的示例性系统架构900。
如图9所示，系统架构900可以包括终端设备901、902、903，网络904和服务器905。网络904用以在终端设备901、902、903和服务器905之间提供通信链路的介质。网络904可以包括各种连接类型，例如有线、无线通信链路或者光纤电缆等等。
用户可以使用终端设备901、902、903通过网络904与服务器905交互，以接收或发送消息等。终端设备901、902、903上可以安装有各种通讯客户端应用，例如购物类应用、网页浏览器应用、搜索类应用、即时通信工具、邮箱客户端、社交平台软件等(仅为示例)。
终端设备901、902、903可以是具有显示屏并且支持网页浏览的各种电子设备，包括但不限于智能手机、平板电脑、膝上型便携计算机和台式计算机等等。
服务器905可以是提供各种服务的服务器，例如对用户利用终端设备901、902、903所浏览的购物类网站提供支持的后台管理服务器(仅为示例)。后台管理服务器可以对接收到的产品信息查询请求等 数据进行分析等处理，并将处理结果(例如目标推送信息、产品信息--仅为示例)反馈给终端设备。
需要说明的是，本公开实施例所提供的确定任务的方法一般由服务器905执行，相应地，确定任务的装置一般设置于服务器905中。
应该理解，图9中的终端设备、网络和服务器的数目仅仅是示意性的。根据实现需要，可以具有任意数目的终端设备、网络和服务器。
下面参考图10，其示出了适于用来实现本公开实施例的终端设备的计算机系统1000的结构示意图。图10示出的终端设备仅仅是一个示例，不应对本公开实施例的功能和使用范围带来任何限制。
如图10所示，计算机系统1000包括中央处理单元(CPU)1001，其可以根据存储在只读存储器(ROM)1002中的程序或者从存储部分1008加载到随机访问存储器(RAM)1003中的程序而执行各种适当的动作和处理。在RAM 1003中，还存储有系统1000操作所需的各种程序和数据。CPU 1001、ROM 1002以及RAM 1003通过总线1004彼此相连。输入/输出(I/O)接口1005也连接至总线1004。
以下部件连接至I/O接口1005：包括键盘、鼠标等的输入部分1006；包括诸如阴极射线管(CRT)、液晶显示器(LCD)等以及扬声器等的输出部分1007；包括硬盘等的存储部分1008；以及包括诸如LAN卡、调制解调器等的网络接口卡的通信部分1009。通信部分1009经由诸如因特网的网络执行通信处理。驱动器1010也根据需要连接至I/O接口1005。可拆卸介质1011，诸如磁盘、光盘、磁光盘、半导体存储器等等，根据需要安装在驱动器1010上，以便于从其上读出的计算机程序根据需要被安装入存储部分1008。
特别地，根据本公开公开的实施例，上文参考流程图描述的过程 可以被实现为计算机软件程序。例如，本公开公开的实施例包括一种计算机程序产品，其包括承载在计算机可读介质上的计算机程序，该计算机程序包含用于执行流程图所示的方法的程序代码。在这样的实施例中，该计算机程序可以通过通信部分1009从网络上被下载和安装，和/或从可拆卸介质1011被安装。在该计算机程序被中央处理单元(CPU)1001执行时，执行本公开的系统中限定的上述功能。
需要说明的是，本公开所示的计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质或者是上述两者的任意组合。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的更具体的例子可以包括但不限于：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本公开中，计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。而在本公开中，计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：无线、电线、光缆、RF等等，或者上述的任意合适的组合。
附图中的流程图和框图，图示了按照本公开各种实施例的系统、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个单元、程序段、或代码 的一部分，上述单元、程序段、或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个接连地表示的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图或流程图中的每个方框、以及框图或流程图中的方框的组合，可以用执行规定的功能或操作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
描述于本公开实施例中所涉及到的单元可以通过软件的方式实现，也可以通过硬件的方式来实现。所描述的单元也可以设置在处理器中，例如，可以描述为：一种处理器包括组合单元、处理单元、选择单元和合并单元。其中，这些单元的名称在某种情况下并不构成对该单元本身的限定，例如，处理单元还可以被描述为“对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率的单元”。
作为另一方面，本公开还提供了一种计算机可读介质，该计算机可读介质可以是上述实施例中描述的设备中所包含的；也可以是单独存在，而未装配入该设备中。上述计算机可读介质承载有一个或者多个程序，当上述一个或者多个程序被一个该设备执行时，使得该设备包括：对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数量，所述第一数量大于所述第二数量；对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率；从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合；对目标组合中的拣货任务进行合并，得到目标任务。
根据本公开实施例的技术方案，对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数 量，所述第一数量大于所述第二数量；对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率；从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合；对目标组合中的拣货任务进行合并，得到目标任务。对物品和储位重合率最高的数个拣货任务进行合并，由一个用户一次性完成合并得到的目标任务，从而减少了用户完成数个拣货任务需消耗的时间，缩短了用户需行走的路程，提高了拣货效率。
上述具体实施方式，并不构成对本公开保护范围的限制。本领域技术人员应该明白的是，取决于设计要求和其他因素，可以发生各种各样的修改、组合、子组合和替代。任何在本公开的精神和原则之内所作的修改、等同替换和改进等，均应包含在本公开保护范围之内。

Claims (11)

  1. 一种确定任务的方法，包括：
    对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数量，所述第一数量大于所述第二数量；
    对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率；
    从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合；
    对目标组合中的拣货任务进行合并，得到目标任务。
  2. 根据权利要求1所述的方法，其中，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率，包括：
    根据所述组合中的每个拣货任务包括的待拣物品和待拣物品的待拣储位，分别确定第一储位的数量与第一物品的数量；
    将所述第一储位的数量与第三数量相除，得到储位重合率；将所述第一物品的数量与所述第三数量相除，得到物品重合率；
    将所述储位重合率和所述物品重合率的和作为所述组合中任务之间的物品和储位重合率；
    其中，将所述组合中的每个拣货任务包括的待拣储位的数量之和作为所述第三数量。
  3. 根据权利要求2所述的方法，其中，根据所述组合中的每个拣货任务包括的待拣物品和待拣物品的待拣储位，分别确定第一储位的数量与第一物品的数量，包括：
    若所述组合中的每个拣货任务均包括同一储位，则将同一储位的数量确定为第一储位的数量；
    若按照所述组合中的每个拣货任务从第一储位所拣的物品均相同，则将相同的物品的数量确定为第一物品的数量。
  4. 根据权利要求3所述的方法，其中，对目标组合中的拣货任务进行合并，得到目标任务，包括：
    对目标组合中的所有拣货任务包括的待拣储位进行去重处理，得到关键储位集合，根据所述关键储位集合生成路径；
    根据目标组合中的所有拣货任务包括的待拣物品、待拣物品的数量和待拣物品的待拣储位，分别确定所述关键储位集合中每个关键储位的待拣物品和从每个关键储位所拣的物品的数量；
    将所述路径，以及所述关键储位集合中每个关键储位的待拣物品和从每个关键储位所拣的物品的数量作为目标任务。
  5. 根据权利要求4所述的方法，其中，根据所述关键储位集合生成路径，包括：
    按照关键储位与拣货初始位置间的距离从短到长的顺序，或者，按照关键储位与所述拣货初始位置间的距离从长到短的顺序，确定所述关键储位集合中每个关键储位的排列顺序；
    根据每个关键储位的排列顺序生成所述路径。
  6. 根据权利要求1所述的方法，其中，获取第一数量的拣货任务的方法，包括：
    从多个拣货任务中，选择出属于同一打包操作执行方、同一复核操作执行方或者同一分拣操作执行方的拣货任务，作为第一数量的拣货任务。
  7. 根据权利要求1所述的方法，其中，拣货任务携带任务类型；
    获取第一数量的拣货任务的方法，包括：
    从多个拣货任务中，选择出所述任务类型相同的拣货任务，作为第一数量的拣货任务。
  8. 根据权利要求1所述的方法，其中，所述第二数量与所述用户 的任务需求量相同。
  9. 一种确定任务的装置，包括：
    组合单元，用于对第一数量的拣货任务进行任意组合，得到多个组合；其中，每个组合中的拣货任务的数量为第二数量，所述第一数量大于所述第二数量；
    处理单元，用于对于每个组合，根据所述组合中的拣货任务，确定所述组合中任务之间的物品和储位重合率；
    选择单元，用于从多个组合中，选择出任务之间的物品和储位重合率最高的组合，作为目标组合；
    合并单元，用于对目标组合中的拣货任务进行合并，得到目标任务。
  10. 一种电子设备，包括：
    一个或多个处理器；
    存储装置，用于存储一个或多个程序，
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如权利要求1-8中任一所述的方法。
  11. 一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现如权利要求1-8中任一所述的方法。
PCT/CN2020/140712 2020-01-16 2020-12-29 确定任务的方法和装置 WO2021143510A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010048469.8 2020-01-16
CN202010048469.8A CN113128821A (zh) 2020-01-16 2020-01-16 确定任务的方法和装置

Publications (1)

Publication Number Publication Date
WO2021143510A1 true WO2021143510A1 (zh) 2021-07-22

Family

ID=76771789

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/140712 WO2021143510A1 (zh) 2020-01-16 2020-12-29 确定任务的方法和装置

Country Status (2)

Country Link
CN (1) CN113128821A (zh)
WO (1) WO2021143510A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115140485A (zh) * 2022-06-30 2022-10-04 上海禹璨信息技术有限公司 分拣方法、装置、设备及存储介质
CN117333059A (zh) * 2023-09-28 2024-01-02 北京工商大学 一种仓拣货路径时间估算方法

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113780647A (zh) * 2021-09-02 2021-12-10 杭州拼便宜网络科技有限公司 取货位置配置方法、装置、设备和存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170336780A1 (en) * 2015-02-12 2017-11-23 Fetch Robolics, Inc., System and Method for Order Fulfillment Using Robots
CN109118137A (zh) * 2018-08-01 2019-01-01 北京极智嘉科技有限公司 一种订单处理方法、装置、服务器及存储介质
CN109242184A (zh) * 2018-09-06 2019-01-18 泉州装备制造研究所 一种基于层次聚类的订单拣货优化方法
CN109583624A (zh) * 2018-10-18 2019-04-05 心怡科技股份有限公司 一种结合相似度算法和遗传算法求取包裹最优组合算法
CN109872107A (zh) * 2019-02-19 2019-06-11 杭州米阳信息技术有限公司 拣货路径优化方法及系统

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
MX2020012508A (es) * 2018-05-21 2021-01-20 Beijing Geekplus Tech Co Ltd Metodo y dispositivo de procesamiento de pedidos, servidor y medio de almacenamiento.

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170336780A1 (en) * 2015-02-12 2017-11-23 Fetch Robolics, Inc., System and Method for Order Fulfillment Using Robots
CN109118137A (zh) * 2018-08-01 2019-01-01 北京极智嘉科技有限公司 一种订单处理方法、装置、服务器及存储介质
CN109242184A (zh) * 2018-09-06 2019-01-18 泉州装备制造研究所 一种基于层次聚类的订单拣货优化方法
CN109583624A (zh) * 2018-10-18 2019-04-05 心怡科技股份有限公司 一种结合相似度算法和遗传算法求取包裹最优组合算法
CN109872107A (zh) * 2019-02-19 2019-06-11 杭州米阳信息技术有限公司 拣货路径优化方法及系统

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
JIN, ZHIHONG ET AL.: "Logistics Engineering and Management: Textbook for Colleges and Universities", MODERN OPTIMIZATION ALGORITHM, 28 February 2017 (2017-02-28), pages 28 - 31, XP009529279, ISBN: 978-7-5632-3446-2 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115140485A (zh) * 2022-06-30 2022-10-04 上海禹璨信息技术有限公司 分拣方法、装置、设备及存储介质
CN115140485B (zh) * 2022-06-30 2023-07-04 上海禹璨信息技术有限公司 分拣方法、装置、设备及存储介质
CN117333059A (zh) * 2023-09-28 2024-01-02 北京工商大学 一种仓拣货路径时间估算方法
CN117333059B (zh) * 2023-09-28 2024-04-30 北京工商大学 一种仓拣货路径时间估算方法

Also Published As

Publication number Publication date
CN113128821A (zh) 2021-07-16

Similar Documents

Publication Publication Date Title
WO2021143510A1 (zh) 确定任务的方法和装置
US10467236B2 (en) Mining association rules in the map-reduce framework
WO2018188476A1 (zh) 一种优化组单的方法和装置
CN111523977B (zh) 波次订单集合的创建方法、装置、计算设备和介质
CN110348771B (zh) 一种对订单进行组单的方法和装置
WO2019047523A1 (zh) 用于分拣货物的方法和装置
CN110826831A (zh) 对仓库的拣选区补货的方法和装置
CN110182530B (zh) 一种仓库管理方法和装置
CN112785215B (zh) 一种生成拣货路径的方法和装置
CN110619002A (zh) 数据处理方法、装置及存储介质
CN111260270A (zh) 提升门店订单处理效率的方法和装置
CN111507651A (zh) 应用于人机混合仓库的订单数据处理方法和装置
CN111950830B (zh) 一种任务分配方法和装置
CN101963969A (zh) Oracle RAC系统中实现负载均衡的方法和数据库服务器
CN113379177A (zh) 一种任务调度系统和方法
CN111461583A (zh) 一种库存盘点方法和装置
CN110834858B (zh) 一种在仓库中存储货物的方法和装置
CN113723893A (zh) 用于处理订单的方法和装置
CN111275509A (zh) 一种物品库存的处理方法和装置
CN113326095A (zh) 一种佣金数据处理方法和装置
CN109902980A (zh) 用于业务处理的方法及装置
CN111260271A (zh) 用于缩短门店订单拣货时长的方法和装置
CN110135772B (zh) 用于生成信息的方法和装置
CN110826948A (zh) 仓库选品方法和装置
CN115099865A (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: 20913997

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20913997

Country of ref document: EP

Kind code of ref document: A1