CN112580905A - Cell equalization method and device - Google Patents
Cell equalization method and device Download PDFInfo
- Publication number
- CN112580905A CN112580905A CN201910925028.9A CN201910925028A CN112580905A CN 112580905 A CN112580905 A CN 112580905A CN 201910925028 A CN201910925028 A CN 201910925028A CN 112580905 A CN112580905 A CN 112580905A
- Authority
- CN
- China
- Prior art keywords
- parcel
- grid
- distribution station
- sum
- open
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000009826 distribution Methods 0.000 claims abstract description 140
- 230000006870 function Effects 0.000 claims description 22
- 230000001174 ascending effect Effects 0.000 claims description 16
- 238000012163 sequencing technique Methods 0.000 claims description 11
- 238000003860 storage Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012384 transportation and delivery Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 21
- 238000012545 processing Methods 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000013439 planning Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 239000002699 waste material Substances 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/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
Abstract
The disclosure discloses a lattice equalization method and a lattice equalization device, and relates to the field of logistics. The method comprises the following steps: determining the number of the grids corresponding to each distribution station in the plurality of distribution stations by taking the number of the parcels distributed by each balanced open grid as a target according to the number of the open grids, the number of the distribution stations and the number of the parcels in each distribution station; determining a package set distributed by each opening grid corresponding to each distribution station and the number of packages in the package set; and determining the opening cell corresponding to each parcel set of each distribution station by taking the balanced parcel density of each area as a target according to the position of each opening cell in the plurality of opening cells and the quantity of parcels distributed by each opening cell so as to carry out sorting operation according to the opening cell corresponding to each parcel set of each distribution station. This openly can improve resource utilization and letter sorting efficiency.
Description
Technical Field
The disclosure relates to the field of logistics, and in particular relates to a lattice equalization method and a lattice equalization device.
Background
With the rapid development of logistics technology, the intelligent unmanned warehouse attracts the wide attention of the logistics industry with the advantages of high speed, high efficiency and low cost. In an unmanned warehouse high-level sorting scenario, parcels are transported via a conveyor belt to an upper parcel platform where they are placed on a sorting AGV (Automated Guided Vehicle) by a worker or a robotic arm. After the sorting AGV carries the packages, the sorted AGV travels to a designated slot along a specific route according to an instruction issued by a WMS (Wireless Management System). Every lattice under the high-order letter sorting scene corresponds a cage car, and letter sorting AGV traveles to one side of cage car, emptys the parcel to the cage car in. Only packages destined for the same distribution station can be placed in each cell. After the grids are filled with the packages, the packages are suspended to be received, and the cage cars are carried to a package collecting platform by the transport AGV to be collected. After the bag collection is finished, the empty cage vehicle is conveyed to the appointed empty cell by the transport AGV, and then the appointed empty cell is reopened.
Because unmanned storehouse contains a large amount of grids and AGV, if distribute improperly, will lead to a large amount of AGV to pile up in specific jam area, and the grid in this jam area often loads with the parcel, and the grid in other idle areas is rarely had the AGV come forward and is transported the parcel to lead to the very big waste of resource and the decline of efficiency.
Disclosure of Invention
One technical problem to be solved by the present disclosure is to provide a cell balancing method and apparatus, which can improve resource utilization rate and sorting efficiency.
According to an aspect of the present disclosure, a trellis equalizing method is provided, including: determining the number of the grids corresponding to each distribution station in the plurality of distribution stations by taking the number of the parcels distributed by each balanced open grid as a target according to the number of the open grids, the number of the distribution stations and the number of the parcels in each distribution station; determining a package set distributed by each opening grid corresponding to each distribution station and the number of packages in the package set; and determining the opening cell corresponding to each parcel set of each distribution station by taking the balanced parcel density of each area as a target according to the position of each opening cell in the plurality of opening cells and the quantity of parcels distributed by each opening cell so as to carry out sorting operation according to the opening cell corresponding to each parcel set of each distribution station.
In some embodiments, the open bay that has been filled with packages is closed while the sorting job is being performed; and determining the position of the grid to be opened by taking the sum of the package quantity of each area as a target.
In some embodiments, determining the number of bays for each dispensing station comprises: calculating the average space value of the parcels corresponding to each distribution station to obtain a plurality of average space values of the parcels corresponding to a plurality of distribution stations; the average parcel space value is determined according to the number of the corresponding grids of each distribution station, the loading space corresponding to each open grid and the number of parcels; obtaining a maximum space value and a minimum space value in a plurality of parcel average space values; and determining the number of the grids corresponding to each distribution station by taking the minimum difference between the maximum space value and the minimum space value as an objective function based on an integer programming model.
In some embodiments, the number of compartments corresponding to each distribution station is greater than or equal to one; the sum of the number of the grids corresponding to the plurality of distribution stations is equal to the number of the open grids; the maximum space value is larger than or equal to the average space value of the parcels corresponding to any distribution station; and the minimum space value is less than or equal to the average space value of the parcels corresponding to any distribution station.
In some embodiments, determining an open bin corresponding to each collection of packages for each distribution station comprises: calculating the sum of the number of packages corresponding to each first grid set in the plurality of first grid sets according to the number of packages distributed by each open grid; the number of the grids in each first grid set is the same, at least one column or one row of open grids in the adjacent first grid sets are the same, and one first grid set corresponds to one area; acquiring the sum of the maximum parcel quantity and the sum of the minimum parcel quantity in the sums of the parcel quantities; and determining an opening grid corresponding to each parcel set of each distribution station by taking the difference between the sum of the maximum parcel quantity and the sum of the minimum parcel quantity as an objective function based on an integer programming model.
In some embodiments, each package collection is assigned to only one open bin; each open bay is assigned only one package set; the sum of the maximum parcel number is greater than or equal to the sum of the parcel number corresponding to any one first grid set; and the sum of the minimum parcel number is less than or equal to the sum of the parcel numbers corresponding to any one first grid set.
In some embodiments, determining the location of the opening to be opened comprises: sorting the number of the packages of the open grid which are not filled with the packages to obtain a first sorting result; determining the number of packages corresponding to the grid in the closed state and a first quantile in the first sequencing result; calculating the sum of the package quantity of each second grid set in a plurality of second grid sets containing grids to be opened; sorting the sum of the number of the packages corresponding to the second crater sets to obtain a second sorting result; determining a second score of the sum of the parcel quantities corresponding to each second crater set in a second sorting result; and determining the position of the grid to be opened according to the absolute value of the difference between the first quantile and the second quantile.
In some embodiments, determining the location of the opening to be opened comprises: if the first sorting result is ascending and the second sorting result is descending, or the first sorting result is descending and the second sorting result is ascending, determining the position of the grid to be opened by taking the minimum absolute value of the difference between the first quantile and the second quantile as a target function; and if the first sequencing result is ascending and the second sequencing result is ascending, or the first sequencing result is descending and the second sequencing result is descending, determining the position of the grid to be opened by taking the maximum absolute value of the difference between the first quantile and the second quantile as a target function.
According to another aspect of the present disclosure, there is also provided a cell equalization apparatus, including: the grid quantity distribution unit is configured to determine the grid quantity corresponding to each distribution station in the plurality of distribution stations by taking the package quantity distributed by balancing each open grid as a target according to the quantity of the open grids, the quantity of the distribution stations and the package quantity of each distribution station; the package set matching unit is configured to determine a package set distributed by each open cell corresponding to each distribution station and the number of packages in the package set; and determining the opening cell corresponding to each parcel set of each distribution station by taking the balanced parcel density of each area as a target according to the position of each opening cell in the plurality of opening cells and the quantity of the parcels distributed by each opening cell so as to carry out sorting operation according to the opening cell corresponding to each parcel set of each distribution station.
In some embodiments, the dynamic bin adjustment unit is configured to close an open bin already filled with packages when performing a sorting job, and to determine the location of the bin to be opened with the goal of balancing the sum of the number of packages per zone.
According to another aspect of the present disclosure, there is also provided a cell equalization apparatus, including: a memory; and a processor coupled to the memory, the processor configured to perform the trellis equalization method as described above based on instructions stored in the memory.
According to another aspect of the present disclosure, a computer-readable storage medium is also proposed, on which computer program instructions are stored, which instructions, when executed by a processor, implement the above-mentioned trellis equalization method.
Compared with the prior art, the method and the device have the advantages that the number of the parcels distributed by each open cell is balanced, the number of the cells corresponding to each distribution station in the distribution stations is determined, the parcel density of each area is balanced, the open cells corresponding to each parcel set of each distribution station are determined, accordingly, the AGV cannot be accumulated in a specific congestion area during sorting operation, and resource utilization rate and sorting efficiency are improved.
Other features of the present disclosure and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.
The present disclosure may be more clearly understood from the following detailed description, taken with reference to the accompanying drawings, in which:
fig. 1 is a flow diagram of some embodiments of a trellis diagram of the present disclosure.
Fig. 2 is a flow chart illustrating another embodiment of a trellis diagram according to the present disclosure.
Fig. 3 is a flow chart illustrating further embodiments of the disclosed trellis diagram equalization method.
FIG. 4 is a schematic view of some embodiments of a sliding window of the present disclosure.
Fig. 5 is a flow chart illustrating further embodiments of the disclosed trellis diagram equalization method.
Fig. 6 is a schematic structural diagram of some embodiments of the disclosed cell equalization apparatus.
Fig. 7 is a schematic structural diagram of another embodiment of a cell equalization apparatus according to the present disclosure.
Fig. 8 is a schematic structural diagram of another embodiment of a cell equalization apparatus according to the present disclosure.
Fig. 9 is a schematic structural diagram of another embodiment of a cell equalization apparatus according to the present disclosure.
Detailed Description
Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
For the purpose of promoting a better understanding of the objects, aspects and advantages of the present disclosure, reference is made to the following detailed description taken in conjunction with the accompanying drawings.
In the related art, when the unmanned storehouse has a plurality of gates and a large scale, the number of packages of different gates cannot be guaranteed to be as close as possible, which may cause that the number of packages of one gate is very small and the number of packages of the other gate is very large in two adjacent gates, resulting in a very unbalanced situation.
Fig. 1 is a flow diagram of some embodiments of a trellis diagram of the present disclosure.
In step 110, the number of the pockets corresponding to each distribution station in the plurality of distribution stations is determined with the goal of balancing the number of the parcels distributed by each open pocket according to the number of the open pockets, the number of the distribution stations and the number of the parcels at each distribution station.
A plurality of preset grids capable of placing cage cars are arranged in the unmanned bin, the preset grids refer to all grids in the sorting area, and the preset grids comprise open grids and unopened grids. Before each day of sorting, a sorting plan is formulated, i.e. different positions and different numbers of open slots corresponding to packages sent to different distribution stations are determined.
In the step, the number of the grids corresponding to different distribution stations is obtained, so that the number of packages between any open grids is balanced as much as possible. For example, for distribution stations with heavy traffic and more packages, more grids are distributed for the distribution stations for sorting; for distribution stations with fewer packages, distributing fewer grids for the distribution stations; for a distribution station with a current package number of 0, no bin is allocated for it.
At step 120, a package set and a number of packages in the package set assigned to each open bay corresponding to each distribution station are determined.
In some embodiments, the number of packages distributed per open cell in a distribution station is obtained by averaging the number of packages in a particular distribution station to the corresponding open cells in that distribution station, since the number of cells distributed per distribution station is already obtained. For example, if a distribution station corresponds to 5 open bays and the distribution station has 100 packages, the number of packages distributed to each open bay is 20, and each 20 packages can be regarded as a package set.
In step 130, the opening grid corresponding to each parcel set of each distribution station is determined with the aim of balancing the parcel density of each area according to the position of each opening grid in the plurality of opening grids and the quantity of parcels distributed by each opening grid, so that the sorting operation is carried out according to the opening grid corresponding to each parcel set of each distribution station.
In the step, the number of the parcels in each area is ensured to be as close as possible through a preset algorithm, the condition that one area is more congested than another area is avoided, and therefore the overall parcel density in the sorting area is balanced.
In the above embodiment, the number of parcels distributed to each opening bay is balanced, the number of bays corresponding to each distribution station in the plurality of distribution stations is determined, and then the opening bay corresponding to each parcel set of each distribution station is determined with the parcel density of each area balanced as a target, so that an AGV is prevented from accumulating in a specific congested area during sorting, and the resource utilization rate and the sorting efficiency are improved.
In other embodiments of the present disclosure, as shown in fig. 2, determining the number of bays for each of the plurality of dispensing stations comprises the steps of:
at step 210, the number of open bays, the number of distribution stations, and the number of packages per distribution station in the sorting area are obtained.
In step 220, the average parcel space value for each distribution station is calculated to obtain a plurality of average parcel space values for a plurality of distribution stations. One distribution station corresponds to one parcel mean space value.
The average parcel space value is determined according to the number of the corresponding compartments of each distribution station, the loading space corresponding to each opening compartment and the number of parcels. In some embodiments, assuming that the volume of each parcel is similar and the cage space corresponding to all the compartments is equal, the storage space of each distribution station is the product of the number of open compartments and the cage space, and the average space value of each distribution station for the parcels is the ratio of the storage space of the distribution station to the number of parcels.
At step 230, a maximum spatial value and a minimum spatial value of the plurality of parcel mean spatial values are obtained. For example, there are 5 distribution stations, and the average space values of parcels corresponding to the first distribution station to the second distribution station in sequence are 10, 5, 6, 2 and 8, respectively, so that the maximum space value is 10 and the minimum space value is 2.
In step 240, based on the integer programming model, the difference between the maximum value and the minimum value is used as an objective function to determine the number of cells corresponding to each distribution station. The number of the grids corresponding to each distribution station is more than or equal to one; the sum of the number of the grids corresponding to the plurality of distribution stations is equal to the number of the open grids; the maximum space value is larger than or equal to the average space value of the parcels corresponding to any distribution station; and the minimum space value is less than or equal to the average space value of the parcels corresponding to any distribution station.
In one embodiment, for example, the parameters for setting the integer program module include the number of open bays M, the number of distribution stations S, and the number of packages per distribution station i SiWherein i is more than or equal to 1 and less than or equal to S; by the number n of open compartments per delivery station iiAs variable, with the maximum spatial value b1And a minimum spatial value b2Is a variable, wherein ni∈Z，b1∈R，b2E is R; in min (b)1-b2) As an objective function, the number n of open cells corresponding to any one distribution station iiThe sum of the number of grids corresponding to a plurality of distribution stations is more than or equal to 1
Equal to the number M of the open cells,
Determining the number n of open cells corresponding to each distribution station i as a constraint conditioniWherein v is the cage truck cargo space corresponding to a single lattice, because v is a constantTherefore, this value can be rounded off at the time of calculation.
In the above embodiment, the number of the open cells is distributed to each distribution station, a total volume of the open cells corresponding to each distribution station is obtained, and then an average volume for each distribution station is obtained, and the number of packages in any open cell can be balanced by minimizing the difference between the upper and lower limits of the average volume of different distribution stations.
In other embodiments of the present disclosure, as shown in FIG. 3, determining an open bay for each package set for each distribution station comprises the steps of:
at step 310, the location of each open bay in the plurality of open bays and the number of packages allocated per open bay are obtained.
For example, there are N predetermined bins in the picking area, with the N predetermined bins divided by l1Line, l2Column, the number of packages allocated per predetermined bin is qijAnd the number of packages allocated to the unopened bin is 0, so that the number of packages allocated to each opened bin can be calculated only.
At step 320, a package set and a number of packages in the package set assigned to each open bay corresponding to each distribution station are determined.
For example, if a distribution station corresponds to 5 open bays and the distribution station has 100 packages, the number of packages distributed to each open bay is 20, and each 20 packages can be regarded as a package set.
In step 330, calculating the sum of the number of parcels corresponding to each first crater set in the plurality of first crater sets according to the number of parcels distributed by each open crater; the number of the grids in each first grid set is the same, at least one column or one row of the open grids in the adjacent first grid sets is the same, and one first grid set corresponds to one area.
In some embodiments, as shown in fig. 4, the windows may be covered with sliding windows that can be translated left, right, up, and down, where a sliding window is a square area with the windows covered by a sliding window as a set of windows. It will be understood by those skilled in the art that the sliding window is a square area for example only, and the sliding window may be rectangular or other shapes. The sliding window represents a specific shape and area in the unmanned bin.
In step 340, the sum of the maximum parcel number and the sum of the minimum parcel number of the sums of the parcel numbers are obtained.
For example, if there are 100 first bin sets, the sum of the 100 parcel numbers corresponds to 500, 450 … 300, 300 … 531, respectively. Wherein, the maximum value is 531, the minimum value is 300, then 531 is the sum of the maximum parcel number, 300 is the sum of the minimum parcel number.
In step 350, based on the integer planning model, the opening bin corresponding to each parcel set of each distribution station is determined with the difference between the sum of the maximum parcel number and the sum of the minimum parcel number as the objective function. Wherein each package aggregate is assigned to only one open bin; each open bay is assigned only one package set; the sum of the maximum parcel number is greater than or equal to the sum of the parcel number corresponding to any one first grid set; the sum of the minimum parcel numbers is less than or equal to the sum of the parcel numbers corresponding to any one first grid set.
For example, the open interface corresponding to each parcel set may be adjusted so that the difference between the sum of the maximum parcel number and the sum of the minimum parcel number is minimized, thereby equalizing the parcel number density in different areas in the unmanned bin.
In one embodiment, a plurality of package collections o corresponding to distribution stations i are obtained firstkWherein, if the number of the corresponding grid of the distribution station i is niThen the number of packages corresponding to each cell in the distribution station i is
Each c isiThe corresponding packages are taken as a package set, and each distribution station has niA collection of packages wherein there are N-M unopened compartments in the picking zone, so that there can be N for each delivery stationiSupplementing N-M0 s on the basis of a package set, whereinAnd 0 corresponds to the set of packages with unopened cells.
The parameters for setting the integer programming module include the number N of predetermined slots, the number S of distribution stations, and the number l of slot rows1Number of rows of cells l2Side length of sliding window3Sliding window interval d, kth parcel set o per delivery stationk. Wherein the side length of the sliding window is l3I.e. the sliding window can comprise3·l3A cell, l3The larger the number of bins the sliding window contains, the more accurate the model, and the longer the computation time. The smaller the distance d between adjacent sliding windows, the larger the number of sliding windows, the more accurate the model, and the longer the calculation time.
To see if the k-th parcel is to be aggregated okCell e assigned to ith row and j columnijkThe number q of packages in the grid of the ith row and j column is {0,1}ijThe sum w of the package numbers of the sliding windows in the ith 'row and the j' columni,j,B 'of the maximum number of packages'1B 'sum of minimum parcel quantities'2Is a variable, wherein qij∈R，wi'j'∈R，b'1∈R，b'2E.g. R. If the k-th parcel is aggregated to okA bin assigned to row i and column j, then eijkIf the k-th parcel is not aggregated, o 1kA bin assigned to row i and column j, then eijk＝0。
As shown in fig. 4, the first sliding window at the upper left is referred to as the sliding window in the first row and the first column, the sliding window adjacent to the right is referred to as the sliding window in the first row and the second column, the sliding window adjacent to the lower side is referred to as the sliding window in the second row and the first column, and so on.
Is min (b'1-b'2) The target function, the grid of any ith row and j column only corresponds to one parcel set
Any one package assembly is allocated to only one grid
The number of packages in the package set corresponding to any lattice in the ith row and the j column
Sum of the number of packages belonging to each of the compartments of the sliding window
b'2≤wi'j'For constraint, an open bin is determined for each package set for each distribution station.
In the embodiment, the sorting operation platform is divided into a plurality of overlapped areas, and the number of packages in each area is ensured to be as close as possible through an algorithm, so that the condition that one area is more congested than the other area is avoided, and the balance of the number of the whole packages in the sorting area is achieved.
In other embodiments of the present disclosure, the open compartments that have been filled with packages are closed while the sorting operation is being performed; and determining the position of the grid to be opened by taking the sum of the package quantity of each balanced area as a target.
After the sorting plan is formulated, the picking operation is started, the open gates are gradually put into packages, when a certain open gate is full of packages, the open gate is closed, cage cars corresponding to the closed gates are carried to a bag collecting platform by a transport AGV to be collected, and meanwhile, an unopened gate needs to be opened to replace the closed gates. The specific implementation process is shown in fig. 5:
at step 510, the number of packages that are not filled with packages and have an open cell is sorted to obtain a first sorting result. For example, the packages are sorted from small to large by the number of packages q.
In step 520, the number q of packages corresponding to the closed compartment is determinedtFirst score p in first order resultt。
For example, the number of packages in an open compartment not filled with packages is 20, 22, 28, respectively, and the number of packages q corresponding to the closed compartment istIs 25, then qtFirst quantile p in first ordering resulttThe content was 80%. Wherein the first quantile represents the positionCongestion level of the closed state of the cell.
At step 530, the sum w 'of the number of parcels in each of a plurality of second set of gates including a gate to be opened is calculated't(ii) a The number of the grids in each second grid set is the same, at least one column or one row of the open grids in the adjacent second grid sets is the same, and one second grid set corresponds to one area. The number of cells in the first set of cells is the same as the number of cells in the second set of cells.
In this embodiment, the to-be-opened state m 'may be covered with a sliding window'tObtaining a cell containing m'tIs provided with the sum w of the parcel quantities corresponding to all the sliding windows't。
In step 540, the parcel number sums corresponding to the plurality of second crater sets are sorted according to the parcel number sum of each second crater set, so as to obtain a second sorting result.
At step 550, a second score in the second ranking result of the sum of the parcel quantities corresponding to each second bin set is determined. The second score represents the degree of congestion in the area where the hatch to be opened is located.
In step 560, the position of the cell to be opened is determined based on the absolute value of the difference between the first and second scores.
In the embodiment, the to-be-opened cell is dynamically opened based on the quantile principle, so that the package quantity of any area is always kept balanced in the whole sorting process, and the AGV accumulation is reduced.
In some embodiments, if the first sorting result is in an ascending order and the second sorting result is in a descending order; or the first sorting result is in a descending order, and the second sorting result is in an ascending order. For example, if the number of packages in an open cell not filled with packages is sorted from small to large, the sum of the numbers of packages corresponding to the plurality of second cell sets is sorted from large to small, and the position of the cell to be opened is determined by taking the minimum absolute value of the difference between the first quantile and the second quantile as an objective function.
In some embodiments, if the first sorting result is ascending and the second sorting result is ascending, or the first sorting result is descending and the second sorting result is descending, the position of the to-be-opened bin is determined by taking the absolute value of the difference between the first quantile and the second quantile as the maximum objective function.
In this embodiment, it is desirable that the congestion levels in the areas where the closed cells and the newly opened cells are located are as opposite as possible in the sense of quantiles. For example, the congestion level of a cell in a closed state is at a level of 80% in all open cells, then the congestion level of a newly opened cell should be at a level of 20% in an unopened cell. Therefore, if the flow corresponding to the grid in the closed state is large, the flow can be better borne when a new grid is opened for storing the package of the original grid, so that the package volume density of the grid can be kept in a balanced state in the whole sorting process, and the sorting effect is improved.
In some embodiments of the present disclosure, the bin balancing process includes a sort plan phase and a bin dynamic allocation phase. That is, before each day of sorting, a sorting plan is made, that is, packages sent to different distribution stations are bound to different positions and different quantities of grids. After the sorting plan is formulated, the operation starts, and the AGV continuously conveys the packages to the grid from the upper package platform. When a certain cell is full, dynamic cell allocation is carried out, namely, corresponding standby cells are opened according to the situation that the cells are fully closed, so that each area in the warehouse is always kept in a balanced wrapping amount state.
Fig. 6 is a schematic structural diagram of some embodiments of the disclosed cell equalization apparatus. The apparatus includes a bin number assigning unit 610 and a package set matching unit 620.
The number of bays allocation unit 610 is configured to determine the number of bays corresponding to each of the plurality of distribution stations with the goal of balancing the number of parcels allocated per open bay based on the number of open bays, the number of distribution stations, and the number of parcels per distribution station.
In some embodiments, the average space value of the parcels corresponding to each distribution station is calculated to obtain a plurality of average space values of the parcels corresponding to a plurality of distribution stations; the average parcel space value is determined according to the number of the corresponding grids of each distribution station, the loading space corresponding to each open grid and the number of parcels; obtaining a maximum space value and a minimum space value in a plurality of parcel average space values; and determining the number of grids corresponding to each distribution station by taking the minimum difference between the maximum space value and the minimum space value as an objective function based on an integer programming model. The number of the grids corresponding to each distribution station is more than or equal to one; the sum of the number of the grids corresponding to the plurality of distribution stations is equal to the number of the open grids; the maximum space value is larger than or equal to the average space value of the parcels corresponding to any distribution station; and the minimum space value is less than or equal to the average space value of the parcels corresponding to any distribution station.
The package set matching unit 620 is configured to determine a package set and a package number in the package set allocated by each open grid corresponding to each distribution station; and determining the opening cell corresponding to each parcel set of each distribution station by taking the balanced parcel density of each area as a target according to the position of each opening cell in the plurality of opening cells and the quantity of the parcels distributed by each opening cell so as to carry out sorting operation according to the opening cell corresponding to each parcel set of each distribution station.
In some embodiments, the sum of the number of parcels corresponding to each first crater set in the plurality of first crater sets is calculated according to the number of parcels distributed by each open crater; the number of the grids in each first grid set is the same, at least one column or one row of open grids in the adjacent first grid sets are the same, and one first grid set corresponds to one area; acquiring the sum of the maximum parcel quantity and the sum of the minimum parcel quantity in the sums of the parcel quantities; and determining the opening grid corresponding to each parcel set of each distribution station by taking the difference between the sum of the maximum parcel quantity and the sum of the minimum parcel quantity as an objective function based on an integer programming model. Wherein each package aggregate is assigned to only one open bin; each open bay is assigned only one package set; the sum of the maximum parcel number is greater than or equal to the sum of the parcel number corresponding to any one first grid set; the sum of the minimum parcel numbers is less than or equal to the sum of the parcel numbers corresponding to any one first grid set.
In the above embodiment, the number of parcels distributed to each opening bay is balanced, the number of bays corresponding to each distribution station in the plurality of distribution stations is determined, and then the opening bay corresponding to each parcel set of each distribution station is determined with the parcel density of each area balanced as a target, so that an AGV is prevented from accumulating in a specific congested area during sorting, and the resource utilization rate and the sorting efficiency are improved.
In other embodiments of the present disclosure, as shown in fig. 7, the apparatus further comprises a dynamic bin adjustment unit 710 configured to close the open bins that have been filled with packages when performing a sorting job, to determine the locations of the bins to be opened with the goal of balancing the sum of the number of packages per zone.
In some embodiments, the number of packages of an open bin not filled with packages is sorted, resulting in a first sorting result; determining the number of packages corresponding to the grid in the closed state and a first quantile in the first sequencing result; calculating the sum of the package quantity of each second grid set in a plurality of second grid sets containing grids to be opened, wherein the grid quantity in each second grid set is the same as that in each first grid set; sorting the sum of the number of the packages corresponding to the second crater sets to obtain a second sorting result; determining a second score of the sum of the parcel quantities corresponding to each second crater set in a second sorting result; and determining the position of the grid to be opened according to the absolute value of the difference between the first quantile and the second quantile.
For example, if the first sorting result is ascending and the second sorting result is descending, or the first sorting result is descending and the second sorting result is ascending, the position of the cell to be opened is determined by taking the minimum absolute value of the difference between the first quantile and the second quantile as a target function; and if the first sequencing result is ascending and the second sequencing result is ascending, or the first sequencing result is descending and the second sequencing result is descending, determining the position of the grid to be opened by taking the maximum absolute value of the difference between the first quantile and the second quantile as a target function.
In this embodiment, after a certain bay is fully loaded with packages, dynamic allocation of the bays is performed, that is, corresponding unopened bays are opened according to the situation of the closed bays, so as to ensure that each area in the unmanned warehouse always keeps the package amount in a balanced state, thereby improving the picking effect.
Fig. 8 is a schematic structural diagram of another embodiment of a cell equalization apparatus according to the present disclosure. The apparatus includes a memory 810 and a processor 820, wherein: the memory 810 may be a magnetic disk, flash memory, or any other non-volatile storage medium. The memory is used for storing instructions in the embodiments corresponding to fig. 1, 2, 3 and 5. Processor 820 is coupled to memory 810 and may be implemented as one or more integrated circuits, such as a microprocessor or microcontroller. The processor 820 is configured to execute instructions stored in the memory.
In some embodiments, as also shown in fig. 9, the apparatus 900 includes a memory 910 and a processor 920. Processor 920 is coupled to memory 910 by a BUS 930. The device 900 may also be coupled to an external storage device 950 via a storage interface 940 for facilitating retrieval of external data, and may also be coupled to a network or another computer system (not shown) via a network interface 960, which will not be described in detail herein.
In the embodiment, the data instructions are stored in the memory and processed by the processor, so that the resource utilization rate and the sorting efficiency are improved.
In further embodiments, a computer-readable storage medium has stored thereon computer program instructions which, when executed by a processor, implement the steps of the method in the embodiments corresponding to fig. 1, 2, 3, 5. As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, apparatus, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Thus far, the present disclosure has been described in detail. Some details that are well known in the art have not been described in order to avoid obscuring the concepts of the present disclosure. It will be fully apparent to those skilled in the art from the foregoing description how to practice the presently disclosed embodiments.
Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the foregoing examples are for purposes of illustration only and are not intended to limit the scope of the present disclosure. It will be appreciated by those skilled in the art that modifications may be made to the above embodiments without departing from the scope and spirit of the present disclosure. The scope of the present disclosure is defined by the appended claims.
Claims (12)
1. A method of trellis equalization comprising:
determining the number of the grids corresponding to each distribution station in the plurality of distribution stations by taking the number of the parcels distributed by each balanced open grid as a target according to the number of the open grids, the number of the distribution stations and the number of the parcels in each distribution station;
determining a package set distributed by each opening grid corresponding to each distribution station and the number of packages in the package set; and
and determining the opening cell corresponding to each parcel set of each distribution station by taking the balanced parcel density of each area as a target according to the position of each opening cell in the plurality of opening cells and the quantity of the parcels distributed by each opening cell so as to carry out sorting operation according to the opening cell corresponding to each parcel set of each distribution station.
2. The trellis equalization method of claim 1, further comprising:
closing the open compartments already filled with packages while performing the sorting operation; and
and determining the position of the grid to be opened by taking the sum of the package quantity of each balanced area as a target.
3. A method of bin equalization according to claim 1 or 2, wherein determining the number of bins for each delivery station comprises:
calculating the average space value of the parcels corresponding to each distribution station to obtain a plurality of average space values of the parcels corresponding to the plurality of distribution stations; the average parcel space value is determined according to the number of the corresponding grids of each distribution station, the loading space corresponding to each open grid and the number of parcels;
obtaining a maximum spatial value and a minimum spatial value of the plurality of parcel mean spatial values; and
and determining the number of the grids corresponding to each distribution station by taking the minimum difference between the space maximum value and the space minimum value as an objective function based on an integer programming model.
4. The trellis equalizing method of claim 3, wherein,
the number of the grids corresponding to each distribution station is more than or equal to one;
the sum of the number of the grids corresponding to the plurality of distribution stations is equal to the number of the open grids;
the maximum space value is larger than or equal to the average space value of the parcels corresponding to any distribution station; and
and the minimum space value is less than or equal to the average space value of the parcels corresponding to any distribution station.
5. The grid equalization method of claim 1 or 2, wherein determining an open grid corresponding to each parcel set for said each distribution station comprises:
calculating the sum of the number of packages corresponding to each first grid set in the plurality of first grid sets according to the number of packages distributed by each open grid; the number of the grids in each first grid set is the same, at least one column or one row of open grids in the adjacent first grid sets is the same, and one first grid set corresponds to one area;
obtaining the sum of the maximum parcel quantity and the sum of the minimum parcel quantity in the sums of the parcel quantities; and
and determining an opening grid corresponding to each parcel set of each distribution station by taking the minimum difference value between the sum of the maximum parcel quantity and the sum of the minimum parcel quantity as an objective function based on an integer programming model.
6. The trellis equalizing method of claim 5, wherein,
each parcel set is assigned to only one open bay;
only one package set is allocated to each open cell;
the sum of the maximum parcel number is greater than or equal to the sum of the parcel number corresponding to any one first grid set; and
and the sum of the minimum parcel number is less than or equal to the sum of the parcel numbers corresponding to any one first grid set.
7. A method of cell equalization as claimed in claim 2, wherein determining the location of the cell to be opened comprises:
sorting the number of the packages of the open grid which are not filled with the packages to obtain a first sorting result;
determining the number of packages corresponding to the grid in the closed state, and the first quantile in the first sequencing result;
calculating the sum of the package quantity of each second grid set in a plurality of second grid sets containing the grid to be opened;
sorting the sum of the number of the plurality of packages corresponding to the plurality of second crater sets to obtain a second sorting result;
determining a second score of the sum of the parcel quantities corresponding to each second crater set in the second sorting result; and
and determining the position of the grid to be opened according to the absolute value of the difference between the first quantile and the second quantile.
8. A method of cell equalization as claimed in claim 7, wherein determining the position of the cell to be opened comprises:
if the first sorting result is in an ascending order and the second sorting result is in a descending order, or the first sorting result is in a descending order and the second sorting result is in an ascending order, determining the position of the lattice to be opened by taking the minimum absolute value of the difference between the first quantile and the second quantile as a target function;
and if the first sorting result is in an ascending order and the second sorting result is in an ascending order, or the first sorting result is in a descending order and the second sorting result is in a descending order, determining the position of the lattice to be opened by taking the maximum absolute value of the difference between the first quantile and the second quantile as an objective function.
9. A cell equalization apparatus, comprising:
the grid quantity distribution unit is configured to determine the grid quantity corresponding to each distribution station in the plurality of distribution stations by taking the package quantity distributed by balancing each open grid as a target according to the quantity of the open grids, the quantity of the distribution stations and the package quantity of each distribution station; and
a package set matching unit configured to determine a package set allocated to each open cell corresponding to each distribution station and a package number in the package set; and determining the opening cell corresponding to each parcel set of each distribution station by taking the balanced parcel density of each area as a target according to the position of each opening cell in the plurality of opening cells and the quantity of the parcels distributed by each opening cell so as to carry out sorting operation according to the opening cell corresponding to each parcel set of each distribution station.
10. A trellis equalizing device according to claim 9, further comprising:
and the grid dynamic adjusting unit is configured to close the opening grids filled with the packages when the sorting operation is executed, and determine the positions of the grids to be opened by taking the sum of the package quantity of each area as a target for balancing.
11. A cell equalization apparatus, comprising:
a memory; and
a processor coupled to the memory, the processor configured to perform the method of trellis equalization of any of claims 1-8 based on instructions stored in the memory.
12. A computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the trellis equalization method of any one of claims 1 through 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910925028.9A CN112580905A (en) | 2019-09-27 | 2019-09-27 | Cell equalization method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910925028.9A CN112580905A (en) | 2019-09-27 | 2019-09-27 | Cell equalization method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112580905A true CN112580905A (en) | 2021-03-30 |
Family
ID=75110690
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910925028.9A Pending CN112580905A (en) | 2019-09-27 | 2019-09-27 | Cell equalization method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112580905A (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB1565714A (en) * | 1978-02-22 | 1980-04-23 | United Carriers Ltd | Parcel sorting apparatus |
| RU2013150229A (en) * | 2013-11-11 | 2015-05-20 | Федеральное государственное образовательное бюджетное учреждение высшего профессионального образования Московский технический университет связи и информатики (ФГОБУ ВПО МТУСИ) | COMPLEX OF SORTING AND STORAGE OF PACKAGES |
| FR3031216A1 (en) * | 2014-12-31 | 2016-07-01 | Skyworld Int Overseas Ltd | METHOD FOR DISTRIBUTION OF REMOTELY CONTROLLED GOODS, AND AUTOMATIC DISTRIBUTION POSITION FOR IMPLEMENTING SAID METHOD |
| CN105929740A (en) * | 2016-05-27 | 2016-09-07 | 杭州嘉拓科技有限公司 | Parcel converged packing method and control device |
| CN107330647A (en) * | 2017-05-18 | 2017-11-07 | 中科富创（北京）科技有限公司 | Express delivery dispatching method, storage device, processing system |
| CN107458828A (en) * | 2016-06-06 | 2017-12-12 | 北京物资学院 | One kind parcel selection AGV system |
| CN108877081A (en) * | 2018-07-03 | 2018-11-23 | 深圳市高德威技术有限公司 | A kind of combined intelligent delivery system and its delivering method |
| CN109377124A (en) * | 2018-09-25 | 2019-02-22 | 顺丰科技有限公司 | Express delivery sorting method, apparatus, server and computer readable storage medium |
| CN109570038A (en) * | 2018-11-02 | 2019-04-05 | 顺丰科技有限公司 | Method for sorting and sorting system |
| CN109604171A (en) * | 2018-10-22 | 2019-04-12 | 顺丰科技有限公司 | Express delivery sorting method, apparatus, equipment and its storage medium |
| CN110090802A (en) * | 2018-01-29 | 2019-08-06 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus generating bin distribution information |
| CN110125015A (en) * | 2019-05-10 | 2019-08-16 | 深圳市前海云途物流有限公司 | Method for sorting, device and computer readable storage medium |
-
2019
- 2019-09-27 CN CN201910925028.9A patent/CN112580905A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB1565714A (en) * | 1978-02-22 | 1980-04-23 | United Carriers Ltd | Parcel sorting apparatus |
| RU2013150229A (en) * | 2013-11-11 | 2015-05-20 | Федеральное государственное образовательное бюджетное учреждение высшего профессионального образования Московский технический университет связи и информатики (ФГОБУ ВПО МТУСИ) | COMPLEX OF SORTING AND STORAGE OF PACKAGES |
| FR3031216A1 (en) * | 2014-12-31 | 2016-07-01 | Skyworld Int Overseas Ltd | METHOD FOR DISTRIBUTION OF REMOTELY CONTROLLED GOODS, AND AUTOMATIC DISTRIBUTION POSITION FOR IMPLEMENTING SAID METHOD |
| CN105929740A (en) * | 2016-05-27 | 2016-09-07 | 杭州嘉拓科技有限公司 | Parcel converged packing method and control device |
| CN107458828A (en) * | 2016-06-06 | 2017-12-12 | 北京物资学院 | One kind parcel selection AGV system |
| CN107330647A (en) * | 2017-05-18 | 2017-11-07 | 中科富创（北京）科技有限公司 | Express delivery dispatching method, storage device, processing system |
| CN110090802A (en) * | 2018-01-29 | 2019-08-06 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus generating bin distribution information |
| CN108877081A (en) * | 2018-07-03 | 2018-11-23 | 深圳市高德威技术有限公司 | A kind of combined intelligent delivery system and its delivering method |
| CN109377124A (en) * | 2018-09-25 | 2019-02-22 | 顺丰科技有限公司 | Express delivery sorting method, apparatus, server and computer readable storage medium |
| CN109604171A (en) * | 2018-10-22 | 2019-04-12 | 顺丰科技有限公司 | Express delivery sorting method, apparatus, equipment and its storage medium |
| CN109570038A (en) * | 2018-11-02 | 2019-04-05 | 顺丰科技有限公司 | Method for sorting and sorting system |
| CN110125015A (en) * | 2019-05-10 | 2019-08-16 | 深圳市前海云途物流有限公司 | Method for sorting, device and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110245890B (en) | Goods sorting method and goods sorting system | |
| CN109978423B (en) | Inventory scheduling method, inventory scheduling device and computer-readable storage medium | |
| CN106934580B (en) | Inventory control method and device | |
| CN112978189B (en) | Goods taking task allocation method and goods sorting system thereof | |
| CN109544054B (en) | Inventory scheduling method, inventory scheduling device and computer-readable storage medium | |
| CN108398924B (en) | Scheduling method and scheduling device for robot transport vehicle | |
| CN109205163B (en) | Across tunnel Multilayer shuttle car warehousing system design method, system and storage medium | |
| CN109767151B (en) | Storage management method, device, medium and electronic equipment | |
| CN108043734B (en) | Simulation method of cross belt sorting system and readable storage medium | |
| CN110059900B (en) | Method and device for controlling transport vehicles in a warehouse | |
| CN113233068A (en) | Goods sorting method and device, computer equipment and storage medium | |
| JP2017521333A (en) | Parcel sorter system and method | |
| CN110175402A (en) | Vehicle component stowage and system | |
| CN110140139B (en) | Method for sorting loads in an automatic distribution system | |
| US20210192659A1 (en) | Warehouse management system and warehouse management method | |
| CN110390497B (en) | Article warehouse-in method and device | |
| CN110633926A (en) | Method, apparatus and system for handling work-bin and storage medium | |
| CN112278674A (en) | Scheduling method, device, equipment and storage medium | |
| Zou et al. | Robotic sorting systems: Performance estimation and operating policies analysis | |
| CN112371518A (en) | Article sorting system and method | |
| Xu et al. | Assignment of parcels to loading stations in robotic sorting systems | |
| CN113998352A (en) | Sorting scheduling method and device, electronic equipment, storage medium and warehousing system | |
| CN112580905A (en) | Cell equalization method and device | |
| WO2024060651A1 (en) | Electric power material distribution and allocation method based on optimized branch-and-bound method | |
| CN109657886B (en) | Distribution method and device of cargo flow and computer readable storage 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 |