Process for sorting distribution sequences

• US 6,703,574 B1
• Filed: 10/01/1999
• Issued: 03/09/2004
• Est. Priority Date: 06/22/1996
• Status: Expired due to Term

• Current Assignee: Siemens AG
• Original Assignee: Siemens AG
• Inventors: Pretzel, Hermann, Kechel, Ottmar, Jirsa, Reinhard
• Primary Examiner(s): Walsh, Donald P.
• Assistant Examiner(s): Miller, Jonathan R.
• Application Number:
  US09/202,903
• Time in Patent Office: 1,621 Days
• Field of Search: 209/584, 209/900, 700/215, 700/219, 700/220, 700/223, 700/221, 700/225, 700/226, 700/227
• US Class Current: 209/584
• CPC Class Codes: B07C 3/02 Apparatus characterised by the means used for distribution
• CPC Class Codes: Y10S 209/90 Sorting flat-type mail

Abstract

The invention relates to a process for sorting distribution sequences on a despatch sorting machine, in which each despatch is arranged in a distribution sequence according to its read and recognized address code, where sorting takes place in several cycles in accordance with the number and size of the available sorting compartments and the sequence requirements. According to the invention, in order to avoid being faced with full compartments, after the recognition of all the despatches'"'"' address codes, with one or more full compartments, one or more compartment combinations for one distribution stop are found by iterative search steps taking account of all the compartments available for sorting and all possible distribution stops, while retaining the predetermined despatch sequence, where said combinations are formed by characteristic numbers of the compartments during the passages and which are capable of accepting despatches for distribution at the distribution stop concerned.

Claims

1. A process for sorting distribution sequences in an item sorting machine, whereby each item is arranged in a distribution sequence in accordance with its read and identified address coding, wherein the sorting takes place during several passes in dependence on the number and size of the existing sorting compartments, as well as the number of distribution stops describing the sequence requirement, characterized in that following knowledge of the complete address coding for all items and in order to avoid full-compartment situations, using iterative search steps in a simulation of the sorting process prior to the sorting process, carried out in the sorting machine with up to n modified distribution stops, wherein n represents the total number of distribution stops processed by the item sorting machine, which are formed as compartment combinations from combinations of the characterizing numbers for all available sorting compartments during the passes, the items of each original distribution stop are distributed to modified distribution stops and compartment combinations while retaining the predetermined distribution sequence, in such a way that the sorting compartments can accommodate the items arriving for distribution without exceeding the filling level, so that following the simulation, the sorting can occur in the item sorting machine.

2. A process for sorting distribution sequences according to claim 1, characterized in that starting with the actual number of items and the number of actually occupied distribution stops, a reduction in the number of compartments used for the distribution occurs until a predetermined, optimum filling level is reached.