EP2011578B1 - Method and device for sorting objects into several cycles in order of delivery - Google Patents

Description

The invention relates to a method and a device for sorting objects, in particular mailpieces, according to a delivery order in several passes.

Method according to the preamble of claim 1 and devices according to the preamble of claim 6 are made Proceed. USPS Advanced Technology Conference, Washington, DC, dated 2.12.1992, p. 1061-1074 ; EP 634957 B1 ; EP 948416 B1 US 5,981,891 ; EP 1258297 A1 known. In these publications, the problem is solved that the sorter has fewer sorting endpoints (output trays) than there are possible delivery points. The items are postal items. As a solution, it is proposed that the mail items pass through the sorting device in several passes. In this case, the mail items for the respective next pass are returned to the sorting device in sequence in the order of material input sorted in the previous pass. According to the Radix method, each delivery point is encoded with an n-digit number. The number of passes is also n. In the first pass, the delivery point is sorted after the one-digit, in the second pass after the tens, in the third pass after the hundred-digit, etc. of the delivery points.

The items are sorted according to a given sorting plan. Fig. 1 shows by way of example such a sorting plan for a two-pass radix method. Mail items to 33 different possible delivery points are to be sorted with the help of 6 sorting endpoints SE-1, ..., SE-6. The sorting plan is displayed in the form of a matrix. The first pass is entered on the y-axis, and the second pass on the x-axis (2nd pass). The matrix determines in which sorting endpoint a mail item after the first pass and in which after the second pass is discharged. This depends on the delivery point. Each mail item to the delivery point 2 is in the example of Fig. 1 in the first pass to the sorting end SE-2 and in the second pass to the sorting end SE-1.

In the example of Fig. 1 In the first pass, all mail items are delivered to the delivery address 1, 7,... into the sorting endpoint SE-1, all mail items to the delivery address 2, 8,... to the sorting endpoint SE-2 and so forth. After the first pass, first the sorting end SE-1 is emptied. All mail items which were discharged in the first pass into the sorting end SE-1 are first fed again to the material input of the sorting device. In the second pass, the mail items are discharged to the delivery address 1 in the sorting SE-1, the mail items to the delivery address 7 in the sorting SE-2 and so on. Subsequently, the sorting end SE-2 is emptied, and the mail items from SE-2 are again supplied to the material input. In the second pass, the mailpieces are discharged to the delivery address 2 in the sorting SE-1, the mail items to the delivery address 8 in the sorting SE-2 and so on.

Sortierendstellen benötigt.As a rule, there is no advance information about the mailpieces, which is why any delivery address taken into account in the sorting plan can actually be applied to an article to be transported. If N is the number of possible delivery points and if in both passes the same sorting end points are used for discharging, then at least $\sqrt{N}$

Sorting sites needed.

The known Radix method has the disadvantage that for each delivery point a matrix element must be provided in the sorting plan shown as a matrix, although the number of delivery points may be smaller than the square of the number of sorting end points. In this case, the sorting device must have more sorting end points than needed.

1. 1. Es ist eine strenge Abarbeitungs-Reihenfolge der Sortierendstellen während zweiten Durchlaufs einzuhalten. Es muss zuerst der gesamte Inhalt von Sortierendstelle 1 verarbeitet sein, bevor mit dem Inhalt von Sortierendstelle 2 begonnen wird. Andernfalls gibt es Reihenfolgefehler.
2. 2. Es kann pro Matrix-Element nur ein Zustellpunkt zugeordnet werden. Damit ist die Menge an Zustellpunkten, welche in einem Prozess verarbeitet werden können, durch das Quadrat der Anzahl der Sortierendstellen limitiert.
3. 3. Bei kleiner Sendungsdichte (< 1) und ohne Sendungsziel-Vorabinformation (idR. der Fall) muss für jeden Zustellpunkt ein Matrixelement im Sortierplan vorgehalten werden, obwohl nur ein Teil der Zustellpunkte mit einer Sendung belegt ist. Damit kann das Verfahren nur auf einer sehr großen und damit schlecht genutzten Maschine durchgeführt werden, was nicht wirtschaftlich ist.

Specifically, the following restrictions arise with this method:

1. 1. A strict execution order of the sorting terminals is to be followed during the second run. First, the entire content of sorting endpoint 1 must be processed before the content of sorting endpoint 2 is started. Otherwise there are sequence errors.
2. 2. Only one delivery point can be assigned per matrix element. Thus, the amount of delivery points that can be processed in a process, limited by the square of the number of sorting endpoints.
3. 3. In the case of a small shipment density (<1) and without advance shipment information (usually the case), a matrix element must be kept in the sorting plan for each delivery point, although only part of the delivery points are assigned to a shipment. Thus, the process can only be performed on a very large and thus poorly used machine, which is not economical.

Furthermore, from the EP 0 718 049 A2 discloses a method and apparatus for sorting sheets or the like, wherein the sheets are sorted in several steps. In this case, target codes of the sheets are detected and the sheets are conveyed to sorting compartments depending on the detected target code and a thickness of the sheets.

The DE 103 10 760 B3 discloses a method for sorting mail items according to their destination addresses on sorting machines located in sorting centers in a plurality of sorting runs according to the radix method, wherein the sorting centers each have a number of delivery offices in which delivery agents operate. The consignments are initially sorted by sorting centers and delivery groups in the sorting outgoing goods, whereby the consignments after the sorting of sorting in the respective sorting centers in several sorting runs, the so-called incoming sorting, sorted by delivery and delivery offices.

Furthermore, from the DE 197 09 232 A1 a method, an apparatus and an information carrier for a field sorting and sorting order sorting of mail known. In doing so, mailpieces are loaded into a computer-controlled sorting device to perform multiple sorting passes. During these sorting passes, delivery information, ie, a delivery order and the addresses, of the mail pieces are detected and the mailpieces are fed to sorting bins.

In the EP 0 812 629 B1 For example, a method for sorting mailpieces intended for addresses / delivery points within a predetermined delivery area and an arrangement for the purpose of using the method are known. The method comprises three steps, wherein the mailpieces are stored in the first step in a storage device with a first sequence number and are removed in a second step from these storage devices and stored again with a second sequence number in the storage facilities. In a third step, the mailpieces of successive storage devices are bundled.

The invention has for its object to provide a method having the features of the preamble of claim 1 and a device having the features of the preamble of claim 6, which requires fewer sorting outlets than known methods or devices for a given number of delivery points.

The objects are achieved by a method having the features of claim 1 and a device having the features of claim 6. Advantageous embodiments are specified in the subclaims.

The objects are sorted by means of a sorting device. Each item is provided with a coding of a delivery point. These delivery points are arranged in a predetermined delivery order.

The sorting device has a plurality of output devices. Some or all of these output devices are marked as sorting endpoints. At least one sorting end point is assigned to a group of delivery points. The delivery point group consists of several delivery points that follow each other in the delivery order.

Each item passes through the sorter at least twice. In each pass, the delivery address applied to the article is determined, and the article is ejected into one of the output devices depending on the determined delivery point. After each but the last pass, the dispensers are deflated one at a time and the articles returned to the sorter.

In the last run, each item is dispatched to one of the sorting endpoints depending on the determined delivery point. All items that are coded with a delivery point of the delivery point group are sorted in the last run and all discharged into the sorting end of the group. This is done so that the following is effected: After the removal, the items of the group in the sorting end position to which the group is assigned are sorted by delivery points according to the delivery order.

The objects at the same delivery point are thus located after the rejection immediately after one another in the sorting end. Items at different delivery points of the group are located in the same sorting endpoint, the items being sorted according to the delivery order.

The invention makes it possible to have articles sorted at more delivery points by a sorting device having a predetermined number of sorting end points. The fact can be exploited in the sorting plan that the number of items varies greatly from delivery address to delivery address.

Advantageous embodiments of the invention are set forth in the subclaims.

Thus, it is advantageous to temporarily store the articles at a delivery point of the group in the sorting device and then to supply them in the delivery order to the assigned sorting end point.

In this context, it is particularly advantageous if the objects of the delivery point group are loaded in the sorting device in pockets of a stationary transfer containers circulating pocket ring and the objects from the stationary transfer containers in which they are cached, so also delivered to target containers as peripheral sorting be that after completion of sorting, the objects of a delivery point group are together in the delivery order in the associated target container.

It is also advantageous if, in each pass, items of the at least one delivery point group are sorted together into a sorting schedule defined by a sorting plan, the items of a delivery point group from in each case one sorting end of the respective previous pass in the order predefined by the sorting plan the intended sorting endpoint are stored.

In the case of sorting in two passes, articles of the delivery point groups in the reading order can accordingly be sorted together into the assigned destination containers in the first pass in accordance with the sorting plan in the first pass. In the second pass, the items of each delivery point group are then sorted in the delivery order into the intended destination containers.

Fig. 1

eine Veranschaulichung eines aus dem Stand der Technik bekannten Sortierverfahrens gemäß dem Radix-Verfahren;

Fig. 2

eine Veranschaulichung einer erfindungsgemäße Verbesserung des Radix-Verfahrens;

Fig. 3

eine schematische Seitenansicht einer verwendeten Sendungssortiereinrichtung mit Zwischenspeichern;

Fig. 4

ein Schema zur Erläuterung des internen Umsortierens.

In the following the invention will be described with reference to an embodiment, in which:

Fig. 1

an illustration of a known from the prior art sorting method according to the Radix method;

Fig. 2

an illustration of an improvement of the Radix method according to the invention;

Fig. 3

a schematic side view of a used mail sorting with caching;

Fig. 4

a scheme for explaining the internal re-sorting.

In the exemplary embodiment, the objects are flat mail items, in particular letters, postcards or large letters. Each mail item is associated with the coding of a delivery point, z. As a delivery address or a mailbox provided.

The method is carried out with the aid of a mail sorting device with 6 sorting end points SE-1,..., SE-6. The person skilled in the art can easily adapt this exemplary mail sorting device to a larger number of delivery addresses by increasing the number of sorting end points.

The consignment sorting device works according to a sorting plan that is in Fig. 2 is illustrated. Instead of 22 delivery points as in Fig. 1 Thanks to the invention, 144 different delivery points 1, 2,..., 144 can now be distinguished without the number of sorting end points having to be increased. In the exemplary embodiment, in turn, two passes are performed, and the 6 sorting endpoints are used as the output device both in the first and in the second pass. However, it is also possible to use different output devices in the first pass than in the second pass.

In the example of Fig. 2 In the first pass all mail items are delivered to the delivery addresses 1 to 3 (ie to 1, 2 or 3), 25 to 29,... to the sorting endpoint SE-1, all mailpieces to the delivery address 4 to 8, 30,... in the sorting end SE-2, all mail to the delivery address 9 to 12, ... in the sorting SE-3 and so on. In this example, many mail items are expected at the delivery address 30.

After the first pass, first the sorting end SE-1 is emptied. All mail items which were discharged in the first pass into the sorting end SE-1 are first fed again to the material input of the sorting device. In the second pass, the mail items are discharged to the delivery address 1 to 3 in the sorting SE-1, the mail items to the delivery address 25 to 29 in the sorting SE-2 and so on.

Subsequently, the sorting end SE-2 is emptied, and the mail items from SE-2 are again supplied to the material input. In the second pass, the mail items are discharged to the delivery address 4 to 8 in the sorting SE-1, the mail items to the delivery address 30 in the sorting SE-2 and so on.

However, the mail items to the delivery points 1 to 3 are placed in the sorting device in the correct order before the final discharge in the sorting 1 in the right order, as well as the shipments to 25 to 29, etc. This ensures that a much higher number of delivery points in one Sorting process is processed at the same number of sorting endpoints. In particular, it is thus also possible to economically process consignment volumes without prior information about the consignment destination with low consignment density.

Fig. 3 shows a schematic side view of a mail sorting with caching. Such a device is out DE 10 2004 033 564 B3 known. The inventive method is carried out in a preferred embodiment with such a device.

• umlaufende Taschen Ta, in die die Sendungen in einer Beladestation geschleust werden,
• darunter angeordnete ortsfeste Speicherbehälter Zw als Zwischenspeicher, in welche die Sendungen aus den Taschen Ta gesteuert befördert werden und
• unter den Speicherbehältern Zw umlaufende Zielbehälter Zb (Sortierendstellen).

The sorting device has

• circumferential pockets Ta, into which the consignments are transported in a loading station,
• underneath fixed storage containers Zw as intermediate storage, in which the mailings are transported from the pockets Ta controlled and
• under the storage containers Zw circulating target containers Zb (sorting end points).

Fig. 4 illustrates, by way of example and schematically, the internal re-sorting for three programs, which are provided with the delivery addresses 3, 2, 1 and in the order 3, 2, 1 were introduced into the pockets Ta of the pocket wreath, but in the order 1, 2, 3 in a target container Zb to be stored. Based on the position and speed of the target bin Zb and the corresponding pockets Ta, the available time frame is calculated. Here, the last possible transfer point of the respective consignment is determined in a target container Zb, taking into account the residence time in the storage container Zw. Then, the three items are loaded in reverse order into a free storage container Zw within the determined time window and from there to the destination container Zb. Accordingly, other pre-sortings can be performed.

LIST OF REFERENCE NUMBERS

reference numeral importance 1, 2, ..., 144 delivery points SE-1, ..., SE-6 sorting Ta Bags of the bag wreath zb Destination container (sorting point) tw Storage container as a buffer

Claims (9)

1. Method for sorting objects with the aid of a sorting device, wherein
   each object is provided with a coding of a delivery point, the delivery points are arranged in a delivery sequence, the sorting device has a number of output devices, of which some or all are identified as sorting end locations,
   each object runs through the sorting device at least twice and, in each run,

   - the delivery address attached to the object is determined and

   - depending on the delivery point determined, the object is transferred into one of the output devices,

   wherein, after each run apart from the last, the output devices are emptied one after the other and the objects are returned to the sorting device and
   in the last run, each object is transferred into one of the sorting end locations,
   each sorting end location is assigned at least one group of delivery points, comprising one or more delivery points following directly one after the other in the delivery sequence,
   in each run, the objects are transferred into output devices on the basis of groups of delivery points, so that all the objects that are coded with a delivery point of the same group of delivery points are transferred into the same output device,
   characterized in that, in the last run, the objects, sorted on the basis of groups of delivery points, are transferred into sorting end locations in such a way that each object is transferred into that sorting end location that is assigned its delivery point and, in each sorting end location, the objects are sorted on the basis of delivery points according to the delivery sequence.
2. Method according to Claim 1,
   characterized in that
   the objects run through the sorting device in accordance with the radix method.
3. Method according to Claim 1 or 2,
   characterized in that
   in the last run, all of the objects that are coded with a delivery point of a group of delivery points
   are buffer-stored before they are transferred into the sorting end location of the group of delivery points.
4. Method according to Claim 3,
   characterized in that
   the sorting device

   - has at least one fixed storage container and

   - a ring of pockets, which circulates around the storage containers and has pockets,

   and
   in the last run, the objects that are coded with a delivery point of a group of delivery points

   - are transported in pockets of the ring of pockets and

   - are buffer-stored in that they are discharged from the respective pockets into the at least one fixed storage container.
5. Method according to Claim 4,
   characterized in that
   the sorting end location of the group of delivery points comprises a likewise circulating destination container and
   in the last run, all of the objects that are coded with a delivery point of the group of delivery points
   are transferred into the sorting end location of the group of delivery points
   by being discharged into the circulating destination container.
6. Device for sorting objects with the aid of a sorting device, wherein
   each object is provided with a coding of a delivery point,
   the device has

   - a data memory,

   - a determining device and

   - a number of output devices,

   some or all of the output devices are identified as sorting end locations,
   a delivery sequence of the delivery points is stored in the data memory,
   the determining device is designed for determining the delivery point coding,
   the sorting device is designed so as

   - the objects are transported through the sorting device in at least two runs and

   - depending on the delivery point determined, are transferred into one of the output devices,

   wherein, after each run apart from the last, the output devices are emptied one after the other and the objects are returned to the sorting device and
   the sorting device is designed so as, in the last run, each object is transferred into one of the sorting end locations,
   at least one assignment of a sorting end location to a group of delivery points, comprising one or more delivery points, is additionally stored in the data memory,
   wherein the group of delivery points consists of one or more delivery points that follow one another directly in the delivery sequence,
   characterized in that the sorting device is designed so as, in each run, all of the objects that are coded with a delivery point of the group of delivery points are transferred in the sorting installation into the sorting end location of the group of delivery points assigned in the data memory and, in the last run, are sorted in such a way
   that, in the sorting end location, they are sorted on the basis of delivery points according to the delivery sequence.
7. Device according to Claim 6,
   characterized in that
   the sorting device is designed so as
   the objects are sorted on the basis of the radix method.
8. Device according to Claim 6 or Claim 7,
   characterized in that
   the sorting device comprises

   - at least one fixed storage container and

   - a ring of pockets, which circulates around the storage containers and has pockets,

   and
   is designed so as, in the last run, the objects that are coded with a delivery point of a group of delivery points

   - are transported in pockets of the ring of pockets and

   - are buffer-stored by discharging the objects from the respective pockets into the at least one fixed storage container.
9. Device according to Claim 8,
   characterized in that
   the sorting end location of the group of delivery points comprises a likewise circulating destination container and
   the sorting device is designed so as
   in the last run, all of the objects that are coded with a delivery point of the group of delivery points
   are transferred into the sorting end location of the group of delivery points
   by discharging the objects into the circulating destination container.

Images