CN110826883A - Order processing method and device - Google Patents

Order processing method and device Download PDF

Info

Publication number
CN110826883A
CN110826883A CN201911025964.0A CN201911025964A CN110826883A CN 110826883 A CN110826883 A CN 110826883A CN 201911025964 A CN201911025964 A CN 201911025964A CN 110826883 A CN110826883 A CN 110826883A
Authority
CN
China
Prior art keywords
order
shelves
processed
goods
matching
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201911025964.0A
Other languages
Chinese (zh)
Inventor
吴航
李佳骏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Wide-Sighted Robot Technology Co Ltd
Beijing Kuangshi Robot Technology Co Ltd
Original Assignee
Beijing Wide-Sighted Robot Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Wide-Sighted Robot Technology Co Ltd filed Critical Beijing Wide-Sighted Robot Technology Co Ltd
Priority to CN201911025964.0A priority Critical patent/CN110826883A/en
Publication of CN110826883A publication Critical patent/CN110826883A/en
Pending legal-status Critical Current

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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • 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

Landscapes

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

Abstract

The invention provides an order processing method and device. The order processing method comprises the following steps: receiving a plurality of to-be-processed orders, wherein each to-be-processed order comprises a required goods type and the quantity of the required goods type; acquiring the types of currently picked goods which are transported to all shelves of a plurality of stations to be selected and the quantity of each type of currently picked goods; according to a preset constraint relationship, determining a matching site corresponding to each order to be processed in a plurality of orders to be processed so as to minimize the total times of carrying the goods shelves, wherein the constraint relationship comprises the following steps: the number of the visiting shelves of each matching site is less than or equal to a first preset threshold, and the goods of the visiting shelves of each matching site can meet the goods requirements of the distributed orders and the pending orders of the matching site. The order processing method provided by the disclosure enables the matching effect of the order to be processed and the station to be better, reduces the carrying times of the goods shelf and improves the order picking efficiency.

Description

Order processing method and device
Technical Field
The present invention relates generally to the field of warehouse order production technologies, and in particular, to an order processing method and apparatus.
Background
Along with the rapid development of the logistics industry, the efficiency requirement on each production link of the warehouse is higher and higher. However, order picking is an important part in the warehouse production link, and the efficiency of order picking has a great influence on the efficiency of the warehouse order production link. The order picking link is that firstly, sites are allocated to each order to be processed based on the current order site matching method to be processed, such as a K-means clustering algorithm. Next, the shelf containing the items required for each pending order is determined. And finally, the dispatching robot carries the goods shelves containing the goods required by the order to be processed to the station where the order to be processed is located, and workers select the goods contained in the goods shelves and required by the order to be processed at the station.
However, in the current site matching process of the pending orders in the pending order picking process, the orders are matched to the sites with high coupling degree for each pending order matching site based on the coupling degree for picking. If a site matches an order containing a hot good, then a large number of orders containing the hot good will be subsequently distributed to the site, which results in uneven busyness at the sites within the warehouse, thereby making the warehouse order production process inefficient.
Disclosure of Invention
In order to solve the above problems in the prior art, the present invention provides an order processing method and apparatus.
In a first aspect, an embodiment of the present invention provides an order processing method, including: receiving a plurality of orders to be processed, each order to be processed including a desired item type and a quantity of the desired item type; acquiring the types of currently picked goods of all shelves which are transported to a plurality of sites to be selected and the quantity of each type of currently picked goods; according to a preset constraint relationship, determining a matching site corresponding to each order to be processed in a plurality of orders to be processed so as to minimize the total times of carrying the goods shelf, wherein the constraint relationship comprises the following steps: the number of the visiting shelves of each matching site is smaller than or equal to a first preset threshold, and the goods of the visiting shelves of each matching site can meet the goods requirements of the allocated orders and the pending orders of the matching site.
In one example, the constraint relationship further comprises at least one of: each pending order is assigned to a matching site; the sum of the numbers of the orders to be distributed and the distributed orders corresponding to each matched site is less than or equal to a second preset threshold value; and the number of each type of item that each shelf is picked at the different matching sites is less than or equal to the number of items that the shelf can be picked.
In one example, the order processing method further includes: acquiring a processable order threshold value of each site; and determining a plurality of sites which do not reach the respective processable order threshold value currently as a plurality of candidate sites based on the processable order threshold value of each site and the orders being processed by each site.
In one example, the order processing method further includes: matching each pending order to one or more shelves, wherein the one or more shelves are the one or more shelves that have been locked to the matched site for each pending order.
In one example, the plurality of shelves matched for each pending order includes: currently, a first part of shelves and a second part of shelves to be visited which are transported to a matching station corresponding to the order to be processed; judging whether the number of shelves currently carried to the matching station corresponding to the order to be processed exceeds a shelf number threshold value; and if not, carrying the second part of shelves to the matching station corresponding to the order to be processed.
In one example, determining a matching site corresponding to each to-be-processed order in the to-be-processed orders according to a preset constraint relationship so as to minimize the total number of shelf transportation includes: setting the total number of times of carrying the goods shelf as a target function at least; and performing integer linear programming processing through the objective function and the constraint relation, and determining a matching site corresponding to each order to be processed in the plurality of orders to be processed.
In one example, the objective function includes:
minΣsΣfzf，s
the constraint relationship includes:
Figure BDA0002248628920000022
Figure BDA0002248628920000023
Figure BDA0002248628920000031
Figure BDA0002248628920000032
Figure BDA0002248628920000033
wherein x iso，sRepresenting whether the order o to be processed is allocated to the site s for production; capacitysRepresenting the number of orders to be processed o currently reprocessed at most simultaneously by the site s; y isf，s，gRepresenting the number of the items g to be picked in the allocated order to be picked o and the number of the items g to be picked in the unallocated order to be picked o from the shelf f to the station s; q. q.sf，gRepresents the number of items g that the shelf f can currently pick; z is a radical off，sRepresenting the probability of whether the shelf f needs to be transported to the station s, and if the shelf f does not need to be transported to the station s, zf，sWhen the pallet f needs to be transported to the station s, z is 0f，s1 is ═ 1; m represents the sum of the number of items on all shelves; l represents the upper limit of the number of shelves f which can be processed by the station s at the same time; u represents a constant, U ═ number of stations ═ number of types of goods ═ number of shelves;
Figure BDA0002248628920000034
and represents arbitrary.
In a second aspect, an embodiment of the present invention provides an order processing apparatus, including: the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a plurality of orders to be processed, and each order to be processed comprises a required goods type and the number of the required goods type; the system comprises an acquisition unit, a sorting unit and a sorting unit, wherein the acquisition unit is used for acquiring the types of currently-sorted goods of all shelves which are transported to a plurality of stations to be sorted and the quantity of each type of currently-sorted goods; the matching unit is used for determining a matching station corresponding to each to-be-processed order in the to-be-processed orders according to a preset constraint relation so as to minimize the total times of carrying the goods shelves, and the constraint relation comprises the following steps: the number of the visiting shelves of each matching site is smaller than or equal to a first preset threshold, and the goods of the visiting shelves of each matching site can meet the goods requirements of the allocated orders and the pending orders of the matching site.
In a third aspect, an embodiment of the present invention provides a warehouse management system, where the system includes: a plurality of shelves, each shelf for holding goods; a transfer robot for transferring the rack; a station for picking items; and an order processing apparatus configured to execute the order processing method according to the first aspect.
In a fourth aspect, an embodiment of the present invention provides an electronic device, where the electronic device includes: a memory to store instructions; and the processor is used for calling the instructions stored in the memory to execute the order processing method in the first aspect.
In a fifth aspect, an embodiment of the present invention provides a computer-readable storage medium, where the computer-readable storage medium stores computer-executable instructions, and when executed by a processor, the computer-executable instructions perform an order processing method according to the first aspect.
According to the order processing method and device provided by the invention, in the matching process of the to-be-processed order and the stations, the matching stations corresponding to the to-be-processed order are determined according to the preset constraint relation based on the goods demand condition of the to-be-processed order and the goods condition available by the to-be-selected stations, so that the total number of shelf carrying is minimum under the condition that the demands of the distributed order and the to-be-processed order are met and the busyness of each station does not exceed the upper limit, the order sorting efficiency is improved, and the order production efficiency of a warehouse is further improved.
Drawings
The above and other objects, features and advantages of embodiments of the present invention will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
FIG. 1 is a schematic diagram illustrating an order processing method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram illustrating another order processing method provided by an embodiment of the invention;
FIG. 3 is a schematic diagram illustrating another order processing method provided by an embodiment of the invention;
FIG. 4 is a schematic diagram of an order processing apparatus according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of another order processing apparatus provided by an embodiment of the invention;
FIG. 6 is a schematic diagram of another order processing apparatus provided by an embodiment of the invention;
fig. 7 is a schematic diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The principles and spirit of the present invention will be described with reference to a number of exemplary embodiments. It is understood that these embodiments are given solely for the purpose of enabling those skilled in the art to better understand and to practice the invention, and are not intended to limit the scope of the invention in any way.
It should be noted that although the expressions "first", "second", etc. are used herein to describe different modules, steps, data, etc. of the embodiments of the present invention, the expressions "first", "second", etc. are merely used to distinguish between different modules, steps, data, etc. and do not indicate a particular order or degree of importance. Indeed, the terms "first," "second," and the like are fully interchangeable.
The order processing method provided by the invention is suitable for order picking in any type of warehouse, and the warehouse comprises the following steps: intelligent robot warehouse, non-intelligent warehouse, etc.
The order processing method provided by the invention is applied to the on-line generation process of the warehouse, namely the order picking process with new orders continuously added, and can dynamically adjust the order picking process so as to better fit the actual production process of the warehouse orders.
In order to solve the above problem, the present disclosure provides an order processing method. Fig. 1 is a schematic diagram of an order processing method according to an embodiment of the disclosure.
As shown in fig. 1, an order processing method 100 provided by the embodiment of the present disclosure includes the following steps.
Step S101, receiving a plurality of orders to be processed, wherein each order to be processed comprises a required goods type and the number of the required goods type.
Step S102, obtaining the types of the currently picked goods which are transported to all the shelves of the plurality of sites to be selected and the quantity of each type of the currently picked goods.
Step S103, determining a matching site corresponding to each order to be processed in the plurality of orders to be processed according to a preset constraint relation so as to minimize the total times of carrying the goods shelves, wherein the constraint relation comprises: the number of the visiting shelves of each matching site is smaller than or equal to a first preset threshold, and the goods of the visiting shelves of each matching site can meet the goods requirements of the allocated orders and the pending orders of the matching site.
It should be noted that, in order to minimize the total number of times of rack transportation, it may be considered to match each to-be-processed order to a to-be-selected station with a high degree of coupling with the to-be-processed order. The coupling degree is the coincidence degree of the types of goods required by the order to be processed and the types of goods required by the order being processed by the station.
Since in practical applications the busyness of the sites needs to be taken into account, the constraint includes that the number of visiting shelves of each matching site is less than or equal to a first preset threshold. Wherein, the first preset threshold refers to the maximum number of shelves that can be processed by one station. The first preset threshold may be a preset value given in advance according to the actual processing capacity of the station. The preset value may be different depending on the station. In the process of determining that each to-be-processed order corresponds to a matching site, the busy degree of each matching site does not exceed the upper limit by restricting the visiting shelf of each matching site to be less than or equal to a first preset threshold value, so that the condition of uneven busy degree among the sites can be avoided, and the overall operation efficiency of the sites in the whole warehousing system can be improved.
According to the constraint conditions, for each matching station corresponding to the order to be processed, the goods of the visiting shelf of the matching station need to meet the goods requirements of the allocated order and the order to be processed of the matching station. It should be noted that the visiting shelves of the matching site include shelves that have arrived at the site, and shelves that have been assigned to the site but have not yet arrived at the site.
According to the order processing method provided by the embodiment of the disclosure, in the matching process of the to-be-processed order and the station, the matching station corresponding to the to-be-processed order is determined according to the preset constraint relation based on the goods demand condition of the to-be-processed order and the goods condition available by the to-be-selected station, so that the total number of shelf carrying times is minimum under the condition of meeting the demands of the distributed order and the to-be-processed order, the order sorting efficiency is improved, and the order production efficiency of the warehouse is further improved.
As a possible embodiment, the constraint relation further comprises at least one of: each pending order is assigned to a matching site; the sum of the numbers of the orders to be distributed and the distributed orders corresponding to each matched site is less than or equal to a second preset threshold value; and the number of each type of item that each shelf is picked at the different matching sites is less than or equal to the number of items that the shelf can be picked.
Based on the constraint, a corresponding matching site can be matched for each pending order. The matching site can minimize the total number of rack transfers in the event that the order requirements are met. Since each station has the corresponding capability of processing orders, the number of orders to be allocated and the allocated orders corresponding to each matching station needs to be within the range of the order processing capability of the matching station. That is, the sum of the numbers of the orders to be distributed and the distributed orders corresponding to each matching site needs to be less than or equal to the second preset threshold. The second preset threshold is: one site can process the maximum number of orders simultaneously. The second preset threshold may be a preset value given in advance according to the actual processing capacity of the station, and the preset value may be different according to different stations.
Accordingly, since each shelf also has a certain capacity to provide items, the sum of the number of each type of item that each shelf is picked at different matching sites should not exceed the upper limit of the number of items that the shelf can pick. That is, the number of each type of item that each shelf is picked at a different matching site needs to be less than or equal to the number of items that the shelf can be picked. The number of items that can be picked per shelf refers to the number of items remaining on the shelf after the items that have been locked or matched are removed.
As a possible embodiment, as shown in fig. 2, the order processing method 100 further includes: step S104, acquiring a processable order threshold value of each site; and determining a plurality of sites which do not reach the respective processable order threshold value currently as a plurality of candidate sites based on the processable order threshold value of each site and the orders being processed by each site.
The processable order threshold is the maximum number of orders that can be processed at a site, and is a preset value which can be preset. For example, the processable order threshold for each warehouse may be set based on actual warehouse considerations. For example, the threshold for which a station can process orders in a warehouse may be set to 10, i.e., a maximum of 10 orders can be processed simultaneously at each station. If the number of orders currently processed by the site is less than 10, the orders to be processed can be continuously processed; if the number of orders processed by the current site at the same time is 10, the site cannot continue to process the orders to be processed currently. Pending orders may continue to be processed until the number of orders currently processed by the site is less than 10.
Therefore, if a certain site has not reached the threshold for processing orders, the site has the ability to continue processing orders, and accordingly, the site also has the possibility of being a candidate site. Therefore, in the application, a plurality of sites which do not reach the respective processable order threshold value currently can be determined according to the processable order threshold value of each site and the orders being processed by each site, and the plurality of sites can be taken as a plurality of candidate sites. The sites which do not reach the threshold value of the processable orders are used as the sites to be selected for matching the orders to be processed, the situation that the number of the orders processed by some sites is too large, so that busyness among the sites is uneven can be further avoided, and the overall operation efficiency of the sites in the warehousing system can be improved.
As a possible embodiment, as shown in fig. 3, the order processing method 100 further includes: step S105, matching each order to be processed to one or more shelves, wherein the one or more shelves are the one or more shelves that have been locked to the matching site of each order to be processed.
By matching each to-be-processed order to one or more shelves of the matching station corresponding to the to-be-processed order, when the shelf corresponding to one to-be-processed order reaches the station, goods required by the to-be-processed order can be picked from the shelf in time, and picking efficiency of the station is improved.
As a possible embodiment, the plurality of shelves matched for each order to be processed comprises: currently, a first part of shelves and a second part of shelves to be visited which are transported to a matching station corresponding to the order to be processed; the order processing method 100 further includes: and carrying the second part of shelves to the matching station corresponding to the order to be processed.
On the premise of meeting the order demand, in order to improve the order picking efficiency, after the matching station is determined, the shelves matched with or corresponding to the to-be-processed orders comprise a first part of shelves which are already transported to the matching station and a second part of shelves which are to be transported to the matching station. By carrying the second part of shelves to the matching point, all the requirements of the order on the required shelves can be met at the matching point, and the order picking efficiency can be further improved.
As a possible embodiment, the transporting the second part of shelves to the matching station corresponding to the pending order includes: judging whether the number of shelves currently carried to the matching station corresponding to the processing order exceeds a shelf threshold value; and if not, carrying the second part of shelves to the matching station corresponding to the order to be processed.
And judging whether the number of the shelves which are currently transported to the matching station exceeds the shelf threshold value of the matching station. If yes, stopping conveying the second part of goods shelves to the matching station; and if not, carrying the second part of shelves to the matching station. The shelf threshold is preset, and the shelf threshold is the number of shelves that can be processed at each station at the same time.
Since the number of shelves that can be processed simultaneously by the matching site is limited, a threshold value of the number of shelves that can be processed simultaneously by the matching site needs to be set in advance to prevent the sorting efficiency from being affected by the excessive number of shelves transported to the matching site. The shelf threshold for a matching site may be set based on the actual processing shelf capacity of the sites in the warehouse.
It should be noted that the number of all types of items that can be currently picked by the station per shelf may also be limited. The method specifically comprises the following steps: the number of items that can be picked by all sites per shelf needs to be less than or equal to the number of items currently unmatched per shelf. For example, if a shelf includes 20 boxes of water, 10 boxes of bread, the water in the shelf is being processed or the processed order matches 5 boxes of water, 4 boxes of bread. Thus, the current shelf can be site matched with 15 bins of water and 6 bins of bread.
As a variant, it is also possible to further define the goods that can be picked on the shelves that are transported to the station. The method specifically comprises the following steps: all kinds of goods which can be selected currently on all visiting shelves of the station and the number of the goods corresponding to all kinds of goods need to meet the order requirement, so that the order selection efficiency is improved. The order requirements comprise a pending order requirement and a pending order requirement.
For example, a site S1 processes two orders A, B together. Order a requires 2 boxes of water and 3 boxes of bread, and order B requires 1 box of milk and 1 box of bread. Thus, the station S1 requires 2 boxes of water, 4 boxes of bread, and 1 box of milk. If it is carried to two shelves y1 and y2 of the station S1, wherein the shelf y1 can be currently sorted 3 boxes of water and the shelf y2 can be currently sorted 5 boxes of bread and 1 box of milk, the shelf carried to the station S1 provides it with 3 boxes of water, 5 boxes of bread and 1 box of milk. The 2 boxes of water, 4 boxes of bread and 1 box of milk required by site S1 for order a and order B are satisfied. Therefore, the kind of goods and the number of goods that can be picked at the time of the shelf y1 and the shelf y2 that are transported to the station S1 satisfy the order demand.
The number of matched goods in the goods shelf is dynamically adjusted in real time, so that the types of the goods required in the actual production process of the warehouse and the number corresponding to the types of the goods can be met, and order picking can be better completed.
As a possible embodiment, determining a matching station corresponding to each to-be-processed order in the plurality of to-be-processed orders according to a preset constraint relationship so as to minimize the total number of times of shelf transportation includes: setting the total number of times of carrying the goods shelf as a target function at least; and performing integer linear programming processing through the objective function and the constraint relation, and determining a matching site corresponding to each order to be processed in the plurality of orders to be processed.
By converting the problem of determining the matching station corresponding to each order to be processed into integer linear programming, the coupling degree between the order and the station, the busyness of the station and the total times of carrying the goods shelves can be better coordinated, and the order picking efficiency can be better improved. In addition, in the embodiment, the problem of matching between the order and the site is changed into an integer linear programming problem, and compared with other greedy solutions, the feasible solution can better improve the efficiency of the warehousing system.
As a possible embodiment, the total number of pallet handling is set as a minimum to an objective function, which comprises:
minΣsΣfzf，s
the constraint relationship of the objective function includes:
Figure BDA0002248628920000091
Figure BDA0002248628920000092
Figure BDA0002248628920000093
Figure BDA0002248628920000094
Figure BDA0002248628920000095
Figure BDA0002248628920000096
wherein x iso，sRepresenting whether the pending order o is allocated to the site s for production; capacitysRepresenting the number of said orders to process o currently reprocessed at most simultaneously by said station s; y isf，s，gRepresenting the number of items g that the shelf f needs to pick to the station s; q. q.sf，gRepresents the number of items g that the shelf f can currently pick; z is a radical off，sRepresents whether the shelf f needs to be transported to the station s, and if the shelf f does not need to be transported to the station s, zf，sWhen the pallet f needs to be transported to the station s, z is 0f，s1 is ═ 1; m represents the sum of the number of items on all of the shelves; l represents an upper limit (i.e. a first preset threshold) of the number of shelves f that can be processed simultaneously by the station s; u represents a constant, U ═ the number of stations ═ the number of goods types · the number of shelves;and represents arbitrary.
Wherein, capacitysThe number of the items g to be picked from the shelf f to the site s is the sum of the number of the items g in the order allocated by the site s and the number of the items g in the order to be processed matched to the site s.
Through the matching scheme of the order and the station with the least total times of shelf carrying, the coupling degree between the order and the station, the station busyness and the condition of one product with multiple stations (namely, one kind of goods is placed in multiple stations) involved in the actual production flow of the warehousing system are fully considered, and the overall efficiency of the warehousing system is improved.
Based on the same inventive concept as the order processing method described above, the disclosed embodiment provides an order processing apparatus 200.
Fig. 4 is a schematic diagram of an order processing apparatus according to an embodiment of the disclosure. As shown in fig. 4, an order processing apparatus 200 includes: a receiving unit 201, an acquiring unit 202 and a matching unit 203.
The receiving unit 201 is configured to receive a plurality of pending orders, each pending order including a required item type and a number of the required item types.
The obtaining unit 202 is configured to obtain the types of items currently pickable on all shelves that have been transported to each of the multiple candidate sites and the number of each of the types of items currently pickable.
The matching unit 203 is configured to determine, according to a preset constraint relationship, a matching station corresponding to each to-be-processed order in the to-be-processed orders, so as to minimize the total number of times of rack transportation, where the constraint relationship includes: the number of the visiting shelves of each matching site is smaller than or equal to a first preset threshold, and the goods of the visiting shelves of each matching site can meet the goods requirements of the allocated orders and the pending orders of the matching site.
As a possible embodiment, the constraint relation further comprises at least one of: each pending order is assigned to a matching site; the sum of the numbers of the orders to be distributed and the distributed orders corresponding to each matched site is less than or equal to a second preset threshold value; and the number of each type of item that each shelf is picked at the different matching sites is less than or equal to the number of items that the shelf can be picked.
As a possible embodiment, as shown in fig. 5, the order processing apparatus 200 further includes a determination unit 204.
A determining unit 204, configured to obtain a processable order threshold for each station; and determining a plurality of sites which do not reach the respective processable order threshold value currently as a plurality of candidate sites based on the processable order threshold value of each site and the orders being processed by each site.
As a possible embodiment, as shown in fig. 6, the order processing apparatus 200 further includes a processing unit 205.
A processing unit 205 for matching each pending order to one or more shelves, wherein one or more shelves are the one or more shelves that have been locked to the matching site for each pending order.
As a possible embodiment, the plurality of shelves matched for each order to be processed comprises: currently, a first part of shelves and a second part of shelves to be visited which are transported to a matching station corresponding to the order to be processed; the processing unit 205 is further configured to transport the second part of shelves to the matching site corresponding to the pending order.
As a possible embodiment, the transporting the second part of shelves to the matching station corresponding to the pending order includes: judging whether the number of shelves currently carried to the matching station corresponding to the order to be processed exceeds a shelf number threshold value; and if not, carrying the second part of shelves to the matching station corresponding to the order to be processed.
As a possible embodiment, determining a matching station corresponding to each to-be-processed order in the plurality of to-be-processed orders according to a preset constraint relationship so as to minimize the total number of times of shelf transportation includes: setting the total number of times of carrying the goods shelf as a target function at least; and performing integer linear programming processing through the objective function and the constraint relation, and determining a matching site corresponding to each order to be processed in the plurality of orders to be processed.
As a possible embodiment, the total number of pallet handling is set as a minimum to an objective function, which comprises:
minΣs∑fzf，s
the constraint relationship of the objective function includes:
Figure BDA0002248628920000111
Figure BDA0002248628920000112
Figure BDA0002248628920000121
Figure BDA0002248628920000122
Figure BDA0002248628920000123
Figure BDA0002248628920000124
wherein x iso，sRepresenting whether the pending order o is allocated to the site s for production; capacitysRepresenting the number of said orders to process o currently reprocessed at most simultaneously by said station s; y isf，s，gRepresenting the number of items g that the shelf f needs to pick to the station s; q. q.sf，gRepresents the number of items g that the shelf f can currently pick; z is a radical off，sRepresents whether the shelf f needs to be transported to the station s, and if the shelf f does not need to be transported to the station s, zf，sWhen the pallet f needs to be transported to the station s, z is 0f，s1 is ═ 1; m represents the sum of the number of items on all of the shelves; l represents an upper limit of the number of shelves f that can be processed simultaneously by the station s; u represents a constant, U ═ the number of stations ═ the number of goods types · the number of shelves;
Figure BDA0002248628920000125
and represents arbitrary.
The functions implemented by the modules in the apparatus correspond to the steps in the method described above, and for concrete implementation and technical effects, please refer to the description of the method steps above, which is not described herein again.
Based on the same inventive concept as the order processing method 100, the embodiment of the present disclosure provides a warehouse management system, wherein the system includes: a plurality of shelves, a transfer robot, a station, and an order processing device.
Wherein each shelf of the plurality of shelves is for placing an item; a transfer robot for transferring the rack; a station for picking items; the order processing apparatus is configured to execute the order processing method 100 according to the first aspect and the corresponding embodiments of the present disclosure.
As shown in fig. 7, one embodiment of the present invention provides an electronic device 40. The electronic device 40 includes a memory 410 and a processor 420. Optionally, the electronic device may further include an Input/Output (I/O) interface 430. Memory 410, for storing instructions. And a processor 420 for calling the instructions stored in the memory 410 to execute the method for order processing according to the embodiment of the present invention. The processor 420 is connected to the memory 410 and the I/O interface 430, respectively, for example, via a bus system and/or other type of connection mechanism (not shown). The memory 410 may be used to store programs and data, including a program for an order processing according to an embodiment of the present invention, and the processor 420 executes various functional applications and data processing of the electronic device 40 by executing the program stored in the memory 410.
In the embodiment of the present invention, the processor 420 may be implemented in at least one hardware form of a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), and a Programmable Logic Array (PLA), and the processor 420 may be one or a combination of a Central Processing Unit (CPU) or other Processing units with data Processing capability and/or instruction execution capability.
Memory 410 in embodiments of the present invention may comprise one or more computer program products that may include various forms of computer-readable storage media, such as volatile memory and/or non-volatile memory. The volatile Memory may include, for example, a Random Access Memory (RAM), a cache Memory (cache), and/or the like. The nonvolatile Memory may include, for example, a Read-only Memory (ROM), a Flash Memory (Flash Memory), a Hard Disk Drive (HDD), a Solid-State Drive (SSD), or the like.
In the embodiment of the present invention, the I/O interface 430 may be used to receive input instructions (e.g., numeric or character information, and generate key signal inputs related to user settings and function control of the electronic device 40, etc.), and may also output various information (e.g., images or sounds, etc.) to the outside. The I/O interface 430 may comprise one or more of a physical keyboard, function buttons (e.g., volume control buttons, switch buttons, etc.), a mouse, a joystick, a trackball, a microphone, a speaker, a touch panel, and the like.
In some embodiments, the invention provides a computer-readable storage medium having stored thereon computer-executable instructions that, when executed by a processor, perform any of the methods described above.
Although operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in serial order, or that all illustrated operations be performed, to achieve desirable results. In certain environments, multitasking and parallel processing may be advantageous.
The methods and apparatus of the present invention can be accomplished with standard programming techniques with rule based logic or other logic to accomplish the various method steps. It should also be noted that the words "means" and "module," as used herein and in the claims, is intended to encompass implementations using one or more lines of software code, and/or hardware implementations, and/or equipment for receiving inputs.
Any of the steps, operations, or procedures described herein may be performed or implemented using one or more hardware or software modules, alone or in combination with other devices. In one embodiment, the software modules are implemented using a computer program product comprising a computer readable medium containing computer program code, which is executable by a computer processor for performing any or all of the described steps, operations, or procedures.
The foregoing description of the implementation of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention. The embodiments were chosen and described in order to explain the principles of the invention and its practical application to enable one skilled in the art to utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated.

Claims (11)

1. An order processing method, comprising:
receiving a plurality of orders to be processed, wherein each order to be processed comprises a required goods type and the number of the required goods type;
acquiring the types of currently picked goods of all shelves which are transported to a plurality of sites to be selected and the quantity of each type of currently picked goods;
determining a matching site corresponding to each to-be-processed order in the to-be-processed orders according to a preset constraint relation so as to minimize the total times of carrying the shelf, wherein the constraint relation comprises: the number of the visiting shelves of each matching site is smaller than or equal to a first preset threshold, and the goods of the visiting shelves of each matching site can meet the goods requirements of the allocated orders and the pending orders of the matching site.
2. The method of claim 1, wherein the constraint relationship further comprises at least one of:
each pending order is assigned to a matching site;
the sum of the numbers of the orders to be distributed and the distributed orders corresponding to each matched site is less than or equal to a second preset threshold value; and the number of each type of item that each shelf is picked at the different matching sites is less than or equal to the number of items that the shelf can be picked.
3. The method according to claim 1 or 2, wherein the method further comprises:
acquiring a processable order threshold value of each site;
and determining a plurality of sites which do not reach the respective processable order threshold value currently as a plurality of the candidate sites based on the processable order threshold value of each site and the orders being processed by each site.
4. The method according to claim 1 or 2, wherein the method further comprises:
matching said each pending order to one or more of said shelves, wherein one or more of said shelves are one or more of said shelves that have been locked to the matched site of said each pending order.
5. The method of claim 4, wherein the plurality of shelves matched for the each pending order comprises: currently, a first part of shelves and a second part of shelves to be visited which are transported to a matching station corresponding to the order to be processed;
judging whether the number of shelves currently carried to the matching station corresponding to the order to be processed exceeds a shelf number threshold value;
and if not, carrying the second part of shelves to the matching station corresponding to the order to be processed.
6. The method of any of claims 1 to 5, wherein determining a matching site for each of the plurality of pending orders to minimize a total number of rack transfers according to a preset constraint relationship comprises:
setting the total number of times of carrying the goods shelf as a target function at least;
and performing integer linear programming processing through the objective function and the constraint relation, and determining a matching site corresponding to each order to be processed in the plurality of orders to be processed.
7. The method of claim 6, wherein,
the objective function includes:
min∑s∑fzf，s
the constraint relationship includes:
∑oxo，s＝capacitys，
Figure FDA0002248628910000025
∑sxo，s＝1，
Figure FDA0002248628910000026
Figure FDA0002248628910000023
Figure FDA0002248628910000024
wherein x iso，sRepresenting whether the pending order o is allocated to the site s for production; capacitysRepresenting the number of said orders to process o currently reprocessed at most simultaneously by said station s; y isf，s，gRepresenting the item g to be picked in the allocated said order to be processed o that said shelf f needs to pick to said station sA quantity and a quantity of unassigned items to pick g in the pending order o; q. q.sf，gRepresents the number of items g that the shelf f can currently pick; z is a radical off，sA probability representing whether the shelf f needs to be transported to the station s, and if the shelf f does not need to be transported to the station s, zf，sWhen the pallet f needs to be transported to the station s, z is 0f，s1 is ═ 1; m represents the sum of the number of items on all of the shelves; l represents an upper limit of the number of shelves f that can be processed simultaneously by the station s; u represents a constant, U ═ the number of stations ═ the number of goods types · the number of shelves;
Figure FDA0002248628910000031
and represents arbitrary.
8. An order processing apparatus, wherein said apparatus comprises:
the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a plurality of orders to be processed, and each order to be processed comprises a required goods type and the number of the required goods type;
the system comprises an acquisition unit, a sorting unit and a sorting unit, wherein the acquisition unit is used for acquiring the types of currently-sorted goods of all shelves which are transported to a plurality of stations to be sorted and the quantity of each type of currently-sorted goods;
the matching unit is used for determining a matching station corresponding to each to-be-processed order in the to-be-processed orders according to a preset constraint relation so as to minimize the total times of carrying the goods shelves, and the constraint relation comprises the following steps: the number of the visiting shelves of each matching site is smaller than or equal to a first preset threshold, and the goods of the visiting shelves of each matching site can meet the goods requirements of the allocated orders and the pending orders of the matching site.
9. A warehouse management system, wherein the system comprises:
a plurality of shelves, each shelf for holding goods;
a transfer robot for transferring the rack;
a station for picking items; and the number of the first and second groups,
order processing apparatus for performing the order processing method of any one of claims 1-7.
10. An electronic device, wherein the electronic device comprises:
a memory to store instructions; and
a processor for invoking the memory-stored instructions to perform an order processing method as recited in any one of claims 1-7.
11. A computer-readable storage medium having stored thereon computer-executable instructions which, when executed by a processor, perform an order processing method as recited in any one of claims 1-7.
CN201911025964.0A 2019-10-25 2019-10-25 Order processing method and device Pending CN110826883A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911025964.0A CN110826883A (en) 2019-10-25 2019-10-25 Order processing method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911025964.0A CN110826883A (en) 2019-10-25 2019-10-25 Order processing method and device

Publications (1)

Publication Number Publication Date
CN110826883A true CN110826883A (en) 2020-02-21

Family

ID=69550593

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911025964.0A Pending CN110826883A (en) 2019-10-25 2019-10-25 Order processing method and device

Country Status (1)

Country Link
CN (1) CN110826883A (en)

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111353648A (en) * 2020-03-03 2020-06-30 北京旷视机器人技术有限公司 Goods delivery site determining method and device and electronic equipment
CN111652408A (en) * 2020-04-13 2020-09-11 北京旷视机器人技术有限公司 Order processing method, device, medium, electronic equipment and system in warehouse
CN112184106A (en) * 2020-09-21 2021-01-05 苏州牧星智能科技有限公司 Commodity picking method, device and system for large-batch orders
CN112801599A (en) * 2021-04-01 2021-05-14 牧星机器人(江苏)有限公司 Storage order processing method and device and storage system
CN113496327A (en) * 2020-03-20 2021-10-12 北京旷视机器人技术有限公司 Cargo handling method, device, system, control terminal and computer storage medium
CN113546849A (en) * 2021-07-20 2021-10-26 北京京东振世信息技术有限公司 Order information processing method and device, electronic equipment and computer readable medium
CN113674051A (en) * 2021-07-08 2021-11-19 北京迈格威科技有限公司 Goods delivery method and device, electronic equipment and storage medium
CN113935570A (en) * 2021-08-31 2022-01-14 广州佳帆计算机有限公司 Order processing method, device, equipment and storage medium
CN113998352A (en) * 2021-10-12 2022-02-01 北京迈格威科技有限公司 Sorting scheduling method and device, electronic equipment, storage medium and warehousing system
CN115660380A (en) * 2022-12-08 2023-01-31 无锡凯乐士科技有限公司 Order processing method and device for goods-to-person picking
WO2023124951A1 (en) * 2021-12-31 2023-07-06 深圳市海柔创新科技有限公司 Workbin processing method and apparatus, and device, warehousing system and storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050071220A1 (en) * 2003-09-26 2005-03-31 I2 Technologies Us, Inc. Distributing consumer demand upstream in a supply chain
CN106127417A (en) * 2016-07-12 2016-11-16 国网甘肃省电力公司电力科学研究院 A kind of tiered warehouse facility haulage equipment dispatching method and system
CN106185152A (en) * 2016-08-03 2016-12-07 北京极智嘉科技有限公司 Goods picking method, goods radio frequency and calculating device
EP3111386A1 (en) * 2014-06-27 2017-01-04 Siemens Aktiengesellschaft System and method for calculating a productivity of an industrial system
CN109118137A (en) * 2018-08-01 2019-01-01 北京极智嘉科技有限公司 A kind of order processing method, apparatus, server and storage medium
CN109978423A (en) * 2017-12-28 2019-07-05 北京京东尚科信息技术有限公司 Inventory's dispatching method, device and computer readable storage medium

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050071220A1 (en) * 2003-09-26 2005-03-31 I2 Technologies Us, Inc. Distributing consumer demand upstream in a supply chain
EP3111386A1 (en) * 2014-06-27 2017-01-04 Siemens Aktiengesellschaft System and method for calculating a productivity of an industrial system
CN106127417A (en) * 2016-07-12 2016-11-16 国网甘肃省电力公司电力科学研究院 A kind of tiered warehouse facility haulage equipment dispatching method and system
CN106185152A (en) * 2016-08-03 2016-12-07 北京极智嘉科技有限公司 Goods picking method, goods radio frequency and calculating device
CN109978423A (en) * 2017-12-28 2019-07-05 北京京东尚科信息技术有限公司 Inventory's dispatching method, device and computer readable storage medium
CN109118137A (en) * 2018-08-01 2019-01-01 北京极智嘉科技有限公司 A kind of order processing method, apparatus, server and storage medium

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111353648A (en) * 2020-03-03 2020-06-30 北京旷视机器人技术有限公司 Goods delivery site determining method and device and electronic equipment
CN113496327A (en) * 2020-03-20 2021-10-12 北京旷视机器人技术有限公司 Cargo handling method, device, system, control terminal and computer storage medium
CN111652408A (en) * 2020-04-13 2020-09-11 北京旷视机器人技术有限公司 Order processing method, device, medium, electronic equipment and system in warehouse
CN112184106A (en) * 2020-09-21 2021-01-05 苏州牧星智能科技有限公司 Commodity picking method, device and system for large-batch orders
CN112801599A (en) * 2021-04-01 2021-05-14 牧星机器人(江苏)有限公司 Storage order processing method and device and storage system
CN113674051A (en) * 2021-07-08 2021-11-19 北京迈格威科技有限公司 Goods delivery method and device, electronic equipment and storage medium
CN113546849A (en) * 2021-07-20 2021-10-26 北京京东振世信息技术有限公司 Order information processing method and device, electronic equipment and computer readable medium
CN113935570A (en) * 2021-08-31 2022-01-14 广州佳帆计算机有限公司 Order processing method, device, equipment and storage medium
CN113998352A (en) * 2021-10-12 2022-02-01 北京迈格威科技有限公司 Sorting scheduling method and device, electronic equipment, storage medium and warehousing system
CN113998352B (en) * 2021-10-12 2023-09-12 北京迈格威科技有限公司 Sorting and dispatching method and device, electronic equipment, storage medium and warehousing system
WO2023124951A1 (en) * 2021-12-31 2023-07-06 深圳市海柔创新科技有限公司 Workbin processing method and apparatus, and device, warehousing system and storage medium
CN115660380A (en) * 2022-12-08 2023-01-31 无锡凯乐士科技有限公司 Order processing method and device for goods-to-person picking
CN115660380B (en) * 2022-12-08 2023-08-15 无锡凯乐士科技有限公司 Order processing method and device for picking goods to person

Similar Documents

Publication Publication Date Title
CN110826883A (en) Order processing method and device
JP7072054B2 (en) Methods and equipment for sorting cargo
CN110197350B (en) Article delivery method and device
US11397979B2 (en) Order processing method and device, server, and storage medium
CN109772714A (en) Cargo picking method and device, storage medium, electronic equipment
CN110348771B (en) Method and device for order grouping of orders
CN110182530B (en) Warehouse management method and device
CN113651009B (en) Method, device, electronic equipment and storage medium for checking articles
CN108906637A (en) Logistics method for sorting and terminal device
TW202240488A (en) Order processind method, apparatus, device, system, medium and product
CN115660380B (en) Order processing method and device for picking goods to person
CN111507651A (en) Order data processing method and device applied to man-machine mixed warehouse
CN113393182A (en) Storage method and device for material box and intelligent storage system
CN114148663B (en) Cargo scheduling method, device, equipment, warehousing system and storage medium
CN110766349A (en) Tallying method and device
CN110826953A (en) Method and device for planning warehouse storage equipment
CN110689293B (en) Article delivery processing method and device
CN112150048A (en) Transport control method, transport control device, electronic apparatus, and storage medium
CN113435821A (en) Material warehousing management method and device and storage medium
CN116664053B (en) Commodity inventory management method
CN113177766A (en) Method and device for storing materials and terminal equipment
KR102046948B1 (en) System and method for automatically distrirbuting product
CN115759929A (en) Goods sorting method and device, electronic equipment and readable storage medium
CN115724113A (en) Goods sorting method and device, electronic equipment and readable storage medium
CN115375243A (en) Order distribution method and device, electronic equipment and computer readable medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200221