[0001] The present patent application for industrial invention relates to a process used
to sort out lots of goods loaded in bulk on conveyor systems according to a specific
order, item by item.
[0002] The system according to the present invention refers to a specific technical sector
that offers conveyor systems capable of sorting out items loaded in bulk.
[0003] A first type of these systems is represented by the so-called sorting systems.
[0004] These systems include a supply line and various exits used to separate the items.
According to their operative principle, the first item that enters the system is usually
the first item that exits from it, thus allowing to sort out the items in various
groups. In these systems the number of exits is defined according to the number of
groups to be created.
[0005] This type of system comprise a loading station, an identification station, a unidirectional
transportation line and multiple exits with automatically controlled exchanges, one
for each destination.
[0006] The major advantage of this type of systems is represented by fast operation, since
unloading occurs together with loading and various items are managed in a parallel,
simultaneous way, since no pre-defined positions are necessary.
[0007] These systems, however, cannot be used if the separation level of the items is high.
As a matter of fact, in order to obtain a certain order in the exit of the items,
it would be necessary to provide as many exits as the number of arriving items, and
this is not possible for reasons related to space and costs.
[0008] Cascade systems are sometimes realised to obtain a higher level of separation. In
these systems, the downstream installation receives a lot of items from one of the
destinations directed to the upstream installation. For illustrative purposes, we
could mention that a shipping system includes a first machine that sorts out the items
by courier and a second machine that takes the items of a specific courier and sorts
them out by client.
[0009] However, whenever a specific exit order is required, item by item, the number of
machines and exits is always very high.
[0010] A second type of conveyor systems is represented by the so-called ordering systems.
The applicant of this patent application has been operating in this field as manufacturer
for a long time.
[0011] The ordering systems include multiple co-operating machines that receive the items
and unload them, one by one, in the desired exit order; it being provided that the
exit order is not related to the entrance order.
[0012] The major advantage of this type of systems is the capability of ordering the items
according to any predefined order, since they include a search phase, item by item,
inside the structure of a temporary stock with a different time schedule compared
to the reception phase.
[0013] These systems are therefore extremely practical and efficient, since they provide
for high separation of the unloading lists or, in any case, for the possibility of
providing a high separation level.
[0014] The weak point of this type of systems is the reduced speed of reordering operations,
since unloading does not take place together with loading. For this reason, in order
to search for a specific item in the stored lot it is necessary to repeat the positioning
for each item.
[0015] Once implemented on a conveyor system, the process according to the present invention
allows for combining the specific advantages of the two types of systems mentioned
above, without their disadvantages. More precisely, the process according to the present
invention provides for the same performance, in terms of separation level, as the
ordering systems, while maintaining the typical advantages of sorting out systems,
related - as mentioned earlier - to limited costs and volumes, to the capability of
respecting any exit order, item by item, and to the limited number of exits.
[0016] In particular, according to the new process, the items are subjected to two different
separation phases: the first, preliminary phase realises the predefined order of the
items during the second, final separation phase.
[0017] In consideration of a maximum number of items, the implementation of the process
according to the present invention requires the realisation of a system with two groups
of exits, each group with a number of exits equal to the square root of the maximum
number of items in the lot, rounded up. To sort out a lot of max. 100 items, it will
be therefore necessary to have a system with two groups of exits, with ten exits defined
as A1, A2 up to A10 and other ten exits defined as B1, B2 up to B10.
[0018] Based on the process according to the present invention, the identification codes
of the items loaded on the system must be known, as well as the desired unloading
order, item by item. The positions of the items along exits B1, B2 ... B10 are booked
according to this order, based on a logic principle by which the first item to be
unloaded will book the first position of exit B1, the second item will book the second
position of the same exit B1, and so on, until the maximum quantity of items that
can be positioned on line B1 has been booked, which corresponds to the number of exits
for each group (ten in this example).
[0019] The first item after the items that have booked the ten positions of exit B1 (that
is the 11
th item) will book the first position of exit B2; likewise, the first item after the
items that have booked the ten positions of exit B2 will book the first position of
exit B3, and so on, until the ten positions of exit B10 have been booked.
[0020] Once the items have been loaded on the conveyor system operated by the logical principle
according to the present invention, the items are initially sorted out along the exits
of series A1-A10, according to the position booked on the exits of series B1-B10.
More precisely, all items designed to take the first positions of the exits B1-B10
will be conveyed towards exit A1 (that is the 1
st item, the 11
th item, the 21
st item ... up to the 91
st item); all items designed to take the second positions of the exits B1-B10 will be
conveyed towards exit A2 (that is the 2
nd item, the 12
th item, the 22
nd item ... up to the 92
nd item) and so on, until all items designed to take the 10
th positions of the exits B1-B10 will be conveyed towards exit A10 (that is the 10
th item, the 20
th item ... up to the 100
th item).
[0021] Unloading starts once the reception of a lot has been completed and the lot has been
divided along exits A1-A10, starting from exit A1 that unloads the ten items in the
first positions of the ten exits B1-B10; likewise, exit A2 unloads the ten items in
the second positions of the ten exits B1-B10, until the ten items located inside exit
A10 have been unloaded in the 10
th positions of the same exits B1-B10.
[0022] It must be noted that, in order to ensure the correct final selection inside exits
B1-B10, the order in which the items are loaded inside each exit from A1 to A10 is
not relevant.
[0023] Considering exit A1 for illustrative purposes, it can be said that the ten items
designed for this exit can be loaded in a rigorous sequence (i.e. the 1
st, the 11
th, the 21
st ... up to the 91
st) like the sequence shown in the table below, but also, with the same efficacy, in
a completely random sequence (i.e. the 21
st, the 91
st, the 1
st, the 31
st, the 41
st, etc.) as long as all these items are the first items of their respective sub-lots
of ten items each.
[0024] To better understand the logic principle of the process according to the present
invention, reference is made to Table A below, which shows the sorting out of a 100-item
lot.
[0025] The table is prepared before the arrival of the 100-item lot, by giving numbers from
1 to 100 to each of the identification codes of the items in the desired final order.
Then the table is filled in, in horizontal direction from left to right, from up down.
[0026] The table is read horizontally for exits of group B and vertically for exits of group
A. In practice, for each identification code, the destination during the separation
phase for exits in group A corresponds to the column and the destination for exits
in group B corresponds to the line.
[0027] It must be noted that the sorting out process with double cycle according to the
present invention can be actuated by a sorting out system with two groups of exits
as illustrated above, or by two independent systems arranged in cascade, each of them
with a single group of exits, or by a single system provided with a single group of
exits, as long as the exits can be divided in two parts and therefore used first as
exits of series A and then as exits of series B, maintaining the items separated along
the same line.
Table A
|
A1 |
A2 |
A3 |
A4 |
A5 |
A6 |
A7 |
A8 |
A9 |
A10 |
B1 |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
B2 |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
B3 |
21 |
22 |
23 |
24 |
25 |
26 |
27 |
28 |
29 |
30 |
B4 |
31 |
32 |
33 |
34 |
35 |
36 |
37 |
38 |
39 |
40 |
B5 |
41 |
42 |
43 |
44 |
45 |
46 |
47 |
48 |
49 |
50 |
B6 |
51 |
52 |
53 |
54 |
55 |
56 |
57 |
58 |
59 |
60 |
B7 |
61 |
62 |
63 |
64 |
65 |
66 |
67 |
68 |
69 |
70 |
B8 |
71 |
72 |
73 |
74 |
75 |
76 |
77 |
78 |
79 |
80 |
B9 |
81 |
82 |
83 |
84 |
85 |
86 |
87 |
88 |
89 |
90 |
B10 |
91 |
92 |
93 |
94 |
95 |
96 |
97 |
98 |
99 |
100 |
[0028] For easier reference this description continues with a practical example of the operation
of the process according to the present invention, with the help of some graphic symbols,
with each symbol representing an item to be sorted out. For convenience reasons, this
example refers to a lot of 16 items. It is understood, however, that the same logic
principle can be used for lots with any number of items, as desired.
[0029] In view of the above, it can be understood that the 16 items can be sorted out by
means of a system provided with two groups of exits, each of them including four exits,
that is equal to the square root of the number (16) of items in the lot to be sorted
out. In this example the items arrive to the system operated according to the present
invention in the following random order:
and must be sorted out in the following order
[0030] More precisely, as it can be seen from the alphanumerical codes associated to the
various symbols, the final purpose is to sort out the items loaded in bulk according
to a desired sequence of four different sub-lots, each of them with four items; it
being provided that the four items of each sub-lot are ordered according to a predefined
sequence.
[0031] With reference to the symbols and alphanumerical codes that identify the items, it
can be stated that the final purpose of this demonstration is to create a sequence
of four sub-lots as explained below:
■ the first sub-lot with items α1, α2, α3, α4
■ the second sub-lot with items β1, β2, β3, β4
■ the third sub-lot with itemsχ1, χ2, χ3, χ4
■ the fourth sub-lot with items δ1, δ2, δ3, δ4.
[0032] To that end two consecutive separation phases will take place, each of them affecting
one group of four exits. The four exits for the first separation phase (or initial
division) are defined as A1, A2, A3 and A4 and the second group of exits for the second
separation phase (or final division) as B1, B2, B3 and B4.
[0033] The description continues illustrating the arrangement of the items at the end of
the second separation phase according to Table B below, which is filled in using the
symbols of the items in the desired final order, from up down and from left to right.
[0034] As shown in Table B, during the first separation phase, the items will be assigned
to the exit that corresponds to the vertical line they belong to, then will be taken
in the second separation phase step and directed to the exit that corresponds to the
same horizontal line they belong to.
[0036] The essential condition for the first separation phase of the process is that the
four specific items directed to a specific exit (A1-A4) must be deposited inside this
specific exit, even if in random order.
[0037] For easier reference, it can be said that if exit A1 is necessarily the first destination
of the items identified with α1, β1, χ1, δ1, these items can be deposited there in
an ordered sequence, but also - as an alternative example - in the sequence χ1, α1,
δ1, β1 or in any other possible sequence.
[0039] Taking the items from the exits of group B, starting from B1 to B4, the desired order
can be obtained, as shown below:
[0040] Finally, it must be noted that for the practical implementation of the process according
to the present invention, the sorting system used for this purpose must be assisted
by an electronic control unit (capable of managing and controlling the entire process)
and a reader capable of identifying the items loaded on the system and transferring
the identification results to the electronic control unit.
1. A process used to sort out lots of goods loaded in bulk on conveyor systems according
to a specific order, item by item, characterised by the fact that it is implemented on a sorting system with two different, but identical
in number, groups of exits (A1-An/B1-Bn), according to which, when items are loaded in bulk on the system, the identification
codes of each item are known, as well as the order in which the items have to be unloaded,
item by item; it being provided that according to the predefined order of unloading,
the various items entering the system are automatically associated - using a suitable
processor - with the position they occupy in the second group of exits (B1-Bn), based on the logic principle that the first item to be unloaded must be assigned
to the first position of the first exit (B1), the second item to be unloaded must
be assigned to the second position of the first exit (B1), up to the last item to
be unloaded that must be assigned to the last position of the last exit (Bn); it being provided that initially the items are assigned to the first group of exits
(A1-An), according to the logic principle that all items assigned to the first positions
in the exits of the second group (B1-Bn) must be conveyed to the first exit (A1), all items assigned to the second positions
of the exits of the second group (B1-Bn) must be conveyed to the second exit (A2), up to the last exit of the first group
(An) in which all items assigned to the last position of the exits of the second group
(B1-Bn) must be conveyed; it being additionally provided that the items are transferred
according to an ordered sequence from the first group of exits (A1-An) to the second group of exits (B1-Bn) according to the logic principle that the items contained in the first exit (A1)
of the first group are unloaded, one by one, into the exits of the second group (B1-Bn) so that they always occupy the first positions, the items contained in the second
exit (A2) of the first group are unloaded, one by one, into the exits of the second
group (B1-Bn) so that they always occupy the second positions, up to the items contained in the
last exit (An) of the first group that are unloaded, one by one, into the exits of the second group
(B1-Bn) so that they always occupy the last positions.
2. A process according to claim 1, characterised by the fact that the items loaded in each exit of the first group of exits (A1-An) are arranged according to a predefined order based on the position they must occupy
in the corresponding exit (B1-Bn) of the second group; it being provided that the first position of the first exit
(A1) is occupied by the first item assigned to the first exit (B1) of the second group,
that the second position of the first exit (A1) is occupied by the first item assigned
to the second exit (B2) of the second group, that the third position of the first
exit (A1) is occupied by the first item assigned to the third exit (B3) of the second
group and so on, just like the first position of the second exit (A2) of the first
group is occupied by the second item assigned to the first exit (B1) of the second
group, the second position of the second exit (A2) of the first group is occupied
by the second item assigned to the second exit (B2) of the second group, the third
position of the second exit (A2) of the first group is occupied by the second item
assigned to the third exit (B3) and so on.
1. Vorgang für die Neuordnung von lose auf Förderanlagen aufgegebenen Mengen Kolli nach
einem spezifischen Ordnungsmuster, Kollo für Kollo. Kennzeichnend für den Vorgang
ist, dass er auf einer Verteileranlage stattfindet, die mit zwei verschiedenen, der
Zahl ihrer Ausgänge nach jedoch identischen Gruppen (A1-An/B1-Bn) ausgerüstet ist, sowie die Tatsache, dass bei der Aufgabe von losen Kolli auf eine
derartige Anlage der Erkennungscode jedes einzelnen Kollo identifiziert wird und die
gewünschte Abfolge für den Austrag der einzelnen Kolli nacheinander bekannt ist. Es
ist vorgesehen, dass - ausgehend von dieser vordefinierten Austragsabfolge - die verschiedenen
einlaufenden Kolli mittels einer entsprechenden Datenverarbeitungs-vorrichtung automatisch
der Position zugeordnet werden, die sie innerhalb der zweiten Ausgangsgruppe (B1-Bn) einnehmen sollen, und zwar nach einer Logik, nach welcher das erste auszutragende
Kollo der ersten Position auf dem ersten Ausgang (B1) zugeordnet wird, das zweite
auszutragende Kollo der zweiten Position immer des ersten Ausgangs (B1) usw., bis
hin zum letzten auszutragenden Kollo, das der letzten Position auf dem letzten Ausgang
zugeordnet wird (Bn). Zu diesem Zweck werden die Kolli zunächst an die erste Ausgangsgruppe geschickt
(A1-An), nach einer Logik, nach welcher alle Kolli, die die jeweils erste Position auf den
verschiedenen Ausgängen der zweiten Gruppe (B1-Bn) einzunehmen haben, zum ersten Ausgang (A1) dieser Gruppe gebracht werden müssen,
zum zweiten Ausgang (A2) alle diejenigen Kolli, welche die jeweils zweite Position
auf den verschiedenen Ausgängen der zweiten Gruppe (B1-Bn) einnehmen sollen, und so fort, bis hin zum letzten Ausgang dieser ersten Gruppe
(An), an den alle diejenigen Kolli geschickt werden müssen, die die jeweils letzte Position
auf den verschiedenen Ausgängen der zweiten Gruppe einnehmen sollen (B1-Bn). Daneben ist die Übergabe der Kolli in geordneter Reihenfolge von der ersten Ausgangsgruppe
(A1-An) zur zweiten Ausgangsgruppe (B1-Bn) nach einer Logik vorgesehen, nach welcher die Kolli im ersten Ausgang (A1) der ersten
Gruppe eines nach dem anderen auf die verschiedenen Ausgänge der zweiten Gruppe (B1-Bn) gebracht werden, und zwar so, dass sie stets die jeweils erste Position einnehmen;
die Kolli im zweiten Ausgang (A2) der ersten Gruppe werden eines nach dem anderen
auf die verschiedenen Ausgänge der zweiten Gruppe (B1-Bn) gebracht, und zwar so, dass sie stets die jeweils zweite Position einnehmen, bis
hin zu den Kolli im letzten Ausgang (An) der ersten Gruppe, die eines nach dem anderen auf die verschiedenen Ausgänge der
zweiten Gruppe (B1-Bn) gebracht werden, und zwar so, dass sie stets die jeweils letzte Position einnehmen.
2. Vorgang gemäß Begründung des Patentanspruchs 1, der dadurch gekennzeichnet ist, dass die Kolli auf die einzelnen Ausgänge der ersten Ausgangsgruppe (A1-An) nach einer vordefinierten Folge verteilt werden, je nach der Position, die sie dann
auf dem entsprechenden Ausgang (B1-Bn) der zweiten Gruppe einnehmen sollen. Zu diesem Zweck ist vorgesehen, dass die erste
Position auf dem ersten Ausgang (A1) durch das erste Kollo belegt ist, das für den
ersten Ausgang (B1) der zweiten Gruppe vorgesehen ist; dass die zweite Position auf
dem ersten Ausgang (A1) durch das erste Kollo belegt wird, das für den zweiten Ausgang
(B2) der zweiten Gruppe vorgesehen ist, dass die dritte Position auf dem ersten Ausgang
(A1) durch das erste Kollo belegt wird, das für den dritten Ausgang (B3) der zweiten
Gruppe vorgesehen ist und so weiter, so, wie die erste Position auf dem zweiten Ausgang
(A2) der ersten Gruppe durch das zweite Kollo eingenommen wird, das für den ersten
Ausgang (B1) der zweiten Gruppe vorgesehen ist, die zweite Position auf dem zweiten
Ausgang (A2) der ersten Gruppe wird von dem zweiten Kollo eingenommen, das für den
zweiten Ausgang (B2) der zweiten Gruppe vorgesehen ist, die dritte Position auf dem
zweiten Ausgang (A2) der ersten Gruppe wird eingenommen durch das zweite Kollo, das
für den dritten Ausgang (B3) vorgesehen ist und so weiter.
1. Procédé pour le rangement, selon un ordre spécifique, colis par colis, de lots de
colis chargés en vrac sur des systèmes de transport, caractérisé par le fait d'être effectué sur une installation de triage, dotée de deux groupes de
sorties distincts mais identiques au niveau du nombre (A1-An/B1-Bn) et par le fait
de prévoir que, au moment du chargement en vrac des colis sur une installation de
ce type, les codes de reconnaissance de chaque colis soient identifiés et que l'ordre
de déchargement soit connu, colis par colis ; étant prévu, justement sur la base de
cet ordre de déchargement pré-établi, que les différents colis à l'entrée de l'installation
soient automatiquement associés - au moyen d'un ordinateur prévu à cet effet - à la
position qu'ils devront prendre dans le cadre du second groupe de sortie (B1-Bn),
en fonction d'une logique selon laquelle le premier colis à décharger devra être associé
à la première position de la première sortie (B1), jusqu'au dernier colis à décharger
qui devra être associé à la dernière position de la dernière sortie (Bn) ; étant prévu
dans ce but qu'au départ ces colis soient destinés au premier groupe de sorties (Al-An),
en fonction d'une logique selon laquelle vers la première sortie (Al) de ce groupe,
devront être convoyés tous les colis destinés à occuper les 20 premières positions
dans les différentes sorties du deuxième groupe (Bl-Bn), vers la deuxième sortie (A2)
tous les colis destinés à occuper les deuxièmes positions dans les différentes sorties
du second groupe (Bl-Bn), jusqu'à la dernière sortie de ce premier groupe (An) à l'intérieur
de laquelle devront être convoyés tous les colis destinés à occuper la dernière position
dans les différentes sorties du deuxième groupe (Bl-Bn); étant aussi prévu le transfert
des 5 colis, en séquence ordonnée, du premier groupe de sorties (A1-An) au deuxième
groupe de sorties (Bl-Bn), en fonction d'une logique selon laquelle les colis contenus
dans la première sortie (Al) du premier groupe sont déchargés, un par un, au niveau
des différentes sorties du deuxième groupe (Bl -Bn) de manière à occuper toujours
les premières positions, les colis contenus dans la deuxième sortie (A2) du premier
groupe sont déchargés, un par un, au niveau des différentes sorties du deuxième groupe
(Bl-Bn) de manière à occuper toujours les deuxièmes positions, jusqu'aux colis contenus
au niveau de dernière sortie (An) du premier groupe qui sont déchargés, un par un,
au niveau des différentes sorties du deuxième groupe (Bl-Bn) de manière à toujours
occuper les dernière positions.
2. Procédé en fonction de la revendication I, caractérisé par le fait que les colis chargés vers chacune des sorties de la première série de sorties (Al-An)
sont disposés selon un ordre pré-établi en fonction de la position qu'ils devront
occuper au niveau de la sortie respective (B1-Bn) du deuxième groupe; étant pour ceci
prévu que la première position de la première sortie (Al) soit occupée par le premier
colis destiné à la première sortie (Bl) du deuxième groupe, que la deuxième position
de cette même première sortie (Al) soit occupée par le premier colis destiné à la
deuxième sortie (B2) du deuxième groupe, que la troisième de cette même première sortie
(Al) soit occupée par le premier colis destiné à la troisième sortie (B3) du deuxième
groupe et ainsi de suite, comme la première position de la deuxième sortie (A2) du
premier groupe est occupée par le deuxième colis destiné à la première sortie (Bl)
du deuxième groupe, la deuxième position de la deuxième sortie (A2) du premier groupe
est occupée par le deuxième colis destiné à la deuxième sortie (B2) du deuxième groupe,
la troisième position de la deuxième sortie (A2) du premier groupe est occupée par
le deuxième colis destiné à la troisième sortie (B3) et ainsi de suite.