EP1792664B1 - Méthode de tri d' envois postaux et un appareil avec une structure de données pour un plan de tri - Google Patents

Méthode de tri d' envois postaux et un appareil avec une structure de données pour un plan de tri Download PDF

Info

Publication number
EP1792664B1
EP1792664B1 EP05026471A EP05026471A EP1792664B1 EP 1792664 B1 EP1792664 B1 EP 1792664B1 EP 05026471 A EP05026471 A EP 05026471A EP 05026471 A EP05026471 A EP 05026471A EP 1792664 B1 EP1792664 B1 EP 1792664B1
Authority
EP
European Patent Office
Prior art keywords
sorting
code
sorting code
range
code range
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Not-in-force
Application number
EP05026471A
Other languages
German (de)
English (en)
Other versions
EP1792664A1 (fr
Inventor
Malte Girnus
Michael Harbaum
Michael Dressler
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Deutsche Post AG
Original Assignee
Deutsche Post AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=36202534&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=EP1792664(B1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Deutsche Post AG filed Critical Deutsche Post AG
Priority to DE502005006892T priority Critical patent/DE502005006892D1/de
Priority to AT05026471T priority patent/ATE425817T1/de
Priority to ES05026471T priority patent/ES2322069T3/es
Priority to EP05026471A priority patent/EP1792664B1/fr
Priority to PCT/EP2006/011592 priority patent/WO2007065615A1/fr
Priority to US12/096,118 priority patent/US8110768B2/en
Priority to CA002632122A priority patent/CA2632122A1/fr
Publication of EP1792664A1 publication Critical patent/EP1792664A1/fr
Publication of EP1792664B1 publication Critical patent/EP1792664B1/fr
Application granted granted Critical
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B07—SEPARATING SOLIDS FROM SOLIDS; SORTING
    • B07C—POSTAL SORTING; SORTING INDIVIDUAL ARTICLES, OR BULK MATERIAL FIT TO BE SORTED PIECE-MEAL, e.g. BY PICKING
    • B07C3/00—Sorting according to destination
    • B07C3/02—Apparatus characterised by the means used for distribution
    • B07C3/06—Linear sorting machines in which articles are removed from a stream at selected points
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B07—SEPARATING SOLIDS FROM SOLIDS; SORTING
    • B07C—POSTAL SORTING; SORTING INDIVIDUAL ARTICLES, OR BULK MATERIAL FIT TO BE SORTED PIECE-MEAL, e.g. BY PICKING
    • B07C3/00—Sorting according to destination
    • B07C3/001—Code converters for keyboards in coding stations
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S209/00—Classifying, separating, and assorting solids
    • Y10S209/90—Sorting flat-type mail

Definitions

  • the invention relates to a method for sorting mailpieces, wherein a sorting compartment of a sorting machine is determined on the basis of a sorting plan which contains an association between mailpieces of assignable sorting codes and sorting compartments of a sorting machine.
  • the invention relates to a data structure suitable for carrying out the method for a sorting plan for sorting mailpieces.
  • the sorting of mailpieces usually takes place in dependence on sorting codes in which the address of the mailpieces is coded.
  • the sorting code is then applied to the mailpieces after the delivery address has been recorded in machine-readable form, such as a barcode. If the item of mail arrives in a sorting machine, the sorting code is detected and the item of mail is ejected into a sorting compartment assigned to the sorting code.
  • the sorting code is, for example, eleven digits, the first five digits corresponding to the postal code contained in the delivery address, which designates a so-called delivery district group comprising a plurality of delivery districts, which in turn contain the road sections within a location, each supplied by a single deliverer.
  • the following three digits contain a coded indication of the street designation contained in the delivery address, wherein it may be provided, for example, that the road sections of a delivery district group are numbered in a predetermined manner.
  • the last three digits of the sort code correspond to the last three digits of the house number specified in the delivery address.
  • the sorting of mailpieces usually takes place in an at least two-stage process.
  • the postal consignments placed in a region are collected in a distribution center of a postal enterprise assigned to this region and, in the context of exit sorting, distributed in particular to the distribution centers in the destination regions of the mailpieces.
  • a fine sorting of the consignments takes place within the framework of the so-called inward sorting, in which case they are distributed to the individual delivery districts in the destination region.
  • the incoming sorting usually also includes a sorting of the mailpieces according to the sequence in which the deliverers supply the delivery points of the delivery districts.
  • the European patent application EP 0 661 106 A2 describes a method for sequence sorting mailpieces.
  • the sequence sorting takes place in several sorting runs. In a first pass, the first positions are assigned from the right to each predetermined bins, in subsequent runs, the following locations are assigned from the right each predetermined bins etc.
  • the sorting depth in the departure sorting ie the number of sorts of sorting code items that go beyond the postal code or the first five digits of the sort code.
  • postal items for certain road sections of a delivery district or a delivery district group can be summarized already in the input sorting, which are sorted at the input sorting in a machine input after the sequence, or it can mail for a subsection of a delivery area or Zustellbezirkslitis together with Shipments for another Zustellbezirkslitis be discharged together in a bin to make the best use of the capacity of the sorting machine. In some cases, however, only one sorting takes place according to the postcode or the first five digits of the sorting code.
  • the assignment of the sorting codes to the sorting compartments of a sorting machine usually takes place on the basis of a so-called sorting plan, which is read out by the sorting machines.
  • the sorting plans of the prior art usually include two lists, one of which contains the associations between postal codes or the first five digits of the sort code to sort bins and is decisive for the sorting of the mailings in which only one Sorting depth is provided according to the postal code.
  • the second list comprises the associations between complete sort codes or intervals of complete sort codes and sort bins for the sorting of mail items in which a sorting depth corresponding to the complete sort code is provided.
  • the list which contains the Postal codes are checked to see if there is a match of the first five digits of the default sort code with one of the postal codes in the list. Furthermore, the list with the complete sorting codes must also be searched in order to check whether there is also a match between the predetermined sorting code and a sorting code contained in the list.
  • a method of the aforementioned type is performed such that a sorting bin is assigned to each of several sorting code areas, wherein at least one first sorting code area is assigned at least one further sorting code area, which is a subarea of the first sorting code area that is assigned to each other Sorting code ranges is checked in succession whether there is an affiliation of the sorting code to the sorting code area and that the mailpiece is ejected into the sorting bin associated with the last sorting code area where the membership of the sort code is the sort code area.
  • the data structure according to the invention for a sorting plan for sorting a mail item wherein the sorting plan contains an association between a sorting code associated with the mail item and a sorting compartment of a sorting machine, is characterized in that it contains a plurality of sorting code areas, each of which has a sorting compartment assigned to it comprises at least one first sorting code range in a first hierarchical level and at least one second sorting code range assigned to the first sorting code range is specified in a lower hierarchical level, and that the sorting code is assigned to the sorting code associated with the sorting code range which is in the lowest Hierarchy level is specified, in which an affiliation of the sort code to the specified sorting code range exists.
  • a sorting code area is understood here to mean a set of sorting codes which have one or more predetermined properties.
  • a sorting code area can not contain a sorting code or at least include a sorting code.
  • a subregion of a sorting code region is understood to mean a set of sorting codes which additionally have further properties, the quantity being either empty or comprising at least one sorting code.
  • it may be specified as a property that the sorting codes is a postal code in a predetermined interval or that the number corresponding to the last three digits of the house number lies within a predetermined interval.
  • the invention is based on the idea of making the determination of the membership of a given sorting code for a specific sorting code range, which is assigned to a sorting bin of a sorting machine within the sorting plan simpler and faster, by defining sorting code ranges and subareas assigned thereto, for which successive checks are made whether there is a membership of the sorting code to the sorting code areas and the partial areas, and by assigning to the mailing the sorting bin associated with the last sorting code area or partial area to which a membership of the sorting code is determined.
  • the sorting code area is determined which contains sorting codes which match the predetermined sorting code with respect to a first property. Then, from this sorting code area, the partial area is determined which comprises sorting codes which also match the predetermined sorting code with respect to a second property.
  • sorting plan is very simple and clear based on the hierarchical structure. This facilitates the creation of the sorting plan and, if necessary, verifications of its correctness.
  • the sorting code is a numerical code and that a sorting code area comprises all sorting codes in which a number, which is formed from at least one digit, is formed located at a predetermined location of the sort code, is within a predetermined interval.
  • this hierarchy corresponds to the infrastructure comprising various administrative units, which is based on the transport of mailpieces from a source region to a destination region and the delivery of the mailpieces within the destination region.
  • an interval is understood to mean an interval of integers which contains either no element or at least one element.
  • a further sorting code area is assigned to a first sorting code area, which comprises all the sorting code associated with the first sorting code area, in which a number which is formed from at least one digit which is itself located at least one of the predetermined location subsequent location of the sorting code is within a predetermined interval.
  • partial areas can be assigned to the first sorting code area, which corresponds to a specific level of the infrastructure which administrative units designate at a lower level of infrastructure.
  • a particularly advantageous embodiment of the method according to the invention and the data structure according to the invention is characterized in that it is a p-digit numerical sorting code of the form n 1 ⁇ n p with n i ⁇ ⁇ 0,..., 9 ⁇ and 1 ⁇ i ⁇ p and that a first sorting code area comprises all the sorting codes in which the number n 1 ⁇ n x is not smaller than a first number and not larger than a second number, where x is an integer with 1 ⁇ x ⁇ p is.
  • a further advantageous embodiment of the method according to the invention and the data structure according to the invention comprises that at least one further sorting code range is assigned to the first sorting code range, which comprises all sorting codes of the first sorting code range in which the number n x + 1 ⁇ n y is not smaller than a first sorting code range Number and not greater than a second number, where y is an integer with x ⁇ y ⁇ p.
  • the first sorting code area is assigned a plurality of further sorting code areas, which are each a subarea of the first sorting code area, wherein the second sorting code areas are checked in a predetermined order to determine whether an affiliation of the sort code to the sort code areas.
  • the first sorting code area can be assigned a plurality of different subareas which, for example, correspond to a plurality of different administrative units within a lower level of the infrastructure.
  • a particularly preferred embodiment of the method according to the invention and of the data structure according to the invention is characterized in that the further sorting code areas assigned to the first sorting area are pairwise disjoint.
  • At least one further sorting code area is assigned to each of a plurality of first sorting code areas, the first sorting code areas being disjoint in pairs.
  • An expedient embodiment of the method according to the invention and of the device according to the invention is characterized in that the sorting code is an eleven-digit numerical sorting code whose first five digits correspond to a postal code contained in the mailing address of the mail item, the following three digits one in the delivery address correspond to the road section contained and the last three digits correspond to a street number contained in the delivery address.
  • a first sorting code area comprises all sorting codes in which the postal code is located in a predefined postal code area. It is under a postal code area to understand an interval of postal codes.
  • a second sorting code area assigned to the first sorting code area comprises all sorting codes of the first sorting code area in which the road section coincides with one of a plurality of predetermined road sections.
  • the second sorting code area is assigned a third sorting code area which comprises all sorting codes of the second sorting code area in which the number formed from the last three digits of the house number lies within a predefined house number area.
  • the method according to the invention and the data structure according to the invention are advantageously designed in such a way that within a sorting plan the structure which normally also exists within the sorting code is mapped.
  • a device for sorting mailpieces in which the mailpieces are sorted out in sorting compartments depending on the sorting codes assigned to the mailpieces, wherein the sorting compartments can be assigned to the sorting codes on the basis of a sorting plan, is provided, which is characterized in that the sorting plan is stored in a storage means connected to the sorting machine and that the sorting plan contains a data structure formed in the manner described above.
  • the device is connected to the storage means via a data network.
  • a further advantageous embodiment of the invention provides that the sorting plan can be transferred from the storage means to the sorting machine, wherein the data structure of the sorting plan can be adapted to the sorting machine.
  • the storage means is arranged in the region of the device.
  • the sorting of mail items is usually carried out in the context of an at least two-stage process, which comprises the departure sorting in a distribution center of a postal company assigned to the originating region of the mail item and the incoming sorting in a distribution center assigned to the destination region of the mail item.
  • the disposal sorting the mailpieces received are distributed in particular to the target regions and, after completion of the disposal sorting, are sent to the distribution centers of the target regions. There, then, a fine sorting of the mailings takes place in which they are distributed among the delivery districts within the destination region and are usually also sorted according to the sequence of the delivery routes in the individual delivery districts.
  • the machine entrances are sorting destinations that aggregate the destinations for which postal items are sorted together in a sorting machine during inbound sorting.
  • a machine input comprises, for example, mail items for several delivery districts, which are sorted together in a sorting machine according to the sequence in which deliverers deliver them in the delivery districts.
  • the distribution centers usually have an encoding device in which the delivery address applied to a mail item or the information contained in the delivery address of the street, the house number and the postal code and the location are detected and converted into a numerical sorting code.
  • the detection is carried out initially automated in an OCR device (OCR: Optical Character Recognition) and - if the delivery address could not be detected here - in a video encoder in which a delivery address contained image of the broadcast surface of a video coding is displayed on a screen. This recognizes the delivery address and enters it in an input means, whereupon then the conversion of the address into the sorting code takes place.
  • OCR OCR: Optical Character Recognition
  • the sorting code applied to the mailpieces is first read in by means of a scanner. Then, based on the sorting plan stored in the sorting machine, it is ascertained into which sorting bin the item is to be removed on the basis of its sorting code. Subsequently, the mail item is conveyed to the sorting bin and there discharged.
  • the assignment list is part of a sorting plan that is loaded into the sorting machine and interpreted by it.
  • sorting code the following description is based on the example of the sorting code used in the applicant's field in which the delivery address is encoded in an eleven-digit numerical code.
  • the person skilled in the art recognizes, however, that the invention can basically be carried out with arbitrary sorting codes and adapted in a simple manner to different codes used in the sorting of mailpieces.
  • n 1 ⁇ n 11 is also used for the sorting code, where n i ⁇ ⁇ 0,..., 9 ⁇ is a placeholder for the ith digit of the sorting code.
  • the first five digits n 1 n 2 n 3 n 4 n 5 of the sorting code correspond to the postcode indicated in the delivery address, which in particular is a delivery district group, a plurality of mailbox cabinets each comprising a plurality of mailboxes, or a combination of one or more delivery district groups and one or more delivery codes referred to several mailbox cabinets.
  • a postal code is referred to as Zustellpostleitiere (Zustell-ZIP), Postfachpostleitiere (PO box postal code) or Kombi ZIP code ( Kombi-ZIP).
  • the first two digits n 1 n 2 of the postal code or of the sorting code can be taken from the region in which the delivery district group and / or the plurality of mailbox cabinets designated by the postal code are located.
  • Each region and therefore also each postal code is assigned exactly one distribution center.
  • a delivery area group designated by a delivery or combination zip code comprises one or more delivery areas, the delivery points within a delivery area being supplied with mail by exactly one deliverer on its delivery route.
  • the delivery districts in turn comprise one or more road sections within the geographical region associated with a delivery district group.
  • Each road section is assigned a three-digit code, which is determined, for example, by numbering the road sections of the geographical region according to a predetermined pattern. Within the sort code, this three-digit code occupies the digits n 6 n 7 n 8 .
  • Each road section in turn comprises one or more house addresses, which are defined by a house number information, which is contained within the sorting code in the places n 9 n 10 n 11 .
  • a six-digit number is assigned to a mailbox which corresponds to the last six digits of the sort code, ie the digits n 6 n 7 n 8 n 9 n 10 n 11 , if the delivery point encoded therein is a mailbox.
  • the machine inputs in the incoming sorting of mail are usually associated with groups of multiple delivery districts.
  • several delivery districts are combined to form a sequence of orders, with all items of a gang group being sorted together in a sorting machine according to the course of the delivery routes.
  • the sequence of services which is also a sorting destination for the departure sorting, is generally not to be equated with the delivery district group, which represents an organizational unit of the postal company, which is responsible for the Sorting of postal items is not relevant.
  • multiple mailbox cabinets are grouped into mailbox cabinet associations for sorting, each of which represents a machine entrance to incoming sorting.
  • large recipient postal codes large recipient postal code
  • special postal code numbers action postal code
  • a large receiver is a recipient who regularly receives a large number of mail items, for example more than 200 items per day, and to whom the items of mail are not delivered in the usual way by a delivery agent but directly from a distribution center.
  • the delivery address of postal items that are addressed by means of a bulk recipient postal code or an action postal code contains no further details about the delivery point. Accordingly, the sort code for mail addressed with such zip code includes only the first five digits. The other digits are either omitted or contain a given character.
  • sorting destinations which are taken into account in the sorting of the mailpieces, in particular in the departure sorting, must be described predominantly on the basis of sorting code areas of the entire eleven-digit sorting code. Only in certain cases, such as broadcasts addressed to a major recipient, in action mail or otherwise coincidentally If the creation of the sorting plans seems favorable, a description of the sorting destinations can be made on the basis of the postal code.
  • the sorting plans which contain an association between the sorting codes and the sorting compartments of the sorting machines, are hierarchically structured.
  • the hierarchy levels provided in this structure relate to specific locations within the sort code, as will be described in detail later.
  • the sorting plans be designed as XML documents (XML: Extensible Markup Language), which are transmitted from a system provided for the creation to the distribution centers and loaded there into the sorting machines.
  • the sorting plans are thereby regularly adapted to changed conditions, for example to added or dropped house addresses or to changed delivery districts.
  • DTD Document Type Definition
  • the version block which is not described here in detail, contains in particular an indication of the version of the sorting plan and the distribution center as well as the sorting machine for which the sorting plan is intended.
  • the version can be specified, for example, by means of a consecutive number, which is incremented with each new creation or adaptation and thus uniquely identifies the version of the sorting plan.
  • the definition block indicates whether it is a complete sorting plan or whether only changes to older sorting plans are specified. If the (empty) element INITIAL is contained in the DTD, then this is a complete sorting plan. If the (empty) DELTA element exists instead of the INITIAL element, then the sorting plan is a so-called Delta delivery, which contains only the changes from previous sorting plans.
  • a delta delivery has the advantage that the data volume to be transmitted to the distribution centers or the sorting machines is substantially lower than the delivery of a complete sorting plan.
  • the sorting plan In the distribution center or within the sorting machine, however, the sorting plan must be created from the older sorting plan, taking into account the changes specified in the delta delivery, which is very time-consuming, above all with a large number of changes. Therefore, it can be provided that, depending on the number of changes within the sorting plan, a decision is made as to whether a new version of the sorting plan is transmitted in its entirety or as a delta delivery to a distribution center.
  • the LEVEL element is used to define the hierarchy levels provided. In this case, it is provided that predetermined locations of the sorting code are assigned to each hierarchical level, wherein each entry of the list respectively indicates the number of digits of the sorting code considered in the corresponding hierarchical level.
  • leading digits of the sorting code are assigned to the highest hierarchical level in the number specified in the first list entry of the element LEVEL, the next lower hierarchical level are assigned the following digits of the sorting code in a number specified in the second list entry of the element LEVEL, etc.
  • the element FACH optionally contained in the element SL describes a sorting compartment into which mailpieces with all sorting codes specified in the sorting list are ejected.
  • the STATUS element occurs on delta deliveries and specifies whether an assignment between a sort code area is to be newly created in the sorting plan (in this case, the STATUS element assumes the value 1), whether an assignment existing in the older sorting plan should be deleted (the status element takes the value 0) or an existing assignment in the older sorting plan should be replaced by the specified one (the Status element takes the value 2).
  • the elements SLCODE for deeper hierarchy levels are each contained in an element SLCDOE the next higher hierarchical level.
  • subregions of the sorting code range are specified which are described in the next higher hierarchical level.
  • subregions of the sorting code areas defined in the highest hierarchical level are defined defined, which include sorting codes, in which additionally the number n x + 1 ⁇ n y lies within a predetermined interval.
  • the number y - x corresponds to the number of digits assigned to the next lower level.
  • portions of these sorting code ranges can be specified in an analogous manner, and so on.
  • the sorting code areas defined in the topmost hierarchical level are pairwise disjunctive, i.e., a given sorting code is contained in none or exactly one of the sorting code areas.
  • the subareas of these sorting code areas which are defined in a lower hierarchical level are preferably also disjoint in pairs, so that a specific sorting code area is uniquely determined by a successive evaluation of all hierarchical levels.
  • a sorting code area defined in a specific hierarchical level is uniquely associated with a node of the corresponding depth within the tree whose children's nodes are each associated with subareas of this sorting code area.
  • the sorting code areas associated with sibling nodes are pairwise disjoint.
  • sorting code range specified in a hierarchical level in the element SLCODE is defined on the basis of the digits of the code which are assigned to this hierarchical level. It is intended in that the sorting code area comprises all the sorting codes in which the number, which is formed from the locations of the sorting code assigned to the hierarchy level, lies within a predetermined interval of integer numbers. The lower limit of this interval is given by the element VON contained in the element SLCODE. The upper limit is specified using the BIS element.
  • the interval only includes the number specified in the element VON.
  • the sorting codes which are contained in the sorting code ranges which are defined in the different hierarchical levels are determined successively.
  • the total defined sorting code area contains all the sorting codes encompassed by the sorting code areas in each level.
  • said sorting code area can be interpreted as being shipments whose delivery address contains the postal code 12345 which are located in the street sections 100 and 101 of the corresponding delivery area group and where the last three digits of the house number corresponding number is between 0 to 999.
  • this expression in particular does not specify the sort code range from 12345 100 004 to 1234 102 560; For example, sorting code 12345 101 999 does not lie in the sorting code area thus defined.
  • a 5,6 hierarchy that consists of two levels of hierarchy.
  • the upper hierarchy level is assigned the first five digits of the eleven-digit sorting code and the lower hierarchical level the last six digits of the sorting code.
  • sort code ranges can be represented with only one indication of an interval for each designated level only if the lowest level subcodes of the interval are completely encompassed, as in the 5,3,3 hierarchy, for example at the interval 12345 100 000 to 12345 101 999, or when the upper and lower interval boundaries of a code interval differ only in the locations assigned to the lowest hierarchical level, as for example at the code interval 12345 100 004 to 12345 100 560 is the case. Otherwise, multiple interval specifications for the individual levels may be required.
  • the specified sorting code range comprises only sorting codes with even elements (element G present) or odd elements (element U present) of the specified interval.
  • sorting code areas which exclusively contain sorting codes for house addresses which are located in predetermined road sections of a delivery district group on a roadside.
  • sorting plans or sorting lists for the sorting of mail items specified in an XML document in the manner previously described are evaluated, ie. how the sorting compartment is determined on the basis of the hierarchically structured sorting lists shown above, into which a mailing item with a predetermined sorting code is ejected.
  • the postal code range specified in the uppermost hierarchical level for example, in which the postal code contained in the predetermined sorting code area is located, is thus first of all determined.
  • the predetermined sorting code is located, whereby only the sorting code areas assigned to the sorting code area specified in the upper level are taken into account here.
  • the procedure for the existing subsequent hierarchy levels is analogous, whereby the sorting compartment which is assigned to the sorting code area which is specified in the lowest hierarchical level in which the membership of the hierarchy is assigned is decisive for the sorting predetermined sorting codes for the specified sorting code range exists.
  • a further step may be followed, in which it is determined in which of the street numbers specified for the previously determined street section with the postal code specified in the first step the number of house numbers contained in the sort code lies.
  • the consignment is thereby discharged into the compartment which is assigned to the house number area in which the number of digits contained in the sorting code is the last three digits of the house number.
  • the sorting compartment which is assigned to the road section area determined in the preceding step becomes relevant for the sorting of the mail item.
  • the delivery address in the coding device When coding the delivery address in the coding device, it may happen that parts of the address are not recognized and encoded because they are illegible, for example.
  • the sort code remains incomplete in this case and contains only the places that can be determined within the scope of the coding. As a rule, however, at least the postcode in the OCR device or the video coding device can be recognized and coded.
  • stepwise evaluation of the sorting plan is carried out until the evaluation in the hierarchy level, the locations of the sorting code are still completely contained in the sort code.
  • the sort code contains only a postal code and a hierarchy is provided to the top hierarchy levels of which the first five digits of the sort code are assigned, then the item will be dumped to the bin associated with the zip code range that includes the zip code contained in the sort code.
  • the sorting plans constructed in the manner according to the invention are preferably transmitted in XML format by the system in which the sorting plans are created.
  • sorting plans executed in XML format are that they can be interpreted across systems, so that the sorting plans can be created independently of the special type of sorting machine. With regard to the sorting machine, therefore, when creating the sorting plans, only the number of existing sorting bins has to be taken into account.
  • sorting plans can not process in XML format.
  • the in Forms of an XML document created sorting plans are converted by a conversion system into a format that is interpretable by the sorting machine.
  • the conversion system can be part of the system for creating the sorting plans or the sorting machine. Furthermore, it may also be an independent system, which is preferably connected via a data network with the system for creating the sorting plans and with the sorting machine.

Landscapes

  • Sorting Of Articles (AREA)
  • Warehouses Or Storage Devices (AREA)

Claims (16)

  1. Procédé pour trier un envoi postal, l'envoi postal étant transféré vers une case de tri d'une machine de tri en fonction d'un code de tri associé à l'envoi postal et respectivement une case de tri étant associée à plusieurs plages de codes de tri,
    caractérisé en ce que
    à au moins une première plage de codes de tri est associée au moins une autre plage de codes de tri qui est une sous-plage de la première plage de codes de tri, en ce qu'il est vérifié, successivement pour les plages de codes de tri associées les unes aux autres, s'il y a un rapport d'appartenance entre le code de tri et la plage de codes de tri et en ce que l'envoi postal est transféré dans la case de tri qui est associée à la dernière plage de codes de tri pour laquelle il y a rapport d'appartenance entre le code de tri et la plage de codes de tri.
  2. Procédé selon la revendication 1,
    caractérisé en ce que
    le code de tri est un code numérique et en ce qu'une plage de codes de tri inclut tous les codes de tri dans lesquels un nombre constitué d'au moins un chiffre qui se trouve à une position prédéterminée du code de tri se trouve dans un intervalle prédéterminé.
  3. Procédé selon la revendication 1,
    caractérisé en ce que
    est associée, à une première plage de codes de tri, une autre plage de codes de tri qui inclut tous les codes de tri associés à la première plage de codes de tri et dans lesquels un nombre constitué d'un chiffre qui se trouve à au moins une position du code de tri suivant la position prédéterminée se trouve dans un intervalle prédéterminé.
  4. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que
    le code de tri est un code de tri numérique à p positions de la forme n1···np avec ni ∈ {0,...,9} et 1 ≤ i ≤ p et en ce qu'une première plage de codes de tri inclut tous les codes de tri pour lesquels le nombre n1···nx n'est pas inférieur à un premier nombre et n'est pas supérieur à un deuxième nombre, x étant un entier tel que 1 ≤ x < p.
  5. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que
    à la première plage de codes de tri est associée au moins une autre plage de codes de tri qui inclut tous les codes de tri de la première plage de codes de tri pour lesquels le nombre nx+1···ny n'est pas inférieur à un premier nombre et n'est pas supérieur à un deuxième nombre, y étant un entier tel que x < y ≤ p.
  6. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que
    à la première plage de codes de tri sont associées plusieurs autres plages de codes de tri qui sont respectivement une sous-plage de la plage de codes de tri, les autres plages de codes de tri étant ensuite contrôlées dans un ordre prédéterminé pour établir l'existence d'un rapport d'appartenance entre le code de tri et les plages de codes de tri.
  7. Procédé selon la revendication 6,
    caractérisé en ce que
    les autres plages de codes de tri associées à la première plage de codes de tri sont disjointes par paires.
  8. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que
    respectivement une autre plage de codes de tri est associée à plusieurs premières plages de codes de tri, les premières plages de codes de tri étant disjointes par paires.
  9. Procédé selon l'une des revendications précédentes,
    caractérisé en ce que
    le code de tri est un code numérique à onze positions dont les cinq premiers chiffres correspondent à un code postal contenu dans l'adresse de livraison de l'envoi postal, dont les trois chiffres suivants correspondent à une section de rue contenue dans l'adresse de livraison et dont les trois derniers chiffres représentent les trois dernières positions d'un numéro de domicile contenu dans l'adresse de livraison.
  10. Procédé selon la revendication 9,
    caractérisé en ce que
    une première plage de codes de tri inclut tous les codes de tri pour lesquels le code postal se trouve dans une plage prédéterminée de codes postaux.
  11. Procédé selon la revendication 10,
    caractérisé en ce que
    une deuxième plage de codes de tri associée à la première plage de codes de tri inclut tous les codes de tri de la première plage de codes de tri pour lesquels la section de rue coïncide avec l'une de plusieurs sections de rue prédéterminées.
  12. Procédé selon la revendication 11,
    caractérisé en ce que
    à la deuxième plage de codes de tri est associée une troisième plage de codes de tri qui inclut tous les codes de tri de la deuxième plage de codes de tri pour lesquels le nombre constitué des trois dernières positions du numéro de domicile se trouve à l'intérieur d'une plage prédéterminée de numéros de domicile.
  13. Dispositif pour trier des envois postaux, dans lequel les envois postaux peuvent être transférés vers des cases de tri en fonction de codes de tri associés aux envois postaux, les cases de tri pouvant être associées aux codes de tri à l'aide d'un plan de tri,
    caractérisé en ce que
    le plan de tri est stocké dans un moyen de mémoire relié à la machine de tri et
    comporte une structure de données, qui contient une association entre un code de tri associé à un envoi postal et une case de tri,
    la structure de données contenant plusieurs plages de codes de tri auxquelles est respectivement associée une case de tri,
    en ce que la structure de données comprend au moins deux niveaux hiérarchiques, au moins une première plage de codes de tri étant indiquée dans un premier niveau hiérarchique et au moins une deuxième plage de codes de tri, associée à la première plage de codes de tri et qui est une sous-plage de la première plage de codes de tri, étant indiquée dans un niveau hiérarchique inférieur, et
    en ce qu'au code de tri est associée la case de tri qui est associée à la plage de codes de tri qui est indiquée dans le niveau hiérarchique le plus bas auquel il y a un rapport d'appartenance entre le code de tri et la plage de codes de tri indiquée.
  14. Dispositif selon la revendication 13,
    caractérisé en ce que
    il est relié au moyen de mémoire par l'intermédiaire d'un réseau de données.
  15. Dispositif selon la revendication 13 ou 14,
    caractérisé en ce que
    le plan de tri peut être transmis du moyen de mémoire à la machine de tri, la structure de données du plan de tri pouvant être adaptée à la machine de tri.
  16. Dispositif selon la revendication 13,
    caractérisé en ce que
    le moyen de mémoire est situé dans la zone du dispositif.
EP05026471A 2005-12-05 2005-12-05 Méthode de tri d' envois postaux et un appareil avec une structure de données pour un plan de tri Not-in-force EP1792664B1 (fr)

Priority Applications (7)

Application Number Priority Date Filing Date Title
DE502005006892T DE502005006892D1 (de) 2005-12-05 2005-12-05 Verfahren zum Sortieren von Postsendungen und Vorrichtung mit einer Datenstruktur für einen Sortierplan
AT05026471T ATE425817T1 (de) 2005-12-05 2005-12-05 Verfahren zum sortieren von postsendungen und vorrichtung mit einer datenstruktur fur einen sortierplan
ES05026471T ES2322069T3 (es) 2005-12-05 2005-12-05 Procedimiento para la clasificacion de envios postales y dispositivo con una estructura de datos para un plan de clasificacion.
EP05026471A EP1792664B1 (fr) 2005-12-05 2005-12-05 Méthode de tri d' envois postaux et un appareil avec une structure de données pour un plan de tri
PCT/EP2006/011592 WO2007065615A1 (fr) 2005-12-05 2006-12-04 Procede pour trier des envois postaux et structure de donnees pour un plan de tri
US12/096,118 US8110768B2 (en) 2005-12-05 2006-12-04 Method for sorting postal items and data structure for a sorting plan
CA002632122A CA2632122A1 (fr) 2005-12-05 2006-12-04 Procede pour trier des envois postaux et structure de donnees pour un plan de tri

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP05026471A EP1792664B1 (fr) 2005-12-05 2005-12-05 Méthode de tri d' envois postaux et un appareil avec une structure de données pour un plan de tri

Publications (2)

Publication Number Publication Date
EP1792664A1 EP1792664A1 (fr) 2007-06-06
EP1792664B1 true EP1792664B1 (fr) 2009-03-18

Family

ID=36202534

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05026471A Not-in-force EP1792664B1 (fr) 2005-12-05 2005-12-05 Méthode de tri d' envois postaux et un appareil avec une structure de données pour un plan de tri

Country Status (7)

Country Link
US (1) US8110768B2 (fr)
EP (1) EP1792664B1 (fr)
AT (1) ATE425817T1 (fr)
CA (1) CA2632122A1 (fr)
DE (1) DE502005006892D1 (fr)
ES (1) ES2322069T3 (fr)
WO (1) WO2007065615A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100912507B1 (ko) 2007-09-18 2009-08-17 한국전자통신연구원 다량 우편물 생성 시스템 및 그 생성 방법
US20090159508A1 (en) * 2007-12-20 2009-06-25 Bowe Bell + Howell Company Relational scheme assignment
US20090223872A1 (en) * 2008-03-07 2009-09-10 Ronald Robbins System and method for sorting items
JP5414866B1 (ja) * 2012-09-26 2014-02-12 日立アロカメディカル株式会社 検体搬送システム
US9259765B2 (en) * 2012-12-19 2016-02-16 Pitney Bowes Inc. Mail run balancing using video capture

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
NL6715302A (fr) * 1967-11-10 1969-05-13
JPS55110B2 (fr) * 1972-06-19 1980-01-05
JPS57190685A (en) 1981-05-19 1982-11-24 Tokyo Shibaura Electric Co Sorter for letter mail
US5119954A (en) * 1990-03-29 1992-06-09 Bell & Howell Company Multi-pass sorting machine
JPH07185472A (ja) 1993-12-28 1995-07-25 Hitachi Ltd 紙葉類区分装置
GB2289966A (en) * 1994-05-24 1995-12-06 Ibm Mail sorting
TR199501071A2 (tr) * 1994-08-31 1996-06-21 Lilly Co Eli Dihidro-2,3-benzodiazepin türevlerinin üretilmesi icin stereoselektif islem.
US6566620B1 (en) 1997-08-06 2003-05-20 Siemens Atkiengsellschaft Method for sorting mail items
US6274836B1 (en) 1998-10-08 2001-08-14 International Business Machines Corp. Method and system for multi-stream object sorting
KR100336498B1 (ko) 2000-01-27 2002-05-15 오길록 우편물 처리 시스템 및 방법
GB2370823B (en) * 2001-01-09 2004-09-22 Post Office An improved sorting system
DE10112186C2 (de) 2001-03-14 2003-02-13 Siemens Production & Logistics Verfahren zum Ermitteln von Fehlerarten fehlerbehafteter Leseergebnisse
US6829369B2 (en) * 2001-05-18 2004-12-07 Lockheed Martin Corporation Coding depth file and method of postal address processing using a coding depth file
US20040040898A1 (en) 2002-08-30 2004-03-04 Kechel Ottmar K. Method and system for sorting manual mail

Also Published As

Publication number Publication date
WO2007065615A1 (fr) 2007-06-14
DE502005006892D1 (de) 2009-04-30
ATE425817T1 (de) 2009-04-15
US8110768B2 (en) 2012-02-07
ES2322069T3 (es) 2009-06-16
CA2632122A1 (fr) 2007-06-14
EP1792664A1 (fr) 2007-06-06
US20080264836A1 (en) 2008-10-30

Similar Documents

Publication Publication Date Title
DE19705891C1 (de) Verfahren zur Sortierung von Sendungen
EP0934128B1 (fr) Procede et dispositif pour le traitement en ligne de courrier a expedier
DE10021734C1 (de) Verfahren und Vorrichtung zum Ermitteln von Gebieten mit Verteilinformationen auf Sendungen
EP1773513A1 (fr) Procede et dispositif de tri d&#39;envois postaux
EP1792664B1 (fr) Méthode de tri d&#39; envois postaux et un appareil avec une structure de données pour un plan de tri
EP2197599B1 (fr) Procédé et dispositif de transport et de traitement de plusieurs objets
DE60004370T2 (de) Verfahren und gerät zum aktualisieren einer adressendatenbank mit registrierten adressendaten
DE19650875C1 (de) Verfahren zur Sortierung von Sendungen
DE10006242B4 (de) Verfahren zur Sendungsverfolgung
EP2197596B1 (fr) Procédé et dispositif de transport d&#39;objets
DE10010241C1 (de) Verfahren und Vorrichtung zum Lesen der Adressen von Sendungen
DE102009060515A1 (de) Verfahren und Vorrichtung zum Sortieren von Gegenständen verschiedener Formatklassen
WO2000054898A1 (fr) Procede et dispositif pour le tri d&#39;envois en fonction de la tournee de distribution du courrier
EP1409161A1 (fr) Procede pour trier des envois sur des dispositifs de tri automatiques
EP1792665B1 (fr) Système logistique pour le transport de courrier et méthode pour déterminer un chemin de transport
EP1699569A1 (fr) Procede pour trier des articles posteaux adresses et non adresses
WO2010057820A1 (fr) Procédé et dispositif pour le transport d&#39;un objet vers une adresse de destination incomplète
EP1804217B1 (fr) Procédé et dispositif destinés au traitement de données relatives au tri d&#39;envois postaux
EP1916039B1 (fr) Procédé et identification d&#39;objets, et dispositif de comparaison de signature
EP3456423B1 (fr) Procédé pour l&#39;assemblage des envois pour un secteur postal
EP1229483A1 (fr) Méthode et appareil pour lire des adresses d&#39;envoi avec codes postaux
DE102005040688A1 (de) Verfahren zur Re-Identifizierung von stromförmigen zu sortierenden Sendungen
EP1229484A1 (fr) Méthode et appareil pour lire des adresses d&#39;envoi avec codes postaux
DE102011076331A1 (de) Verfahren und Vorrichtung zum Transportieren von Gegenständen in zwei Zustell-Zeiträumen

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20061212

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK YU

17Q First examination report despatched

Effective date: 20070823

AKX Designation fees paid

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RTI1 Title (correction)

Free format text: PROCESS FOR SORTING MAIL ITEMS AND APPARATUS COMPRISING A DATA STRUCTURE FOR A SORTING PLAN

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: GERMAN

REF Corresponds to:

Ref document number: 502005006892

Country of ref document: DE

Date of ref document: 20090430

Kind code of ref document: P

REG Reference to a national code

Ref country code: CH

Ref legal event code: NV

Representative=s name: R. A. EGLI & CO. PATENTANWAELTE

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2322069

Country of ref document: ES

Kind code of ref document: T3

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090618

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

REG Reference to a national code

Ref country code: IE

Ref legal event code: FD4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090827

Ref country code: IE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090718

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

PLBI Opposition filed

Free format text: ORIGINAL CODE: 0009260

PLAX Notice of opposition and request to file observation + time limit sent

Free format text: ORIGINAL CODE: EPIDOSNOBS2

26 Opposition filed

Opponent name: SIEMENS AKTIENGESELLSCHAFT

Effective date: 20091218

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090618

NLR1 Nl: opposition has been filed with the epo

Opponent name: SIEMENS AKTIENGESELLSCHAFT

PLAF Information modified related to communication of a notice of opposition and request to file observations + time limit

Free format text: ORIGINAL CODE: EPIDOSCOBS2

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20100701

PLBB Reply of patent proprietor to notice(s) of opposition received

Free format text: ORIGINAL CODE: EPIDOSNOBS3

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090619

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20091205

PLBD Termination of opposition procedure: decision despatched

Free format text: ORIGINAL CODE: EPIDOSNOPC1

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090919

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

PLBM Termination of opposition procedure: date of legal effect published

Free format text: ORIGINAL CODE: 0009276

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: OPPOSITION PROCEDURE CLOSED

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20090318

27C Opposition proceedings terminated

Effective date: 20110605

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: CH

Payment date: 20121221

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20121220

Year of fee payment: 8

Ref country code: ES

Payment date: 20121217

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: AT

Payment date: 20121212

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: BE

Payment date: 20121219

Year of fee payment: 8

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20121220

Year of fee payment: 8

BERE Be: lapsed

Owner name: DEUTSCHE POST A.G.

Effective date: 20131231

REG Reference to a national code

Ref country code: NL

Ref legal event code: V1

Effective date: 20140701

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: AT

Ref legal event code: MM01

Ref document number: 425817

Country of ref document: AT

Kind code of ref document: T

Effective date: 20131205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131231

Ref country code: NL

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140701

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131231

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131205

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20141231

Year of fee payment: 10

Ref country code: GB

Payment date: 20141219

Year of fee payment: 10

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20141219

Year of fee payment: 10

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20150709

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131206

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131205

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 502005006892

Country of ref document: DE

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20151205

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20160831

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20160701

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151205

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151231