# US 2011/0066572 A1 · System and method for sorting items

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2011/0066572 A1
- Document ID: US20110066572A1
- Status: Published application
- Kind: A1
- Application number: 12/949,342
- Filed: 2010-11-18
- Published: 2011-03-17
- Earliest claimed: 2008-03-07
- Assignees: Engineering Innovation, Inc.
- Inventors: Ronald Robbins
- Web page: https://patentgrep.com/patent/US20110066572A1

## CPC

- B07C 3/00: Sorting according to destination {(collating the pages of a book B42C1/00)}
- B07C 5/00: Sorting according to a characteristic or feature of the articles or material being sorted, e.g. by control effected by devices which detect or measure such characteristic or feature; Sorting by manually actuated devices, e.g. switches (sorting by hand only B07C7/00; separating solids from solids by sieving, screening, or sifting or by using gas currents or other separating by dry methods applicable to bulk material B07B)
- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- B07C 7/00: Sorting by hand only {e.g. of mail}
- B07C: POSTAL SORTING; SORTING INDIVIDUAL ARTICLES, OR BULK MATERIAL FIT TO BE SORTED PIECE-MEAL, e.g. BY PICKING (specially adapted for a specific purpose covered by another class, see the relevant place, e.g. A43D33/06, B23Q7/12)
- 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

## Abstract

Disclosed is a system and method of dynamically sorting items for delivery to diverse destinations in which at least one target location changes during the sorting process using an electronic array that correlates diverse destinations to target locations for sorting, wherein the electronic array changes based upon criteria relating to the results of the sort resulting in the removal of a first set of items from one target location while leaving a second set in the target location and placing the first set in another target location to adapt to the changed array and thereafter continuing to sort further items according to the changed array while some items remain in their initial target locations. Additionally disclosed is a system and method of sorting which electronically identifies items destined for the same address that are comingled with items to diverse destinations, and allows for their separation and bundling responsive to the electronic identification and allows for payment for delivery charges based upon a bundle rather than the individual items included in the bundle.

## Claims

### Claim 1

A method of dynamically sorting items for delivery to diverse destinations in which at least one target location changes during the sorting process comprising the steps of:
(a) establishing a first electronic array correlating diverse destinations for items to first target locations;
(b) sorting a first number of items into the first target locations;
(c) based upon criteria relating to the results of the first sort,
(1) changing the array, and
(2) removing items from one of the first target locations that encompasses a first and second subset and placing items from said first subset in another target location to adapt to the changed array; and
(d) thereafter continuing sorting further items according to the changed array, while first sorted items in said second subset remain in their initial target locations until either the sort has reached a stopping point or there has been a subsequent array change involving said second subset.

### Claim 2 (depends on 1)

The method of claim 1, in which said establishing and sorting are concurrent.

### Claim 3 (depends on 1)

The method of claim 1, in which the criteria is a function based upon a variable selected from the group consisting of number of items, weight, linear dimension, two dimensional area, volume, postal category, requested delivery time, thickness in trays or height in tubs.

### Claim 4 (depends on 3)

The method of claim 3, in which the criteria is a number of items.

### Claim 5 (depends on 4)

The method of claim 4, in which the number of items is ten.

### Claim 6 (depends on 1)

The method of claim 1, in which the items are pieces of mail, the method further comprising the step of:
(e) generating a manifest mailing report that identifies each piece of mail by a unique identifier and a discount postage rate, wherein the discount postage rate is a function of a zip density of each piece of mail, wherein the target locations include at least two zip densities.

### Claim 7 (depends on 6)

The method of claim 6, wherein the discount postage rate is also a function of the weight of each piece of mail.

### Claim 8 (depends on 7)

The method of claim 7, further comprising the step of:
(g) generating a customer billing summary that identifies a total postage for a customer, wherein the total postage is a function of the discount postage rate for each piece of mail from the customer.

### Claim 9 (depends on 1)

The method of claim 1, in which the items are pieces of mail, the method further comprising the steps of:
(h) labeling each piece of mail with a sort routing number corresponding to the target location for each piece of mail;
(i) presorting each piece of mail to territory bins corresponding to a multitude of target locations; and
(j) manually sorting each piece of mail to target locations from each territory bin.

### Claim 10 (depends on 1)

The method of claim 1, further comprising the steps of:
(k) labeling each item with a sort routing number corresponding to the target location for each item; and
(l) labeling each item that resulted in changing the array with the sort routing number corresponding to the first target location of such items.

### Claim at position 11

11-16. (canceled)

### Claim 17

A method of dynamically sorting flats for delivery to diverse zip break locations in which at least one target zip break location changes during the sorting process, the method comprising the steps of:
(a) establishing an electronic array of zip break locations;
(b) sorting flats into the zip break locations;
(c) based upon a computer identifying a target number of flats destined to a subsidiary zip break being reached,
(1) changing the electronic array of zip break locations to include the subsidiary zip break as a new zip break location,
(2) removing flats from one of the zip break locations and placing those flats in the new zip break location;
(d) thereafter sorting further flats according to the changed array, while some flats remain in the originally established zip break locations until either the sort has reached a stopping point or there has been a subsequent array change involving said second subset.

### Claim 18 (depends on 17)

The method of claim 17, further comprising the step of:
(e) the computer generating a manifest mailing report that identifies each flat by a unique identifier and a discount postage rate, wherein the discount postage rate is a function of a zip density for each flat, wherein the zip break locations include at least two zip densities.

### Claim 19 (depends on 18)

The method of claim 18, further comprising the step of:
(f) the computer generating a customer billing summary that identifies a total postage for a customer, wherein the total postage is a function of discount postage rate for each flat from the customer.

### Claim 20 (depends on 17)

The method of claim 17, further comprising the steps of:
(g) automatically labeling each flat with a sort routing number corresponding to the zip break locations;
(h) presorting each flat to territory bins corresponding to a multitude of zip break locations;
(i) manually sorting each flat from the territory bins to the zip break locations; and
(j) automatically labeling each flat that equals the target number of flats destined to the subsidiary zip break with the sort routing number corresponding to the original zip break location of the other flats destined to the subsidiary zip break.

### Claim 21

A method of sorting items for delivery to diverse destinations, at least two items of which are for delivery to the same destination, comprising the steps of:
(a) establishing an electronic array correlating diverse destinations for items to target locations;
(b) sorting a number of items into the target locations according to the electronic array;
(c) during the sorting, electronically detecting whether there is a group of items being sorted in which each item is for delivery to the same child destination, and separating such a child destination group from the other items being sorted in response to the electronic detection, wherein the electronically detecting occurs at least in part while the sorting process is continuing,
(d) bundling the destination group of items for delivery to the same destination, and
(e) electronically calculating a delivery fee based upon the bundled group, rather than upon the individual items within the group.

### Claim 22 (depends on 21)

The method of claim 21 wherein the items are pieces of mail and the destinations are street addresses or post office boxes and the delivery fee is postage.

### Claim 23 (depends on 21)

The method of claim 21 wherein when the presence of a child destination group is detected, items previously sorted to the same child destination are removed from their position in the electronic array to a new position to which subsequently detected members of that child destination group are placed.

### Claim 24 (depends on 21)

The method of claim 21 in which the separation of items that are in a child destination group occurs while the other aspect of the sorting process is continuing.

### Claim 25

A method of dynamically sorting flats for delivery to diverse zip break locations, the method comprising:
establishing an electronic array correlating diverse zip break locations to target locations;
inputting address information for flats into a computer;
electronically determining the target locations for flats based on the electronic array;
outputting target location information for flats;
sorting flats to target locations based on the outputted target location information;
while determining the target location for flats based on the electronic array, with the computer, dynamically evaluating the already sorted flats to determine whether a target number of flats addressed to a common child zip break exist in a parent target location, if so, then changing the electronic array to create a new child target location containing a subset of flats each addressed to the common child zip break while keeping the parent target location as part of the electronic array;
outputting information as to flats to be relocated to the new child target location to corresponded to the changed electronic array; and
relocating flats addressed to the common child zip break in the parent target location to the child target location.

### Claim 26 (depends on 25)

The method of claim 25, further comprising:
labeling each flat with a bin identifier; and
sorting each flat into a bin based on the bin identifier.

### Claim 27 (depends on 26)

The method of claim 26, further comprising relabeling flats already labeled with the parent target location with a new bin identifier corresponding to the changed array.

### Claim 28 (depends on 26)

The method of claim 26, further comprising:
labeling each flat with a territory identifier;
sorting each flat into a territory bin; and
transporting the territory bin to a territory including a plurality of bins each corresponding to a target location.

### Claim 29 (depends on 28)

The method of claim 28, wherein the plurality of bins include stacked rows of bins arranged in rows of ten.

### Claim 30 (depends on 25)

The method of claim 25, further comprising:
the computer generating a manifest mailing report that identifies each flat by a unique identifier and a discount postage rate, wherein the discount postage rate is a function of a zip density for each flat, wherein the zip break locations include at least two zip densities.

### Claim 31 (depends on 25)

The method of claim 25, further comprising:
the computer generating a customer billing summary that identifies a total postage for a customer, wherein the total postage is a function of discount postage rate for each flat from the customer.
