# US 2020/0118049 A1 · High-density dynamic mail services

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

- Number: US 2020/0118049 A1
- Document ID: US20200118049A1
- Status: Published application
- Kind: A1
- Application number: 16/159,325
- Filed: 2018-10-12
- Published: 2020-04-16
- Earliest claimed: 2018-10-12
- Assignees: Ricoh Company, Ltd.
- Inventors: NICOLE BLOHM
- Web page: https://patentgrep.com/patent/US20200118049A1

## CPC

- G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202)
- G06Q 10/0631: Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q 10/0832: Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
- G06Q 10/0836: Recipient pick-ups
- G07B 17/00024: {Physical or organizational aspects of franking systems}
- G07B 17/00467: {Transporting mailpieces (postal sorting B07C)}
- G07B 2017/00072: {Hybrid mail, i.e. mail delivered using different physical means along the mail delivery path, e.g. email and envelope}
- G07B 2017/00483: {Batch processing of mailpieces}
- 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

In an embodiment, an apparatus comprises one or more processors and one or more memories communicatively coupled to the one or more processors and storing instructions which, when processed by the one or more processors, cause: evaluating historical mail fulfillment data for a plurality of physical mail items delivered to a plurality of recipients; dynamically assigning mail bins for the plurality of recipients based, at least in part, on the historical mail fulfillment data for the plurality of recipients; and distributing mail into the dynamically assigned mail bins for the plurality of recipients using the mail distribution mechanism.

## Claims

### Claim 1

An apparatus featuring an improved mail assignment and distribution system, comprising:
a mail distribution mechanism;
one or more processors communicatively coupled to the mail distribution mechanism; and
one or more memories communicatively coupled to the one or more processors and storing instructions which, when processed by the one or more processors, cause:
evaluating historical mail fulfillment data for a plurality of physical mail items delivered to a plurality of recipients;
dynamically assigning mail bins for the plurality of recipients based, at least in part, on the historical mail fulfillment data for the plurality of recipients; and
distributing mail into the dynamically assigned mail bins for the plurality of recipients using the mail distribution mechanism.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein one or more memories further store additional instructions which, when processed by the one or more processors, cause:
calculating an estimated next pick-up time period for one or more recipients from the plurality of recipients based on the historical mail fulfillment data for the plurality of recipients, and wherein dynamically assigning mail bins is based, at least in part, on the estimated next pick-up time period.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein one or more memories further store additional instructions which, when processed by the one or more processors, cause:
determining an optimal mail bin size based, at least in part, on an estimated next pick-up time for a particular participant from the plurality of recipients determined based on historical mail fulfillment data for the particular participant, and wherein dynamically assigning mail bins is based, at least in part, on the optimal mail bin size.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein one or more memories further store additional instructions which, when processed by the one or more processors, cause:
determining an optimal mail bin size based, at least in part, on an estimated next delivery time for a particular participant from the plurality of recipients based on the historical mail fulfillment data, and wherein dynamically assigning mail bins is based, at least in part, on the optimal mail bin size.

### Claim 5 (depends on 1)

The apparatus of claim 1, wherein one or more memories further store additional instructions which, when processed by the one or more processors, cause:
calculating a mail consolidation window using the historical mail fulfillment data, wherein the mail consolidation window comprises a time period for consolidating mail into a single mail bin for a particular participant from the plurality of recipients, and wherein dynamically assigning mail bins for the plurality of recipients is based, at least in part, on the mail consolidation window.

### Claim 6 (depends on 1)

The apparatus of claim 1, wherein the historical mail fulfillment data for the plurality of recipients comprises one or more of a historical pick-up time, a historical pick-up frequency, or a historical pick-up location, and wherein dynamically assigning mail bins is based, at least in part, on the historical pick-up time, the historical pick-up frequency, or the historical pick-up location.

### Claim 7 (depends on 1)

The apparatus of claim 1, wherein the historical mail fulfillment data for the plurality of recipients comprises: mail dimension data, mail weight data, mail quantity data, sender data, subscription data, or mail bin preference data, and wherein dynamically assigning mail bins is based, at least in part, on the mail dimension data, the mail weight data, the mail quantity data, the sender data, the subscription data, or the mail bin preference data.

### Claim 8

One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause:
evaluating historical mail fulfillment data for a plurality of physical mail items delivered to a plurality of recipients;
dynamically assigning mail bins for the plurality of recipients based, at least in part, on the historical mail fulfillment data for the plurality of recipients; and
distributing mail into the dynamically assigned mail bins for the plurality of recipients using a mail distribution mechanism.

### Claim 9 (depends on 8)

The one or more non-transitory computer-readable media of claim 8, further comprising additional instructions which, when processed by the one or more processors, cause:
calculating an estimated next pick-up time period for one or more recipients from the plurality of recipients based on the historical mail fulfillment data for the plurality of recipients, and wherein dynamically assigning mail bins is based, at least in part, on the estimated next pick- up time period.

### Claim 10 (depends on 8)

The one or more non-transitory computer-readable media of claim 8, further comprising additional instructions which, when processed by the one or more processors, cause:
determining an optimal mail bin size based, at least in part, on an estimated next pick-up time period for a particular participant from the plurality of recipients determined based on historical mail fulfillment data for the particular participant, and wherein dynamically assigning mail bins is based, at least in part, on the optimal mail bin size.

### Claim 11 (depends on 8)

The one or more non-transitory computer-readable media of claim 8, further comprising additional instructions which, when processed by the one or more processors, cause:
determining an optimal mail bin size based, at least in part, on an estimated next pick-up time for a particular participant from the plurality of recipients determined based on historical mail fulfillment data for the particular participant, and wherein dynamically assigning mail bins is based, at least in part, on the optimal mail bin size.

### Claim 12 (depends on 8)

The one or more non-transitory computer-readable media of claim 8, further comprising additional instructions which, when processed by the one or more processors, cause:
determining an optimal bin size based, at least in part, on an estimated next delivery time for each of the plurality of recipients based on the historical mail fulfillment data, and wherein dynamically assigning mail bins is based, at least in part, on the optimal bin size.

### Claim 13 (depends on 8)

The one or more non-transitory computer-readable media of claim 8, further comprising additional instructions which, when processed by the one or more processors, cause:
calculating a mail consolidation window using the historical mail fulfillment data, wherein the mail consolidation window comprises a time period for consolidating mail into a single mail bin for a particular participant from the plurality of recipients, and wherein dynamically assigning mail bins for the plurality of recipients is based, at least in part, on the mail consolidation window.

### Claim 14 (depends on 8)

The one or more non-transitory computer-readable media of claim 8, wherein the historical mail fulfillment data for the plurality of recipients comprises one or more of a historical pick-up time, a historical pick-up frequency, a historical pick-up location, mail dimension data, mail weight data, mail quantity data, sender data, subscription data, or bin preference data for each of the plurality of recipients, and wherein dynamically assigning mail bins is based, at least in part, on the historical pick-up time, the historical pick-up frequency, the historical pick-up location, the mail dimension data, the mail weight data, the mail quantity data, the sender data, the subscription data, or the bin preference data.

### Claim 15

A computer-implemented method providing an improved mail assignment and distribution system, comprising:
evaluating historical mail fulfillment data for a plurality of physical mail items delivered to a plurality of recipients;
dynamically assigning mail bins for the plurality of recipients based, at least in part, on the historical mail fulfillment data for the plurality of recipients; and
distributing mail into the dynamically assigned mail bins for the plurality of recipients using a mail distribution mechanism.

### Claim 16 (depends on 15)

The method of claim 15, further comprising:
calculating an estimated next pick-up time period for one or more recipients from the plurality of recipients based on the historical mail fulfillment data for the plurality of recipients, and wherein dynamically assigning mail bins is based, at least in part, on the estimated next pick-up time period.

### Claim 17 (depends on 15)

The method of claim 15, further comprising:
determining an optimal mail bin size based, at least in part, on an estimated next pick-up time for a particular participant from the plurality of recipients determined based on historical mail fulfillment data for the particular participant, and wherein dynamically assigning mail bins is based, at least in part, on the optimal mail bin size.

### Claim 18 (depends on 15)

The method of claim 15, further comprising:
determining an optimal bin size based, at least in part, on an estimated next delivery time for each of the plurality of recipients based on the historical mail fulfillment data, and wherein dynamically assigning mail bins is based, at least in part, on the optimal bin size.

### Claim 19 (depends on 15)

The method of claim 15, further comprising:
calculating a mail consolidation window using the historical mail fulfillment data, wherein the mail consolidation window comprises a time period for consolidating mail into a single mail bin for a particular participant from the plurality of recipients, and wherein dynamically assigning mail bins for the plurality of recipients is based, at least in part, on the mail consolidation window.

### Claim 20 (depends on 15)

The method of claim 15, wherein the historical mail fulfillment data for the plurality of recipients comprises one or more of a historical pick-up time, a historical pick-up frequency, a historical pick-up location, mail dimension data, mail weight data, mail quantity data, sender data, subscription data, or bin preference data for each of the plurality of recipients, and wherein dynamically assigning mail bins is based, at least in part, on the historical pick-up time, the historical pick-up frequency, the historical pick-up location, the mail dimension data, the mail weight data, the mail quantity data, the sender data, the subscription data, or the bin preference data.
