In-Memory Postal Presorting Algorithm
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems for postal presorting are inefficient in sorting large mailing lists into presort levels, requiring excessive time due to reliance on disk-based algorithms and being impractical for sequential or random lists.
Innovation Solution
A computer system uses an algorithm to create a table of zip code occurrences, allocates addresses to containers based on presort levels, and directly addresses or labels mail pieces for efficient sorting, predominantly operating in internal memory to minimize time and maximize presort level discounts.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If disk-based algorithms are used to sort mailing lists into presort levels, then the system can handle large mailing lists, but the sorting time becomes excessively long
Solution Approach 1:
The patent replaces the mechanical disk-based sorting system with an in-memory processing system. The computer system loads the mailing list into internal memory and processes it there, eliminating the need for disk I/O operations during the sorting process. This substitution of the storage medium and processing location dramatically reduces sorting time while maintaining the ability to handle large mailing lists.
Solution Approach 2:
The patent performs preliminary actions by pre-processing the mailing list data into a compressed format that can be efficiently processed in memory. The system creates a condensed representation of the mailing list that retains all necessary sorting information while reducing the amount of data that needs to be processed, thereby accelerating the sorting operation.
2Measurement precision
If individual mail pieces are scanned and sorted using optical character recognition, then presort levels can be determined, but the process becomes too time intensive for large mailings
Solution Approach 1:
The patent creates a digital copy or representation of the mailing list data that can be processed without physically handling each mail piece. Instead of scanning individual pieces, the system works with a digital replica of the mailing list, enabling rapid processing while maintaining accurate presort level determination.
Solution Approach 2:
The patent performs preliminary data preparation by pre-processing the mailing list into a format optimized for rapid processing. The system creates a compressed, in-memory representation of the mailing list that can be quickly analyzed to determine presort levels without the need for time-consuming individual piece scanning.
3Adaptability or versatility
If a sequential or random mailing list is processed, then the system can handle various list types, but the sorting efficiency decreases significantly
Solution Approach 1:
The patent implements a dynamic processing approach that adapts to different mailing list types (sequential, random, or a mix) while maintaining high sorting efficiency. The system dynamically adjusts its processing strategy based on the input list characteristics, using in-memory algorithms that can handle any list type without requiring pre-sorting or significant time penalties for random ordering.
Data Source
AI summary
A computer system utilizes an algorithm that: (a) prepares a table that includes counts of zip code occurrences in a mailing list; (b) prepares a container list that allocates counts to different containers; (c) uses the container list to allocate individual addresses to different mailing containers; and (d) addresses the mailing pieces (directly or by labels) according to the addresses associated with the various containers. Such configurations can advantageously decrease the time required to sort an extremely large mailing into mailing containers according to postal presort levels, among other things by performing the above steps predominantly in the internal memory of the computer system.