CN110826752A - Collection list distribution method and device - Google Patents
Collection list distribution method and device Download PDFInfo
- Publication number
- CN110826752A CN110826752A CN201810904292.XA CN201810904292A CN110826752A CN 110826752 A CN110826752 A CN 110826752A CN 201810904292 A CN201810904292 A CN 201810904292A CN 110826752 A CN110826752 A CN 110826752A
- Authority
- CN
- China
- Prior art keywords
- collection
- workstations
- workstation
- available
- cost
- 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
Links
- 238000009826 distribution Methods 0.000 title claims abstract description 90
- 238000000034 method Methods 0.000 title claims abstract description 51
- 230000001419 dependent effect Effects 0.000 claims abstract description 24
- 238000003860 storage Methods 0.000 claims description 50
- 230000002776 aggregation Effects 0.000 claims description 43
- 238000004220 aggregation Methods 0.000 claims description 43
- 230000002596 correlated effect Effects 0.000 claims description 13
- 238000004590 computer program Methods 0.000 claims description 9
- 238000005520 cutting process Methods 0.000 claims description 6
- 238000012552 review Methods 0.000 claims description 5
- 239000000126 substance Substances 0.000 claims 4
- 238000012545 processing Methods 0.000 abstract description 8
- 230000006870 function Effects 0.000 description 44
- 230000007306 turnover Effects 0.000 description 28
- 238000010586 diagram Methods 0.000 description 12
- 230000008569 process Effects 0.000 description 10
- 238000004891 communication Methods 0.000 description 8
- 230000000875 corresponding effect Effects 0.000 description 8
- 239000010410 layer Substances 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 3
- 238000013178 mathematical model Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000002356 single layer Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000036962 time dependent Effects 0.000 description 1
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (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)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
Abstract
The invention discloses a method and a device for distributing a collection list, and relates to the technical field of computers. One embodiment of the method comprises: establishing an allocation model according to the quantity of the warehousing units in the collection sheet of each unbound workstation and the quantity of the warehousing units acceptable by each available workstation; the distribution model comprises an objective function which takes the distribution target information of the collection list as an independent variable and takes the sum of at least one cost item as a dependent variable; the cost items include quantity matching costs determined by how well the number of warehouse units acceptable to each available workstation matches the number of warehouse units in the aggregated sheet to be assigned to that available workstation; solving the distribution model, and determining the distribution target information of the collection sheet when the dependent variable takes the optimal value; and distributing the collection list according to the distribution destination information. The embodiment can determine the work station suitable for processing any collection list through a mathematical programming method, thereby improving the order confluence efficiency.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for distributing a collection list.
Background
With the rapid development of computer technology, the requirements of modern society on logistics distribution are continuously improved, and in order to effectively improve logistics efficiency, more and more service parties adopt an automatic warehouse to produce orders. In an automated warehouse, the picking system outputs the collection sheets and corresponding totes after completing the picking of the items. Then, the collection sheet and the turnover box need to be distributed to a rechecking workstation through an order converging link, and the articles in the turnover box are processed according to the requirements of different orders at the rechecking workstation. In practical application, a conveying line system is generally adopted for order confluence.
In the process of implementing the invention, the inventor finds that the prior art has at least the following problems: firstly, the capacity of the conveying line for accommodating the turnover box is strongly related to the length of the conveying line, and if the conveying line is short, the capacity of the conveying line for accommodating the turnover box is limited; if the transfer chain is longer, its cost is higher, and the space occupies great. Secondly, if a single-layer conveying line is adopted, the space utilization rate is poor; if multiple layers are used, difficulties arise in structural design, system control, and the like. Thirdly, in practical application, the staff need in time handle the turnover case on the transfer chain, otherwise can lead to the turnover case to pile up in a large number. In addition, the strategy of distributing the collection list to the review workstation in the order confluence link is lacked in the prior art.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for allocating collection sheets, which can determine a workstation suitable for processing any collection sheet through a mathematical programming method, thereby improving order merging efficiency.
To achieve the above object, according to one aspect of the present invention, there is provided an aggregation list allocation method.
The collection list distribution method provided by the embodiment of the invention is used for distributing the collection list of the unbound workstations to the available workstations, and comprises the following steps: establishing an allocation model according to the quantity of the warehousing units in the collection sheet of each unbound workstation and the quantity of the warehousing units acceptable by each available workstation; the distribution model comprises an objective function which takes the distribution target information of the collection list as an independent variable and takes the sum of at least one cost item as a dependent variable; the cost items include quantity matching costs determined by how well the number of warehouse units acceptable to each available workstation matches the number of warehouse units in the aggregated sheet to be assigned to that available workstation; solving the distribution model, and determining the distribution target information of the collection sheet when the dependent variable takes the optimal value; and distributing the collection list according to the distribution destination information.
Optionally, the allocation destination information of any aggregate sheet in the objective function includes: an identification of available workstations for the purposes of the aggregate order allocation; the matching degree is as follows: an absolute value of the difference between the number of stockers acceptable to each available workstation and the number of stockers in the aggregated sheet to be assigned to that available workstation; and the optimum value is a minimum value.
Optionally, the method further comprises: before the distribution model is established, receiving a scheduling request sent by any workstation; for each workstation which can accept the warehousing units, judging whether the warehousing units which are not scheduled exist in the bound collection list: if yes, indicating the transportation unit to move the storage unit to the workstation; determining the workstation which can receive the warehousing unit at present as a primary selection workstation; comparing the number of the primary selection workstations with the number of the collection lists of the unbound workstations: if the former is larger than the latter, selecting part of the primary selected workstations as available workstations, wherein the number of the available workstations is not larger than the number of the collection lists of the unbound workstations; if the two are equal, all or part of the primary selection workstations are selected as available workstations; if the former is smaller than the latter, all the primary selected workstations are used as available workstations.
Optionally, the storage units in any collection sheet are stored in a three-dimensional shelf before scheduling; when the number of the available workstations is less than the number of the collection lists of the unbound workstations, the independent variable of the objective function further comprises allocation judgment information of the collection list, and the allocation judgment information is used for representing whether the collection list is allocated or not; the cost item further comprises the superposition cost of the collection sheets, which is determined by the superposition degree of any two collection sheets in the collection sheets to be distributed; wherein the degree of overlap comprises: the number of the storage units in the same lane of the same layer of the three-dimensional goods shelf appears in any two collection lists.
Optionally, when the number of available workstations is less than the number of the collection sheets of unbound workstations, the cost item further includes a collection sheet time cost which is positively correlated to the time length from the current time to the sheet cutting time of each collection sheet to be allocated and negatively correlated to the backlog time length of each collection sheet to be allocated.
Optionally, when the number of available workstations is less than the number of the aggregation sheets of unbound workstations, the cost item further comprises an aggregation sheet priority cost that is inversely related to the preset priority of each aggregation sheet to be allocated.
Optionally, the dependent variable is a sum of a number matching cost, an aggregation list time cost, and an aggregation list priority cost when there is only one available workstation.
Optionally, the workstation is a rechecking workstation, the storage unit is a turnover box, and the transportation unit is a shuttle and a conveying line.
To achieve the above object, according to another aspect of the present invention, there is provided an aggregation sheet distribution apparatus.
The collection sheet distribution device of the embodiment of the invention can be used for distributing the collection sheets of unbound workstations to available workstations, and the device can comprise: the modeling unit is used for establishing an allocation model according to the quantity of the warehousing units in the collection sheet of each unbound workstation and the quantity of the warehousing units acceptable by each available workstation; the distribution model comprises an objective function which takes the distribution target information of the collection list as an independent variable and takes the sum of at least one cost item as a dependent variable; the cost items include quantity matching costs determined by how well the number of warehouse units acceptable to each available workstation matches the number of warehouse units in the aggregated sheet to be assigned to that available workstation; the distribution unit is used for solving the distribution model and determining the distribution target information of the collection list when the dependent variable takes the optimal value; and distributing the collection list according to the distribution destination information.
Optionally, the allocation destination information of any aggregate sheet in the objective function includes: an identification of available workstations for the purposes of the aggregate order allocation; the matching degree is as follows: an absolute value of the difference between the number of stockers acceptable to each available workstation and the number of stockers in the aggregated sheet to be assigned to that available workstation; and the optimum value is a minimum value.
Optionally, the apparatus may further comprise a triggering unit for: before the distribution model is established, receiving a scheduling request sent by any workstation; for each workstation which can accept the warehousing units, judging whether the warehousing units which are not scheduled exist in the bound collection list: if yes, indicating the transportation unit to move the storage unit to the workstation; determining the workstation which can receive the warehousing unit at present as a primary selection workstation; comparing the number of the primary selection workstations with the number of the collection lists of the unbound workstations: if the former is larger than the latter, selecting part of the primary selected workstations as available workstations, wherein the number of the available workstations is not larger than the number of the collection lists of the unbound workstations; if the two are equal, all or part of the primary selection workstations are selected as available workstations; if the former is smaller than the latter, all the primary selected workstations are used as available workstations.
Optionally, the storage units in any collection sheet are stored in a three-dimensional shelf before scheduling; when the number of the available workstations is less than the number of the collection lists of the unbound workstations, the independent variable of the objective function further comprises allocation judgment information of the collection list, and the allocation judgment information is used for representing whether the collection list is allocated or not; the cost item further comprises the superposition cost of the collection sheets, which is determined by the superposition degree of any two collection sheets in the collection sheets to be distributed; wherein the degree of overlap comprises: the number of the storage units in the same lane of the same layer of the three-dimensional goods shelf appears in any two collection lists.
Optionally, when the number of available workstations is less than the number of the collection sheets of unbound workstations, the cost item further includes a collection sheet time cost which is positively correlated to the time length from the current time to the sheet cutting time of each collection sheet to be allocated and negatively correlated to the backlog time length of each collection sheet to be allocated.
Optionally, when the number of available workstations is less than the number of the aggregation sheets of unbound workstations, the cost item further comprises an aggregation sheet priority cost that is inversely related to the preset priority of each aggregation sheet to be allocated.
Optionally, the dependent variable is a sum of a number matching cost, an aggregation list time cost, and an aggregation list priority cost when there is only one available workstation.
Optionally, the workstation is a rechecking workstation, the storage unit is a turnover box, and the transportation unit is a shuttle and a conveying line.
To achieve the above object, according to still another aspect of the present invention, there is provided an electronic apparatus.
An electronic device of the present invention includes: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors realize the collection list allocation method provided by the invention.
To achieve the above object, according to still another aspect of the present invention, there is provided a computer-readable storage medium.
A computer-readable storage medium of the present invention has stored thereon a computer program which, when executed by a processor, implements the aggregation sheet allocation method provided by the present invention.
According to the technical scheme of the invention, one embodiment of the invention has the following advantages or beneficial effects:
firstly, a workstation suitable for processing each collection list is obtained through a mathematical programming method, and therefore order confluence efficiency is improved. Specifically, the distribution model and the objective function thereof are established by comprehensively considering a plurality of factors, and the optimal set list distribution strategy can be obtained by solving the distribution model and the objective function thereof, wherein the factors comprise quantity matching cost, set list coincidence cost, set list time cost and set list priority cost. The quantity matching cost tends to distribute the collection list to the workstations consistent with the supply and demand conditions of the collection list, namely the quantity of the turnover boxes in the collection list to be distributed tends to be closer to the quantity of the turnover boxes acceptable by the target workstation, so that the turnover box delivery efficiency is improved; the collection list overlapping book is inclined to allocate two collection lists with small or non-overlapping storage positions (referring to the storage positions of turnover boxes in the collection lists) (overlapping refers to that turnover boxes of the two collection lists are positioned in the same roadway of the same layer of the stereoscopic shelf) in one allocation task, so that the condition that the operation time of one shuttle vehicle is long to influence the ex-warehouse efficiency is avoided; the cost of the collection list time tends to be distributed to the collection lists which are close to the time of the list interception and/or have long backlog time; the aggregate order priority cost tends to assign the higher priority aggregate orders first. By considering the factors, an allocation model and an objective function are established, and the most suitable workstation can be determined for each collection sheet, so that the warehouse-out efficiency of the turnover box is improved on the premise of meeting the service requirements.
Secondly, aiming at various defects of the existing conveying line system, the order converging system of the shuttle car combined conveying line and the three-dimensional goods shelf for storing the turnover box are designed, and the system can overcome various defects of the existing conveying line system due to the fact that the three-dimensional goods shelf is high in accommodating capacity, high in space utilization rate and high in shuttle car carrying speed and running speed. In addition, the turnover box can be temporarily stored in the three-dimensional shelf when the rechecking tasks are more, and the turnover box can be processed when the rechecking tasks are less, so that the problem of overstocking of the turnover box in the prior art can be solved.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of the main steps of a method for allocating a collection list according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of the components of an aggregate order distribution apparatus according to an embodiment of the present invention;
FIG. 3 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;
fig. 4 is a schematic structural diagram of an electronic device for implementing the method for allocating a collection list in the embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In existing automated warehouses, the picking system may convert orders into a collection sheet through a sheet-combining process and temporarily store items in the collection sheet using totes. Generally, a single collection sheet corresponds to one or more totes. The turnaround box then passes through the conveyor line system to the review station to complete the order merge. Because existing conveyor line systems have many of the aforementioned drawbacks, they need to be retrofitted. In the embodiment of the invention, an order converging system combining a three-dimensional shelf, a shuttle and a conveying line is designed. The turnover box from the sorting system is temporarily stored to the three-dimensional goods shelf, the shuttle cars running in the roadways of the three-dimensional goods shelf move the turnover box to the conveying line of the roadway opening, and the turnover box is conveyed to the rechecking workstation by the conveying line. Like this, but greatly reduced transfer chain structure complexity and laying space promote turnover case warehouse-out efficiency simultaneously. In addition, the invention also designs an aggregate sheet distribution method applied to the order confluence system, so that the most suitable review workstation is selected for processing each aggregate sheet.
The method for allocating the aggregate list according to the embodiment of the present invention will be described in detail below, and it should be noted that the embodiments of the present invention and the technical features of the embodiments may be combined with each other without conflict.
Fig. 1 is a schematic diagram of main steps of a collective list allocation method according to an embodiment of the present invention.
As shown in fig. 1, the method for allocating a collection list according to the embodiment of the present invention may specifically be performed according to the following steps:
step S101: establishing an allocation model according to the quantity of the warehousing units in the collection sheet of each unbound workstation and the quantity of the warehousing units acceptable by each available workstation; the distribution model comprises an objective function which takes the distribution target information of the collection list as an independent variable and takes the sum of at least one cost item as a dependent variable; the cost items include quantity matching costs determined by how well the number of warehouse units acceptable to each available workstation matches the number of warehouse units in the aggregated sheet to be assigned to that available workstation.
In an embodiment of the invention, the aggregate order is generated from one or more orders in the order pool through an order-grouping process. After the picking link, the picking unit corresponds to at least one storage unit temporarily stored in the three-dimensional goods shelf, and all the articles in the collection list are stored in the corresponding storage units. In practice, for an aggregation sheet and a workstation having an assignment relationship, the aggregation sheet may be said to bind the workstation. In the order confluence link, the workstation can be a rechecking workstation, the storage unit can be a turnover box, and the transportation unit for moving the storage unit can be a shuttle car and a conveying line.
In a specific application, the server may initiate the distribution of the collection list under the trigger of a certain event. For example, the server may perform the allocation of the aggregated sheets periodically, or the server may perform the allocation of the aggregated sheets upon receiving a scheduling request from any of the workstations. The scheduling refers to a process of allocating a workstation to a storage unit in a three-dimensional shelf and moving the storage unit to the workstation; a scheduling request is issued by the workstation to the server upon detecting that it has a certain number of free buffer bits. Wherein, the buffer position is the space that supplies the storage unit to queue in front of the workstation. For example, five buffer positions may be provided for each workstation, with each buffer position providing five buffer positions, each buffer position accommodating one stocker unit.
In a specific application scenario, a server generally executes current distribution of a collection sheet after receiving a scheduling request sent by any server. The specific execution steps can be as follows:
1. the server receives a scheduling request sent by any workstation. Specifically, any workstation may send a scheduling request when the free buffer bit is greater than a preset threshold.
2. The server judges whether the warehouse units which are not scheduled exist in the bound collection list aiming at each workstation which can accept the warehouse units: if yes, the transportation unit is instructed to move the storage unit to the workstation. The work station capable of receiving the warehousing units is a work station with an idle buffer position or an idle buffer position; a warehouse unit that has not been scheduled indicates that the warehouse unit has not been assigned to a workstation for scheduling, i.e., has not been taken out of the warehouse.
In practice, all of the warehouse units in an aggregate are assigned to a workstation to ensure order quality. In addition, when any workstation processes the multiple warehouse units in any collection list bound by the workstation, the multiple warehouse units must be in a continuous state and should not be interrupted or separated by the warehouse units in other collection lists, otherwise the order production confusion is easily caused. Therefore, in this step, if there are warehouse units that have not been scheduled in the aggregate sheet bound by a certain workstation, it indicates that all warehouse units in the aggregate sheet bound by the workstation have not been ex-warehouse, and at this time, other aggregate sheets should not be allocated to the workstation, and the warehouse units that have not been scheduled should be ex-warehouse first.
3. After the warehousing units which are not scheduled are delivered, the workstation which can receive the warehousing units at present can be determined as a primary selection workstation. Obviously, the primary workstation still has idle buffer locations or idle buffer locations at this time.
4. Comparing the number of the primary selection workstations with the number of the collection lists of the unbound workstations: if the former is larger than the latter, selecting part of the primary selected workstations as available workstations, wherein the number of the available workstations is not larger than the number of the collection lists of the unbound workstations.
Wherein, the available workstation refers to the workstation which is the distribution purpose of the aggregation list to be distributed. In a specific application, the selection may be determined by comparing the number of the stockers acceptable by the primary selection workstation (i.e. the number of free buffer locations) with the number of the stockers in the aggregate list: if the number of the warehousing units acceptable by the primary selection workstation is more than that of the warehousing units in the aggregation list, selecting the primary selection workstation less than the number of the aggregation list as an available workstation, and executing subsequent allocation tasks; if the number of the warehousing units acceptable by the primary selection workstations is close to the number of the warehousing units in the aggregate list, the primary selection workstations with the number equal to the number of the aggregate list can be selected as available workstations according to the sequence from morning to evening when the scheduling request is sent out (the workstations with the same request time can be in the sequence of workstation identification), and subsequent allocation tasks are executed.
When the number of the primary selection workstations is equal to the number of the collection lists of the unbound workstations, all or part of the primary selection workstations can be selected as available workstations. Specifically, if the number of the warehousing units acceptable by the primary selection workstation is judged to be more than the number of the warehousing units in the aggregate list, part of the primary selection workstation can be selected as an available workstation to execute subsequent allocation tasks; and if the number of the warehousing units acceptable by the primary selection workstation is close to the number of the warehousing units in the aggregate list, all the primary selection workstations can be used as available workstations to execute subsequent allocation tasks.
And when the number of the primary selected workstations is less than the number of the aggregate lists of the unbound workstations, all the primary selected workstations can be used as available workstations to execute subsequent distribution tasks.
Through the above steps, two situations can be created when allocating a collection sheet of unbound workstations. In the first case the number of available workstations is smaller than the number of singlets, in the second case the number of available workstations is equal to the number of singlets. It will be appreciated that in the second case, there may be a one-to-one correspondence of orders to available workstations, i.e., each order is assigned to one available workstation and each available workstation is assigned to one order. The following will be described separately for the above two cases.
When the number of the available workstations is less than the number of the aggregate sheets of the unbound workstations, an allocation model can be established according to the number of the warehouse units in the aggregate sheet of each unbound workstation and the number of the warehouse units acceptable by each available workstation. It is to be understood that the distribution model described above refers to a mathematical model established for obtaining an optimal solution of the distribution judgment information and the distribution destination information of the collective list.
The distribution judgment information of the collection list can represent whether the collection list is distributed in the distribution task. Generally, the allocation determination information may include an identifier of the collection sheet, and a value of the identifier may be 0 or 1, where 0 indicates that the collection sheet is not allocated and 1 indicates that the collection sheet is allocated. The allocation destination information of the aggregate sheet may characterize to which of the available workstations the aggregate sheet is allocated in this allocation task. Generally, the allocation determination information may include an identifier of the aggregate sheet and an identifier of an available workstation, and a value of the value may be 0 or 1, where 0 indicates that the aggregate sheet is not allocated to the available workstation, and 1 indicates that the aggregate sheet is allocated to the available workstation. It can be understood that the specific allocation condition of each collection sheet can be obtained by calculating the allocation judgment information and the allocation destination information of each collection sheet.
As is well known in the art, the assignment model may be comprised of an objective function and at least one constraint. In the embodiment of the present invention, the independent variables of the objective function are the allocation judgment information and the allocation destination information; the dependent variable is the sum of at least one cost term, wherein each cost term represents a measure of a cost-related dimension; the constraint condition can be specifically set according to the service environment.
In practice, the cost items may include quantity matching costs, which are determined by how well the number of warehouse units acceptable to each available workstation matches the number of warehouse units in the aggregated sheet to be assigned to that available workstation. Wherein, the 'quasi-allocation' refers to the allocation of the collection list in any possible path of the allocation model, and is not related to the actual allocation situation. It can be understood that, when the optimal value of the objective function is calculated by using the distribution model, all possible paths need to be traversed and the function value of each path needs to be calculated, so that the optimal value and the independent variable value corresponding to the optimal value are obtained.
The degree of match may be an absolute value of the difference between the number of warehouse units acceptable to each available workstation and the number of warehouse units in the aggregated sheet to be assigned to that available workstation. In a specific application scenario, the quantity matching cost may be the sum of the above matching degrees for each available workstation. It can be understood that the quantity matching cost set as above tends to distribute the collection list to the workstations in accordance with the supply and demand conditions of the collection list, that is, the quantity of the turnover boxes in the collection list to be distributed tends to be closer to the quantity of the turnover boxes acceptable by the destination workstations, so that the turnover efficiency of the turnover boxes is improved.
For the stereoscopic shelf and the shuttle system, if two storage units to be allocated with the collection list are stored in the same tunnel of the same layer, the shuttle needs to occupy a long time in the tunnel, thereby affecting the ex-warehouse efficiency. Therefore, a cost item formed by the superposition of the collection sheets can be added into the objective function, and two collection sheets with the superposition degree of 0 or lower tend to be selected for distribution during calculation. In this way, the cost of coincidence of the collection sheets can be increased in the objective function, which is determined by the degree of coincidence of any two collection sheets in the collection sheets to be distributed, and the degree of coincidence can be: the number of the storage units in the same lane on the same layer of the three-dimensional goods shelf appears in any two collection lists. In specific application, each combination of two collection sheets in the collection sheet to be allocated can be determined, the coincidence degree of the collection sheets in each combination is calculated, and finally the sum of the coincidence degrees is used as the coincidence cost of the collection sheets.
In embodiments of the present invention, a cost term for a time-dependent dimension may be embodied in an objective function. Specifically, for any aggregate order, if the current time is close to the order interception time (namely the time of stopping order production on the same day), the aggregate order needs to be preferentially allocated to avoid being ex-warehouse on the same day; if the backlog time of the collection list is longer, the collection list is also allocated preferentially, so that the collection list is prevented from occupying the storage position for a long time. Therefore, the cost of the collection list time can be increased in the objective function, and the cost is positively correlated with the time length from the current time to the list cutting time of each to-be-distributed collection list and negatively correlated with the backlog time length of each to-be-distributed collection list. In practical application, the difference between the current time and the time of the order interception and the backlog time of each to-be-allocated collection sheet is calculated, and then the difference of each to-be-allocated collection sheet is added to obtain the time cost of the collection sheet.
Since different orders are often pre-set with different priorities, an order priority cost can be added to the objective function that is inversely related to the pre-set priority of each order to be assigned. In practice, the type cost of each to-be-allocated collection sheet (which is inversely related to the priority of the collection sheet) may be first calculated, and then the sum of the type costs may be used as the collection sheet priority cost.
It should be noted that, when the number of available workstations is equal to the number of the aggregation sheets of the unbound workstations, the available workstations are in one-to-one correspondence with the aggregation sheets, that is, each aggregation sheet is truly allocated, so that the time cost, the priority cost, and the coincidence cost of the aggregation sheet do not need to be considered, and only the number of the allocation model matches the cost item.
Through the setting, the distribution model and the objective function can be established by comprehensively considering the number matching cost, the aggregation list coincidence cost, the aggregation list time cost, the aggregation list priority cost and other factors, and a basis is provided for the subsequent calculation of the optimal aggregation list distribution strategy. It is understood that in the embodiment of the present invention, the calculation of the subsequent bill of aggregation allocation policy may be performed in the objective function using one or more of the above four cost terms as dependent variables.
Step S102: solving the distribution model, and determining the distribution target information of the aggregation list when the dependent variable takes the optimal value; and distributing the collection sheet according to the distribution destination information.
In this step, the allocation model established in step S101 may be solved by using mathematical programming solving software such as CPLEX and the like to obtain an optimal solution of allocation judgment information and allocation destination information of the aggregation list, and the warehousing unit ex-warehouse efficiency may be improved by performing aggregation list allocation using the optimal solution. In general, the optimum value may be a maximum value or a minimum value. In the embodiment of the present invention, the optimum value is preferably the minimum value.
It is understood that, besides the cost term, the objective function of the assignment model may also be composed of a score term (for adjusting the corresponding parameter), and the final assignment strategy is determined according to the assignment judgment information and the assignment purpose information corresponding to the maximum value of the sum of the score terms when solving. In addition, although the shuttle car, the stereoscopic shelf and the conveyor line system are taken as examples in the above description of the invention, this does not mean that the usage scenario of the invention is limited to this. In fact, the aggregate sheet distribution method of the present invention can be used in an order converging system composed of a stacker, an Automated Guided Vehicle (AGV), and the like, and the objective function of the distribution model needs to be adjusted accordingly when the aggregate sheet distribution method is used.
The modeling and solving processes of the collective single allocation method according to the embodiment of the present invention will be described below with specific formulas. First, the symbols to appear in the formula are explained:
the currently available workstations are in giIndicating that i is the identification of available workstations, i ∈ {1,2,3 … n }, and n is the total number of available workstations. Aggregate order of unbound workstations in hjAnd j is equal to {1,2,3, … m }, which represents the identification of the collection list, and m is the total number of the collection lists.
With xjThe allocation judgment information indicating the list of sets indicates that the list of sets j is allocated when it is 1, and indicates that the list of sets j is not allocated when it is 0. With yjiAnd the allocation destination information of the collection list represents that the collection list j is to be allocated to the available workstation i when the allocation destination information is 1, and represents that the collection list j is not to be allocated to the available workstation i when the allocation destination information is 0.
With kjsAnd (4) representing the coincidence degree of the set list j and s, wherein s belongs to {1,2,3, … m }, and s is not equal to j. With ljThe difference between the current time of the collection list j and the list interception time and the backlog time is represented by pjRepresenting the type cost of the collection sheet j. At λ1、λ2、λ3Representing model parameters.
This allows the following assignment model to be established:
constrained to: x is the number ofj＝∑iyji，∑jyji≥1
The objective function consists of four cost items, and the number matching cost, the collection list coincidence cost, the collection list time cost and the collection list priority cost are sequentially arranged from left to right. It can be understood that | gi-∑jyjihjI represents the available workstation i and the set to be allocated to the available workstation iThe matching degree of the number of the corresponding storage units of the single sheet. Further, the first constraint indicates the association of the allocation judgment information and the allocation destination information, and the second constraint indicates that at least one singleton can be allocated to any of the available workstations.
Since the objective function is a nonlinear function, the solution can be simplified by using the following method:
setting an intermediate variable tiAnd zjsThe above distribution model is converted into the following mathematical model:
constrained to: x is the number ofj＝∑iyji，∑jyji≥1，ti≥gi-∑jyjihj，ti≥∑jyjihj-gi，zjs≥xj+xs-1，zjs≤xj，zjs≤xs，zjs∈{0,1}
For the request of only one available workstation, no matter whether one or more collection sheets are finally allocated to the available workstation, no matter how much the multiple collection sheets overlap with each other, the currently allocated collection sheet can be delivered after the previous collection sheet is completely delivered, so that the cost of overlapping the collection sheets is not required to be considered, and the objective function dependent variable is the sum of the quantity matching cost, the time cost of the collection sheet and the priority cost of the collection sheet. The corresponding mathematical model is:
constrained to: x is the number ofj＝yj1，∑jyj1≥1，t1≥g1-∑jyj1hj，t1≥∑jyj1hj-g1
Through the modeling and solving processes, the distribution judgment information and the distribution target information corresponding to the minimum value of the objective function can be obtained, so that the optimal set list distribution strategy is realized.
In the technical scheme of the embodiment of the invention, the distribution model and the objective function can be established by comprehensively considering the factors such as quantity matching cost, collection list overlapping cost, collection list time cost, collection list priority cost and the like, and the optimal collection list distribution strategy can be obtained by solving the distribution model and the objective function, so that the circulation box can be rapidly and concurrently delivered out of the warehouse, and the order converging efficiency is improved.
It should be noted that, for the convenience of description, the foregoing method embodiments are described as a series of acts, but those skilled in the art will appreciate that the present invention is not limited by the order of acts described, and that some steps may in fact be performed in other orders or concurrently. Moreover, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no acts or modules are necessarily required to implement the invention.
To facilitate a better implementation of the above-described aspects of embodiments of the present invention, the following also provides relevant means for implementing the above-described aspects.
Referring to fig. 2, an assembly sheet allocating apparatus 200 for allocating an assembly sheet of unbound workstations to available workstations according to an embodiment of the present invention may include a modeling unit 201 and an allocating unit 202.
The modeling unit 201 is configured to establish an allocation model according to the number of warehouse units in the aggregate sheet of each unbound workstation and the number of warehouse units acceptable by each available workstation; the distribution model comprises an objective function which takes the distribution target information of the collection list as an independent variable and takes the sum of at least one cost item as a dependent variable; the cost items include quantity matching costs determined by how well the number of warehouse units acceptable to each available workstation matches the number of warehouse units in the aggregated sheet to be assigned to that available workstation.
The distribution unit 202 may be configured to solve the distribution model, and determine distribution destination information of the collection sheet when the dependent variable takes an optimal value; and distributing the collection list according to the distribution destination information.
In the embodiment of the present invention, the allocation destination information of any aggregation sheet in the objective function includes: an identification of available workstations for the purposes of the aggregate order allocation; the matching degree is as follows: an absolute value of the difference between the number of stockers acceptable to each available workstation and the number of stockers in the aggregated sheet to be assigned to that available workstation; and the optimum value is a minimum value.
As a preferred aspect, the apparatus 200 may further include a trigger unit for: before the distribution model is established, receiving a scheduling request sent by any workstation; for each workstation which can accept the warehousing units, judging whether the warehousing units which are not scheduled exist in the bound collection list: if yes, indicating the transportation unit to move the storage unit to the workstation; determining the workstation which can receive the warehousing unit at present as a primary selection workstation; comparing the number of the primary selection workstations with the number of the collection lists of the unbound workstations: if the former is larger than the latter, selecting part of the primary selected workstations as available workstations, wherein the number of the available workstations is not larger than the number of the collection lists of the unbound workstations; if the two are equal, all or part of the primary selection workstations are selected as available workstations; if the former is smaller than the latter, all the primary selected workstations are used as available workstations.
Preferably, the storage units in any collection list are stored in a three-dimensional shelf before production scheduling; when the number of the available workstations is less than the number of the collection lists of the unbound workstations, the independent variable of the objective function further comprises allocation judgment information of the collection list, and the allocation judgment information is used for representing whether the collection list is allocated or not; the cost item further comprises the superposition cost of the collection sheets, which is determined by the superposition degree of any two collection sheets in the collection sheets to be distributed; wherein the degree of overlap comprises: the number of the storage units in the same lane of the same layer of the three-dimensional goods shelf appears in any two collection lists.
In a specific application, when the number of available workstations is less than the number of the collection lists of unbound workstations, the cost item further includes a collection list time cost, which is positively correlated to the time length from the current time to the order cutting time of each collection list to be allocated and negatively correlated to the backlog time length of each collection list to be allocated.
In practice, when the number of available workstations is less than the number of the collection sheets of unbound workstations, the cost item further includes a collection sheet priority cost that is inversely related to the preset priority of each collection sheet to be allocated.
In an alternative implementation, the dependent variable is the sum of the number matching cost, the aggregation single time cost, and the aggregation single priority cost when there is only one available workstation.
In addition, in the embodiment of the invention, the workstation is a rechecking workstation, the storage unit is a turnover box, and the transportation unit is a shuttle car and a conveying line.
In the technical scheme of the embodiment of the invention, the distribution model and the objective function can be established by comprehensively considering the factors such as quantity matching cost, collection list overlapping cost, collection list time cost, collection list priority cost and the like, and the optimal collection list distribution strategy can be obtained by solving the distribution model and the objective function, so that the circulation box can be rapidly and concurrently delivered out of the warehouse, and the order converging efficiency is improved.
Fig. 3 illustrates an exemplary system architecture 300 to which the aggregation sheet allocation method or the aggregation sheet allocation apparatus according to an embodiment of the present invention may be applied.
As shown in fig. 3, the system architecture 300 may include terminal devices 301, 302, 303, a network 304, a server 305, transportation units 306, 307, 308, and warehousing units 309, 310, 311 (this architecture is merely an example, and the components included in a specific architecture may be adjusted according to specific application cases). The network 304 serves as a medium for providing communication links between the terminal devices 301, 302, 303 and the server 305. The network 304 may include various types of connections, such as wired, wireless communication links, or fiber optic cables, among others, and the connections between the server 305 and the transport units 306, 307, 308 may also be made by various communication means.
The user may use the terminal device 301, 302, 303 to interact with the server 305 via the network 304 to receive or send messages or the like. The terminal devices 301, 302, 303 may have installed thereon various communication client applications, such as a repository management type application, a web browser application, a search type application, an instant messaging tool, a mailbox client, social platform software, etc. (by way of example only). The server 305 may instruct the transport units 306, 307, 308 to transport the warehouse units 309, 310, 311 to a specified location.
The terminal devices 301, 302, 303 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 305 may be a server that provides various services, such as a logistics server (for example only) that provides support for users to utilize logistics information displayed by the terminal devices 301, 302, 303. The logistics server may process the aggregate order allocation result query request sent by the terminal device, and feed back a processing result (for example, an aggregate order allocation result — just an example) to the terminal device.
It should be noted that the collection sheet allocation method provided by the embodiment of the present invention is generally executed by the server 305, and accordingly, the collection sheet allocation apparatus is generally disposed in the server 305.
It should be understood that the number of terminal devices, networks, and servers in fig. 3 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
The invention also provides the electronic equipment. The electronic device of the embodiment of the invention comprises: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors realize the collection list allocation method provided by the invention.
Referring now to FIG. 4, a block diagram of a computer system 400 suitable for use with the electronic device implementing an embodiment of the invention is shown. The electronic device shown in fig. 4 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 4, the computer system 400 includes a Central Processing Unit (CPU)401 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage section 408 into a Random Access Memory (RAM) 403. In the RAM403, various programs and data necessary for the operation of the computer system 400 are also stored. The CPU401, ROM 402, and RAM403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: an input section 406 including a keyboard, a mouse, and the like; an output section 407 including a display device such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 408 including a hard disk and the like; and a communication section 409 including a network interface card such as a LAN card, a modem, or the like. The communication section 409 performs communication processing via a network such as the internet. A driver 410 is also connected to the I/O interface 405 as needed. A removable medium 411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 410 as necessary, so that a computer program read out therefrom is mounted into the storage section 408 as necessary.
In particular, the processes described in the main step diagrams above may be implemented as computer software programs, according to embodiments of the present disclosure. For example, embodiments of the invention include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the main step diagram. In the above-described embodiment, the computer program can be downloaded and installed from a network through the communication section 409, and/or installed from the removable medium 411. The computer program performs the above-described functions defined in the system of the present invention when executed by the central processing unit 401.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present invention may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a modeling unit and an assignment unit. Where the names of these units do not in some cases constitute a limitation on the units themselves, for example, a modeling unit may also be described as a "unit that sends an assignment model to an assignment unit".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by the apparatus, cause the apparatus to perform steps comprising: establishing an allocation model according to the quantity of the warehousing units in the collection sheet of each unbound workstation and the quantity of the warehousing units acceptable by each available workstation; the distribution model comprises an objective function which takes the distribution target information of the collection list as an independent variable and takes the sum of at least one cost item as a dependent variable; the cost items include quantity matching costs determined by how well the number of warehouse units acceptable to each available workstation matches the number of warehouse units in the aggregated sheet to be assigned to that available workstation; solving the distribution model, and determining the distribution target information of the collection sheet when the dependent variable takes the optimal value; and distributing the collection list according to the distribution destination information.
In the technical scheme of the embodiment of the invention, the distribution model and the objective function can be established by comprehensively considering the factors such as quantity matching cost, collection list overlapping cost, collection list time cost, collection list priority cost and the like, and the optimal collection list distribution strategy can be obtained by solving the distribution model and the objective function, so that the circulation box can be rapidly and concurrently delivered out of the warehouse, and the order converging efficiency is improved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (18)
1. An aggregation sheet allocation method for allocating an aggregation sheet of unbound workstations to available workstations, the method comprising:
establishing an allocation model according to the quantity of the warehousing units in the collection sheet of each unbound workstation and the quantity of the warehousing units acceptable by each available workstation; wherein the content of the first and second substances,
the distribution model comprises an objective function which takes the distribution target information of the collection sheet as an independent variable and takes the sum of at least one cost item as a dependent variable; the cost items include quantity matching costs determined by how well the number of warehouse units acceptable to each available workstation matches the number of warehouse units in the aggregated sheet to be assigned to that available workstation;
solving the distribution model, and determining the distribution target information of the collection sheet when the dependent variable takes the optimal value; and distributing the collection list according to the distribution destination information.
2. The method of claim 1,
the distribution destination information of any collection list in the objective function comprises: an identification of available workstations for the purposes of the aggregate order allocation;
the matching degree is as follows: an absolute value of the difference between the number of stockers acceptable to each available workstation and the number of stockers in the aggregated sheet to be assigned to that available workstation; and the optimum value is a minimum value.
3. The method of claim 1, further comprising:
before the distribution model is established, receiving a scheduling request sent by any workstation;
for each workstation which can accept the warehousing units, judging whether the warehousing units which are not scheduled exist in the bound collection list: if yes, indicating the transportation unit to move the storage unit to the workstation;
determining the workstation which can receive the warehousing unit at present as a primary selection workstation; and
comparing the number of the primary selection workstations with the number of the collection lists of the unbound workstations: if the former is larger than the latter, selecting part of the primary selected workstations as available workstations, wherein the number of the available workstations is not larger than the number of the collection lists of the unbound workstations; if the two are equal, all or part of the primary selection workstations are selected as available workstations; if the former is smaller than the latter, all the primary selected workstations are used as available workstations.
4. The method of claim 3, wherein the storage units in any of the collection lists are stored on a shelf prior to scheduling; and the number of the first and second groups,
when the number of the available workstations is less than the number of the collection lists of the unbound workstations, the independent variable of the objective function further comprises allocation judgment information of the collection list, and the allocation judgment information is used for representing whether the collection list is allocated or not; the cost item further comprises the superposition cost of the collection sheets, which is determined by the superposition degree of any two collection sheets in the collection sheets to be distributed; wherein the content of the first and second substances,
the degree of overlap includes: the number of the storage units in the same lane of the same layer of the three-dimensional goods shelf appears in any two collection lists.
5. The method of claim 4, wherein when the number of available workstations is less than the number of the collection sheets of unbound workstations, the cost term further comprises a collection sheet time cost which is positively correlated to the time duration from the current time to the order-cutting time of each of the collection sheets to be allocated and negatively correlated to the backlog time duration of each of the collection sheets to be allocated.
6. The method of claim 5, wherein the cost term further comprises an aggregate order priority cost that is inversely related to a preset priority of each aggregate order to be allocated when the number of available workstations is less than the number of aggregate orders for unbound workstations.
7. The method of claim 6, wherein the dependent variable is a sum of a number matching cost, an aggregation single time cost, and an aggregation single priority cost when there is only one workstation available.
8. The method according to any one of claims 3 to 7, wherein the workstation is a review workstation, the storage unit is a tote, and the transport unit is a shuttle and conveyor line.
9. An assembly sheet assignment device for assigning an assembly sheet of unbound workstations to available workstations, the device comprising:
the modeling unit is used for establishing an allocation model according to the quantity of the warehousing units in the collection sheet of each unbound workstation and the quantity of the warehousing units acceptable by each available workstation; wherein the content of the first and second substances,
the distribution model comprises an objective function which takes the distribution target information of the collection sheet as an independent variable and takes the sum of at least one cost item as a dependent variable; the cost items include quantity matching costs determined by how well the number of warehouse units acceptable to each available workstation matches the number of warehouse units in the aggregated sheet to be assigned to that available workstation;
the distribution unit is used for solving the distribution model and determining the distribution target information of the collection list when the dependent variable takes the optimal value; and distributing the collection list according to the distribution destination information.
10. The apparatus of claim 9,
the distribution destination information of any collection list in the objective function comprises: an identification of available workstations for the purposes of the aggregate order allocation;
the matching degree is as follows: an absolute value of the difference between the number of stockers acceptable to each available workstation and the number of stockers in the aggregated sheet to be assigned to that available workstation; and the optimum value is a minimum value.
11. The apparatus of claim 9, further comprising a triggering unit configured to:
before the distribution model is established, receiving a scheduling request sent by any workstation; for each workstation which can accept the warehousing units, judging whether the warehousing units which are not scheduled exist in the bound collection list: if yes, indicating the transportation unit to move the storage unit to the workstation; determining the workstation which can receive the warehousing unit at present as a primary selection workstation; comparing the number of the primary selection workstations with the number of the collection lists of the unbound workstations: if the former is larger than the latter, selecting part of the primary selected workstations as available workstations, wherein the number of the available workstations is not larger than the number of the collection lists of the unbound workstations; if the two are equal, all or part of the primary selection workstations are selected as available workstations; if the former is smaller than the latter, all the primary selected workstations are used as available workstations.
12. The apparatus of claim 11, wherein the storage units in any of the collection lists are stored on a shelf prior to scheduling; and the number of the first and second groups,
when the number of the available workstations is less than the number of the collection lists of the unbound workstations, the independent variable of the objective function further comprises allocation judgment information of the collection list, and the allocation judgment information is used for representing whether the collection list is allocated or not; the cost item further comprises the superposition cost of the collection sheets, which is determined by the superposition degree of any two collection sheets in the collection sheets to be distributed; wherein the content of the first and second substances,
the degree of overlap includes: the number of the storage units in the same lane of the same layer of the three-dimensional goods shelf appears in any two collection lists.
13. The apparatus of claim 12, wherein when the number of available workstations is less than the number of the aggregation sheets of unbound workstations, the cost term further comprises an aggregation sheet time cost, which is positively correlated to the time duration from the current time to the order-cutting time of each of the collection sheets to be allocated and negatively correlated to the backlog time duration of each of the collection sheets to be allocated.
14. The apparatus of claim 13, wherein the cost term further comprises an aggregate order priority cost negatively correlated to a preset priority of each aggregate order to be allocated when the number of available workstations is less than the number of aggregate orders for unbound workstations.
15. The apparatus of claim 14, wherein the dependent variable is a sum of a number matching cost, an aggregation single time cost, and an aggregation single priority cost when there is only one available workstation.
16. The apparatus according to any one of claims 11 to 15, wherein the workstation is a review workstation, the storage unit is a tote, and the transport unit is a shuttle and conveyor line.
17. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-8.
18. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810904292.XA CN110826752A (en) | 2018-08-09 | 2018-08-09 | Collection list distribution method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810904292.XA CN110826752A (en) | 2018-08-09 | 2018-08-09 | Collection list distribution method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110826752A true CN110826752A (en) | 2020-02-21 |
Family
ID=69540965
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810904292.XA Pending CN110826752A (en) | 2018-08-09 | 2018-08-09 | Collection list distribution method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110826752A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111815229A (en) * | 2020-06-12 | 2020-10-23 | 北京顺达同行科技有限公司 | Order information processing method and device, electronic equipment and storage medium |
| CN113554381A (en) * | 2020-04-26 | 2021-10-26 | 北京京东乾石科技有限公司 | Warehousing scheduling method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106809586A (en) * | 2017-03-28 | 2017-06-09 | 北京京东尚科信息技术有限公司 | Method and apparatus for determining picking path |
| CN107230035A (en) * | 2017-06-29 | 2017-10-03 | 北京京东尚科信息技术有限公司 | Information-pushing method and device |
| CN107235276A (en) * | 2017-06-05 | 2017-10-10 | 北京京东尚科信息技术有限公司 | Goods method for carrying and device |
| US20170313516A1 (en) * | 2015-03-18 | 2017-11-02 | Hitachi, Ltd. | Order Management Apparatus and Order Management Method |
| CN108290685A (en) * | 2015-06-02 | 2018-07-17 | 阿勒特创新股份有限公司 | Access system |
| CN108320041A (en) * | 2017-01-16 | 2018-07-24 | 北京京东尚科信息技术有限公司 | Distribution set single method, apparatus, electronic equipment and readable storage medium storing program for executing |
-
2018
- 2018-08-09 CN CN201810904292.XA patent/CN110826752A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170313516A1 (en) * | 2015-03-18 | 2017-11-02 | Hitachi, Ltd. | Order Management Apparatus and Order Management Method |
| CN108290685A (en) * | 2015-06-02 | 2018-07-17 | 阿勒特创新股份有限公司 | Access system |
| CN108320041A (en) * | 2017-01-16 | 2018-07-24 | 北京京东尚科信息技术有限公司 | Distribution set single method, apparatus, electronic equipment and readable storage medium storing program for executing |
| CN106809586A (en) * | 2017-03-28 | 2017-06-09 | 北京京东尚科信息技术有限公司 | Method and apparatus for determining picking path |
| CN107235276A (en) * | 2017-06-05 | 2017-10-10 | 北京京东尚科信息技术有限公司 | Goods method for carrying and device |
| CN107230035A (en) * | 2017-06-29 | 2017-10-03 | 北京京东尚科信息技术有限公司 | Information-pushing method and device |
Non-Patent Citations (1)
| Title |
|---|
| 李冠瑾: "大型网络零售企业物流中心出货流程优化", 《中国优秀硕士学位论文全文数据库 经济与管理科学辑》, vol. 2018, no. 04, 15 April 2018 (2018-04-15), pages 157 - 481 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113554381A (en) * | 2020-04-26 | 2021-10-26 | 北京京东乾石科技有限公司 | Warehousing scheduling method and device |
| CN111815229A (en) * | 2020-06-12 | 2020-10-23 | 北京顺达同行科技有限公司 | Order information processing method and device, electronic equipment and storage medium |
| CN111815229B (en) * | 2020-06-12 | 2024-01-23 | 北京顺达同行科技有限公司 | Order information processing method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109772714B (en) | Goods sorting method and device, storage medium and electronic equipment | |
| CN110197351B (en) | Article delivery method and device | |
| CN108846609A (en) | Picking method, device, server and medium based on order taking responsibility | |
| CN110371548B (en) | Goods warehousing method and device | |
| CN110348771B (en) | Method and device for order grouping of orders | |
| CN111553548B (en) | Goods picking method and device | |
| CN110348650B (en) | Order converging method and device | |
| CN109902975A (en) | Dispatching method, system, device and computer readable storage medium | |
| CN111507651A (en) | Order data processing method and device applied to man-machine mixed warehouse | |
| CN110390497B (en) | Article warehouse-in method and device | |
| CN111260240A (en) | Task allocation method and device | |
| CN110880087A (en) | Method, device, warehousing system, equipment and medium for determining shelf position | |
| CN111985862A (en) | Method and apparatus for locating inventory items | |
| CN110826752A (en) | Collection list distribution method and device | |
| CN111832980A (en) | Method and device for allocating storage positions of multi-layer warehouse | |
| CN111950830A (en) | Task allocation method and device | |
| CN112101831A (en) | Goods delivery method, device, medium and electronic equipment | |
| CN112966992B (en) | Order production method and device | |
| CN113393193A (en) | Warehouse-out method and device | |
| CN110689293A (en) | Method and device for processing articles out of warehouse | |
| CN113759890A (en) | Control method and device for transport device | |
| CN112785212A (en) | Transportation equipment management method and device | |
| CN115375243A (en) | Order distribution method and device, electronic equipment and computer readable medium | |
| CN111768133A (en) | Method and device for warehousing articles | |
| CN112801569B (en) | Article sorting method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200601 Address after: Room A1905, 19th floor, No. 2 Building, 18 Kechuang 11th Street, Beijing Daxing District, Beijing Applicant after: Beijing Jingdong Qianshi Technology Co.,Ltd. Address before: 300 457 days Tianjin Binhai New Area, Tianjin Economic and Technological Development Zone, No. 10 Fourth Avenue, Phase 2, First Floor Applicant before: Tianjin Jingdong Shentuo Robot Technology Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |