# US 2004/0083190 A1 · Method and apparatus for delivering mail items to non-postal route locations

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

- Number: US 2004/0083190 A1
- Document ID: US20040083190A1
- Status: Published application
- Kind: A1
- Application number: 10/687,772
- Filed: 2003-10-20
- Published: 2004-04-29
- Earliest claimed: 2000-01-21
- Inventors: Michael R. Sanders
- Web page: https://patentgrep.com/patent/US20040083190A1

## CPC

- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G07B 17/00024: {Physical or organizational aspects of franking systems}
- G07B 17/00435: {Details specific to central, non-customer apparatus, e.g. servers at post office or vendor}
- G07B 2017/00032: {Determining the location of apparatus}
- 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
- G07B: TICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS

## Abstract

A data structure for storing non-postal route data records for access by a sortation program including a non-postal route data table containing a plurality of non-postal route data sets; a destination data table containing a plurality of destination data sets corresponding to the one or more non-postal route data sets, each non-postal route data set having a link to the corresponding destination data sets of said destination data table. Each destination data set includes a sequence designation indicating an order of delivery of materials between the plurality of destinations. A delivery point data table containing one or more delivery point data sets corresponds to each destination data set, each destination data set having a link to the corresponding delivery point data set of said delivery point data table.

## Claims

### Claim 1

A computer readable medium containing a data structure for storing non-postal route data records for access by a sortation program comprising:
a non-postal route data table containing a plurality of non-postal route data sets;
a destination data table containing a plurality of destination data sets corresponding to the one or more non-postal route data sets, each non-postal route data set having a link to the corresponding destination data sets of said destination data table, each destination data set including a sequence designation indicating an order of delivery of materials between the plurality of destinations; and
a delivery point data table containing one or more delivery point data sets corresponding to each destination data set, each destination data set having a link to the corresponding delivery point data set of said delivery point data table.

### Claim 2 (depends on 1)

The computer readable medium of claim 1 wherein each delivery point data set includes delivery point sequence data that indicates an order of delivery of materials between multiple delivery points.

### Claim 3 (depends on 2)

The computer readable medium of claim 2 wherein each delivery point data set includes all delivery points within a destination of the corresponding destination data set and the delivery point sequence data includes sequence designations corresponding to each delivery point.

### Claim 4 (depends on 2)

The computer readable medium of claim 2 wherein each delivery point data set includes a range of delivery points and the delivery point sequence data includes a sequence designation corresponding to the range of delivery points.

### Claim 5 (depends on 1)

The computer readable medium of claim 1 wherein each destination data set includes a destination address.

### Claim 6 (depends on 5)

The computer readable medium of claim 5 wherein each destination data set includes a shipping address.

### Claim 7 (depends on 5)

The computer readable medium of claim 5 wherein the shipping address is different from the destination address.

### Claim 8 (depends on 5)

The computer readable medium of claim 5 wherein each destination data set includes the name of the destination.

### Claim 9 (depends on 5)

The computer readable medium of claim 5 wherein each destination data set includes an alias for the destination.

### Claim 10 (depends on 1)

The computer readable medium of claim 1 wherein the non-postal route data sets include identification data comprising the name and address of the non-postal route location.

### Claim 11 (depends on 1)

The computer readable medium of claim 1 wherein the non-postal route data sets include a nickname for the non-postal route location.

### Claim 12

A data processing system for executing an extraction program for extracting non-postal route mail records from among a plurality of input mail records, said data processing system comprising:
a processor for processing said extraction program; and
a medium readable by said processor for storing a data structure for access by said extraction program, said data structure including:
a non-postal route data table containing a plurality of non-postal route data sets;
a destination data table containing a plurality of destination data sets corresponding to the one or more non-postal route data sets, each non-postal route data set having a link to the corresponding destination data sets of said destination data table, each destination data set including a sequence designation indicating an order of delivery of materials between the plurality of destinations; and
a delivery point data table containing one or more delivery point data sets corresponding to each destination data set, each destination data set having a link to the corresponding delivery point data sets of said delivery point data table.
