1. Field of the Invention
The invention generally relates to a single pass sequencer and process and, in particular, to a system and method for sequencing mail pieces in a single pass to reduce overhead space and costs as well as minimize mail damage.
2. Background Description
The delivery of mail such as catalogs, products, advertisements and a host of other articles have increased exponentially over the years. These mail pieces are known to be critical to commerce and the underlying economy. It is thus critical to commerce and the underlying economy to provide efficient delivery of such mail in both a cost effective and time efficient manner. This includes, for example, arranging randomly deposited mail pieces into a sequential delivery order for delivery to a destination point. By sorting the mail in a sequential order based on destination point, the delivery of mail and other articles can be provided in an orderly and effective manner.
In current sorting processes, optical character recognition systems may be used to capture delivery destination information. A host of feeders and other complex handling systems are then used to transport the mail to a host of bins or containers for sorting and future delivery. To this end, central processing facilities, i.e., United States Postal Service centers, have employed a high degree of automation using bar code readers and/or character recognition to perform basic sorting of articles to be transported to defined geographic regions or to local offices within those regions. It is also known to manually sort mail pieces, but this process is very labor intensive, time consuming and costly.
As to known automated sorting processes, currently, for example, a two pass algorithm process is used as one method for sorting mail based on delivery destination. In this known process, a multiple pass process of each piece of mail is provided for sorting the mail; that is, the mail pieces, for future delivery, are fed through a feeder twice for sorting purposes. In general, the two pass algorithm method requires a first pass for addresses to be read by an optical character reader and assigned a label or destination code. Once the mail pieces are assigned a label or destination code, they are then fed to bins based on one of the numbers of the destination code. The mail pieces are then fed through the feeder a second time, scanned, and sorted based on the second number of the destination code. It is the use of the second number that completes the basis for sorting the mail pieces based on delivery or destination order.
The two pass algorithm method may present some shortcomings. For example, the mail pieces are fed through the feeder twice, which may increase the damage to the mail pieces. Second, known optical recognition systems typically have a reliability of approximately 70%; however, by having to read the mail pieces twice, the rate is multiplied by itself dramatically reducing the read rate and thus requiring more manual operations. That is, the read rate is decreased and an operator may have to manually read the destination codes and manually sort the mail when the scanner is unable to accurately read the destination code, address or other information associated with the mail pieces two consecutive times. Additionally, bar code labeling and additional sorting steps involves additional processing time and sorting machine overhead as well as additional operator involvement. This all leads to added costs and processing times.
It is also known that by using the two pass algorithm method as well as other processing methods, the containers and bins may not be efficiently utilized, thus wasting valuable space. By way of illustrative example, a first bin may not be entirely filled while other bins may be over-filled. In this scenario, the mail pieces are not uniformly stacked within the bins, wasting valuable space, causing spillage or an array of other processing difficulties.
However, U.S. application Ser. No. 10/265,570 solves these problems and provides many advantages over known systems. For example, in U.S. application Ser. No. 10/265,570, a novel single pass system and method has been devised to sort and sequence mail pieces in a single sorting pass, thus eliminating the need for a two pass algorithm and accompanying system. The system and method of U.S. application Ser. No. 10/265,570 minimizes damage to flats, provides a single drop point, as well as increases the overall efficiency by ensuring that “tubs” or other transport containers are efficiently utilized by evenly filling the tubs to a maximum or near maximum level. But, further advances in such system are still possible such as, for example, still further reductions in component parts and use of flooring space.
In a first aspect of the invention, a system is provided for sorting objects such as, for example, mail pieces. The system includes a feeding station which feeds non-sequenced objects into a plurality of holders for holding and transporting the non-sequenced objects fed from the feeding station. The holders are transportable between a moveable carriage and a stationary carriage to sort the non-sequenced objects stored in the holders into a sequence.
In another aspect of the invention, a method is provided for sorting objects. The method includes inducting objects into separate holders on a first carriage and transporting the separate holders from the first carriage to a second carriage, in substantially a same order. The method further includes instructing the separate holders to move from the second carriage to a corresponding position on the first carriage, incrementally and in sequence, based on sorting criteria of the objects to thereby sequentially order the objects based on delivery destination. The sequenced objects are then unloaded from each of the separate holders.
In another aspect of the invention, the method includes placing non-sequenced mail pieces in separate holders extending from a moveable carriage and assigning codes to the holders and positions on the moveable carriage based information associated with the non-sequenced mail pieces. The holders are moved to corresponding positions on the stationary carriage. The holders are then moved back to the moveable carriage, in sequence. The mail pieces are unloaded.
a–5c are flow charts implementing the steps of the invention using the system of the invention;
a–6c show several operational phases of the system in accordance with the invention; and
The invention provides a flexible system and method for sequencing objects such as, for example, flats, mail pieces and other products or parts (generally referred to as flats or mail pieces) in a mixed stream process using only a single feed or pass through a feeder system. The system and method of the invention reduces damage to flats by using a single pass, and reduces manufacturing and delivery costs while still maintaining superior sorting and delivery results. For example, in one aspect of the invention, overall length and working components can be considerably reduced conserving valuable user floor space and costs by using a stationary storage carriage. The system configuration is also variable to adapt to facility size, in terms of number of routes and size of routes.
Still referring to
A flat thickness device 106 and a scanning device 108 such as, for example, an optical character recognition device (OCR), bar code scanner or the like is provided adjacent or proximate the feed track 104. In embodiments, the flat thickness device 106 measures the thickness of each flat as it passes through the system, and the OCR 108 reads the address or other delivery information which is located on the flat. The flat thickness device 106 may be any known measuring device such as a shaft encoder, for example. The flat thickness device 106 and the OCR 108 communicate with a sorting computer 110 via an Ethernet, Local Area Network, Wide Area Network, Intranet, Internet or the like. The flat thickness device 106 and the OCR 108 provide the thickness and address information to the sort computer 110, at which time the sort computer 110 assigns a virtual code to the flat for delivery and sorting purposes. This is provided via a look-up table or other known method.
In one particular application, for illustration, the OCR 108 will capture information such as, for example, address destination information, from the flats. Once the information is captured, it will be sent to the central processing unit (e.g., sorting computer 110) for interpretation and analysis. Using this information, the sorting computer can provide instructions to any the components of the invention for sequencing the flats, as discussed in more detail below.
The cell movement mechanism 112 includes a first, moveable carriage 112a and a second, stationary carriage 112b (referred hereinafter as the “stationary carriage”). The stationary carriage 112b eliminates the need for additional motors and other hardware, otherwise needed to move such a carriage thus reducing overhead costs and flooring space. The first carriage 112a may transport the flats in one direction (e.g., when in a loop configuration) or bi-directionally (e.g., when in a line configuration). In one aspect of the invention, a plurality of holders or cartridges 114, 114n+1 extend downward from the first carriage 112a or the stationary carriage 112b, depending on the particular stage of the process.
In one implementation, the sort computer 110 tracks each holder in addition to the flats loaded therein, and assigns numerical designations, codes or the like corresponding to the order of the holders 114 on the first carriage 112a or the designations associated with the flats placed therein (as discussed below). In this manner, the sort computer 110 is capable of accurately following each flat throughout the system for future sorting.
The hangers 122 may be transported by sliding between the first carriage and the stationary carriage by known mechanisms such as, for example, linear actuators, solenoids or piston and cylinder assemblies, as depicted at reference numeral 126. The linear actuators, solenoids or piston and cylinder assemblies may be packaged in the cell movement mechanism 112 and communicate with the holders and, in one application, directly with the hangers, themselves. The linear actuators, solenoids or piston and cylinder assemblies push or pull the hangers, depending on the position between the respective carriages. Such linear actuators, solenoids or piston and cylinder assemblies are manufactured by Tol-o-matic Fluid Power Products of Hamel Minn., for example, and are implemented in various applications by Lockheed Martin Corporation. The hangers 122 may also simply be manually moved, although less efficient than an automated means of moving the carriages.
As further shown in
a–5c are flow diagrams showing the steps implemented by the invention. The steps of the invention may be implemented on computer program code in combination with the appropriate hardware. This computer program code may be stored on storage media such as a diskette, hard disk, CD-ROM, DVD-ROM or tape, as well as a memory storage device or collection of memory storage devices such as read-only memory (ROM) or random access memory (RAM). Additionally, the computer program code can be transferred to a workstation or the sort computer over the Internet or some other type of network.
a is an embodiment implementing the steps of the invention. In step 100, the non-sequenced flats are placed in the holders extending from the first carriage. In step 102, the first carriage (moveable carriage) incrementally moves and the holders are moved to positions on the stationary carriage. In step 102, the holders are not in sequential order on the stationary carriage. Steps 100 and 102 are repeated until all of the mail pieces for a delivery route or sequence are placed on the stationary carriage. After all of the mail pieces for a delivery route are on the system (transported past the reading device), in step 104, the sort computer assigns codes or the like to the holders and positions on the moveable carriage(s) based on the flat information and sequencing thereof. In step 106, the holders are moved from the stationary carriage to the moveable carriage, in sequence. It should be understood that the ordering of the flats, in sequence, may occur when the holders are moved onto the moveable carriage from the stationary carriage based on the codes assigned to the holders and positions on the respective carriages, as determined by the sort computer. In step 108, the flats are sequentially loaded into the packager or optionally directly into the containers.
Referring now to
During this process, or after this process, the sort computer will assign a sort number or code (i.e., sorting criteria) to each of the holders based on the sequence of the flats, as well as the slots on the stationary carriage (in one implementation). That is, a number or code (i.e., a final order sorting information also referred to as a number or code) is assigned to the slots or open spaces on the moveable carriage based on the final order of delivery of the flat. These slots will eventually accommodate the holders, in sequence, as discussed below.
In step 206, a determination is made as to whether all of the slots on the stationary carriage are full or whether there are any remaining flats to be sorted. If there are remaining flats and the slots on the stationary carriage are not full, then steps 202–206 are repeated. If there are no more flats or the slots on the stationary carriage are full, in step 208, the holders on the stationary carriage that are already in a proper alignment with empty slots on the moveable carriage, are then moved to the respective slots (on the moveable carriage). In one aspect of the invention, all of the slots on the stationary carriage are empty to accommodate the holders being moved thereon in delivery order sequence. However, in another aspect of the invention, there may be flats being inducted onto the moveable holder, dynamically, such that these new inductees are being transported to empty slots on the stationary carriage as others are being moved to the moveable carriage.
In step 210, the moveable carriage is incremented until a next empty slot(s) is aligned with the respective holder on the stationary carriage. That is, the moveable carriage is indexed until at least one assigned number or code associated with the slot on the moveable carriage is aligned with an assigned number or code of the holder on the stationary carriage. The indexing is preferably a single, incremental turn of the moveable carriage in either the clockwise or counter clockwise direction. Once this is accomplished, then the holders are moved from the stationary carriage to the moveable carriage, in a sequence. In step 212, a determination is made as to whether all of the holders are moved to the moveable carriage. If not, the process repeats at step 208. If all of the holders are moved, then the process ends at step 214 by releasing the flats from the holders into containers, for example.
In one aspect of the invention and referring to
If the determination in step 300 is negative or after step 306, a determination is made as to whether all assigned flats for all delivery points are packaged (step 308). If not, then the method can return to the steps of
Referring to
In one implementation, each holder 114, on the first carriage 112a, is assigned a sequential number for sorting purposes. The stationary carriage 112b is also assigned numbers or codes corresponding to the sequential order of the final completed sort. That is, the order of the holders 114 on the first carriage 112a are sequentially assigned a number or code by the sort computer 110; whereas, a number or code is assigned to a position on the stationary carriage 112b associated with a delivery destination of each of the flats.
As represented by
Referring to
In
While the invention has been described in terms of embodiments, those skilled in the art will recognize that the invention can be practiced with modifications and in the spirit and scope of the appended claims.
This application is a continuation in part application to U.S. application Ser. No. 10/265,570, filed on Oct. 8, 2002 now U.S. Pat. No. 6,924,451, which is now incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
1626492 | Youngson | Apr 1927 | A |
2695699 | Stille et al. | Nov 1954 | A |
3184061 | Levy | May 1965 | A |
3598303 | Folz | Aug 1971 | A |
3880298 | Habegger et al. | Apr 1975 | A |
3929076 | McRae, Jr. et al. | Dec 1975 | A |
3941372 | Matsuo | Mar 1976 | A |
4008813 | Leersnijder | Feb 1977 | A |
4247008 | Dobbs | Jan 1981 | A |
4401301 | Hayskar | Aug 1983 | A |
4440492 | Howard | Apr 1984 | A |
4507739 | Haruki et al. | Mar 1985 | A |
4511024 | Long | Apr 1985 | A |
4566595 | Fustier | Jan 1986 | A |
4630216 | Tyler et al. | Dec 1986 | A |
4641753 | Tamada | Feb 1987 | A |
4672553 | Goldberg | Jun 1987 | A |
4690751 | Umiker | Sep 1987 | A |
4974721 | Born | Dec 1990 | A |
5009321 | Keough | Apr 1991 | A |
5016753 | Henderson | May 1991 | A |
5031223 | Rosenbaum et al. | Jul 1991 | A |
5072822 | Smith | Dec 1991 | A |
5074539 | Wells et al. | Dec 1991 | A |
5101981 | Carbone et al. | Apr 1992 | A |
5119954 | Svyatsky et al. | Jun 1992 | A |
5133543 | Eitel et al. | Jul 1992 | A |
5226547 | Malatesta | Jul 1993 | A |
5289983 | Ueda et al. | Mar 1994 | A |
5293983 | Grapes et al. | Mar 1994 | A |
5353912 | Killer et al. | Oct 1994 | A |
5353915 | Schneider | Oct 1994 | A |
5363971 | Weeks et al. | Nov 1994 | A |
5398922 | Malatesta | Mar 1995 | A |
5446667 | Oh et al. | Aug 1995 | A |
5558201 | Oppliger et al. | Sep 1996 | A |
5628162 | Kreusch et al. | May 1997 | A |
5706928 | Neukam | Jan 1998 | A |
5718321 | Brugger et al. | Feb 1998 | A |
5772029 | Boccacci | Jun 1998 | A |
5833076 | Harres et al. | Nov 1998 | A |
6059091 | Maier et al. | May 2000 | A |
6119929 | Rose | Sep 2000 | A |
6208908 | Boyd et al. | Mar 2001 | B1 |
6217274 | Svyatsky et al. | Apr 2001 | B1 |
6239397 | Rosenbaum et al. | May 2001 | B1 |
6241099 | Hendrickson et al. | Jun 2001 | B1 |
6270069 | Cera et al. | Aug 2001 | B1 |
6283304 | Gottlied et al. | Sep 2001 | B1 |
6316741 | Fitzgibbons et al. | Nov 2001 | B1 |
6328302 | Hendrickson et al. | Dec 2001 | B2 |
6364199 | Rose | Apr 2002 | B1 |
6443311 | Hendrickson et al. | Sep 2002 | B2 |
6466828 | Lem et al. | Oct 2002 | B1 |
6501041 | Burns et al. | Dec 2002 | B1 |
6536191 | Ruggiero | Mar 2003 | B1 |
6555776 | Roth et al. | Apr 2003 | B2 |
6561339 | Olson et al. | May 2003 | B1 |
6561360 | Kalm et al. | May 2003 | B1 |
6798748 | Mileaf et al. | Jul 2003 | B1 |
6946612 | Morikawa | Sep 2005 | B2 |
20020079255 | Anderson | Jun 2002 | A1 |
20020139726 | Roth et al. | Oct 2002 | A1 |
20030141226 | Morikawa | Jul 2003 | A1 |
20030155282 | Kechel | Aug 2003 | A1 |
Number | Date | Country |
---|---|---|
2060774 | Aug 1992 | CA |
0575109 | Dec 1993 | EP |
9824564 | Jun 1998 | WO |
Number | Date | Country | |
---|---|---|---|
20040211710 A1 | Oct 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10265570 | Oct 2002 | US |
Child | 10836192 | US |