Classifications

• • B—PERFORMING OPERATIONS; TRANSPORTING
  • B07—SEPARATING SOLIDS FROM SOLIDS; SORTING
  • B07C—POSTAL SORTING; SORTING INDIVIDUAL ARTICLES, OR BULK MATERIAL FIT TO BE SORTED PIECE-MEAL, e.g. BY PICKING
  • B07C3/00—Sorting according to destination

Definitions

• the invention relates to a method for sorting mail items on N sorting destinations of a sorting plan with a sorting machine comprising a conveyor of items that serves M sorting outlets each provided with a storage bin for mailings removable container handled by a conveyor of bins.
• the invention applies more particularly to the sorting of mail items of the "large format" type on bucket carousel sorting machines, but the invention can be applied to the sorting of other postal items. These machines have a significant amount of space.
• the aim of the invention is to reduce this congestion by proposing a sorting method according to which, in the sorting plane, the M sorting outlets are associated with only a subset of the N logical destinations.
• the object of the invention is to provide a method for sorting simple postal items and which preserves the operational flow of a bucket carousel of a sorting machine, which uses a sub-sized sorting machine of small size, that is to say, the number of sorting outlets is less than the number of destinations of the shipments.
• the subject of the invention is therefore a method for sorting mail items on N sorting destinations with a sorting machine comprising a mail conveyor which serves M sorting outlets each provided with a sorting container. storage of removable items handled by a conveyor of bins, characterized in that it comprises the following steps:
• the process according to the invention may have the following particularities
• the storage tank extracted from said certain sorting outlet is recirculated on a closed loop path of the container conveyor and in which the items corresponding to said other logical destination are recirculated on a closed loop path of the conveyor of shipments;
• a first subset of the sorting outputs is associated with a first subset of the N logical destinations and a second subset of the sorting outputs is associated with a second subset of the N logical destinations, and in which if detects that a logical destination of the second set of logical destinations is in a state of overbooking, dynamically allocating to this overbooked logical destination a certain sorting output which is part of the first subset of sorting outputs; said certain sorting output is chosen by considering the instantaneous or provisional occupation of the sorting outlets;
• the method is provided for sorting items of the large format type, in which a bucket carousel is used to move the items along the sorting outlets.
• the idea underlying the invention is therefore to dynamically allocate the sorting outputs to the logical destinations and to perform a tray change on a sorting output dynamically allocated to a logical destination, the tray extracted from this output sorting is put on a waiting loop of the ferry conveyor.
• the dynamic allocation and the tray change can be fast enough to prevent shipments destined for a logical destination dynamically over-serviced to travel the entire waiting loop of the delivery conveyor.
• the bins extracted from the dynamically allocated sorting outlets may be partially filled bins that during the sorting process may return to a sorting output dynamically allocated to still store shipments. There is then a recycling of partially filled bins in the sorting outlets of the machine.
• the method according to the invention is more particularly applicable to the sorting of large format items on a conveyor conveyor of the carrousel type with buckets.
• the advantage of the method according to the invention is that it makes it possible to use a sorting machine whose dimensioning is optimized with respect to the number of destinations of the items to be sorted.
• this method makes it possible to optimize the filling the bins, that is to say to leave the bins of the machine only when they are full.
• FIG. 1 shows very schematically a bucket carousel postal sorting machine according to the invention in a first operating state.
• Figure 2 shows very schematically the postal sorting machine in a second operating state.
• Figure 3 shows very schematically the postal sorting machine in a third state of operation.
• Figure 4 shows very schematically the postal sorting machine in a fourth operating state.
• Figure 5 shows very schematically the postal sorting machine in a fifth state of operation.
• Figure 6 shows very schematically the postal sorting machine in a sixth state of operation.
• FIG. 7 is a flow chart which illustrates the main steps of the method for sorting items according to the invention with a sorting machine as shown in FIGS. 1 to 6.
• sorting machine 1 with two feed inlet with 480 physical sorting outlets to sort 600 logical destinations of a sorting plan.
• Each logical destination can correspond to several distribution points of a postman's tour.
• the sorting process according to the invention is particularly effective in the situation described hereinafter but it can also operate with a single group of 600 logical destinations assigned to the 480 physical sorting outlets of the sorting machine 1. There is also in this case a number of sorting outputs smaller than the number of logical destinations to process on the machine.
• the sorting machine 1 for sorting postal items thus comprises two feed input lines 2 with automatic unstacking devices supplying a conveyor of items 3 of the carousel type. with buckets. Each bucket is here arranged to move one shipment at a time.
• each item goes into a reading and recognition device automatic address by OCR for example (not shown).
• OCR optical character recognition
• each item is injected into a cup of the carousel 3, the cups of the carousel circulating in a closed loop path above the physical sorting outlets of the machine 1 (not referenced) which are distributed here on two opposite sides of the machine 1.
• the carousel 3 is designed to allow, therefore, shipments to be recirculated on a waiting loop 4 temporarily.
• the shipping conveyor 3 is controlled by a control / command unit 7.
• Each sorting outlet is provided with a storage bin 5 for shipments.
• the storage capacity of each tray is about fifty shipments.
• the bins 5 of the sorting outlets are removable and interchangeable bins.
• the sorting machine 1 also comprises a tray conveyor 6 for transporting trays along the sorting outlets.
• This tray conveyor 6 is able to load and unload a tray 5 at each sorting outlet.
• This tray conveyor 6 is furthermore arranged to follow, along the sorting outlets, a path 8 in a closed loop, which makes it possible to temporarily recirculate (wait) partially filled containers on a waiting loop as described below.
• FIG. 1 it can be seen that the closed loop path 8 of the bins conveyor 6 passes to the front and rear of the sorting outlets of the machine so that the bins enter and leave each sort outlet as in a "FIFO"("First In, First Out", that is, the first entry in the sorting output is the first output).
• FIFO First In, First Out
• the conveyor of bins 6 here comprises two so-called external ferry conveyor sections 9a, 9b (also called OTAC for "Outside Tray Accumulation Conveyor”) respectively connected to two so-called internal ferry conveyor sections 10a, 10b (also called ITAC for "Inside Tray Accumulation Conveyor”) by via input or output tray transfer devices 1 1a, 11b, 12a, 12b (also called ITD for "Input Transfer Device” or OTD for "Output Transfer Device”).
• OTAC External Transport Conveyor
• ITAC Internal Tray Accumulation Conveyor
• the conveyor sections 9a, 9b therefore run along the front side of the sort discharge outlets while the conveyor sections 10a, 10b run along the rear side of the sorting outlets.
• the bin conveyor 6 is also driven by the unit 7.
• the sorting of each shipment is made from the sorting plane in which each sorting output of the machine is associated with a logical destination derived from the postal address automatically read on the surface of the shipment.
• the sorting plan can be seen as an association table stored in the unit 7 which associates a logical destination with a distribution point (for example a postal address), the logical destination being moreover associated in machine memory with a sorting outlet which allows the unit 7 to control the conveyors of items 3 and bins 6.
• the allocation (or assignment) of a sorting output to a logical destination for a shipment is done dynamically, that is to say while the sending flows in the conveyor of items 3.
• the thickness of the items can be measured in the sorting machine to anticipate the fill level of sort output bins and to calculate bin replacement requests based on a fill level limit.
• the unit 7 can therefore associate the shipment with a logical destination and normally a sorting outlet. Since the sort plan requires 600 logical destinations, and the sorting units only have 480 physical outputs, the association of a logical destination to a physical sorting output is not a one-to-one association but an association dynamic that does not exist during a whole sorting pass and can therefore move from one physical sort output to another during this pass.
• a first input 2 of the machine with sendings intended for group A of logical destinations indicated in FIG. 1 is used.
• 300 physical sorting outputs are used to start a password. sorting with group A. These sorting outlets have empty trays at the start.
• the other power input of the machine is not used with sendings to group B of logical destinations.
• the bins of the outputs of group A are therefore filled as and when the shipments of group A in the conveyor 6.
• FIG. 1 illustrates the operating state of the sorting machine at this stage of the sorting process by showing in rectangles with hatching on the right the partially filled sorting outlets 5 associated with group A and in empty rectangles sorting outlets 5 associated with no logical destination.
• the bins 5 in the conveyor 6 can be identified and tracked by the unit 7 via machine readable codes, such as barcodes.
• machine readable codes such as barcodes.
• Figure 2 shows an operating state of the sorting machine 1 during a first phase of simultaneous sorting of shipments for groups A and B of logical destinations, the shipping conveyor 3 being fed at the same time from the two inputs 2 of the machine. At this time, shipments also fill the sorting outlets associated with the logical destinations of Group B.
• Figure 2 there is shown a set of bins 5 partially filled with shipments associated with Group B logical destinations that are illustrated by a rectangle with a hatch on the left.
• the unit 7 can control the activity or the instantaneous occupation of the physical sorting outlets.
• unit 7 may, for example, choose a physical output associated with group A of logical destinations which has the lowest occupancy and therefore control the conveyor of bins. 6 so that it replaces the partially full container of this sorting outlet with an empty container able to receive the items to be sorted for this overbooked destination.
• the partially filled tank of this sorting outlet is thus removed on the outer conveyor section 9a, 9b and the empty tank is fed by the inner conveyor section 10a, 10b.
• This sorting output can be selected for example according to the number of expected shipments it must receive, for example the number of shipments present in the conveyor 3 and which are intended for it according to the sorting plan.
• the selection criterion is the exit with the lowest occupancy. We can therefore have to change several partially filled bins by several empty bins in the sorting outlets.
• Figures 3 and 4 show operating states of the machine 1 where partially filled tanks associated with the group A circulate in the conveyor 6 with empty trays. In order to avoid creating space on the inner conveyor section 10a, 10b, the bins reaching the downstream end of the inner conveyor section 10a, 10b are transferred onto the outer conveyor section 9a, 9b by the transfer of bins 12a, 12b.
• empty bins can be transferred on the conveyor section 9a, 9b when they reach the downstream end of the conveyor section 10a, 10b and partially filled bins can be transferred on the conveyor section 9a, 9b either at the following unloading sorting outlet when they are replaced by another tray, or when they reach the downstream end of the inner conveyor section 10a, 10b.
• Figure 5 shows the state of the machine during a recycling of empty bins and partially filled bins on the outer conveyor section 9a, 9b during the sorting process.
• bins partially filled in with group A, partially filled bins associated with group B and empty bins run along closed loop path 8 and partially filled bins are recycled to the sorting outlets by unit 7, which is shown in Figure 6.
• a limited amount of empty bins are accepted on the inner conveyor section 10a, 10b.
• additional empty bins coming for example from an infeed conveyor system or ICS (Infeed Conveyor System) are put on hold in a reserve of empty bins. This makes it possible to maintain a fluid circulation of bins inside the conveyor 6 and to prepare a rapid change of bins in the sorting outlets by keeping a local stock of empty bins on the bins storage conveyor.
• FIG. 7 illustrates the main steps of the dynamic allocation process according to the invention.
• step 20 the unit 7 automatically determines the mailing address for a current mail entering the sorting machine and therefore a logical destination that corresponds to this mailing address in the sorting plan.
• step 21 the unit 7 checks whether this logical destination is a logic destination in overbooking. If the logical destination is not overbooked, the unit 7 controls the conveyor 6 in step 22 to direct the sending to a sorting outlet of the machine 1 identified in the sorting plane for storage in a bin 5.
• the unit 7 determines in step 23, starting from the instantaneous or predicted occupation levels of the sorting outlets of the machine, an output to reassociate, for example the sort out with the lowest occupancy
• the sorting plan in memory in the sorting machine is then updated dynamically in step 24 to associate the logical destination which is overbooked with the lowest occupancy sorting output which was determined in step 23.
• step 24 the logical destination that was previously associated with this sorting output has passed into a state of overbooking in the sorting plan so that the items present, if any, in the conveyor 3 having this logical destination. are then recirculated by the unit 7 in the waiting loop of the conveyor 3 (the unit 7 therefore suspends the unloading of these items in a storage bin).
• the unit 7 also controls the tray conveyor 6 to unload the tray sorting outlet, if necessary partially full, and replace it with a replacement tray, if necessary an empty tray, in which the current shipment may be unloaded at step 22.
• the replacement tray may be also be a tray already partially full in the case where this tray has already been recycled during the sorting process.
• the unit 7 must make this change of bins in a sorting outlet in advance of the arrival of the items in the sorting outlet and the items to be directed to this sorting outlet can be recirculated on the waiting loop 4 before being unloaded in the sorting outlet.
• the management of the bins on the conveyor 6 may require identification of the bins and tracing of the bins along the conveyor 8 in a manner known per se.

Landscapes

• Sorting Of Articles (AREA)
• Separation, Sorting, Adjustment, Or Bending Of Sheets To Be Conveyed (AREA)
• Pile Receivers (AREA)

Applications Claiming Priority (2)

Publications (3)

Family

ID=40736004

Family Applications (1)

Country Status (5)

Cited By (1)

Families Citing this family (29)

Family Cites Families (25)

• 2008
  • 2008-12-12 US US12/514,827 patent/US8504192B2/en active Active
  • 2008-12-12 ES ES08865507.1T patent/ES2372161T5/es active Active
  • 2008-12-12 EP EP08865507.1A patent/EP2225049B2/de not_active Not-in-force
  • 2008-12-12 WO PCT/FR2008/052292 patent/WO2009081008A2/fr active Application Filing
  • 2008-12-12 AT AT08865507T patent/ATE524246T1/de not_active IP Right Cessation

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events