Classifications

• • G—PHYSICS
  • G07—CHECKING-DEVICES
  • G07F—COIN-FREED OR LIKE APPARATUS
  • G07F7/00—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus
  • G07F7/06—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus by returnable containers, i.e. reverse vending systems in which a user is rewarded for returning a container that serves as a token of value, e.g. bottles
  • G07F7/0609—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus by returnable containers, i.e. reverse vending systems in which a user is rewarded for returning a container that serves as a token of value, e.g. bottles by fluid containers, e.g. bottles, cups, gas containers
• • B—PERFORMING OPERATIONS; TRANSPORTING
  • B67—OPENING, CLOSING OR CLEANING BOTTLES, JARS OR SIMILAR CONTAINERS; LIQUID HANDLING
  • B67C—CLEANING, FILLING WITH LIQUIDS OR SEMILIQUIDS, OR EMPTYING, OF BOTTLES, JARS, CANS, CASKS, BARRELS, OR SIMILAR CONTAINERS, NOT OTHERWISE PROVIDED FOR; FUNNELS
  • B67C3/00—Bottling liquids or semiliquids; Filling jars or cans with liquids or semiliquids using bottling or like apparatus; Filling casks or barrels with liquids or semiliquids
  • B67C3/007—Applications of control, warning or safety devices in filling machinery
• • B—PERFORMING OPERATIONS; TRANSPORTING
  • B67—OPENING, CLOSING OR CLEANING BOTTLES, JARS OR SIMILAR CONTAINERS; LIQUID HANDLING
  • B67C—CLEANING, FILLING WITH LIQUIDS OR SEMILIQUIDS, OR EMPTYING, OF BOTTLES, JARS, CANS, CASKS, BARRELS, OR SIMILAR CONTAINERS, NOT OTHERWISE PROVIDED FOR; FUNNELS
  • B67C7/00—Concurrent cleaning, filling, and closing of bottles; Processes or devices for at least two of these operations
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
  • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
  • G06Q10/30—Administration of product recycling or disposal
• • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
  • Y02W—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO WASTEWATER TREATMENT OR WASTE MANAGEMENT
  • Y02W90/00—Enabling technologies or technologies with a potential or indirect contribution to greenhouse gas [GHG] emissions mitigation

Definitions

• the invention relates to a system for managing a large number of reusable reusable packagings, each of which is identified by a code in an identifiable manner, the reusable packagings being used in several local stations that are separate from one another in a number of round trips and the code for each round trip is read.
• the invention further relates to a code which is particularly suitable for this system for managing a large number of reusable reusable packaging, the coding elements being able to be set only at positions which are arranged in a grid.
• the reusable packaging can be a means of transport or a container, in particular a reusable beverage bottle.
• Plastic bottles have a softer surface than glass bottles and are therefore easier to scratch that they become unsightly after about fifteen rounds or uses. They are also not as dimensionally stable as glass bottles and shrink slightly over time, so that they no longer have the specified fill quantity. It is therefore necessary to limit the number of reuses and the total period of use of such plastic bottles.
• each bottle is marked laterally with a laser beam with each use, the height of the marking indicating the number of uses. With each use, the mark made in the previous use is read or detected and a new mark is made at a certain distance above it.
• These markings consist of a small welding spot created by the laser beam. With this marking only the number of uses or revolutions can be determined, but not the age of the bottle. The spot weld also interferes with empty bottle inspection using CCD cameras, since it is easily mistaken for a foreign body. Another disadvantage of this marking is that it can easily be skipped or its reading suppressed, so that unsightly bottles are in circulation and the disposal of the bottles is also incurred by the next user. Finally, each beverage filling station must be equipped with a laser to apply the marking.
• a method for filling reusable containers with a liquid product in which the containers are provided with a code before filling.
• the coding is checked for correctness before filling.
• the coding consists of a coding body that can be attached to the underside of the container.
• the coding body has a multiplicity of vertical holes which are scanned by pins of the coding testing device.
• a device for marking containers with refill and refill codes is known, the existing codes being detected and the container being rotated so that the further refill code to be applied does not overwrite the existing refill codes or overlap with them.
• the refill codes are applied to the plastic containers using a laser marking system.
• the laser beam is shaped by a mask.
• DE-A-41 07 012 discloses applying an optically readable code marking to a plastic bottle by means of a laser beam.
• the laser beam is directed at an angle of 7 to 15 ° to the axis of the plastic bottle onto a horizontal surface of the bottle, e.g. the support ring or the floor surface.
• the code marking can be formed from line-shaped or punctiform depressions which are applied laterally one after the other.
• an optical-electrical sensor for reading a bottle code marking which consists of raised dots or lines.
• a light guide Using a light guide, a light beam is directed onto the code marking and the reflected light is directed to a photoelectric receiver.
• a control system for the detection, counting, logging and recording of various applications in a bottling plant is known, the entire filling process being controlled by a central device.
• the invention has for its object to provide a system for managing a large number of reusable reusable packaging that allows simple means to limit the number of uses or circulation of each individual reusable packaging.
• this object is achieved in that, in a central station, data which have been recorded in the local stations for the individual reusable packaging are stored in association with the code read and are evaluated in order to determine the number of cycles or uses of each reusable packaging.
• each reusable packaging is preferably also determined on the basis of the data stored in the central station.
• the local stations are signaled that the reusable packaging in question should no longer be used.
• each local station contains a memory in which the code of the reusable packaging that is no longer to be used is stored.
• Each bottle is identified by the code before filling and the read code is compared with the stored codes of the reusable packaging that can no longer be used. If necessary, the reusable packaging is then sorted out.
• the data exchange between the stations and the central station is expediently carried out at regular intervals, for example daily or weekly.
• the time interval should be shorter than half the smallest expected time interval between two successive uses of the same reusable packaging. This will ensures that no reusable packaging is used too often only because the data in the central station was not updated.
• the following information is preferably saved to the central station in connection with the code and this data is stored in the central station in association with the code:
• the data stored in the central station in association with the code of each reusable packaging for each round preferably contain one or more of the following information:
• the contents e.g. the filled drink
• the detection of the contents is particularly advantageous in the case of plastic beverage bottles, since these bottles affect the taste of the beverage, e.g. preserve a filled fruit juice. If water is poured in the next use, the water will still taste like this fruit juice.
• the process according to the invention can ensure that only bottles are used for water in which no beverage containing flavorings was previously filled.
• the evaluation in the local station offers the following additional options: - sorting, recording and verification according to the number of round trips, age and other criteria,
• the centrally managed data can be linked using fuzzy logic to data that is currently being determined in the local station.
• Beverage bottles can e.g. Visually inspected or checked for shrinkage, scratches or blindness of the material and the decision whether to discard the bottle can be made taking all of these parameters into account.
• each local station requires only one reading device and not one writing or marking device (laser).
• the reusable packaging can also each carry a transponder chip that contains the code. Data on each reusable packaging can then be stored in its own transponder chip.
• the system can also be used to manage different types of reusable packaging, especially bottle types, at the same time.
• the code can indicate the type of reusable packaging e.g. specify the bottle type.
• the system is secured against unauthorized feeding of non-poolable reusable packaging, as duplicates of codes or codes that have not yet been allocated or allocated would be recognized immediately.
• the frequent occurrence of such reusable packaging with a specific user can be determined on the basis of the stored data.
• a 32-bit code should be sufficient to identify all reusable packaging based on the code. It can be used to distinguish 2 32 ( «4 billion) reusable packaging.
• the code can consist of a sequential numbering of the bottles.
• the reading security can be improved by algorithms, redundancy, parity or recovery bits.
• the code can be constructed in such a way that it can be derived directly, i.e. even without recourse to the data stored in the central station, at least the approximate date of manufacture of the reusable packaging can be determined. Reusable packaging that exceeds a certain age can then - as before - be sorted out immediately without waiting for the signaling from the central station. This signaling would only lead to its sorting out when the reusable packaging is subsequently used.
• the coding can be a bar code.
• the coding can be located on the bottom of the bottles and the code can be read during the bottom inspection of the bottles.
• the code can also be attached to the mouth ring or the support ring of the bottles, in which case there is the advantage of universal legibility.
• the code can also be attached to the side wall and read during the side wall inspection.
• the coding must be extremely durable and is therefore expediently burned into the plastic material of the bottles by means of a laser.
• the coding can also consist of a pattern of fields with different molecular orientations of the material. Such a molecular orientation can be used for embossing plastic bottles by cooling under tension e.g. generated by means of Peltier elements. Such a pattern could then only be recognized in polarized light.
• the individual fields can also be magnetized differently (magnetic code).
• the code can be read using a CCD camera and customary evaluation methods or with appropriate scanners or reading devices.
• a coding element or dot with a size that is determined by the dimensions of the laser pulse is burned into the material of the reusable packaging, for example the wall of a reusable PET bottle, by a laser pulse.
• the dimensions of the laser pulse depend on the mask used.
• Mask lasers have one certain maximum shot or pulse frequency of 100 Hz, for example, ie two successive laser pulses must have a certain minimum distance, in the selected example 10 ms. This maximum limit of the pulse frequency results from the time it takes to charge the capacitors
• Flash lamps are needed to pump the active material.
• the reusable packaging to be provided with the code is moved past the mask laser at a certain speed and the minimum distance between the dots is the speed of the reusable packaging divided by the maximum pulse frequency of the mask laser.
• the positions at which coding elements can be placed are arranged in a grid which corresponds approximately to this minimum distance.
• the grid can also be larger, but not smaller.
• the invention is also based on the object of providing a code which is particularly suitable for the system for managing a large number of reusable packaging, especially if the reusable packaging is a plastic bottle.
• this object is achieved in that no coding element is set at least at one grid position between two raster positions at which coding elements (dots) are set.
• the raster can be chosen to be narrower than in the case of conventional methods using mask lasers. If at least one raster position remains free after a set dot, the raster can be half of the above-mentioned minimum spacing of the raster positions due to the laser pulse frequency. In other words: within this number, information is not only due to the presence or absence of a dot, but also due to it absolute position with respect to the leading edge of the digit is saved. This allows more values to be encoded than would be possible with a fixed structure.
• the grid can be a third of this minimum distance, etc. Which value makes the most sense here depends on the sharpness of the outline of the set dots and the accuracy with which the dots can be set . The accuracy with which the code can be read when deciphering must also be taken into account. In the following it is assumed that after each dot set, only the subsequent raster position has to remain free.
• the width of the coding elements can be larger or smaller than the grid or equal to the grid.
• the width of the coding elements or dots is larger than the grid e.g. by 30%.
• the dots can be distinguished without any problems, since no dot may be set in the grid field following a set dot, so that this field is free and the dot set in the previous grid field can therefore also occupy the beginning of this field .
• a dot may only be placed in the next but one field after a dot, there is a restriction in the combinations of dots and non-dots, but on the other hand the grid can be made smaller. This code is therefore less suitable for the reproduction of digits in a dual system.
• the marking is preferably a consecutive numbering of the reusable packaging.
• the module width results from the transport speed of the reusable packaging divided by the pulse frequency of the laser.
• the digits are preferably reproduced in the duo decimal system.
• Two grid widths form a module and three modules are used to represent a digit of the duo-decimal system. You then have five dot positions available to represent a number. The sixth dot position must remain free, so there must be a non-dot there, since a dot would extend into a module of the next digit, which should be avoided.
• the number of grid positions is preferably limited at which no coding elements are set between two coding elements (free grid positions).
• the coding of a number by no dots is therefore dispensed with, i.e. each digit value is encoded with at least one dot. This limits the maximum gap between two dots, making machine code reading easier. Reading the code can only be synchronized to set dots.
• the worst case occurs when a digit that is represented by a dot at the first position of the first module is followed by a digit that is represented by a dot in the third module — inevitably at the first position of this module. In this case, the gap between the two dots is 4.5 modules wide or 9 grid positions.
• an additional coding element is preferably set at the second position of the last module (last grid field) of a digit whenever the next position is at the first position of the first module Digit no coding element is set.
• the number of free grid positions can be limited to 5.
• the code is made up of 8, 9 or 10 digits, which are displayed in the duo-decimal system.
• the coding of the reusable packaging is preferably applied by means of a mask laser.
• a mask laser has a predetermined maximum pulse frequency.
• the reusable packs are moved past the mask laser at such a speed that twice (three times, etc. n times) the width of a raster position is approximately equal to this speed divided by the maximum pulse frequency.
• at least one (two, etc. n-1) grid position then follows, at which no coding element is set.
• the total length of the code is first determined, ie the distance between the start and stop bit. In the case of a dual code, these always have the value 1 and in the code according to the invention are a dot at the first position of the first module. From the length of the coding it is then determined whether the code consists of 8, 9 or 10 digits. Each digit consists of 3 modules, so that the positions of the individual modules can be determined by dividing the total length of the code. The front edge of the dot can either coincide with the start of the module or be offset by half the module width, the dot then extending somewhat into the next module over the end of the module, or the module can be free.
• Fig. 1 shows the system for a schematic representation
• 3 shows the representation of the digits 0 to 11 in the duo-decimal system
• 4 shows the setting of an additional dot in the last module of a digit to shorten the empty space
• the system for managing a large number of reusable beverage bottles is composed of a central station 10 and a number - in the exemplary embodiment shown three - local stations 20, 21, 22.
• the central station 10 essentially consists of a computer and can be connected to each local station 20, 21, 22 via modem connections 30, 31, 32 in order to exchange data with them.
• the modem connection 30, 31 is established directly with a reading and diversion device 24 or an empty bottle inspector 25, while at the local station 22 the modem connection 32 runs via a local PC server 26.
• An empty bottle inspector 27 and a reading and diversion device 28, a PC terminal 29 and other devices are connected to the PC server 26 via a local network 33.
• the beverage bottles are coded on the bottom with a 32-bit code.
• the code of the bottles passing through and, in association therewith, the current date, a code for the local station, the reading device and the filled beverage are first stored in the local station 20, 21, 22 in a data memory of the reading and discharge device 24, the empty bottle inspector 25 or the PC server 26 stored.
• the modem connection 30, 31, 32 is established once a week and this data is transmitted to the central station 10. If the transferred data relate to new bottles, this becomes additional identified or noted.
• the data is evaluated in the central station by calculating the number of circulations and the age of the bottle from the data stored for each bottle in association with its code.
• the codes of those bottles for which the number of circulations or the age exceeds a specified limit are recorded in a file.
• This file is transmitted to the local stations 20, 21, 22 each time the modem connection 30, 31, 32 is established.
• the transmitted file is stored in the reading and diversion devices 24, 28 and each read code of the bottles passing through is compared with the codes listed in this file. If the code of a bottle that is currently running can be found in this file, the bottle is rejected.
• the central station 10 is then informed that the bottle was rejected with this code and when and through which local station 20, 21, 22 the rejection took place.
• the data are evaluated according to which local station 20, 21, 22 has fed how many new bottles and sorted out old bottles and how many bottles have been used, i.e. has filled.
• the manufacturing, disposal and running costs of the bottles in the pool are then distributed among the member companies of the pool according to an agreed key.
• All bottles of this type should be labeled with a consecutive number. This serves as the basis for managing the bottle pool.
• the number space to be encoded must contain at least 4 billion bottles. If possible, the manufacturer's existing coding machines should be used.
• Code length Is the length of the entire code, defined as the distance between the start and stop bit and is specified as an angle in [°].
• the module width is given as an angle in [°].
• a number is part of the bottle number and consists of three modules.
• Bottles Is the number or number to be encoded. number. : It consists of n digits.
• Dot I the area of the module that is covered by the laser mask.
• the check bits, as well as the start and stop bits, occupy one module per bit.
• the number is always three Modules packed together. Information is stored within this number not only by the presence of a dot, but also by its absolute position in relation to the front edge of the number. This allows more values to be coded than would be possible with a fixed structure.
• the range of values that can be encoded within a number is the basis of the number system.
• the bottle number is variable in length and can be supplemented or reduced by one or more digits. This means that if the planned pool size is exceeded in the future, it can be expanded. In addition, one digit less can be coded in the first year, which simplifies the conversion of the coding machines.
• the dots can be shifted by half a module width within one digit. This allows 5 shot positions within one digit. As can be seen from FIG. 3, the values 0 to 11 can then be encoded. Thus the number system for the bottle number has the basis 12. In order to maintain the writing frequency of the laser coding machine, the next writing pulse may come after one module at the earliest. Therefore, the last module only writes at the beginning of the module.
• the gap between two dots must be limited. Each value of a digit is therefore encoded with at least one dot. The worst case occurs when a digit with the value 0 is followed by a digit with the value 4. The gap between two dots becomes 4.5 modules wide.
• Digits allow this, ie if there is no dot in the first position of the following digit, the last one will Position of a digit written a dot. This is the case in example 1 of FIG. 4. In contrast, in example 2 of FIG. 4, no dot is set at the last position of the number n, since a dot is already set at the penultimate position.
• the code length is used to identify the code type.
• Code A This code is the code currently used for the 1 liter GDB bottle
• Code B This code is a number coding with which one could start in order to keep the conversion costs of the coding systems low.
• Code C Code C is code B expanded by one digit. It can cover the required value range of 4 billion bottles.
• Code D This code would be for a future expansion, which might also result in modifications to the reading and coding systems.
• Codes B to D each contain a start bit, a stop bit and four check bits.
• Errors during coding can be largely excluded by means of a reading device during production. Thus, only errors due to scratching and soiling must be expected.
• the check bits are formed across all digits across all write positions. Six positions per digit are possible.
• the gray areas in the diagram of FIG. 6 show which positions are used for the calculation of the corresponding check bits C1 to C2. The following applies to the calculation:

Landscapes

• Business, Economics & Management (AREA)
• Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Physics & Mathematics (AREA)
• Human Resources & Organizations (AREA)
• Economics (AREA)
• Theoretical Computer Science (AREA)
• Tourism & Hospitality (AREA)
• Entrepreneurship & Innovation (AREA)
• Marketing (AREA)
• Operations Research (AREA)
• Quality & Reliability (AREA)
• Strategic Management (AREA)
• General Business, Economics & Management (AREA)
• Sustainable Development (AREA)
• Life Sciences & Earth Sciences (AREA)
• Development Economics (AREA)
• Details Of Rigid Or Semi-Rigid Containers (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)
• Warehouses Or Storage Devices (AREA)

Applications Claiming Priority (3)

Publications (1)

Family

ID=7895817

Family Applications (1)

Country Status (8)

Families Citing this family (11)

Family Cites Families (17)

• 1999
  • 1999-01-29 DE DE19903586A patent/DE19903586A1/de not_active Withdrawn
• 2000
  • 2000-01-31 JP JP2000596497A patent/JP4362236B2/ja not_active Expired - Fee Related
  • 2000-01-31 EP EP00904987A patent/EP1190349A2/de not_active Withdrawn
  • 2000-01-31 US US09/890,082 patent/US6732921B1/en not_active Expired - Lifetime
  • 2000-01-31 WO PCT/EP2000/000730 patent/WO2000045309A2/de active Application Filing
  • 2000-01-31 MX MXPA01007615A patent/MXPA01007615A/es active IP Right Grant
  • 2000-01-31 BR BR0008195-7A patent/BR0008195A/pt active Pending
  • 2000-01-31 CA CA2359691A patent/CA2359691C/en not_active Expired - Fee Related

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events