Logistics network for processing of mailed articles and method for controlling this network

• US 5,870,715 A
• Filed: 07/03/1996
• Issued: 02/09/1999
• Est. Priority Date: 08/19/1994
• Status: Expired due to Term

• Current Assignee: Siemens AG
• Original Assignee: Licentia Patent-Verwaltungs-GmbH
• Inventors: Belitz, Beate, Eychmueller, Tobias, Kreitmeier, Franz, Berends, Andreas
• Primary Examiner(s): Ramirez, Ellis B.
• Application Number:
  US08/632,452
• Time in Patent Office: 951 Days
• Field of Search: 345/200.36, 345/200.69, 345/200.71, 345/673, 345/674, 705/7, 705/9, 705/11, 705/22, 705/28, 705/29
• US Class Current: 705/22
• CPC Class Codes: B07C 3/00 Sorting according to destination collating the pages of a book B42C1/00
• CPC Class Codes: G06Q 20/203 Inventory monitoring

Abstract

A logistical network has nodes and edges, or transport links, which permit mailed articles that are being set from a sender to a receiver to be transferred, processed, and forwarded in a sequence which is predetermined in terms of time and place. The network includes devices for determining differences between nominal data describing the state of the logistical network and actual measured data. A controlled system is provided for minimizing differences in a predetermined period of time by shifting the processing of mailed articles from one node or a plurality of nodes of which the capacity is reduced with respect to the nominal data to one or a plurality of other nodes such that minimal additional expenditure is incurred.

Claims

1. A logistics network comprising:

means for performing acceptance, processing and passing on of mailed articles, which are directed from a sender to a recipient, in a temporally and locally predetermined sequence, the means for performing including edges and nodes;

means for detecting discrepancies between requirements data, which describe requirements imposed on the logistics network if a predetermined quality standard is to be maintained, and actual measured data, and

control means for minimizing the discrepancies in a predetermined time by moving the processing of mailed articles from at least one node, whose capacity is less than the requirements data, to at least one other node, wherein a minimal additional outlay or expense is incurred.

2. The logistics network as claimed in claim 1, wherein the network has an upper network level, and wherein a first subset of the nodes forms the upper network level, the nodes forming the upper network level having I/O means for input and output processing of mailed articles.

3. The logistics network as claimed in claim 2, wherein the network has at least one middle network level, and wherein a second subset of nodes forms the at least one middle network level.

4. A method for controlling a logistics network so that processing is moved from at least one node, whose capacity is less than the requirements data, to at least one other node and a minimal additional outlay or expense is incurred, comprising utilizing the logistics network according to claim 1.

5. A method for controlling a logistics network so that, if a node has an existing capacity for input processing that is not sufficient, excess input processing beyond the existing capacity is moved to at least one other node to achieve the requirements data of this at least one other node, comprising utilizing the logistics network according to claim 2.

6. A method for controlling a logistics network so that, if a node has an existing capacity for output processing that is not sufficient, excess output processing beyond the existing capacity is moved to at least one other node to achieve the requirements data of this at least one other node, comprising utilizing the logistics network according to claim 2.

7. The method as claimed in claim 4, wherein the processing is not moved from one node to another node unless a quantity of mailed articles intended for processing by said one node exceeds the available capacity there by a predetermined value ε

.

8. The method as claimed in claim 7, wherein ε

=0.8 X^b, where X=mean throughput of said one node and ^b =0.75 to 0.82.

9. The method as claimed in claim 5, wherein the processing is not moved from one node to another node unless a quantity of mailed articles intended for processing by said one node exceeds the available capacity there by a predetermined value ε

.

10. The method as claimed in claim 9, wherein ε

=0.8 X^b, where X=mean throughput of said one node and ^b =0.75 to 0.82.

11. The method as claimed in claim 6, wherein the processing is not moved from one node to another node unless a quantity of mailed articles intended for processing by said one node exceeds the available capacity there by a predetermined value ε

.

12. The method as claimed in claim 11, wherein ε

=0.8 X^b, where X=mean throughput of said one node and ^b =0.75 to 0.82.

13. A method for controlling a logistics network having a plurality of nodes for processing articles between receipt of the articles from senders and delivery of the articles to receivers, comprising;

(a) assigning articles to the nodes in a predetermined manner if predetermined throughput requirements can be maintained;

(b) detecting whether any of the nodes wold be overloaded and thus unable to maintain the throughput requirements as a result of the assignment in step (a);

(c) determining whether any other nodes have excess processing capacity; and

(d) dynamically modifying the predetermined manner of assigning articles to nodes so as to divert articles from a node that was detected as being overloaded in step (b) to a node that was determined to have excess capacity in step (c) if the throughput requirements can be maintained as a result of the diversion.