DE102012211964A1 - Method for transportation of parcels to service addresses in given responsibility area of post service provider, involves selecting sorting destination of sorting system by using sorting plan, and exporting objects in selected destination - Google Patents

Abstract

The method involves automatically generating sorting plans generated by a sorting plan generator for a sorting system (SAnl.1), where the plans utilizes target point information determined by the system. Objects i.e. parcels (P), to be transported to the system are transported at target points (Zp.2), where the target points belong to a responsibility area (Ber.2) of the system. The target points are determined by the sorting system. A sorting destination of the sorting system is selected by using the sorting plan. The objects are exported in the selected sorting destination. An independent claim is also included for an arrangement for transportation of multiple objects to target points.

Description

The invention relates to a method and a device for transporting a plurality of objects to destinations, in particular of several postal packages to delivery addresses.

The solution according to the method can be used for different types of objects that are to be transported to destinations, z. B. for postal packages.

A postal parcel goes through at least one sorting system on its way from the place of delivery to the destination and is then transported to a delivery base and transported from there to the destination in a delivery vehicle. A postal parcel, which is to be transported over a greater distance, first passes through a first sorting installation, is transported together with many other parcels to a second sorting installation and passes through this second sorting installation and is transported from there to a delivery base.

1 from EP 1089831 B1 shows an arrangement in which a package 201 from a departure location 200 "To a" destination location 300 "Is transported. The package 201 goes through a "first mail center 202 "And then a second mail center 203 ". In the "first mail center 202 "Will be the delivery address of the package 201 determined by OCR and if necessary by video coding. By read access to a "first data base", an address information address assigned to the delivery address is determined and applied to the packet 201 applied. A sorting conveyor 204 "Tosses the package 201 into the "discharge station 205 ", Which was previously selected depending on the determined" address information code ". From the "discharge station 205 "Will be the package 201 to the "second mail center 203 "Transported. The "first mail center 202 "Is responsible for a" region, city or country ", the" second mail center 203 "Is z. Eg a "regional post office". In the "second mail center 203 "Will be the package 201 into a previously selected "discharge station 206 "Removed and from there to the" destination location 300 "Transported. A "first control system 207 "For the" first mail center 202 "And a second control system 208 "For the" second mail center 203 "Choose the" discharge station 205 " respectively. 206 out. A sender of many packages can use a "sequence generating computer system 210 "Generating a" sortation and / or distributing sequence or sortation pattern "for the packets, cf. Section [0052] and Claim 33. Such a "sequence or sortation pattern" is sent to the two "control systems 207 . 208 " transmitted.

In WO 2009/007100 A1 For example, a method and apparatus for carrying a mail item in a logistics network is described. A sender of a mailing 10 transmitted with the help of a user computer 2 and the Internet advance information about a mailing 10 to a server 30 of the transporter, cf. 1 and p. 35. The sender also brings to the mailing 10 Data for identification of this mailing 10 on, z. B. in the form of a machine-readable code 20 , A processing unit 50 the transporter reads the code 20 with these identification data, cf. 1 , This processing unit 50 brings a second code 60 on the mailing. The second code 60 is z. In a database with the first code 50 connected. In one embodiment, the mailpiece 10 based on the first code 20 sorted and / or forwarded, cf. P. 38 / Z. 20-23.

In US Pat. No. 7,657,439 B2 For example, an apparatus and method are described for transporting and delivering mail to a United States Post Office Box. A mailing 12 from a sender ("consignor 11 ") Becomes a" regional sorting facility 19 Transported, cf. 5 , It is possible that the mailing 12 previously a "service center 3 or district hub 4 "Has gone through. The "regional sorting facility 19 "Sorts incoming mail to" ZIP codes ". mailings 12 become a local sorting facility in groups 20 Transported, cf. 5 , The mailing 12 is in one embodiment a package with a "label 12 ", Which in 1 and 3 is shown and in this example contains a "post office box identifier". For this "label 12 "Becomes a" label 14 "Generated and glued on the package. This generated "label 14 "Additionally shows the ID of a" post office branch 70 "In which the one" post office box 58 "Which is on the" label 12 "Is specified. The package 12 will continue to this "post office branch 70 "Transported. A "shipping computer 21 "The transporter is with the" consignor computer system 23 "Of the sender and with a" regional sorting facilty computer system 17 "Connected, cf. 6 , The "regional sorting facility computer system 17 "Sends feedback about incoming mail to the" shipping computer system 21 ". The "consignor computer system 23 "Transmits" billing and funds transfer information "to the" shipping computer system 21 ", see. the character "$" in 6 ,

It is desired to make good use of the capacities of the sorting installations and means of transport and other resources used for transporting the items.

The invention has for its object to provide a method and an arrangement that transport multiple items to predetermined destinations and thereby make good use of the existing capacity of the sorting systems used, means of transport and other resources, although not known in advance, which objects to transport to which destinations are and without the need for past data on the transport of goods.

The object is achieved by a method having the features of claim 1 and an arrangement having the features of claim 5. Advantageous embodiments are specified in the subclaims.

By the method according to the solution and the arrangement according to the solution several objects are transported to destination points. All destinations are in a given area of responsibility. For each object, a target point is given to which this object is to be transported. It is possible that the same target point is specified for several objects.

• – eine erste Sortieranlage
• – mindestens eine zweite Sortieranlage und
• – einen datenverarbeitenden Sortierplan-Generierer

umfasst. Used is an arrangement that

• - a first sorting plant
• - At least a second sorting system and
• A data-processing sorting plan generator

includes.

The first sorting system has several sorting outputs. Each additional sorting system also has several other sorting outputs. Each sorting system used is designed to divide articles depending on their respective destinations on the sorting outputs and aufzuschleusen the items in these sorting outputs. The term "sorting plant" in the sense of the claims may designate a single machine or also the entirety of the machines in a sorting center.

Each sorting plant is responsible for one area of responsibility in the area of responsibility. The limits of this area of responsibility are not specified, but automatically generated by the method according to the solution and the arrangement according to the solution, on the basis of advance information about objects that are currently to be transported.

The sorting plan generator can automatically generate for each sorting system in each case a computer-evaluable sorting plan and initiate the step of transmitting this generated sorting plan to a respective sorting system.

Advance information about objects to be transported is transmitted to the sorting plan generator. Each advance information relates to at least one item to be transported and includes a determination to which destination item this item is to be transported. All these objects, for each of which advance information is transmitted, will later pass through the first sorting system. It is possible that further objects pass through the first sorting system and there are no advance information for these further objects to be transported.

The sorting plan generator generates a sorting plan for the first sorting system on the basis of the preliminary information. Information as to which objects will actually reach the first sorting plant is not used and also not needed to generate this sorting plan for the first sorting plant. In particular, the information is not needed as to how many items are to be transported without advance information in addition to the items with advance information.

• – den Zuständigkeitsbereich, in dem dieser Zielpunkt liegt, und
• – abhängig von diesem Zuständigkeitsbereich einen Sortierausgang der ersten Sortieranlage

festlegt. Der erste Sortierplan berücksichtigt alle möglichen Zielpunkte im Zuständigkeitsgebiet. Zu dem Zeitpunkt, an dem der erste Sortierplan generiert wird, brauchen noch nicht alle Zielpunkte der zu transportierenden Gegenstände bekannt zu sein. Verwendet werden die Zielpunkt-Kennzeichnungen in den übermittelten Vorab-Informationen. Der Sortierplan-Generierer generiert also rechnerauswertbare Festlegungen von Zuständigkeitsbereichen innerhalb des vorgegebenen Zuständigkeitsgebiets. Auf Basis dieser Zuständigkeitsbereichs-Festlegungen generiert der Sortierplan-Generierer dann den Sortierplan, der jedem im Zuständigkeitsgebiet liegenden Zielpunkt jeweils einen Sortierausgang der ersten Sortieranlage zuordnet. A "sorting plan" for the first sorting installation is understood to mean a computer-evaluable definition which is valid for each destination point located in the area of responsibility and thus for each destination point of an object to be transported

• The area of responsibility in which this destination lies, and
• - Depending on this area of responsibility a sorting output of the first sorting system

sets. The first sorting plan considers all possible destination points in the area of responsibility. By the time the first sorting plan is generated, not all target points of the objects to be transported need to be known. The destination point markings are used in the transmitted advance information. The sorting plan generator thus generates computer-evaluable definitions of areas of responsibility within the specified area of responsibility. Based on these areas of responsibility The sorting plan generator then generates the sorting plan which assigns a sorting output to the first sorting system to each destination point located in the area of responsibility.

The sorting plan for the first sorting system thus assigns a sorting output to each target point that occurs. The sorting plan is generated in such a way that: Two target points that belong to two different areas of responsibility, the first sorting plan assigns two different sorting outputs. Therefore, the first sorting system that uses the first sorting plan can divide the items transported to the first sorting system into the areas of responsibility.

The target points that occur occur in a jurisdiction that is divided into several areas of responsibility. Each occurring destination lies in at least one area of responsibility and preferably not simultaneously in two delivery areas. According to the solution, the areas of responsibility are not predefined in advance, but are generated in the course of the method using the advance information.

The first sorting system determines the destination point for each object to be transported, selects a sorting output of the first sorting system as a function of the determined destination point and the generated first sorting plan and discharges the object to be transported into this selected sorting exit. From this sorting exit, the object is subsequently transported to that other sorting system which is responsible for the defined area of responsibility - unless the destination point lies within the area of responsibility of the first sorting installation. All objects in a sorting exit of the first sorting installation are transported to the same further sorting installation, thus saving the step of dividing these objects into different sorting installations.

• – ein Teilgebiet des Zuständigkeitsbereichs, wobei der Zielpunkt in diesem Teilgebiet liegt, und
• – abhängig vom Teilgebiet einen Sortierausgang der weiteren Sortieranlage

festlegt. As already mentioned, both the first sorting plant and each further sorting plant are responsible for one area of responsibility in the given area of responsibility. A "sorting plan" for a further sorting installation is understood to mean a computer-evaluable definition which is valid for each destination located in the area of responsibility of this further sorting installation and thus for each destination of an item transported to this further sorting installation

• A subarea of the area of competence where the destination is in that subarea, and
• - Depending on the sub-area a sorting output of the other sorting system

sets.

Each additional sorting system is responsible for one area of responsibility. A specification of the area of responsibility of a further sorting system has been generated by the sorting plan generator on the basis of the advance information. The sorting plan for this further sorting system therefore assigns each sorting destination that occurs in the area of responsibility of this further sorting installation to a sorting output of this further sorting installation. By the further sorting system divides the objects according to this further sorting plan on the sorting outputs, the further sorting system is therefore able to divide objects to destination points in this further area of responsibility according to a criterion, for. To different jurisdictions in the area of responsibility. This criterion, for. As the subdivision in delivery districts, is generated according to solution and not specified. In order to generate a further sorting plan, the sorting plan generator uses the destination points of the objects to be transported, which are determined by the first sorting installation. The sorting plan generator thus also uses the determined target points of objects without advance information.

As it passes through the further sorting installation, the object is discharged into the assigned sorting exit depending on the determined destination point and from the further sorting plan, and then transported to the subarea of the area of responsibility of the further sorting installation in which the destination point is located.

Thanks to the invention, it is not necessary to generate a sorting plan on the basis of historical data, nor the sorting plan for the first sorting plant. Also, the determination of jurisdictions is automatically generated thanks to the invention due to the advance information and does not need to be specified by means of historical data. Although the invention makes it possible to use such historical data in addition to the preliminary information, it does not require any historical data. Thus, the invention saves the need to capture and process historical data. In addition, historical data may be outdated. Thanks to the invention, rather, sorting plans are generated which are adapted to the number and the destination points of the objects actually actually to be transported. It is even possible to generate sorting plans that are optimized with regard to the preliminary information.

The invention results in that the sorting and sorting outputs are better utilized. This advantage is achieved above all by the fact that it is not determined in advance and thus fixed, which sorting system is responsible for which area of responsibility in the area of responsibility. Rather, the area of responsibility is subdivided automatically and depending on the advance information about objects to be transported into areas of responsibility, that is dependent on actually occurring destination points of objects to be transported.

According to the solution, the first sorting plan for the first sorting system is generated before sorting on the basis of the preliminary information. As a result, this first sorting plan is available before an object to be transported reaches the first sorting system. Because the up-front information is usually transmitted and made available electronically, it is available sooner than the physical objects themselves. Thanks to the invention, it is furthermore not necessary to count or otherwise measure the articles themselves in order to determine how many or even which objects are to be transported to which destinations, in order to use this information to generate the sorting plans such that they are suitable for the objects currently being transported are optimized or at least adapted. Therefore, the invention saves an otherwise required processing step and thus time to produce the adapted sorting plans. The up-front information is often available anyway, in particular to be able to identify certain items during transport or to initiate a transaction to pay for the transportation of an item.

The invention uses advance information for a subset of the items, but does not require that there be pre-information for each item to be transported. Thanks to the invention, items with advance information and items without prior information can be sorted and transported equally and together. The first sorting system sorts items with pre-information and items without pre-information based on the first sorting plan generated using the pre-information. It is not necessary to assume the existence of a certain number of advance information in order to carry out the method according to the solution.

Thanks to the invention, pre-information from several different sources can be combined to generate the first sorting plan. The various sources are z. For example, data processing equipment from various senders of items to be transported, such as mail order companies, which send mail packets in response to customer orders over the Internet. It is sufficient that the preliminary information from a source names the destinations of the objects to be transported from this source.

In order to generate the further sorting plan, the sorting plan generator uses the destination points which the first sorting installation has determined while the articles to be transported pass through the first sorting installation. For the further sorting plan, therefore, no historical data is required, and also the further sorting plan is not fixed. Rather, the determined target points of those objects are used, which are actually to transport current. Thanks to the invention, therefore, the sorting outputs of each other sorting system and the other resources can be better utilized and are better utilized, namely adapted to the destination of the objects actually to be transported.

The invention can also be used when several sets of objects are to be transported in succession and the quantities differ unpredictably in how many items are to be transported to which destinations. For any amount, the invention is applied once again.

The first set of items refers to a first set of pre-information and the second set of items to a second set of pre-information. The sorting plan generator first generates, based on the first set of preliminary information, a first sorting plan, which comprises first definitions of areas of responsibility as well as a first assignment of sorting outputs of the sorting system to these areas of responsibility. Because of the second set of advance information, the sorting plan generator for the second time generates a first sorting plan which comprises second definitions of areas of responsibility in the same area of responsibility and a second assignment of sorting outputs of the same first sorting station to these areas of responsibility.

In one embodiment, each article is provided with an identification of the destination to which this object is to be transported. This marking consists of alphanumeric characters, so it is readable by a human, or from a machine-readable encoding of a destination point designation, eg. B. a bar code or a matrix code. Or the destination point identification is stored in a mobile data carrier which is attached to the object, for. B. in an RFID chip. It is possible that the object is provided both with an alphanumeric identification and with a machine-readable coding. The tag on the item itself either completely describes the target item or is a searchable key for a database. In this database, markings on objects and definitions of target points are stored. The marking on the article does not necessarily distinguish this article from all other articles to be transported. Therefore, the tag may be shorter than a unique tag. To search z. B. additionally used a label of the sender, which is applied to the object and stored in the database.

In another embodiment, each item is provided with a unique identifier ("identifier") that distinguishes that item from all other items to be transported within a period of time in the jurisdiction. In a database is deposited for each item to which destination this item is to be transported. While passing through a sorting facility, the unique identifier is read, and a query with this item identifier to the database provides the stored destination location.

It is also possible to clearly identify the object on the basis of several optically detectable features. In the database, a vector with feature values and the determination of the target point are stored for each object. The feature value vectors and the destination point are determined by a sorting system during the first pass of the item or else by a data processing system of a mailer of the item. After the feature value vector and the determined target point markings have been stored in the central database, the object is registered. A sorting system, through which the object is later transported, measures the feature values and directs a search query to the database with this feature value vector. By finding the data record that was generated and stored during the registration of this item, the item is identified. Such methods for registering and identifying have become known under the name "Fingerprint" and z. In DE 10 2009 056 422 A1 . DE 10 2009 023 306 A1 and DE 10 2008 017 191 A1 described.

The sorting plan generator preferably comprises a software program which runs on a data processing system. In one embodiment, the sorting plan generator generates a sorting plan without interaction with a user, that is, exclusively with the aid of software interfaces and accesses to databases. It is possible for the sorter generator to output a result in a human-tangible form, e.g. B. represents graphically on a screen. It is possible for an editor to modify an automatically generated and output result. A user interaction or a user intervention is possible in one embodiment, but not required.

The sorting plan generator preferably subdivides each responsibility area of a sorting installation into a plurality of areas of responsibility in each case and generates the sorting plans-or at least each further sorting plan-depending on this subdivision into jurisdiction districts. Each destination belongs to exactly one jurisdiction. This subdivision is already being made by the sorting plan generator in one embodiment on the basis of the advance information. Therefore, the subdivision of a jurisdiction into jurisdictions allows before an object to be transported reaches the first sorting facility. The subdivision into jurisdictions is taken into account when generating the sorting plans. Two sorting points in two different jurisdictions of a jurisdiction assign the sorting plan to two different sorting outputs of the sorting plant for that area of responsibility. Therefore, each sorting system can sort the items to delivery districts exactly and split depending on the delivery districts on the sorting outputs, including the first sorting system. The jurisdictions of a further area of responsibility function as subregions.

As already explained, based on the advance information, the sorting plan generator generates a definition of that area of responsibility for which the first sorting installation is responsible. Preferably, the sorter generator also generates a decomposition of this first jurisdiction into jurisdictions. The sorting plan generator generates the first sorting plan in such a way that this first sorting plan assigns at least one sorting output of the first sorting system to each responsibility district in the first area of responsibility, and also each one destination area in the first area of responsibility. By the first sorting plant applying this first sorting plan, the first one distributes Sorting facility All objects with destination points in the first area of responsibility according to their jurisdiction over the sorting exits.

In a further development of this embodiment, the sorting plan generator additionally generates a further sorting plan for the first sorting system after the first sorting plan. This further sorting plan for the first sorting system assigns two destination points from two different jurisdiction districts of the first area of responsibility to two different sorting exits of the first sorting station. In order to generate this further sorting plan, the sorting plan generator uses the determination results of the first sorting installation, that is to which destination points the objects transported to the first sorting installation are to be transported. These determination results often refer to more items than the advance information, because they refer to those items that are actually actually to transport destination points in the area of responsibility of the first sorting system, including objects without advance information. The further sorting plan can therefore only be generated when the first sorting system has determined the destination points of all objects, which in turn presupposes that the articles have been transported to the first sorting system. Preferably, the further sorting plan for the first sorting system is already generated before the first sorting system has discharged all objects to destination points of the first area of responsibility.

In one embodiment, each article to be transported is cached after its destination has been determined and it has been determined that this destination is within the area of responsibility of the first sorting facility. The further sorting plan for the first sorting system is generated. Thereafter, the cached items are distributed according to the further sorting plan on the sorting outputs of the first sorting system.

Another embodiment saves it from buffering an object before the first outward transfer. The system checks whether the blanks of jurisdiction areas have changed in the area of responsibility of the first sorting system, that is, they are defined differently in the further sorting plan for the first sorting plant than in the first sorting plan. If this is the case for at least two areas of responsibility, then at least one item again passes through the first sorting unit and is discharged into the sorting output which the further sorting plan assigns to the destination point of this item. This configuration makes it possible to take into consideration the case that many items without advance information are to be transported to destination points in the area of responsibility of the first sorting facility, and therefore the division into delivery areas which the sorting plan generator has made due to the advance information becomes unnecessary high resource consumption leads.

Preferably, the arrangement with the at least two sorting machines SAnl.a, SAnl.b sorts and transports two quantities M.A, M.B of objects overlapping in time. The objects of the quantity M.A are first transported to the sorting plant SAnl.a, the articles of the quantity M.B first to the sorting plant SAnl.b. For the objects of the quantity M.A the sorting plant SAnl.a functions as the first sorting plant and the sorting plant SAnl.b as a further sorting plant. For the articles of the quantity M.B, the sorting plant SAnl.b functions as the first sorting plant and the sorting plant SAnl.a as the further sorting plant. Advance information for an item to be transported, in addition to determining the destination to which the item is to be transported, also includes information that the sorting plan generator uses to decide whether that item belongs to the set MA or to the set MB , For example, the advance information includes a determination of the starting point to which the transport of the item begins, e.g. B. a sender address in addition to the delivery address of a postal packet. Based on the advance information, the sorting plan generator respectively generates a first sorting plan for the sorting system SAnl.a, SAnl.b. After each article has once passed through a sorting system SAnl.a or SAnl.b and this sorting system has determined the destination point, the sorting plan generator again generates a sorting plan for each sorting system SAnl.a, SAnl.b. These sorting plans function as further sorting plans.

This embodiment can also be realized for more than two sorting systems, for. B. for three sorting SAnl.a, SAnl.b and SAnl.c and three quantities M.A, M.B, M.C of objects to be transported. For the objects of the quantity M.A the sorting plant SAnl.a functions as the first sorting plant and the two sorting plants SAnl.b, SAnl.c as the further sorting plants and so on.

In one embodiment, the pre-information for an item additionally comprises a unique identifier of the item or an identifier that distinguishes that item from all other items from the same sender. In another embodiment, the transmission of the advance information triggers the step to generate a unique identifier and to associate with the advance information, for. In a record of a database. This generated identifier is in one embodiment to a Data processing system of the sender transmitted. The identifier is applied to the object, preferably by means of a machine-readable code. Each time a sorting facility has to determine the destination of that item, the sorting facility deciphers the identifier on the item and directs a query with the identifier to the database. An answer to this search provides an identification of the destination, which is stored as part of the advance information with this identifier. This embodiment eliminates the need for the sorting system to decipher a destination mark on the item itself.

In one embodiment, the first sorting system distributes the articles to the sorting outputs in such a way that the first sorting system discharges each article into the assigned sorting output as a function of the destination point. Objects in different areas of responsibility reach different sorting outputs. After all items have passed through the first sorting system, the sorting outputs used are filled with objects. This embodiment requires at least as many sorting outputs as there are areas of responsibility, but no cache. It is possible that items are or will be distributed to several sorting outputs in the same jurisdiction.

In another embodiment, the first sorting system has a buffer. The first sorting plan assigns the same sorting output of the first sorting system to a respective set of destination points. For at least one sort output, this target point set is divided into at least two subsets. The sorting plan defines a subset as the first subset. An item whose destination belongs to the first subset is ejected into the sort exit. An item whose target point belongs to another subset of this target item set is cached in the buffer. The first sorting output is emptied when it or the buffer are filled up to a predetermined level limit or all objects with target points from the first subset have passed through the first sorting system or when a predetermined time is reached. Subsequently, the objects are transported from the buffer to the sorting exit and discharged into this.

The invention can be z. B. to sort and transport postal packages. A postal service provider works in a given production cycle of z. Eg 24 hours duration. The method according to the solution is reapplied in every production cycle. As a set of objects to be transported, those postal parcels which reach an acceptance point in the area of responsibility of the postal service provider within a production cycle function. Since the solution-based method is used again in each production cycle, the respective area of responsibility of a sorting system of the postal service provider can change from production cycle to production cycle. As a sorting system in the sense of the claims, a parcel sorting center with at least one machine for sorting postal parcels.

The invention can also be used to transport pieces of luggage from travelers, freight or other cargo and to sort it.

In the following the invention will be described with reference to an embodiment. Showing:

1 the path a postal parcel takes from the place of delivery to the destination;

2 five exemplary core service areas for five parcel centers;

3 five exemplary core supply districts for five delivery bases in a supply area;

4 five exemplary service areas for the five parcel centers of 1 ;

5 the delivery bases and core supply districts of 3 and the destinations of the packages with advance notice;

6 the situation of 5 with additional destinations for the packages without notice;

7 the final supply districts of the delivery bases of 3 and the provisional delivery areas;

8th the final delivery areas of the delivery bases of 3 ,

In the exemplary embodiment, the invention is used to transport and deliver postal parcels and post parcels. In the following, we will speak uniformly of "packages".

Each parcel is provided with an identification of the delivery address to which the parcel is to be transported. This marking specifies the name of the recipient (natural or legal persons) as well as a postal address (street and number or parcel deposit box, zip code or ZIP code, location, country, if applicable). This tag is applied to the package in a human-readable form. This allows a deliverer to deliver the package without a special reader. The receiver can check without a reader if the package is actually for him. In one embodiment, the geo-coordinates of the delivery address are additionally applied to the package.

Furthermore, a machine-readable identifier of the package can be applied to the package. The identifier distinguishes the package from other packages. It is also possible for a machine-readable coding of the destination marking to be applied to the package or to be applied during the transport.

The invention makes it possible to sort packages with and packages without machine-readable identifiers together in a transport and sorting operation. A machine-readable identifier package still has a destination-point label in a human-readable form so that a parcel deliverer or recipient without a reader can determine the destination of the parcel.

A postal service provider transports in every production cycle, eg. For example, every business day, packets to delivery addresses in a delivery area (eg in a country). In addition, the postal service provider hands over parcels to other postal service providers who are responsible for other delivery areas. The post service provider carries out a transport and sorting process every working day.

• – mehrere Annahmestationen,
• – mehrere Paketzentren („hubs“),
• – mehrere Zustellbasen („delivery bases“) und
• – mehrere Auslieferungsfahrzeuge.

The postal service provider operates in the delivery area

• - several receiving stations,
• - several package centers ("hubs"),
• - several delivery bases and delivery bases
• - several delivery vehicles.

The delivery area for which the postal service provider is responsible is subdivided by the procedure into several service areas. Each hub is responsible for such a coverage area. Each coverage area is divided into several care districts. Each delivery base is responsible for such a care district. Each delivery address in the delivery area belongs in the exemplary embodiment to exactly one supply district. Each supply district and thus also each delivery address thus belongs to exactly one supply area. The service areas and supply areas function as the areas of responsibility and jurisdictions within the meaning of the claims.

Preferably, the fact is exploited that each postal address can be uniquely described by two GIS coordinates (GIS = Geography Information System). In the exemplary embodiment, the assigned pair of GIS coordinates is automatically calculated for each postal delivery address of a parcel.

Each utility district and each service area is calculated as an area on the earth's surface and described as a set of GIS coordinate pairs. Preferably, each coverage area and each coverage area is described as a closed curve, which curve describes the geographic boundary of the coverage area. Each utility district and each service area is therefore a topologically coherent area without holes on the earth's surface. In a modification, although each supply district is also defined by a closed curve. Each coverage area, however, is defined by a list of the corresponding coverage areas.

In both embodiments, the geographic boundary of that delivery area as the area on the earth's surface, for which the postal service provider is responsible, is specified as a boundary condition. This area is not necessarily topologically coherent. Another constraint is that a parcel center is located in the service area for which the parcel center is responsible.

The generated descriptions of service areas and supply areas are generated and stored in a computer-evaluable form in a data memory.

Each parcel center ("hub") has at least one parcel sorter. Each parcel sorting system has several sorting outputs for parcels. Each parcel sorting system determines the postal delivery address of each parcel which has been transported to this sorting system. First, a parcel sorting reader attempts to automatically decipher a destination mark on the parcel. If the reader is unable to decipher the target point identification automatically, an editor gives the complete target point identification or at least a part, eg. As the postcode or the place, a, z. B. by voice. Or a reader decodes a machine-readable identifier on the package and determines the destination by a search request with this identifier to a central database. Or a delivery code tag is applied to the package and is deciphered.

The parcel sorting system selects a sorting output for this parcel. The parcel sorting system ejects the parcel into the selected sorting output. In order to select a sorting output for a parcel, the sorting system applies to the identification of the determined destination a computer-evaluable sorting plan which is stored in a data memory.

1 illustrates the path that a packet P takes through the logistics network of the postal service provider. This package P is sent to a point of delivery EO, z. B. in a postal agency, a parcel deposit box or other delivery station, the postal service provider and should be transported to the destination Zp.2 with the postal delivery address Add.2. The place of delivery EO lies in the supply area Ber.1, for which the parcel center Pz.1 is responsible. In parcel center Pz.1, the parcel sorting system SAnl.1 operates with the four sorting outputs SAus.1.1, SAus.1.2, SAus.1.3, SAusg.1.4 shown by way of example. The computer-analyzable sorting plan Spl.1 is stored in the data memory DSp.1 of the sorting installation SAnl.1.

The package P is to be transported to the destination point Zp.2 with the postal delivery address Add.2. This destination Zp.2 is located in the supply area Ber.2, for which the parcel center Pz.2 is responsible with the sorting system SAnl.2. Exemplary are in 1 the four sorting outputs SAus.2.1, SAus.2.2, SAus.2.3, SAusg.2.4 of the sorting system SAnl.2 and another parcel sorting system SAnl.3, which is responsible for the supply area Ber.3, are drawn. The destination point Zp.2 with the postal address Add.2 lies in the supply area Bez.2.2 of the supply area Ber.2, and for the supply area Bez.2.2 the delivery basis ZB.2.2 is responsible.

• – Das Paket P wird vom Einlieferungsort EO zum Paketzentrum Pz.1 transportiert.
• – Das Paket P durchläuft während einer Abgangssortierung die Sortieranlage SAnl.1. In dieser Abgangssortierung ermittelt die Sortieranlage SAnl.1 für jedes durchlaufende Paket, welches im Versorgungsbereich Ber.1 dem Post-Dienstleister übergeben wurde, welches Zustell-Paketzentrum für die jeweilige Zustelladresse dieses Pakets zuständig ist.
• – Im Fall von 1 ist das Paketzentrum Pz.2 das Zustell-Paketzentrum, welches für den Versorgungsbereich mit dem Zielpunkt Zp.2 und daher mit der postalischen Zustelladresse Add.2 des Pakets P zuständig ist. Durch Anwendung des ersten Sortierplans Spl.1 auf die Adresse Add.2 wird für das Paket P daher der Sortierausgang SAusg.1.1 ausgewählt.
• – Das Paket P wird in den Sortierausgang SAus.1.1 der Sortieranlage SAnl.1 ausgeschleust und zusammen mit anderen Paketen in einem Behälter („Wechselbrücke“) vom Einlieferungs-Paketzentrum Pz.1 zum Zustell-Paketzentrum Pz.2 transportiert. Dieser Transport wird mit Hilfe des Fahrzeugs LKw.1 durchgeführt.
• – Alle Pakete, die das Zustell-Paketzentrum Pz.2 erreichen und an Zustelladressen im Versorgungsbereich Ber.2 zu transportieren sind, durchlaufen in einer Eingangssortierung die Paket-Sortieranlage SAnl.2. Die eintreffenden Pakete werden in dieser Eingangssortierung auf Auslieferungsfahrzeuge genau sortiert. Die Sortieranlage SAnl.2 wendet den Sortierplan Spl.2 an.
• – Das Paket P an den Zielpunkt Zp.2 mit der Adresse Add.2 wird in den Sortierausgang SAus.2.1 der Sortieranlage SAnl.2 ausgeschleust und von dort zur Zustellbasis ZB.2.2 transportiert, die für den Versorgungsbezirk Bez.2.2 zuständig ist. Dort wird das Paket P in das Auslieferungsfahrzeug Fhzg.2.2 verladen und in diesem Auslieferungsfahrzeug FHzg.2.2 zum Zielpunkt Zp.2 gefahren.
• – Das Paket P wird am Zielpunkt Zp.2 zugestellt, d. h. dem Empfänger übergeben. Der Zielpunkt Zp.2 kann auch ein Fach einer Paketfachanlage sein. In diesem Fall wird das Paket P in das Fach eingelegt, und der Empfänger des Pakets P wird benachrichtigt.

The package P takes the following route:

• The package P is transported from the place of delivery EO to the parcel center Pz.1.
• - The package P goes through the sorting system SAnl.1 during a departure sorting. In this departure sorting system, the sorting system SAnl.1 determines for each transit packet which was handed over to the postal service provider in the coverage area Ber.1, which delivery parcel center is responsible for the respective delivery address of this parcel.
• - In case of 1 is the parcel center Pz.2 the delivery parcel center, which is responsible for the coverage area with the destination point Zp.2 and therefore with the postal delivery address Add.2 of the package P. By applying the first sorting plan Spl.1 to the address Add.2, the sorting output SAusg.1.1 is therefore selected for the packet P.
• The package P is discharged into the sorting exit SAus.1.1 of the sorting installation SAnl.1 and transported together with other parcels in a container ("swap body") from the delivery parcel center Pz.1 to the delivery parcel center Pz.2. This transport is carried out with the help of the vehicle LKw.1.
• - All parcels that reach the delivery parcel center Pz.2 and are to be transported to delivery addresses in the supply area Ber.2, pass through the parcel sorting system SAnl.2 in an incoming sorting system. The arriving parcels are sorted exactly on delivery vehicles in this inbound sorting. The sorting system SAnl.2 applies the sorting plan Spl.2.
• - The package P to the destination point Zp.2 with the address Add.2 is discharged into the sorting output SAus.2.1 the sorting system SAnl.2 and transported from there to the delivery base ZB.2.2, which is responsible for the Versorgungsbezirk Bez.2.2. There, the package P is loaded into the delivery vehicle Fhzg.2.2 and driven in this delivery vehicle FHzg.2.2 to the destination Zp.2.
• - The package P is delivered to the destination point Zp.2, ie transferred to the recipient. The destination point Zp.2 can also be a compartment of a parcel compartment system. In this case, the packet P is inserted in the tray, and the recipient of the packet P is notified.

In the above example, for the packet P at the destination point Zp.2 with the address Add.2, the delivery packet center Pz.1 differed from the delivery packet center Pz.2. Each parcel whose delivery location is in a different coverage area than its delivery address, first passes through a sorting facility of the delivery parcel center in a departure sorting and then in a sorting sorting facility of the delivery parcel center. It is also possible that the place of delivery and the delivery address of a parcel are in the same coverage area. As a rule, this package passes through a sorting system only once, namely in a sort-out sorting pass ("pass") in a parcel sorting system of the delivery parcel center. An exception will be explained below.

In the departure sorting the input sorting for the coverage area of the own parcel center is therefore generally carried out in the embodiment at the same time. In departure sorting for other parcel centers, in one embodiment, sorting is performed on delivery parcel centers only, but not more accurately. All parcels for another parcel center are loaded into one or more containers (swap bodies) and transported overnight in these swap bodies to the corresponding other parcel parcel center.

• – welche Auslieferungsfahrzeuge und Fahrer dem Post-Dienstleister aktuell zur Verfügung stehen,
• – die Zuordnung dieser verfügbaren Auslieferungsfahrzeuge zu den Zustellbasen,
• – die Zustellbasen und deren geographische Positionen,
• – die Paketzentren und deren geographische Positionen.

In the exemplary embodiment, the following definitions in computer-evaluable form are predefined in accordance with the method according to the solution:

• - which delivery vehicles and drivers are currently available to the postal service provider,
• - the assignment of these available delivery vehicles to the delivery bases,
• - the delivery bases and their geographical positions,
• - the parcel centers and their geographical positions.

• – ein Paketzentrum oder eine Zustellbasis oder ein Auslieferungsfahrzeug beispielsweise durch einen Neubau ergänzt wird oder
• – ein Paketzentrum oder eine Zustellbasis z. B. wegen Wartung oder einer Störung zeitweise nicht zur Verfügung steht oder
• – ein Paketzentrum oder eine Zustellbasis oder ein Auslieferungsfahrzeug dauerhaft nicht zur Verfügung steht, weil es aufgehoben wurde und stillgelegt wird.

This fixed information is changed only when needed, namely, when

• - a parcel center or a delivery base or a delivery vehicle is supplemented for example by a new building, or
• - a parcel center or a delivery base z. B. is temporarily unavailable due to maintenance or malfunction or
• - a parcel center or a delivery base or delivery vehicle is permanently unavailable because it has been canceled and is decommissioned.

• – jeweils eine Abgangssortierung in jeder Paket-Sortieranlage,
• – den Transport von Paketen von dem Eingangs-Paketzentrum zu dem Zustell-Paketzentrum,
• – jeweils eine Eingangssortierung in jeder Paket-Sortieranlage,
• – die Aufteilung der Pakete auf die Zustellbasen und
• – die Auslieferung der Pakete.

The post service provider performs several transport and sorting processes in succession. In each transport and sorting process, all packages are sorted and transported within a certain period of time, from e.g. B. 24 hours duration to be handed over the post service. Each transport and sorting process includes

• - a disposal sorting in each parcel sorting system,
• The transport of parcels from the inbound parcel center to the parcel delivery center,
• - one input sorting in each parcel sorting system,
• - the distribution of the packages on the delivery bases and
• - the delivery of the packages.

• – der jeweilige Versorgungsbereich eines Paketzentrums in diesem Transport- und Sortiervorgang, wodurch festgelegt wird, welche postalischen Zustelladressen von diesem Paketzentrum versorgt werden,
• – der jeweilige Versorgungsbezirk einer Zustellbasis in diesem Transport- und Sortiervorgang, wodurch festgelegt wird, welche postalischen Zustelladressen von dieser Zustellbasis versorgt werden, und
• – die jeweilige Zustellroute, die ein Auslieferungsfahrzeug dieser Zustellbasis in diesem Transport- und Sortiervorgang befährt.

Thanks to the invention, the following computer-evaluable determinations of transport and sorting process for transport and sorting operation are variable and are automatically adapted to the actual numbers of postal packages:

• The respective service area of a parcel center in this transport and sorting process, which determines which postal delivery addresses are supplied by this parcel center,
• The respective supply area of a delivery base in this transport and sorting process, which determines which postal delivery addresses are supplied by this delivery base, and
• The respective delivery route which a delivery vehicle of this delivery base travels in this transport and sorting process.

These variable determinations are automatically calculated by means of a data processing system in the following three optimizations per transport and sorting process. This data processing system includes a sorting plan generator gene.

• – die Festlegungen von Versorgungsbereichen, also für jedes Paketzentrum die Festlegung, für welchen Versorgungsbereich dieses Paketzentrum zuständig ist,
• – die Zuordnungen von Zustellbasen zu Paketzentren und
• – vorläufige Festlegungen von Versorgungsbezirken von Zustellbasen, also jeweils eine vorläufige Festlegung, welche postalischen Adressen zu einem Versorgungsbezirk einer Zustellbasis gehören.

The first optimization calculates:

• - the definition of supply areas, that is, for each parcel center, determining which area of supply this parcel center is responsible for,
• The assignments of delivery bases to parcel centers and
• Provisional determinations of supply areas of delivery bases, that is to say a provisional definition of which postal addresses belong to a supply area of a delivery base.

The first optimization is carried out in the embodiment solely on the basis of the present advance information about packets to be transported in the next transport and sorting process. In one variation, historical data is used in addition to the pre-departure information, that is, data on how many packets were to be transported to which destination points in previous transport operations.

In the second optimization, the final supply districts of all given delivery bases are calculated to use these generated supply district definitions for the next inbound sort. For this purpose, the determined delivery addresses of those packets are used, which are actually transported in the current transport and sorting process and sorted here.

In the third optimization, the delivery routes of all delivery vehicles are calculated in order to also use these delivery routes for the next incoming sorting, namely for the delivery of the packets after the respective inward sorting. The determined delivery addresses of the packets actually to be transported and sorted in the current transport and sorting process are also used for the third optimization.

In each production cycle, ie for each transport and sorting process, these three optimizations are carried out again. It is not necessary to buffer the result of an optimization for a transport and sorting operation and to use it in a subsequent transport and sorting operation.

The provisional specifications of supply districts from the first optimization may change due to the second optimization. The reason is that the first optimization is performed solely on the basis of pre-information ("announcements") for a subset of packages, while for the second optimization, the determined delivery addresses of all packages to be transported in this transport and sorting operation are used , This includes packages without notice.

In one embodiment, the assignment of delivery bases to parcel centers may also change as a result of the second optimization. In another embodiment, the assignment that was generated in the first optimization remains constant. The assignment of delivery bases to parcel centers and the provisional provisions of supply districts together provide a definition of supply areas of the parcel centers. The determination of which coverage area a parcel center is responsible for is determined in the first optimization and remains immutable in the exemplary embodiment for this transport operation. In a subsequent transport operation, the parcel center may be responsible for another service area, ie for a service area with a different limit.

As already stated, a package then typically traverses a package sorting system only once if the delivery parcel center is equal to the parcel delivery center because the delivery location EO and the delivery address Add.2 of the destination point Zp.2 of the package P are in the same Supply area lie. The result of the first optimization - based on the advance information - is used to calculate the departure sort sort schedules in the delivery parcel centers.

In this departure sorting, the packages for the own parcel center in one embodiment are already sorted exactly at least on delivery bases, preferably exactly on delivery vehicles. In another embodiment, a parcel passes through a parcel sorting facility twice in the same parcel center, which parcel center is both the inbound parcel center and the parcel delivery center for that parcel. Packages for other parcel centers are sorted exactly only to these parcel delivery centers. In this embodiment, some packages only go through a parcel sorting system once, other parcels through the same parcel sorting system twice.

• – die postalische Zustelladresse für das Paket,
• – eine Kennzeichnung des Einlieferungsorts,
• – eine Kennzeichnung des Absenders,
• – eine ID-Kennung des Pakets, welches dieses Paket von allen anderen Paketen dieses Absenders unterscheidet,
• – einen geplanten Einlieferungs-Zeitraum,
• – einen gewünschten Zustell-Zeitraum,
• – mindestens eine Abmessung des Pakets,
• – das Gewicht des Pakets und
• – Angaben, die den Transport des Pakets spezifizieren, z. B. eine Festlegung des Paket-Inhalts als „zerbrechlich“.

In the exemplary embodiment, the postal service provider operates a central data processing system DVA, which is connected via the Internet or by means of another wide area network with data processing systems of senders of packets. A registered sender can pre-record data about a package send this sender, to the central data processing system of the postal service provider. These pre-submitted data include all or at least some of the following data:

• The postal delivery address for the parcel,
• - a marking of the place of consignment,
• - an identification of the sender,
• An ID identifier of the packet which distinguishes this packet from all other packets of this sender,
• - a planned delivery period,
• A desired delivery period,
• At least one dimension of the package,
• - the weight of the package and
• - information specifying the transport of the parcel, e.g. For example, setting the package content as "fragile".

These pre-communicated data ("advance notice") about a parcel act as the "pre-information" about this parcel.

In the example of 1 the sender of the package P transmitted by means of a computer PC, the advance information before as an electronic message with data to the central data processing system DVA the postal service provider. The transmitted data will be referred to as "advance notice" for the package in the following.

In one embodiment, the central data processing system DVA assigns a unique identifier ID for the package, which distinguishes this package from all other packages that the postal service provider transports within a certain period of time, including other packages from other senders. An electronic message with this unique identifier ID is transmitted to the computer PC of the sender. The sender generates a label that transmits the transmitted unique identifier ID in a machine-readable form, e.g. B. in the form of a bar pattern ("bar code" or "matrix code"), as well as the delivery address Add.2 in a human readable form and a label of the sender contains. This label is glued to the package P.

The central data processing system DVA generates a data record for the package and stores this data record in a central data memory P-DSp. This record contains the unique identifier and the pre-announcement data for the package. Each time the package P passes through a sorter, a reader deciphers the unique identifier ID on the label. The sorting system directs a search request to the central data memory P-DSp. The record with this unique identifier ID is determined. In response to the search request, at least the delivery address in the data record is returned to the requesting sorting system. The name of the delivery address in a human-readable form is used by the deliverer and the controlling recipient, as well as if the identifier on the label can not be uniquely deciphered.

The packages for which advance notice is available are sorted and transported with other packages without notice. It is possible, in fact, for a parcel to reach a place of delivery without the sender having transmitted an advance notice to the central data processing installation DVA. Therefore, the package does not yet have a unique identifier of the postal service provider at the time of posting.

If a packet does not contain a label with a unique and machine-readable identifier, then a camera generates a computer-evaluable image from the surface of the packet showing the delivery address. An image evaluation unit attempts to automatically decipher the delivery addresses via "optical character recognition" (OCR). If this is not successful, a processor deciphers the delivery address, for which the processor preferably picks up the package and reads the delivery address on the package and inserts parts of the delivery address into a language acquisition system. Or the image is displayed on a screen device, and the processor enters a part of the delivery address by means of a keyboard.

Subsequently, a unique identifier and a record for the package are again generated, wherein the record includes the unique identifier and the deciphered delivery address. The package is provided at the place of delivery EO or in the first sorting system SAnl.1 with a label containing the unique identifier in machine-readable form.

Each sorting system in the logistics network of the postal service provider uses a computer-evaluable sorting plan to sort packages. This sorting plan assigns a sorting output to this sorting system to each postal delivery address of a parcel. The sorting plan assigns the same sorting output to several postal delivery addresses because there are many more postal delivery addresses than the sorting system has sorting outputs. In the example of 1 the sorting system SAnl.1 applies a sorting plan Spl.1, which assigns the delivery address Add.2 to the sorting output SAus.1.1 of the sorting system SAnl.1. The sorting plan Spl.2 assigns the sorting output SAus.2.1 of the sorting installation SAnl.2 to this delivery address Add.2.

According to the solution, the sorting plans are generated again for each transport and sorting operation, namely one sorting plan for the outgoing sorting and one sorting plan for the incoming sorting on each sorting system. The sort schedules for departure sorting are calculated in the embodiment solely on the basis of advance announcements for packages. Therefore, sorting schedules for the departure sort are available before the first package to be sorted in this transport and sort operation reaches a delivery package center.

• – Nachsendeanträge und sonstige Informationen über Änderungen von Empfängeradressen,
• – Vorgaben, welche Zustelladressen deshalb nicht angefahren werden zu brauchen, weil der jeweilige Empfänger seine Pakete selbst abholt, und
• – Vorgaben, an welchen Einlieferungsorten ein Paketzusteller jeweils mindestens ein Paket abholen soll – vorzugsweise werden Abholung und Zustellung von Paketen miteinander kombiniert.

In order to calculate the sorting schedules for the departure sorting in the first optimization on the basis of the advance information, the supply areas and the supply areas are previously automatically redefined and calculated for this transport and sorting process by recalculating their respective limits. In addition to the advance information in the form of advance announcements, the following information is processed in the exemplary embodiment in order to calculate the sorting plans for the disposal sorting and to calculate supply areas and supply areas for this purpose:

• - Forwarding requests and other information about changes in recipient addresses,
• - Defines which delivery addresses are therefore not needed to start because the respective recipient picks up his own packages, and
• - Defines at which places of delivery a parcel deliverer should pick up at least one parcel in each case - preferably pick-up and delivery of parcels are combined.

In each case, a sorting plan is to be generated for the outgoing sorting for each delivery parcel center. The first optimization provides the respective boundary of the coverage area of each parcel center, which is valid and used for the next transport and transport and sorting operation. These supply area definitions are used to generate the sorting plan for the next departure sort in a delivery parcel center.

• – die Vorankündigungen für Pakete,
• – die Informationen, welche Auslieferungsfahrzeuge, Zustellbasen und Paketzentren aktuell verfügbar sind, und die feste und vorgegebene Zuordnung von Auslieferungsfahrzeugen zu Zustellbasen,
• – die maximale Verarbeitungskapazität jedes Paketzentrums und jeder Zustellbasis, wobei die Verarbeitungskapazitäten von Paketzentrum zu Paketzentrum und von Zustellbasis zu Zustellbasis sowie von Tag zu Tag variieren können, und
• – in einer Ausgestaltung statistische Aussagen aufgrund historischer Daten, wie viele Pakete insgesamt pro Zustelladresse zu erwarten sind oder wie sich Vorankündigungen in der Vergangenheit zu tatsächlichen Paketanzahlen verhielten.

The following information is used to generate the provisional supply areas and thus the preliminary supply areas in the first optimization:

• - the advance notice for packages,
• The information as to which delivery vehicles, delivery bases and parcel centers are currently available, and the fixed and predefined assignment of delivery vehicles to delivery bases,
• The maximum processing capacity of each parcel center and each delivery base, where the processing capacities may vary from parcel center to parcel center and from delivery to delivery and from day to day, and
• In one embodiment, statistical statements based on historical data, how many packets are to be expected in total per delivery address, or how previous announcements in the past related to actual packet counts.

Each advance notice specifies a delivery address for a package. As a rule, this delivery address includes the name of the recipient as well as a postal delivery address. During the first optimization, an identification of the geographical point corresponding to the delivery address on the surface is calculated for each delivery address of an advance notice, in the form of two GIS coordinates of this geographical point.

In the exemplary embodiment, in each case one core service area and, for each delivery base, one core service area are respectively specified for each package center. Each delivery address in this core supply district is firmly associated with a delivery base, and the generation of coverage areas and coverage areas during optimizations does not change this allocation. In addition, a core service area is specified for each parcel center, which comprises at least one delivery base. Each parcel center is located in its core service area. Each delivery base is in its core supply district.

These core supply areas and core supply areas are also defined in one embodiment by means of closed curves. However, many delivery addresses do not belong to a core supply area of a delivery base but to a "respiratory area" and are reassigned each time supply areas are generated. Accordingly, there are delivery bases, which are successively assigned to different parcel centers. In another embodiment, a core coverage area is defined by listing those core coverage areas that belong to that core coverage area. For each parcel center, one core supply area is defined, for each delivery base one core supply area each.

• – von der erzielten Auslastung des Ressourcen jedes Paketzentrums, insbesondere der Sortierausgänge, und der Ressourcen jeder Zustellbasis und
• – von der erzielten Auslastung der Flotte von Auslieferungsfahrzeugen, beispielsweise mittels Fahrzeiten und/oder Füllständen der Auslieferungsfahrzeuge bewertet.

The boundaries of the full coverage areas and coverage areas are generated in both the first optimization and the second optimization by using an optimization method. The objective function to be optimized is a predefined evaluation function which depends on at least the following target variables:

• From the achieved utilization of the resources of each parcel center, in particular the sorting exits, and the resources of each delivery base and
• - Evaluated by the achieved utilization of the fleet of delivery vehicles, for example by means of travel times and / or levels of the delivery vehicles.

As utilization z. For example, throughput is used as the number of packets per hour.

During optimization, different workloads are calculated on the basis of different service areas and / or different service areas. Each tentatively assigned delivery area for a delivery base includes the corresponding predetermined core coverage area for that delivery base. This sample predicted achieved utilization is z. For example, the percentages for the parcel centers and the percentages for the delivery bases should vary as little as possible from each other, for example, by a percentage below the current maximum processing capacity. This causes a uniform utilization.

In addition, a cost function can be used for the optimization, the z. B. costs for different transport routes or different costs of processing in the various parcel centers considered.

2 illustrates the default core coverage areas. Illustrated are five parcel centers Pz.1, ..., Pz.5 with five core service areas K-Ber.1, ..., K-Ber.5. Some delivery bases ZB.1.3, ZB.2.3, ZB.4.2 are within a core service area, other delivery bases ZB.x, ZB.y, ZB.z are outside the core service areas.

3 on the one hand exemplifies the five core supply districts K-Bez.2.1, ..., K-Bez.2.5 for the five delivery bases ZB.2.1, ..., ZB.2.5 in the supply area Ber.2 the parcel center Pz.2. On the other hand illustrated 3 by way of example, where the delivery addresses of adverts are in the coverage area Ber.2 (round points with white interior). Some delivery addresses are outside the core supply districts K-Bez.2.1, ..., K-Bez.2.5.

4 illustrates the service areas Ber.1, ... Ber.5 of the five parcel centers Pz.1,..., Pz.5, which were generated for this transport and transport and sorting operation exclusively on the basis of the advance announcements and in the first optimization. Each delivery base is located in exactly one supply area. The delivery basis ZB.x was assigned to the delivery basis ZB.4.5 in the service area Ber.4, the delivery basis ZB.y to the delivery basis ZB.1.6 in the service area Ber.1.

For the transport and sorting process of the example of 2 to 8th the delivery districts are generated so that the delivery districts of the five delivery bases ZB.2.1, ... ZB.2.5 are all in the delivery area Ber.2, for which the parcel center Pz.2 is responsible. 5 illustrates the boundaries of these five core delivery districts K-Bez.2.1, ..., K-Bez.2.5 and the provisional delivery areas of the delivery vehicles. The delivery basis ZB.2.3 are permanently assigned to two delivery vehicles in this example. For these two delivery vehicles, the provisional delivery areas V-Rout.2.1.1, V-Rout.2.1.2, ... are generated.

On the basis of the electronic advance announcements, the first optimization then calculates the respective coverage area of each parcel center. Each core coverage area is within the generated coverage area of the respective package center, each core coverage area in the preliminary coverage area of the delivery base. After the first optimization, it is clear which delivery address a Advance notice to the supply area which parcel center belongs to. Using these coverage areas and provisional coverage areas, the sorting schedules for the departure sort are generated, namely, a first sorting plan per package sorting facility. These provisions of the supply districts are provisional because the second optimization may still change a determination. The supply areas, however, are already determined in the first optimization for this transport and sorting process. Because after the first optimization, it is clear which package is to be transported to which delivery parcel center. The package will later actually be transported to this delivery parcel center. The sorting plans for the disposal sorting function as first sorting plans in the sense of the claims.

Each sorting plan of a parcel sorting system assigns a sorting output of the parcel sorting system to each possible delivery address. In one embodiment, each sorting plan assigns each delivery address in the area of responsibility of the postal service provider to a sorting output of the parcel sorting system used. Each postal address in the area is described by two GIS coordinates. To select a sorting output for a package, the GIS coordinates of the delivery address of that package are initially determined automatically, and by using the sorting plan, a sorting output is selected for the package.

A sorting plan generator GEN of the central data processing system DVA generates for each parcel sorting system the sorting plan which is used in this sorting and sorting operation in the outgoing sorting, that is to say a total of a first sorting plan per sorting plant. This first sorting plan Spl.1, Spl.2, Spl.3 is transmitted to the sorting system SAnl.1, SAnl.2, SAnl.3. According to this first sorting plan Spl.1, Spl.2, Spl.3, each sorting installation SAnl.1, SAnl.2, SAnl.3 carries out a departure sorting with all the parcels arriving at it, that is to say with those parcels for which an advance notice exists , as well as for other packages. A package without notice is registered during this departure sorting, wherein the delivery address on the package is deciphered, a unique identifier is assigned and a record with this unique identifier and this deciphered delivery address is generated and stored in the data memory P-DSp. Each sorting system functions as a first sorting system for those packages that have been transported from the respective posting location to this sorting system.

In the departure sorting of this transport and sorting process, the delivery addresses of all packages to be sorted are determined, including the delivery addresses of the packages without prior notice. These determined delivery addresses of all packages are used to generate the sorting schedules for the inbound sorting of this transport and sort operation in the subsequent second optimization. In this second optimization, the announcements are no longer used. What is needed is the determined delivery addresses of the parcels that have passed through the sorting system in the outbound sorting. Preferably, the sorting plan generator performs the second optimization as early as possible, already during departure sorting and once all the delivery addresses have been determined.

In the first optimization, preliminary supply areas for the parcel centers and provisional supply districts for the delivery bases were generated. The coverage areas are no longer changed in the second optimization. Therefore, there are no provisional coverage areas. In the second optimization, final supply areas for the delivery bases are generated. A final supply area of a delivery base may differ from the provisional supply area of the same delivery base from the first optimization.

• – von der Auslastung der Flotte von Auslieferungsfahrzeugen und
• – von der Kapazität und Auslastung der Zustellbasen

abhängt. The second optimization uses a predefined evaluation function, the

• From the capacity of the delivery vehicle fleet and
• - the capacity and capacity of the delivery bases

depends.

The respective GIS coordinates of the postal delivery addresses of the packages are also determined for the second optimization. The service areas and the final service areas are described by means of closed curves.

Preferably, the second optimization is already being performed while the delivery parcel centers are still performing the exit sortings. Because for the second optimization only the determined delivery addresses of the packages are needed, but not the packages themselves. As already stated, the second optimization may result in a final coverage area of a delivery base that differs from the provisional coverage area of that delivery area. The coverage areas do not become in the second optimization changed. This boundary condition is taken into account in the generation of the supply districts, so that each final supply district is located in exactly one supply area, ie is not divided into two supply areas.

The change of a supply district may result in a parcel being transported to another delivery location or being delivered in a different delivery area than originally planned, namely because the destination point of that area is in the service area of another delivery base.

A changed definition of a supply district is already recognized during the departure sorting in the delivery parcel center. A package for which the delivery parcel center is the same as this delivery parcel center and whose delivery address is located in a changed service district is therefore in one embodiment already rejected during the outbound sorting and traverses this delivery parcel center in a second sorting pass. In this case, therefore, a second sort pass is performed even though the packet remains in the service area of the same parcel center. In the incoming sorting, therefore, some packages are sorted, which were delivered in the supply area of this parcel center. Preferably, these packages, which have been delivered in the service area of this parcel center, are sorted in the in-door sorting together with parcels from other parcel centers.

In the incoming sorting, the arriving packets are sorted in a design on delivery vehicles exactly. In another embodiment, in the input sorting on roll containers, which are each assigned to a few delivery vehicles, sorted exactly.

6 shows the default core supply districts K-Bez.2.1, ..., K-Bez.2.5 the five delivery bases ZB.2.1, ..., ZB.2.5 and the delivery addresses due to advance notice of 3 and 5 (Dots with black border and white inside). Also shows 6 those delivery addresses that have been added by packages without notice (dots with black border and hatched inside). In addition, the preliminary delivery areas that were generated in the first optimization are drawn. It can be seen that delivery addresses of parcels with and of parcels are without prior notice outside the provisional delivery areas.

7 shows the generated final supply districts Bez.2.1, ..., Bez.1.5 of the five delivery bases ZB.2.1, ..., ZB.2.5 and the delivery addresses due to advance notifications from 5 , as well as the additional delivery addresses due to parcels without advance notice and also the provisional delivery areas V-Rout.2.1.1, V-Rout.2.1.2, .... Each delivery address lies in exactly one delivery area. In 7 but it can be seen that some destination points of parcels are outside the provisional delivery areas.

8th shows the final delivery areas Rout.2.1.1, Rout.2.1.2, ..., which were generated in the third optimization on the basis of the determined delivery addresses. Each delivery address is located in exactly one delivery area. It is not necessary for the delivery territories to fully cover each delivery area. Areas without a currently actually occurring delivery address can lie outside of each delivery area.

The generation of coverage areas and final coverage areas, the generation of delivery areas, and the generation of routes and sorting schedules will be completed as late as possible, preferably so that the sorting schedules will be available at the beginning of inbound sorting. This makes it possible to take account of time delays in the transport of packages between departure sorting and incoming sorting. In addition, delivery requests from pre-notified recipients of packages can still be considered, even if these delivery requests arrive late. LIST OF REFERENCE NUMBERS reference numeral importance Add.1, Add.2, ... Delivery addresses of the destinations Zp.1, Zp.2 Ber.1, Ber.2, ... Supply areas with the parcel centers Pz.1, Pz.2, ... Ref.2.1, ref.2.2, ... Supply districts in the supply area Ber.2 are supplied by the delivery bases ZB.2.1, ZB.2.2, ... DSp.1, DSp.2, ... Data storage with the sorting plans Spl.1, Spl.2, ... DVA central data processing system of the postal service provider, includes the sorting plan generator Gen EO Place of delivery for the package P Fhzg.1, Fhzg.2 Vehicles for the delivery of parcels to destination points gene Sorting Plan Generator ID unique identifier for the package P, generated by the postal service provider and transmitted to the sender K-Ber.1, K-Ber.2, ... Core supply areas of parcel centers Pz.1, Pz.2, ... K-Bez.2.1, K-Bez.2.2, ... Core supply districts of the delivery bases ZB.2.1, ZB.2.2, ... LKw.1, LKw.2 Vehicles for the transport of parcels between parcel centers P Postal parcel, is transported from the point of delivery EO to the destination point Zp.2 P-dsp central data store with data records for packages PC Calculator of the sender of the parcel P, transmits advance notice to the central data processing system DVA Pz.1, Pz.2, ... Parcel centers for the supply areas Ber.1, Ber.2, ... Rout.2.1.1, Rout.2.1.2, ... Delivery routes in the supply district Bez.2.1 Rout.2.4.1, Rout.2.4.2, ... Delivery routes in the supply district Bez.2.4 SAnl.1 Sorting plant in the parcel center Pz.1 SAnl.2 Sorting plant in the parcel center Pz.2 SAusg.1.1, SAusg.1.2, ... Sorting outputs of the sorting plant SAnl.1 SAusg.2.1, SAusg.2.2, ... Sorting outputs of the sorting plant SAnl.2 SAusg.3.1, SAusg.3.2, ... Sorting outputs of the sorting system SAnl.3 Spl.1, Spl.2, ... Sorting plans of the sorting system SAnl.1, SAnl.2, ..., stored in the data memories DSp.1, DSp.2, ... ZB.2.1, ZB.2.2, ... Delivery bases in the supply area Ber.2, are responsible for the supply districts Bez.2.1, Bez.2.2, ... Zp.1, Zp.2 Destination points for packages with the delivery addresses Add.1, Add.2, ... V-Rout.2.1.1, V-Rout.2.1.2, ... provisional delivery routes in the supply district Bez.2.1 V-Rout.2.4.1, V-Rout.2.4.2, ... provisional delivery routes in the supply district Bez.2.4 In front Advance notice for the packet P is generated by the computer PC and transmitted to the data processing system DVA

QUOTES INCLUDE IN THE DESCRIPTION

This list of the documents listed by the applicant has been generated automatically and is included solely for the better information of the reader. The list is not part of the German patent or utility model application. The DPMA assumes no liability for any errors or omissions.

Cited patent literature

• EP 1089831 B1 [0004]
• WO 2009/007100 A1 [0005]
• US 7657439 B2 [0006]
• DE 102009056422 A1 [0034]
• DE 102009023306 A1 [0034]
• DE 102008017191 A1 [0034]

Claims (5)

Method for transporting multiple items to destinations located in a given jurisdiction, wherein for each object to be transported (P) the target point (Zp.2) is given, to which this object (P) is to be transported, an arrangement with - a first sorting plant (SAnl.1), - at least one other sorting plant (SAnl.2, SAnl.3) and A data-processing sorting plan generator (gene) is used, each sorting system (SAnl.1, SAnl.2, SAnl.3) has several sorting outputs (SAusg.1.1, ..., SAusg.2.1, ...) and the method comprises the steps of for each object (P) of a subset of the objects to be transported, the advance information (Vor) is transmitted in advance to the sorting plan generator (gene), to which destination point (Zp.2) this object (P) is to be transported, the sorting plan generator (gene) automatically using the preliminary information (Vor) - for each sorting system (SAnl.1, SAnl.2, SAnl.3), a computer-evaluable definition of a jurisdiction (Ber.1, Ber.2, ...) in the area of responsibility and - for the first sorting plant (SAnl.1) a first sorting plan (Spl.1) such that generates - each target point (Zp.2) in the area of responsibility of an item (P) to be transported belongs to a jurisdiction (Ber.1, Ber.2, ...) and - the first sorting plan (Spl.1) assigns each sorting exit (SAusg.1.1, SAusg.1.2, ...) of the first sorting installation (SAnl.1) to each destination point (Zp.2) of an item to be transported (P), - two target points, which belong to two different areas of responsibility, are assigned to two different sorting outputs, each article (P) to be transported is transported to the first sorting installation (SAnl.1), the first sorting system (SAnl.1) for each item to be transported (P) - determines its destination (Zp.2), - by using the first sorting plan (Spl.1) selects a sorting output (SAusg.1.1) of the first sorting system (SAnl.1) for this object (P) and - eject the object (P) into the selected sorting exit (SAusg.1.1), each item (P) whose destination belongs to the area of responsibility (Ber.2, Ber.3) of a further sorting installation (SAnl.2, SAnl.3), from the selected sorting exit (SAusg.1.1) of the first sorting installation (SAnl.1) this further sorting plant (SAnl.2, SAnl.3) is transported, the sorting plan generator (gene) automatically generates a further sorting plan (Spl.2, Spl.3) for each further sorting installation (SAnl.2, SAnl.3) in such a way, in that the further sorting plan (Spl.2, Spl.3) in each case a sorting output (SAusg.2.1,. .., SAusg.3.1, ...) of this further sorting system (SAnl.2, SAnl.3), wherein the sorting plan generator (gene) for each generation of a further sorting plan (Spl.2, Spl.3) uses the destination points information determined by the first sorting installation (SAnl.1) to which destination points the first sorting installation (SAnl.1 ) transported objects are to be transported in each case, every other sorting plant (SLAN 2, SANT 3) for each item (P) transported to this other sorting plant (SUBL.2, SAnl.3), - determines its destination (Zp.2), - by using the further sorting plan (Spl.2, Spl.3) generated for this further sorting installation (Spln.2, Spln.3) for this object (P), a sorting exit (SAusg.2.2) of this further sorting installation (SAnl.2, SAnl.3) selects and - eject the object (P) to the selected sorting exit (SAusg.2.2). A method according to claim 1, characterized in that in each area of responsibility (Ber.1, Ber.2, ...) of a sorting plant (SAnl.1, SAnl.2, SAnl.3) in each case at least one transport and sorting process is carried out, wherein in each transport and sorting process all objects to destinations of a jurisdiction (Ber.1, Ber.2, ...) of this sorting plant (SAnl.1, SAnl.2, SAnl.3) lying jurisdiction district (Bez.2.1, Bez .2.2, ...) and the sorting plan generator (gene) - when the first sorting plan (Spl.1) is generated, the area of responsibility (Ber.1) of the first sorting system is subdivided into jurisdiction districts (Bez.1.1, Bez.1.2, ...), - When generating each further sorting plan (Spl.2 , Spl.3) the area of responsibility (Ber.2, Ber.3) of this further sorting installation (SAnl.2, SAnl.3) is subdivided into jurisdiction districts (Bez.2.1, Bez.2.2, ...) and - each sorting plan (Spl .1, Spl.2, Spl.3) are generated in such a way that the sorting plan assigns two destination points from two different jurisdiction districts two different sorting outputs to the respective sorting system. A method according to claim 1 or claim 2, characterized in that the generation of the sorting plan (Spl.1) for the first sorting plant (SAnl.1) is completed, before the objects to be transported reach the first sorting plant (SAnl.1). Method according to one of claims 1 to 3, characterized in that the sorting plan generator (Gen) generates a further sorting plan for the first sorting system (SAnl.1) after the generation of the first sorting plan (Spl.1), wherein the sorting plan generator (gene) uses the information determined by the first sorting installation (SAnl.1) to which destination points the objects to be transported to the first sorting installation (SAnl.1) are to be transported, the generated further sorting plan for the first sorting plant (SAnl.1) - subdivided the area of responsibility (Ber.1) of the first sorting plant (SAnl.1) into other jurisdiction districts (Bez.1.1, Bez.1.2, ...) and - two target points from two different jurisdictions (Bez.1.1., Bez.1.2) assigns two different sorting outputs (SAusg.1.1, SAusg.1.2, ...) of the first sorting system (SAnl.1), and at least one object whose destination lies within the area of responsibility (Ber.1) of the first sorting installation (SAnl.1), - again the first sorting system (SAnl.1) goes through and - Is discharged from the first sorting system (SAnl.1) in those sorting output, which assigns the generated further sorting plan for the first sorting system (SAnl.1) to the target point of this item. Arrangement for transporting a plurality of objects to destinations lying in a predetermined area of responsibility, wherein for each object to be transported (P), the destination point (Zp.2) to which this article (P) is to be transported, the arrangement - a first sorting installation (SAnl.1), - at least one further sorting installation (SAnl.2, SAnl.3), - several means of transport (LKw.1, LKw.2) and - a data-processing sorting plan generator (gene), each sorting installation ( SAnl.1, SAnl.2, SAnl.3) each has a plurality of sorting outputs (SAusg.1.1, ..., SAusg.2.1, ...), the arrangement being designed for each item (P) of a subset of each advance information (Vor) to receive and automatically process the transporting objects, the advance information (Vor) determines for an object to be transported, to which destination (Zp.2) this object is to be transported, the sorting plan Generie rer (gene) is designed to automatically using the obtained advance information (Vor) - for each sorting system (SAnl.1, SAnl.2, SAnl.3) in each case a computer-evaluable determination of a jurisdiction (Ber.1, Ber.2 , ...) and - for the first sorting system (SAnl.1) to generate a first sorting plan (Spl.1) in such a way that - each destination point of an item (P) to be transported in the area of responsibility belongs to a jurisdiction (Ber.1, Ber.2, ...) of a sorting system used (SAnl.1, SAnl.2, SAnl.3) belongs and - the first sorting plan (Spl.1) each target point of an object to be transported (P) each have a sorting output (SAusg. 1.1, SAusg.1.2, ...) of the first sorting system (SAnl.1), wherein two destination points, which belong to two different areas of responsibility, are assigned to two different sorting outputs, the arrangement being designed using at least one transporting means (LKw.1, LKw.2) each object to be transported (P) to the first sorting plant (SAnl.1) is transported, the first sorting system (SAnl.1) is designed to - to determine the destination (Zp.2) for each object to be transported, - to select a sorting exit (SAusg.1.1) of the first sorting installation (SAnl.1) for this object by using the first sorting plan (Spl.1) and - the object (P) in the selected sorting output (SAusg.1.1) auszuschleusen, the arrangement is designed so that using at least one means of transport (LKw.1, LKw.2) each item whose destination to the jurisdiction (Ber.2, Ber.3 ) of a further sorting plant (SAnl.2, SAnl.3) belongs, is transported from the selected sorting output of the first sorting plant (SAnl.1) to this further sorting plant (SAnl.2, SAnl.3), the sorting plan generator (gene) to it is configured to generate for each other sorting system (SAnl.2, SAnl.3) in each case a further sorting plan (Spl.2, Spl.3) in such a way that the further sorting plan (Spl.2, Spl.3) each target point of a Item (P) under the responsibility tsbereich (Ber.2, Ber.3) of the other sorting system (SAnl.2, SAnl.3) each have a sorting output (SAusg.2.1, ..., SAusg.3.1, ...) of this further sorting system (SAnl.2, SAnl.3), wherein the sorting plan generator (Ben) for each generation of a further sorting plan (Spl.2, Spl.3) uses the target point information determined by the first sorting installation (SAnl.1), to which destination points the Each sorting system (SAnl.2, SAnl.3) is designed to, for each item (P), to this other sorting system (SAnl.2, SAnl.3.) Are transported each transported to the first sorting system (SAnl.1) transported objects each ) - to determine its destination (Zp.2), - by applying the further sorting plan (Spl.2, Spl.3) generated for this further sorting installation (SAnl.2, SAnl.3) for this object (P) select a sorting output (SAusg.2.2) of this further sorting installation (SAnl.2, SAnl.3) and - select the object (P) in the selected exclude sorting output (SAusg.2.2).

Images