Item sorting with delivery point compression
US-11548035-B2 · Jan 10, 2023 · US
US11833548B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11833548-B2 |
| Application number | US-202218061404-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 2, 2022 |
| Priority date | Jul 26, 2019 |
| Publication date | Dec 5, 2023 |
| Grant date | Dec 5, 2023 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Systems and methods for sorting items for delivery to delivery points, using delivery point compression. Items can be sorted and sequenced for delivery by a sorting machine having a finite number of sorting destinations. For routes having more delivery points than the number of sorting destinations, delivery point compression allows sorting destination assignments that eliminate delivery points not likely to receive any items. Sorting destination assignments can be performed by a processor of the sorting machine based on expected item information and delivery point item frequency scores.
Opening claim text (preview).
What is claimed is: 1. A method for delivery point compression, the method comprising: receiving, for a set of delivery points, expected item information including item information associate with a set of expected items; determining, based on the item information, a set of expected delivery points to which the set of expected items are to be delivered; determining, for an item sorting apparatus, a set of sorting destinations; determining a set of prioritized delivery points from the set of delivery points; and assigning each of the set of prioritized delivery points to one of the set of sorting destinations. 2. The method of claim 1 , wherein determining the set of prioritized delivery points is based on whether a quantity of the set of expected delivery points exceeds a quantity of sorting destinations in the item sorting apparatus. 3. The method of claim 1 , wherein determining the set of prioritized delivery points is based on an indication that the item sorting apparatus should conduct an efficient sorting batch. 4. The method of claim 1 , wherein determining the set of prioritized delivery points comprises determining an item frequency score associated with the delivery point. 5. The method of claim 4 , wherein determining the item frequency score comprises determining a historical average of items delivered to the delivery point. 6. The method of claim 1 , wherein determining the set of prioritized delivery points comprises comparing an item frequency score with a threshold value. 7. The method of claim 1 , further comprising: determining whether each of the set of prioritized delivery points is included in the set of expected delivery points; and where one of the prioritized delivery points is not included in the set of expected delivery points, determining whether the set of sorting destinations has an available additional sorting destination. 8. The method of claim 1 , further comprising: determining the set of sorting destinations has no available additional sorting destinations; removing a low probability delivery point from the set of expected delivery points; and inserting the prioritized delivery point into the set of expected delivery points. 9. The method of claim 8 , wherein the low probability delivery point is one of the expected delivery points that is associated with an item frequency score below a threshold value. 10. The method of claim 1 , wherein assigning each of the set of prioritized delivery points to one of the set of sorting destinations comprises: determining whether each of the set of prioritized delivery points is included in the set of expected delivery points; and where one of the prioritized delivery points is not included in the set of expected delivery points, inserting the prioritized delivery point into the set of expected delivery points. 11. The method of claim 10 , wherein inserting the prioritized delivery point into the set of expected delivery points further comprises: determining whether the set of sorting destinations has an available additional sorting destination; and where the set of sorting destination has no available additional sorting destination, removing a low probability delivery point from the set of expected delivery points. 12. A system for delivery point compression comprising: a memory storing a set of delivery points and expected item information for the set of delivery points; an item sorting apparatus; and a processor in communication with the memory and the item sorting apparatus, the processor configured to: receive, from the memory, the expected item information, including item information associated with a set of expected items, determine, based on the item information, a set of expected delivery points to which the set of expected items are to be delivered, determine, for the item sorting apparatus, a set of sorting destinations, determine a set of prioritized delivery points from the set of delivery points, assign each of the set of prioritized delivery points to one of the set of sorting destinations, and cause the item sorting apparatus to sort a batch of items based on the assignment of the set or prioritized delivery points. 13. The system of claim 12 , wherein the processor is further configured to determine the set of prioritized delivery points based on whether a quantity of the set of expected delivery points exceeds a quantity of sorting destinations in the item sorting apparatus. 14. The system of claim 12 , wherein the processor is further configured to determine the set of prioritized delivery points based on an indication that the item sorting apparatus should conduct an efficient sorting batch. 15. The system of claim 12 , wherein the processor is further configured to determine the set of prioritized delivery points by determining an item frequency score associated with the delivery point. 16. The system of claim 15 , wherein the processor is further configured to determine the item frequency score by determining a historical average number of items delivered to the delivery point. 17. The system of claim 12 , wherein the processor is further configured to determine the set of prioritized delivery points by comparing an item frequency score with a threshold value. 18. The system of claim 12 , wherein the processor is further configured to: determine whether each of the set of prioritized delivery points is included in the set of expected delivery points; and where one of the prioritized delivery points is not included in the set of expected delivery points, determine whether the set of sorting destinations has an available additional sorting destination. 19. The system of claim 18 , wherein the processor is further configured to: where the set of sorting destination has no available additional sorting destination, remove a low probability delivery point from the set of expected delivery points; insert the prioritized delivery point into the set of expected delivery points; and assign each of the set of expected delivery points to one of the set of sorting destinations. 20. The system of claim 19 , wherein the low probability delivery point is one of the expected delivery points that is associated with an item frequency score below a threshold value.
Electric or electronic control circuits, e.g. delay lines (delay devices per se H03H7/30, H03H11/26) · CPC title
Means for collecting objects, e.g. containers for sorted mail items (pile receivers in general B65H31/00) · CPC title
Sorting according to destination {(collating the pages of a book B42C1/00)} · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.