US5287271A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data processing system for optimized mail piece sorting and mapping to carrier walk sequence using real time statistical data
Assignee: International Business Machines Corp
•
Filing: 1991-08-22
•
Granted: 1994-02-15
•
Expires: 2011-08-22
Abstract
Abstract A data processing system, method and program are disclosed to optimize mail piece sorting and the mapping of mail down to the carrier walk sequence using real time statistical data. The invention makes use of techniques such as fast OCR devices at a sending location or deferred processing of OCR scanned mail, to accumulate volume statistics indicating the number of mail pieces being routed particular addressees at a destination postal region on a given day. The information for mail volumes being directed to a particular postal region are collected over data communications links prior to the receipt of the actual mail pieces. The efficiency of sorting is maximized at the destination postal region by organizing the sorting apparatus to remove the highest volume addressee's mail first. This requires the compilation of the real time volume statistics from all of the sending postal regions sending mail to the destination postal location. In this manner, the maximum number of letters on every pass through the sorting apparatus can be achieved at the destination location. This minimizes the total number of reading operations required in order to achieve a desired level of mail sorting separation. Because the mail volume statistics are available at the destination location prior to sorting, at each stage of the sorting operations, bin allocation can be customized to yield the highest final patron or addressee sort. In this manner, the time for every subsequent pass through the sorting apparatus is reduced. This enables sorting directly to the addressee level and the distribution of the mail down to carrier walk sequence.
Inventors
- 👤 Walter S. Rosenbaum
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 15:38
CPC Classifications
B; B07; B07C; B07C3/00; G; G06; G06Q; G06Q10/00; G06Q10/06; G06Q10/063; G06Q10/0631; G06Q10/06311; G06Q10/06316; G06Q99/00
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
180 words
A data processing system to optimize the sorting of mail, comprising: a data communications receiver at a destination postal region, connected to a data communications network, for receiving addressee data for mail pieces to be delivered to said destination postal region; a data processor coupled to said data communications receiver, for processing said addressee data to compute addressee volume values for mail addressed to addressees at said destination postal region; a mail piece sorter coupled to said data processor, having a plurality of pockets, said data processor assigned individual ones of said pockets to respective ones of said addressees in an order related to said addressee volume values; said mail piece sorter having a plurality of M pockets, said data processor assigning a subplurality of N of said pockets to N addresses having the N highest addressee volume values; said data processor assigning an additional pocket of said plurality of M pockets for mail pieces addressed to a second plurality addressees who have addressee volume values less than those of said N addressees having the N highest addressee volume values.
Claim 2
Dependent Claim
180 words
A data processing system to optimize the sorting of mail, comprising: a data communications receiver at a destination postal region, connected to a data communications network, for receiving addressee data for mail pieces to be delivered to said destination postal region; a data processor coupled to said data communications receiver, for processing said addressee data to compute addressee volume values for mail addressed to addressees at said destination postal region; a mail piece sorter coupled to said data processor, having a plurality of pockets, said data processor assigned individual ones of said pockets to respective ones of said addressees in an order related to said addressee volume values; said mail piece sorter having a plurality of M pockets, said data processor assigning a subplurality of N of said pockets to N addresses having the N highest addressee volume values; said data processor assigning an additional pocket of said plurality of M pockets for mail pieces addressed to a second plurality addressees who have addressee volume values less than those of said N addressees having the N highest addressee volume values.
Claim 3
Dependent Claim
86 words
The data processing system of claim 1, which further comprises: a code reading device coupled to said data processor, for reading a code on each of said mail pieces representing said addressee data; said data processor further sorting said second plurality of addressees by reading said code on a second subplurality of said mail pieces with said code reading device and assigning one of said M pockets to one of said second plurality of addressees having the largest magnitude addressee volume value in said second subplurality.
Claim 4
Dependent Claim
91 words
The data processing system of claim 1, which further comprises: a code reading device coupled to said data processor, for reading a code on each of said mail pieces representing said addressee data; said data processor further sorting said second plurality of addressees by reading said code on a second subplurality of said mail pieces with said code reading device and assigning one of said M pockets to one of said second plurality of addressees having the greatest quantity of mail pieces proximate to said code reading device, in said subplurality.
Claim 5
Dependent Claim
62 words
The data processing system of claim 1, which further comprises: a second code reading device coupled to said data processor, for reading said code on one of said mail pieces in a packet of mail pieces in one of said pockets; said data processor receiving said code from said second code reading device and computing a carrier route assignment for said packet.
Claim 6
Dependent Claim
73 words
The data processing system of claim 1, which further comprises: said data processor computing a carrier route assignment for a packet of said mail pieces in one of said pockets addressed to an addressee; a workstation coupled to said data processor, including a second code reading device, for reading said code on one of said mail pieces in said packet and assigning said packet to a carrier walk sequence in said carrier route.
Claim 7
Dependent Claim
112 words
The data processing system of claim 1, which further comprises: said data processor computing a carrier route assignment for a packet of said mail pieces in one of said pockets addressed to an addressee; a workstation coupled to said data processor, including a second code reading device, for reading said code on one of said mail pieces n said packet; a sorting case having indicators coupled to said workstation, for receiving signals from said workstation indicating said packet; said workstation assigning said packet to a carrier walk sequence in said carrier route and manifesting said carrier walk sequence by signalling one of said indicators proximate to said packet in said sorting case.
Claim 8
Dependent Claim
177 words
The data processing system of claim 1, which further comprises: said data processor computing a carrier route assignment for a packet of said mail pieces in one of said pockets addressed to an addressee; a workstation coupled to said data processor, including a second code reading device, for reading said code on one of said mail pieces in said packet; a plurality of last in, first out stacks for arranging a plurality of packets from said pockets into segments of said carrier route, said data processor computing which one of said plurality of stacks corresponds to a segment of said route for said packet; a sorting case for arranging a plurality of packets transferred from one of said plurality of stacks into a carrier walk sequence, said case having indicators coupled to said workstation, for receiving signals from said workstation indicating said packet; said workstation assigning said packet to a carrier walk sequence in said carrier route and manifesting said carrier walk sequence by signalling one of said indicators proximate to said packet in said sorting case.
Claim 9
Dependent Claim
178 words
A data processing method to optimize the sorting of mail, comprising the steps of: receiving in a data communications receiver at a destination postal region, connected to a data communications network, addressee data for mail pieces to be delivered to said destination postal region; processing in a data processor coupled to said data communications receiver, said addressee data to compute addressee volume values for mail addressed to addressees at said destination postal region; assigning with said data processor, individual ones of a plurality of pockets in a mail piece sorter, to respective ones of said addressees in an order related to said addressee volume values; said mail piece sorter having a plurality of M pockets, said data processor assigning a subplurality of N of said pockets to N addressees having the N highest addressee volume values; and said data processor assigning an additional pocket of said plurality of M pockets for mail pieces addressed to a second plurality addressees who have addressee volume values less than those of said N addressees having the N highest addressee volume values.
Claim 10
Dependent Claim
178 words
A data processing method to optimize the sorting of mail, comprising the steps of: receiving in a data communications receiver at a destination postal region, connected to a data communications network, addressee data for mail pieces to be delivered to said destination postal region; processing in a data processor coupled to said data communications receiver, said addressee data to compute addressee volume values for mail addressed to addressees at said destination postal region; assigning with said data processor, individual ones of a plurality of pockets in a mail piece sorter, to respective ones of said addressees in an order related to said addressee volume values; said mail piece sorter having a plurality of M pockets, said data processor assigning a subplurality of N of said pockets to N addressees having the N highest addressee volume values; and said data processor assigning an additional pocket of said plurality of M pockets for mail pieces addressed to a second plurality addressees who have addressee volume values less than those of said N addressees having the N highest addressee volume values.
Claim 11
Dependent Claim
89 words
The data processing method of claim 8, which further comprises the steps of: reading with a code reading device coupled to said data processor, a code on each of said mail pieces representing said addressee data; said data processor further sorting said second plurality of addressees by reading said code on a second subplurality of said mail pieces with said code reading device and assigning one of said M pockets to one of said second plurality of addressees having the largest magnitude addressee volume value in said second subplurality.
Claim 12
Dependent Claim
94 words
The data processing method of claim 8, which further comprises the steps of: reading with a code reading device coupled to said data processor, a code on each of said mail pieces representing said addressee data; said data processor further sorting said second plurality of addressees by reading said code on a second subplurality of said mail pieces with said code reading device and assigning one of said M pockets to one of said second plurality of addressees having the greatest quantity of mail pieces proximate to said code reading device, in said subplurality.
Claim 13
Dependent Claim
65 words
The data processing method of claim 8, which further comprises the steps of: reading with a second code reading device coupled to said data processor, said code on one of said mail pieces in a packet of mail pieces in one of said pockets; said data processor receiving said code from said second code reading device and computing a carrier route assignment for said packet.
Claim 14
Dependent Claim
57 words
The data processing method of claim 8, which further comprises the steps of: said data processor computing a carrier route assignment for a packet of said mail pieces in one of said pockets addressed to an addressee; assigning with a workstation coupled to said data processor, said packet to a carrier walk sequence in said carrier route.
Claim 15
Dependent Claim
98 words
The data processing method of claim 8, which further comprises the steps of: said data processor computing a carrier route assignment for a packet of said mail pieces in one of said pockets addressed to an addressee; reading with a second code reading device, said code on one of said mail pieces in said packet; receiving signals at a sorting case having indicators indicating said packet; assigning said packet to a carrier walk sequence in said carrier route and manifesting said carrier walk sequence by signalling one of said indicators proximate to said packet in said sorting case.
Claim 16
Dependent Claim
146 words
The data processing method of claim 8, which further comprises the steps of: said data processor computing a carrier route assignment for a packet of said mail pieces in one of said pockets addressed to an addressee; reading said code on one of said mail pieces in said packet; arranging a plurality of packets from said pockets into segments of said carrier route, said data processor computing which one of a plurality of stacks corresponds to a segment of said route for said packet; arranging a plurality of packets transferred from one of said plurality of stacks into a carrier walk sequence, in a sorting case having indicators for receiving signals indicating said packet; assigning said packet to a carrier walk sequence in said carrier route and manifesting said carrier walk sequence by signalling one of said indicators proximate to said packet in said sorting case.
Claim 17
Dependent Claim
262 words
A data processing method to optimize the sorting of mail, comprising the steps of: receiving in a data communications receiver at a destination postal region, connected to a data communications network, addressee data for mail pieces to be delivered to said destination postal region; processing in a data processor coupled to said data communications receiver, said addressee data to compute addressee volume values for mail addressed to addressees at said destination postal region; assigning with said data processor, individual ones of a plurality of M pockets in a mail piece sorter, to respective ones of said addressees in an order related to said addressee volume values; said data processor assigning a subplurality of N of said M pockets to a first plurality of N addresses having the N highest addressee volume values; said data processor assigning an additional pocket of said plurality of M pockets for mail pieces addressed to a second plurality addressees who have addressee volume values less than those of said N addressees having the N highest addressee volume values; sorting with said sorter, a first group of said mail pieces addressed to said first plurality of addressees, into said subplurality of N pockets and sorting a second group of said mail pieces addressed to said second plurality of addressees, into said additional pocket; said data processor assigning said subplurality of N pockets to at least a portion of said second plurality of addressees; and sorting with said sorter, said second group of said mail pieces addressed to said second plurality of addressees, into said subplurality of N pockets.
Claim 18
Dependent Claim
262 words
A data processing method to optimize the sorting of mail, comprising the steps of: receiving in a data communications receiver at a destination postal region, connected to a data communications network, addressee data for mail pieces to be delivered to said destination postal region; processing in a data processor coupled to said data communications receiver, said addressee data to compute addressee volume values for mail addressed to addressees at said destination postal region; assigning with said data processor, individual ones of a plurality of M pockets in a mail piece sorter, to respective ones of said addressees in an order related to said addressee volume values; said data processor assigning a subplurality of N of said M pockets to a first plurality of N addresses having the N highest addressee volume values; said data processor assigning an additional pocket of said plurality of M pockets for mail pieces addressed to a second plurality addressees who have addressee volume values less than those of said N addressees having the N highest addressee volume values; sorting with said sorter, a first group of said mail pieces addressed to said first plurality of addressees, into said subplurality of N pockets and sorting a second group of said mail pieces addressed to said second plurality of addressees, into said additional pocket; said data processor assigning said subplurality of N pockets to at least a portion of said second plurality of addressees; and sorting with said sorter, said second group of said mail pieces addressed to said second plurality of addressees, into said subplurality of N pockets.
Claim 19
Dependent Claim
63 words
The data processing method of claim 15, which further comprises the steps of: reading with a code reading device coupled to said data processor, a code on one of said mail pieces in a packet of mail pieces in one of said pockets; said data processor receiving said code from said code reading device and computing a carrier route assignment for said packet.
Claim 20
Dependent Claim
57 words
The data processing method of claim 15, which further comprises the steps of: said data processor computing a carrier route assignment for a packet of said mail pieces in one of said pockets addressed to an addressee; assigning with a workstation coupled to said data processor, said packet to a carrier walk sequence in said carrier route.
Claim 21
Dependent Claim
113 words
The data processing method of claim 15, which further comprises the steps of: said data processor computing a carrier route assignment for a packet of said mail pieces in one of said pockets addressed to an addressee; reading with a code reading device coupled to said data processor, a code on one of said mail pieces in said packet; receiving signals at a sorting case coupled to said data processor, said case having indicators indicating said packet; assigning said packet to a carrier walk sequence in said carrier route with said data processor, and manifesting said carrier walk sequence by signalling one of said indicators proximate to said packet in said sorting case.
References Cited (Backward Citations)
EP0095737A2
Cited
US4632252A
Cited
US4832204A
Cited
US5005124A
Cited
US5077694A
Cited
US5051914A
Cited
US5068797A
Cited
US5072401A
Cited
US5031223A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-02-14 | 1997-08-16 | 1998-02-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-02-14 | 2001-08-16 | 2002-02-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-02-14 | 2005-08-16 | 2006-02-15 | $7700.00 | Window Closed / Lapsed |