The present invention relates generally to mail sortation, and more particularly to scheduling of mail sortation.
Postal services are held accountable for achieving certain service levels of performance, and one particularly important criterion is on-time delivery. Postal services typically measure their on-time delivery performance by assessing the effectiveness of both the sorting system, and the delivery operations. In many countries, the target is 97% to 98% of first class mail delivered within one day of receipt by the postal service (hereinafter “the post”). Typically, the targets for standard class mail are less challenging: for example, 95% of mail delivered within three to five days of receipt by the post.
In centralized postal sorting systems, mail is usually passed through automated sorting systems multiple times. The United States Postal Service (USPS), for example, has invested in sufficient sorting equipment to be able to sort 80% of letter mail to delivery sequence before it leaves a centralized sorting facility. To accomplish this level of sorting, often the mail will be passed through the sorters between four and six times. Because the delivery commitments for first class mail are so demanding, the first class mail is generally sorted as soon as it is available. In typical centralized sorting operations, once the first class mail has been sorted, the operators will sort as much standard class mail as they can within the time periods available for sorting.
After the last pass through the sorters, the mail must be placed in mail trays and loaded onto trucks by the deadline for dispatching the mail to the delivery offices. Typically this deadline for dispatch is between 4:00 and 6:30 A.M., depending upon the distance of the delivery offices from the centralized sorting facility. If the mail is late being dispatched from the centralized sorting facility, it often arrives much later at the delivery offices, due to delays caused by rush hour traffic. So, the posts tend to be fairly rigid in insuring that the mail is on the truck and on the way to the delivery offices no later than the established dispatch deadlines.
The problem is determining how much standard mail the operators should mix in with the first class mail during the multiple sorting operations. Sometimes, this mixing of standard mail with first class mail is limited to the last two passes through the sorting machines. And, because the performance of the sorter is somewhat affected by the type of mail being fed, and the skill of the operators, the ability to predict the total time to complete each pass through the sorters is an approximation based on experience of the operators and supervisors. Supervisors will occasionally get that approximation wrong, due to variables that they cannot control, and they consequently miss the dispatch deadline, or will need to dispatch some portion of the mail before it is completely sorted. These uncontrollable variables include the skill and efficiency of the operator, the number of jams and other shutdowns of the sorting equipment, and variables in the mail itself, such as the thickness and size of the mail pieces. In order to minimize the possibility of missing the dispatch deadline, some supervisors will err on the side of caution, and instruct the sorter operators to hold back some of the standard class on the second to last run in order to make sure that the last run through the sorter can be completed prior to the dispatch deadlines.
Therefore, sorting operations are often not as efficient as they could be. The total volume of mail run through the sorters falls well short of the ideal. And, mail that is run through the sorters—but that does not finish the last pass or two through the automated sorting equipment—is sometimes dispatched unsorted to the delivery offices, where it is sorted by hand. Manual sorting of mail is the most time-consuming and expensive way to process mail.
What is needed is a way to know precisely how much mail is to be sorted in the last pass or two, and precisely how long it will take to sort that mail so that the maximum amount can be sorted automatically, while still ensuring that the dispatch deadlines are met. This problems exist both for conventional sorters, as well as for damp-based sorters wherein mail is put in clamps, and the mail is sorted by manipulating the clamps instead of by directly guiding the mail pieces. Examples of such a clamp-based system can be found in International Application WO 2006/063204 filed 7 Dec. 2005 titled “System and Method for Full Escort Mixed Mail Sorter Using Clamps” and can also be found in U.S. Provisional Application No. 11/519,630 filed 12 Sep. 2006 titled “Sorter, Method, and Software Product for a Two-Step and One-Pass Sorting Algorithm,” which are both incorporated herein by reference in their entirety. The problem also exists for macro-sorters, which are sorters that simultaneously sort inbound as well as outbound mail. The concepts of macro-sorting are described, for example, in U.S. Provisional Application No. 60/669,340 filed 5 Apr. 2005, titled “Macro Sorting System and Method” which also incorporated herein by reference in its entirety.
The present invention provides a controllable way to deal with uncontrollable variables from the last pass(es) through the sorter, so that the time to complete the job can be precisely predicted based on the specific mail pieces to be sorted. In addition, the invention provides both a visible indication of when the last pass must be started through the sorter in order to meet the deadline, as well as providing an alert when the last pass must be started. In this way, the maximum amount of mail can be loaded into the sorter in order to deliver all of the first class mail and a maximum amount of standard or other class mail each day.
The present invention can be used both in a clamp-based sorter wherein mail is put in clamps, and the mail is sorted by manipulating the clamps instead of by directly guiding the mail pieces, as well as in other types of sorters, but it has special advantages in the context of a clamp-based sorter. A unique feature of clamp-based sorter is the ability to predict exactly how long it will take to process the last pass through the sorter, because the last pass is a fully automated step with no operator actions involved. The exact number of pieces and characteristics of the mail to be processed through the last pass has been previously measured and stored in a database, and actual pieces are stored in the sorter. For conventional sorters, an equivalent capability of predicting the time to complete the last pass based on measurements and data taken on the mail loaded during the second last pass is also enabled by this invention.
The accompanying drawings illustrate presently various embodiments of the invention, and assist in explaining the principles of the invention.
An embodiment of the present invention will now be described. It is to be understood that this description is for purposes of illustration only, and is not meant to limit the scope of the claimed invention.
It is possible to scale up a merge and sequence sorter concept, so that multiple zones of mail can be loaded and sorted to delivery sequence.
The inbound sorting operations (merging and sequencing) for these types of sorters are typically conducted in three phases. Phase I involves loading all the mail into the sorter using one or more infeed stations. Each piece of inbound mail is loaded into a clamp, transported in face-to-face orientation with respect to other clamped mail pieces, and sorted into groups of one or more routes of mail and stored in storage legs in the upper tiers of the sorter. This could occur over a time period of 21 hours or less. Phase II starts after all the mail is loaded into the sorter during phase I, and includes moving mail to the lowest tier one batch at a time, and sorting first into batches of 20 to 60 addresses, which are then sorted to delivery sequence. When the mail is sorted to sequence, it then enters phase III, during which it is loaded into trays and sent to dispatch.
For this type of sorter configuration, it will be noted that the time to complete phase I varies, because of all the uncontrollable variables. These uncontrollable variables include the total number of pieces to be sorted and delivered that day, the type of mail (size, weight, dimensions), how much of each type of mail can be fed into the sorter using high speed letter feeders (typically these feed at 36,000/hour), how much must be fed using flats feeders (at 10,000/hour), and how much must be fed in manually (at 3,600/hour). These feed-in rates will also be affected by operator skill and diligence.
In addition, for a clamp-based sorter in which the mail is transported in face-to-face orientation, the time to move the mail into and out of storage during phase I will be variable, depending on the amount of mail loaded and the thicknesses of mail pieces. The transport speeds are a constant, but the number of pieces being transported is an uncontrollable variable that will change with each day's mail. The transports may include ways to transport clamped mail at fixed pitches such that thicker mail pieces will occupy more pitches than thinner pieces. The storage areas may also be designed with fixed pitches, and the number of pitches to be occupied in the sorter by each mail piece depends on the thickness of each piece. And, therefore, the number of pieces that can be transported within the sorter per unit of time will be a function of the thickness of the pieces (and the pitches occupied) being transported. Hence, the time to complete phase I will depend on a host of uncontrollable variables.
It will be noted that during phase I, all the important parameters about the mail being loaded are measured and stored in a database. For the purposes of this discussion, the key attributes of the mail to be used include the number of pieces, and the number of pitches occupied by those pieces.
In a clamp-based sorter, Phase II, on the other hand, can be fully automated. No operator skill or diligence is required other than commanding the sorter to start this phase. Following that, the sorter systematically moves the mail, previously sorted and stored in batches consisting of one or more routes, from its storage location inside the sorter to the lowest tier to conduct the sort to sequence operations. The batches of mail are transported one right after another through the bottom tier, and thereafter they are stacked into trays and sent to dispatch.
The time to complete phases II and III can be precisely calculated. The total number of pitches occupied by the mail to be sorted in phase II will be known after phase I is halted. The total distance that this mail must be moved will also be known as a function of the sorter geometry and the number of pitches occupied. Since the transport velocity is a constant (for example, 3 in/sec), the precise time to sort the mail for phase II can be easily calculated. A typical equation to perform this calculation might look like this: Time for Phase II=[Sorter Path Length+(Total Pitches Occupied)(Efficiency Factor)]/[Transport Speed].
In fact, if the last dispatch deadline is, for instance 6:30 A.M., then the time to complete phases II and III can be subtracted from the dispatch deadline—and displayed appropriately. So, for example, the sorter user interface might continuously update the time that phase II must be started throughout the loading of mail during phase I. Early in phase I, when only about 20% of the day's mail has been fed in, the display might say “Phase II must start no later than 5:47 a.m.” Later on, after 99% of the mail has been loaded in phase I, the message on the display will then show “Phase II must start no later than 3:12 a.m.” In other words, the time calculated and displayed for the start of phase II will be continuously updated, changing to an ever earlier time, as additional mail pieces are loaded in during phase I.
There will come a time when this calculated time will be exactly the same as the actual time (i.e. the calculated time line and the actual time line intersect.) At this point, the sorter will actuate an alarm (such as an audible signal or a visual display alert) to make certain that the operator knows it is time to halt phase I and initiate phase II.
As seen in accompanying
A variant of the method shown in
The sorter system in this embodiment of the invention enables an unprecedented level of precision in determining exactly when the later phase including the phase II operations must be started, because the clamp-based phase II is fully automated without any operator involvement. But, a similar approach could also be applied to conventional sorting systems. In typical central sorting centers, multiple sorting systems are used in each phase. Also, for each pass, one or more operators are required to load mail into feeders, and one or more operators may be required to unload the mail from the sorting bins and into trays. In addition, auxiliary support systems are required to support the sorters—such as the tray storage and retrieval systems that take the trays of mail after they are unloaded in one pass and present them to the feeder operators in the correct order to be fed back into the sorters during the second pass.
The performance of all of these systems for the last pass or two of sorting is reasonably predictable based on the data that can be collected during early passes. Examples of data that can be collected include the piece count of mail fed, how long it took to feed it, the number of trays full of mail unloaded and stored, et cetera. As with a clamp-based sorter, the transport rates are a known constant. The speed of the sorter combined with the collected data on the number of pieces and the average time to feed those specific pieces can be put into a simple equation to determine exactly how long it will take to complete the last pass through the sorter. A typical equation might look like this: [Last Pass Time]=[Total Pieces Fed on Second-to-Last Pass]/[(Number of Sorters)(Measured Feed Rate)]
However, if multiple sorters are used in each of the phases, then the start time for the last phase may in fact be a series of start times for each of the sorters involved in sorting the last pass. Typically, any one of the multiple sorters will be assigned to sort the mail for specific routes or zones (e.g. 20 routes/zone). In this situation, during the second to last pass, the number of pieces sorted to the zones to be fed into any specific sorter for the final pass can be separately recorded. In this case, multiple equations like the one mentioned in the previous paragraph will be used. Each numerator for each equation will include only the number of pieces sorted during the second-to-last pass that will be fed into the specific sorter that will sort those pieces for the last pass.
For example, suppose 10 sorters are being used in a sorting center. And suppose mail destined for 100 zones will be sorted. For the last pass, the sorting plan is that sorter number one will be assigned to sort mail for zones 1 to 10, sorter number two will sort mail for zones 11 to 20, et cetera. During the second to last pass, all the mail destined for zones 1 to 10 sorted on all ten sorters will be recorded and applied in the equation. A display can be used to show the start time for the last pass for each of the ten sorters. So, for example, the display at any point in time, based on the cumulative mail sorted during the second to last pass in all sorters, might display the following: “The last pass for sorter number one must start at 4:15 AM, the last pass for sorter number two must start at 3:47 AM, the last pass for sorter number three . . . ” et cetera.
Turning now to
Algorithms for implementing the precision scheduling of the present invention can be realized using a general purpose or specific-use computer system, with standard operating system software conforming to the method described above. The software product is designed to drive the operation of the particular hardware of the system. A computer system for implementing this embodiment includes a CPU processor 355 or controller, comprising a single processing unit, multiple processing units capable of parallel operation, or the CPU can be distributed across one or more processing units in one or more locations, e.g., on a client and server. The CPU may interact with a memory unit 330 having any known type of data storage and/or transmission media, including magnetic media, optical media, random access memory (RAM), read-only memory (ROM), a data cache, a data object, etc. Moreover, similar to the CPU, the memory may reside at a single physical location, comprising one or more types of data storage, or be distributed across a plurality of physical systems in various forms.
For sorting configurations in which sort to delivery sequence is a functional requirement, an average of five mail pieces will likely be sorted to each address in embodiments for use in the United States, and an average of two to three will be sorted to each address in typical European applications. A sorter module with 14 to 20 paths between the input side (unsorted mail) and the sorted side is an appropriate design.
As mentioned, this embodiment of the invention includes batch sorting modules, for sorting large batches to small batches, as well as address sorting modules for sorting to delivery sequence.
The address sorting module will accept sequential batches of clamped mail from the third path 511 of the upstream batch sorting module 500 shown in
Each address sorting module will have a first path 405 for transporting clamped unsorted mail, which is either aligned with the third path of the upstream module when the upstream module is a batch sort module, or with the first path when the upstream module is an address sorting module. The input to this first path of the address sorting module is a batch of clamped mail handed off from an upstream module, each batch containing mail destined for a number of addresses not to exceed the number of address sorting stations. The outputs to this first path of the address sorting module include fourteen diverter stations (in the present example), in order to move the mail sideways off the transport, and a means to hand the partial batches of mail to additional address sorter modules downstream.
In the current example, each address sorting module has fourteen diverter subsystems 410 to move mail from the first mail path 405 to the fourteen assignable address stations 415. These diverter subsystems could operate identically to the three diverter systems designed for the small batch sorting modules (described later), and preferably have identical components.
Moreover, each address sorting module will have fourteen mail storage transports for storing mail destined for each address. There are two inputs to each of these address storage transports: the first input is a diverter transport carrying clamps from the first (batch) mail path, and the second input includes clamps handed off from an upstream address storage transport. The single output for each address sorting transport will pass the mail onto the next address storage transport—which may be the first address storing transport in the next module. The last address storing transport will hand the mail off to an output (de-clamping or stacking) module.
The storage capacity of each address storage transport may be a maximum of 10 clamps each holding mail pieces 0.2 inches thick or less. The capacity will be reduced when the batch being stored contains thicker mail pieces. The intent of this capacity target is to accommodate European routes where each address receives an average of 2.5 mail pieces per day. The 10 pitch storage system will accommodate heavy mail days of up to 10 of the thinnest pieces per address, or will accommodate heftier average thickness of each piece being up to 1.0 inches thick, (or some combination of these two possibilities.) Note that this storage capacity for each address station is four times the average mail to be sent to each address each day.
As an example, one configuration of the sorter may have a total of 28 address stations to sort mail previously batched for 25 addresses; these address stations are provided by two address sorting modules per sorting system, each sorting module having a 14-address sorting capability. Thus, three address stations can be used as overflow for specific addresses that receive more than the ten-piece maximum storage capability of the single address station.
Each small batch sorting module will have a first path 505 (i.e. unsorted path) for transporting clamped mail that has not yet been sorted to small batch; the outputs may include, for example, three diverter stations to move the mail sideways off the transport, and a means to hand the unsorted mail off to a sorter module or an output module downstream.
Each small batch sorting module will have, for example, three diverter subsystems 510 to move mail from the unsorted path 505 to respective temporary batch storage stations 512. The diverter subsystems will have three major sub-components. First, a diverter subsystem will have a means to move one clamp off the unsorted mail transport and onto a diverter transport without disturbing the clamp before or after the diverted clamp on the unsorted mail transport. The actuator for this mechanism will be responsive to commands from the module controller. The cycle time for the diverting mechanism will be sufficient to enable diverting of either single or adjacent clamps onto the diverting transport. Second, a diverter subsystem will have a transport for transporting diverted clamps from the unsorted mail path to the temporary batch storage area. It is expected that this transport will be positioned at an angle from the unsorted path such that the component of velocity parallel to the unsorted path will match the speed of the unsorted path. Hence, the relative motion between the mail pieces is limited to mail moving sideways out of the queue of unsorted mail. Third, a diverter subsystem will have a means to transfer the clamps from the diverting transport to the batch storage transport.
According to this embodiment, each small batch sorting module will have three (3) temporary batch storage transports (or stations) for storing batches of mail. There are as many as two inputs to each batch storage transport: the diverter transport 510 carrying clamps from the unsorted mail path 505, and clamps handed off from an upstream batch storage transport. Likewise, there are as many as two outputs for each batch storage transport: an output 514 to the third path/exit transport 511, and an output to a downstream batch storage transport.
The operation of the batch storage transport will be intermittent; it will advance all mail pieces stored whenever a new piece has been added from either of the two inputs. The storage capacity of each batch storage transport may be a maximum of 115 clamps each holding mail pieces 2 mm thick or less. The capacity will be reduced when the batch being stored contains thicker mail pieces. The intent of this capacity target is to satisfy two objectives: first, capacity to hold mail for 25 addresses on European routes, each address receiving an average of 2.5 mail pieces per day, the average thickness of each piece being 1.3× the standard pitch of 0.2 inches and, second, and capacity that allows 40% excess capacity for high volume mail days.
As mentioned, each small batch sorting module will have a third path (i.e. batch output path) 511 for advancing clamped mail past downstream batch storage transports, directly to other modules down stream such as the address sorting modules or the stacker modules. The third path transports will accept clamped mail from any of the three batch storage transports, or from the third path in an upstream module. The third path will transfer the clamped mail to the input of the third path on the next downstream module. The third path speed will be compatible with the rate of transferring damped mail onto the transport. Mail will be transferred to the third path under the following conditions: for the merge and sequence operation, when the last clamp having unsorted mail passes the diverter station associated with the batch storage transport, the clamped mail stored on the batch storage transport can be transferred to the third path. This empties the batch storage transport so that the next large batch of mail can be started down the unsorted mail path. Note the possibility that the unsorted path may be utilized as (or transformed into) the batch output path once all of the mail pieces have been diverted from the unsorted path.
The first stage of sorting operations involves feeding mail, measuring one or more of its dimensions, scanning and interpreting the destination address of each mail piece, and loading it into clamps—all of which is done in the modules 701 and 702 shown in
Mail that is initially sorted into large batches, or groups of one or more routes of mail, is stored in storage legs as shown in
It is to be understood that all of the present figures, and the accompanying narrative discussions of preferred embodiments, do not purport to be completely rigorous treatments of the methods and systems under consideration. A person skilled in the art will understand that the steps and stages of the present application represent general cause-and-effect relationships that do not exclude intermediate interactions of various types, and will further understand that the various structures and mechanisms described in this application can be implemented by a variety of different combinations of hardware and software, and in various configurations which need not be further elaborated herein.
Number | Name | Date | Kind |
---|---|---|---|
3420368 | Sorrells | Jan 1969 | A |
3452509 | Hauer | Jul 1969 | A |
3587856 | Lemelson | Jun 1971 | A |
3757939 | Henig | Sep 1973 | A |
3889811 | Yoshimura | Jun 1975 | A |
3901797 | Storace | Aug 1975 | A |
3904516 | Chiba | Sep 1975 | A |
3933094 | Murphy | Jan 1976 | A |
4008813 | Leersnijder | Feb 1977 | A |
4058217 | Vaughan | Nov 1977 | A |
4106636 | Ouimet | Aug 1978 | A |
4169529 | Hunter | Oct 1979 | A |
4244672 | Lund | Jan 1981 | A |
4507739 | Haruki | Mar 1985 | A |
4627540 | Takeda | Dec 1986 | A |
4688678 | Zue | Aug 1987 | A |
4738368 | Shaw | Apr 1988 | A |
4868570 | Davis | Sep 1989 | A |
4874281 | Bergerioux | Oct 1989 | A |
4891088 | Svyatsky | Jan 1990 | A |
4895242 | Michel | Jan 1990 | A |
4921107 | Hofer | May 1990 | A |
4923022 | Hsieh | May 1990 | A |
4965829 | Lemelson | Oct 1990 | A |
5031223 | Rosenbaum | Jul 1991 | A |
5042667 | Keough | Aug 1991 | A |
5119954 | Svyatsky | Jun 1992 | A |
5186336 | Pippin | Feb 1993 | A |
5291002 | Agnew | Mar 1994 | A |
5470427 | Mikel | Nov 1995 | A |
5480032 | Pippin | Jan 1996 | A |
5518122 | Tilles | May 1996 | A |
5718321 | Brugger | Feb 1998 | A |
5981891 | Yamashita | Nov 1999 | A |
5994657 | Maier | Nov 1999 | A |
6032122 | Gertner | Feb 2000 | A |
6079570 | Oppliger | Jun 2000 | A |
6082521 | Maier | Jul 2000 | A |
6126017 | Hours | Oct 2000 | A |
6227378 | Jones | May 2001 | B1 |
6276509 | Schuster | Aug 2001 | B1 |
6337451 | De Leo | Jan 2002 | B1 |
6347710 | Ryan | Feb 2002 | B1 |
6365862 | Miller | Apr 2002 | B1 |
6403906 | De Leo | Jun 2002 | B1 |
6435353 | Ryan | Aug 2002 | B2 |
6443311 | Hendrickson | Sep 2002 | B2 |
6561339 | Olson | May 2003 | B1 |
6561360 | Kalm | May 2003 | B1 |
6587806 | Mangiameli et al. | Jul 2003 | B2 |
6674038 | Latta | Jan 2004 | B1 |
6677548 | Robu | Jan 2004 | B2 |
6814210 | Hendzel | Nov 2004 | B1 |
6897395 | Shiibashi | May 2005 | B2 |
6946612 | Morikawa | Sep 2005 | B2 |
6953906 | Burns | Oct 2005 | B2 |
6994220 | Schererz | Feb 2006 | B2 |
7004396 | Quine | Feb 2006 | B1 |
7111742 | Zimmermann | Sep 2006 | B1 |
7112031 | Harres | Sep 2006 | B2 |
7138596 | Pippin | Nov 2006 | B2 |
7170024 | Burns | Jan 2007 | B2 |
7210893 | Overman | May 2007 | B1 |
7227094 | Oexle | Jun 2007 | B2 |
7235756 | De Leo | Jun 2007 | B2 |
7259346 | Svyatsky | Aug 2007 | B2 |
7304260 | Boller | Dec 2007 | B2 |
7329824 | Chamblee | Feb 2008 | B2 |
7378610 | Umezawa | May 2008 | B2 |
7396011 | Svyatsky | Jul 2008 | B2 |
7397010 | Wilke | Jul 2008 | B2 |
7397011 | Berdelle-Hilge | Jul 2008 | B2 |
20020053533 | Brehm | May 2002 | A1 |
20020123855 | Mangiameli et al. | Sep 2002 | A1 |
20030006174 | Harres | Jan 2003 | A1 |
20040200761 | Hanson et al. | Oct 2004 | A1 |
20050125096 | Kechel | Jun 2005 | A1 |
20050169224 | Baker | Aug 2005 | A1 |
20060070929 | Fry | Apr 2006 | A1 |
20060124512 | Quine | Jun 2006 | A1 |
20060180519 | Carey et al. | Aug 2006 | A1 |
20060180520 | Ehrat | Aug 2006 | A1 |
20060191822 | Avant | Aug 2006 | A1 |
20060271234 | Gaug | Nov 2006 | A1 |
20070090029 | Avant | Apr 2007 | A1 |
20070131593 | Burns | Jun 2007 | A1 |
20070272601 | Stemmle | Nov 2007 | A1 |
20080011653 | Stemmle | Jan 2008 | A1 |
20080012211 | Stemmle | Jan 2008 | A1 |
20080027986 | Stemmle | Jan 2008 | A1 |
20080093273 | Stemmle | Apr 2008 | A1 |
20080093274 | Stemmle | Apr 2008 | A1 |
20080164185 | Stemmle | Jul 2008 | A1 |
20080179225 | Bowers et al. | Jul 2008 | A1 |
20080230449 | Stemmle | Sep 2008 | A1 |
Number | Date | Country |
---|---|---|
1159088 | Jun 1989 | JP |
1271789 | Oct 1989 | JP |
Number | Date | Country | |
---|---|---|---|
20080086232 A1 | Apr 2008 | US |