Currency handling apparatus

Abstract: A currency handling apparatus comprising a store for storing currency of a first denomination and signal generating means, wherein in response to a signal from the signal generating means the apparatus directs currency of a second denomination to the store.

Description: This invention relates to apparatus for handling units of currency. The invention will be described mainly in the context of coin handling, but is also applicable to apparatus which also or alternatively handles other units of currency, such as banknotes, smart cards, payment cards or the like. It is known to provide a coin handling apparatus which receives and validates coins of different denominations, and directs valid coins to respective containers each containing coins of a single denomination. It is also known to dispense coins from these containers as change in an amount corresponding to the difference between the value of inserted coins and the price of a product or service obtained from a machine associated with the coin handling apparatus. It is also known to arrange for the level of coins in each container not to exceed a predetermined upper level. The apparatus would thus tend to direct coins of a particular denomination to an associated container until the upper level is reached, and then any further coins of the same denomination would be sent to a cashbox, which would normally be of a type which does not permit the dispensing of coins therefrom. Periodically, an operator will empty the cashbox. At this time, it is common for operators to adjust the levels of coins in the coin containers so that each one will contain a number of coins corresponding to a so called "float" level for the respective container in an attempt to ensure that there is usually an adequate supply of coins in the container to be used as change if this is necessary. In use, between visits by the operator, the levels of coins in the containers vary, and at some times there may not be sufficient coins in a container to supply the correct change for a given transaction, when the machine is said to be in "exact change only" mode. It is understood that when a vending machine only accepts the exact change for a selected item, sales are lost. It is known from EP 0 653 084 to attempt to minimise the risk that, in the period following servicing of the machine, there will be insufficient coins available for change by arranging for the apparatus to monitor certain parameters, to calculate dynamically the likelihood that a particular denomination will be required for dispensing. US 5,356,333 relates to a coin escrow which is a store for temporarily storing coins inserted into a coin-handling apparatus in a single transaction before they are either returned to the user of directed to a cashbox. The invention provides a currency handling apparatus as set out in claim 1 and a method of operating a currency handling apparatus as set out in claim 33. Preferred features of the invention are set out in the dependent claims. An example of an apparatus in accordance with the invention will now be described with reference to the accompanying drawings, in which: Fig. 1 is a schematic diagram of the mechanical part of a coin handling apparatus; Fig. 2 is a block diagram of the circuit of the coin handling apparatus; Fig. 3 is a diagram showing a removable cassette; Fig. 4 is a flow diagram; Fig. 5 is a diagram of a vending machine; Fig. 6 is a flow chart; and Fig. 7 is a flow chart. Fig. 5 shows a vending machine, indicated generally by the reference number 90. Referring to Fig. 1, the coin handling apparatus 2 in the vending machine includes a coin vaiidator 4 for receiving coins as indicated at 6. During the passage of the coins 6 along a path 8 in the validator 4, the validator provides signals indicating whether the coins are acceptable, and if so the denomination of the coins. Various types of validators are known, including validators using optical, acoustic and inductive techniques. Examples of such validators are described in, amongst others, GB 1 397 083, GB 1 443 934, GB 2 254 948 and GB 2 094 008. Acceptable coins then enter a coin separator 10, which has a number of gates (not shown) controlled by the circuitry of the apparatus for selectively diverting the coins from a main path 12 into any of a number of further paths 14, 15, 16 and 17, or allowing the coins to proceed along the path 12 to a path 20 leading to a cashbox 21. If the coins are unacceptable, instead of entering the separator 10 they are led straight to a reject slot via a path 30. Each of the paths 14, 15, 16 and 17 leads to a respective one of four coin tubes or containers 22, 24 and 26 and 28. Each of these containers is arranged to store a vertical stack of coins of a particular denomination. Although only four containers are shown, any number may be provided. A dispenser indicated schematically at 29 is operable to dispense coins from the containers when change is to be given by the apparatus. The dispensed coins are delivered to a refund path 31. As shown in Fig. 3, the tubes 22, 24, 26, 28 are provided in a removable cassette 40, and the tubes themselves are removable from the cassette, as described in GB 2 246 897 A. Referring to Fig. 2, the circuit incorporates a microprocessor 50 connected to data and address buses 52 and 54. Although separate buses are shown, data and address signals could instead be multiplexed on a single bus. A bus for control signals could also be provided. The microprocessor 50 is connected via the buses 52 and 54 to a read-only memory (ROM) 56 and a random access memory (RAM) 58. The ROM 56 stores the program controlling the overall operation of the microprocessor 50, and the RAM 58 is used by the microprocessor 50 as a scratch-pad memory. The microprocessor 50, the ROM 56 and the RAM 58 are, in the preferred embodiment, combined on a single integrated circuit. The microprocessor 50 may also be connected via the buses 52 and 54 to an EAROM 60 for storing a variety of alterable parameters. The microprocessor 50 is also coupled via the buses 52 and 54 to input/output circuitry indicated at 62. The circuitry 62 includes user-operable switches, at least one level sensor for each of the coin containers 22, 24, 26, 28, circuits for operating the dispenser 29 and the gates of the coin separator 10, the circuitry of the coin validator 4, and a display visible to a user of the apparatus for displaying an accumulated credit value and an indication when insufficient coins are stored to guarantee that change will be available. The circuitry 62 is connected to a display 68 visible to the operator, and to a keypad 70 accessible only to the operator. The input/output circuitry 62 also includes an interface between the control circuit of the apparatus and a vending machine circuit board 64 to which it is connected, and a further interface to an audit device 66. In operation of the apparatus the microprocessor SO successively tests the signals from the validator to determine whether a coin has been inserted in the apparatus. When a credit has been accumulated, the microprocessor also tests signals from the vending machine to determine whether a vending operation has been carried out. In response to various signals received by the microprocessor 50, various parts of the program stored in the ROM 56 are carried out. The microprocessor is thus arranged to operate and receive signals from the level sensors of the coin containers 22, 24, 26, 28, and to control the gates in the separator 10 in order to deliver the coins to the required locations, and is also operable to cause appropriate information to be shown on the displays of the apparatus and to deliver signals to the vending machine to permit or prevent vending operations. The microprocessor is also operable to control the dispenser to deliver appropriate amounts of change. The arrangement so far is quite conventional, and the details of particular structures suitable for using as various parts of the mechanism will therefore not be described in detail. The particular sequence of most of the operations carried out by the microprocessor may be the same as in previous apparatus. A suitable program to be stored in the ROM 56 can therefore be designed by anyone familiar with the art, and accordingly only the operations carried out by the particularly relevant parts of this program will be described. The apparatus 2 is arranged to monitor each transaction performed by the vending machine. More specifically, the microprocessor 50 registers, for each transaction, the price of the item selected, the number and denominations of the coins supplied as payment, and the number and denominations of coins supplied in change. The processor 50 also registers when 'exact change only' events occur, and which coin tubes are empty and for how long. The number and denomination of coins supplied as change is determined by a suitable change algorithm in the microprocessor, as described, for example, in GB 2 269 258. The information registered by the processor 50 is stored in the audit device 66. When the operator visits the machine, he causes the microprocessor 50 to analyse data stored by the audit device 66 and calculate a desired float level for each denomination of coin by pressing appropriate keys on the keypad 70. Alternatively, the stored data can be downloaded to and processed by a computer which the operator plugs into the processor 50 or the audit device 66. Steps of the calculation are set out in Fig. 4. More specifically, the microprocessor 50 calculates the total number of coins of that denomination that have been inserted (step 72) and the total number of coins of that denomination (step 74) that have been dispensed in the previous seven days. The difference between the number of coins dispensed and inserted is then calculated (step 76). That number is then multiplied by four, assuming that the operator visits the machine once a month, to arrive at an estimate for the difference over a month, and hence an estimate for the float level. The microprocessor 50 then divides that estimated figure for the float level by the maximum number of coins that can be stored by a tube in the mechanism (step 78), rounds up the result (step 80) to the next whole number to arrive at a number which represents the number of tubes of that denomination that should be supplied. The microprocessor 50 performs similar calculations for each denomination of coin, and then decides what changes need to be made to the coin tubes in the assembly at the time. A signal, representing instructions regarding changes to the tubes, is generated and sent to the circuitry 62. The instructions are then displayed on the display 68. For example, suppose over a period of 7 days, the coin mechanism detects that 100 5p coins are inserted, and 130 5p coins are dispensed as change. If the operator is to visit the machine once a month, using steps of the algorithm set out above it is estimated a float of 120 5p coins should be available at the start. Assuming that a preformed tube stores at most 90 5p coins, then it can be seen that at least two such tubes, each full of 90 5p coins should be present at each service to reduce the risk that an exact change only mode will occur. Instead of supplying two full tubes, two tubes containing a total of 120 or more coins could be provided. In the example given above, the processor 50 is making predictions about the tubes to be required by predicting the likely distribution of coins to be dispensed as change. This is done by monitoring the flow in and out of each denomination coin over a predetermined period of time, or, more simply, the difference between the number of coins of that denomination inserted and the number dispensed. The number of tubes to be required is then estimated using the predetermined, known capacity of a tube. The above example does not, for example, take account of fluctuations throughout the seven day monitoring period, such as periods when a sequence of 5ps are dispensed as change, but none are inserted. More sophisticated methods of predicting a good float level and hence the number of tubes required are possible. In an alternative approach, a rate of depletion for each coin denomination is calculated, where Rate (R) = (no. of coins dispensed - no. of coins accepted) capacity of coin tube(s) (taking into account only coins of the given denomination). The rate is established over 50 vends, and is then continuously updated, using a running sample of 50 vends in a sequence. R tends to 0 with a slower depletion of coins in the coin tubes and tends to I with a faster depletion of coins. The calculated value R can be used as an indicator for changes in the tubes. For example, if R > 0.80 for a given denomination continuously for a certain number of vends, say 10, then the microprocessor outputs a signal indicating that the number of coin tubes for that denomination should be increased. Similarly, if R < 0.15, for example, the processor outputs a signal indicating that the number of tubes should be decreased (the processor can be programmed to suppress such a signal if the number of tubes is one). The information about the number and denomination of coins inserted into the mechanism and monitored by the microprocessor 50 is useful on its own. For example, it can give an indication of changes in the relative population levels of certain denominations of coins, or of the introduction of new coins into a coin set. As discussed below, predictions for the number of tubes of each denomination to be provided can be made in other ways and using variables other than those in the examples above. Information about the prices of items for sale is useful for making accurate predictions of change that will be necessary. Price information is especially useful in such predictions when there is an alteration in price. As an illustration only, suppose the vending machine is set up for use in the U.K. and comprises a single coin tube for each of 5p, 10p, 20p, and £1. Only one item is available for sale and its price is 95p. Using the information about the price of the item for sale and of the acceptable currency set, the processor can work out that, whatever coins are inserted, the only change that will ever be dispensed are 5ps and 10ps. On that basis, the processor issues instructions to remove the 20p, and £1 tubes and replace them with, for example, one extra tube for 5ps, and one extra tube for 10ps, and direct all the remaining coins straight to the cash box. Another useful parameter is the number and denominations of coins dispensed as change. Such information can be used, for example, to request a new tube for coins of a higher denomination than any already provided. Suppose the highest denomination of coin for which a tube is provided is a 20p coin and transactions occur regularly (say more than 5 times a day an average) where five or more 20p coins are dispensed as change, then a £1 coin tube may be requested. Usually, it will be preferable also to consider other parameters as well, such as number of denominations of coins inserted. In the above example, a £1 coin tube would be of limited use if few £1 coins are received because the tube would empty relatively rapidly. The change algorithm in use, which influences the likelihood that a coin will be dispensed in change, may also be useful. Other parameters, such as data indicative of the relative population levels of respective currency denominations in the area in which the apparatus is to be used, may be relevant. The relative population level of given denominations are related to the probability that those denominations will be inserted into the machine. The relative population levels may vary within a country, as. for example, in Southern Germany where there is a different distribution of coins from the rest of the country. Such data is known, and can be supplied by a programming mechanism such as a computer, in the field, or it may be pre-programmed in, depending on the intended destination of the mechanism. The mechanism might, for example, note where the use of smart cards and/or banknotes is on the increase and recommend changes in the coin tubes as a result As mentioned above, a record is made regarding exact change only' events. It is noted, for example, when exact change only events occur, how long they last, and which tubes have been emptied (or have a level provided). Some or all of that information can also be used in predicting what change tubes should be provided. While each of the parameters mentioned above may be used on its own to provide an indication of change tubes to be required, it is usually advantageous to consider two or more of those parameters in combination. In the present example, the change cassettes comprise removable tubes 22, 24, 26, 28. The operator simply interchanges tubes of certain denominations in accordance with the instructions on the display means 68. The operator uses the keypad 70 on the coin apparatus to inform the microprocessor of the changes in the tubes in the mechanism, which alters the settings in the microprocessor 50 accordingly so that coins are subsequently directed to and dispensed from the correct tube. Other modifications to the apparatus described are also envisaged. For example, instead of using the information stored in the previous seven days, the microprocessor may analyse the information stored since the apparatus was installed. Alternatively, for example, the processor could be arranged to carry out an analysis of the relevant information after a predetermined number of transactions. Instead of replacing certain tubes, the operator could replace the whole cassette, in accordance with suitable instructions from the apparatus, with a cassette prepared with a predetermined arrangement of tubes. Cassettes prepared in such a way may be marked with a code, indicating the type and distribution of tubes within the cassette, so that instructions for changing the tubes can be displayed using the appropriate code, and once the cassette is inserted, the code can be input via the keypad to inform the microprocessor of which tubes are in use. The prediction may be stored in the processor to be retrieved by the operator at a later date. Alternatively, predictions may be obtained remotely, using known techniques, so that the operator knows in advance what tubes to take to the machine to service it. For example, the machine may transmit signals down a telephone line, or mains line, to a computer in the servicing centre. The transmitted signals may be data relating to the vend signals, which are then processed at the servicing centre to provide instructions about changing the tubes, or signals representing the instructions. Data can also be downloaded using a smart card and processed or read elsewhere. The information regarding 'exact change only' events, that is recorded in the audit device has uses other than for predicting change tubes to be required. As mentioned previously, an exact change only event is deemed equivalent to lost sales, and a record of such events is useful for analysts to determine the occurrence and volume of lost sales. A log of exact change only events can also be useful in setting float levels, or for determining whether the operator needs to visit the machine more often to replenish the coin tubes. In the example given above, the rate at which the service operator visits the machine or the next date for a visit is predetermined and the visiting rate or date is used in working out the optimum number of stores for reducing the risk of one or more tubes running out of coins. Alternatively, as described in more detail below, the operator may visit the vending machine to replace the change cassette or replenish the stores in response to instructions which are output from the machine in advance, for example, instructions regarding a date on which a visit should be made. In this example, the machine outputs instructions for the operator to visit in accordance with a prediction of when one of the tubes is likely to run out of coins. To make the prediction, the processor 50, automatically and once a week, performs certain calculations, as explained below with reference to Fig. 6, using information stored in the audit device 60. First, the processor 50 calculates, for one of the denominations used for change, a rate of depletion r 1 for the preceding week, as follows: r 1 = b 1 - a 1 where b 1 = no. of coins of the given denomination dispensed as change in the preceding week, and a 1 = no. of coins of the given denomination inserted as payment in the preceding week. The number of coins in the tubes for the relevant denomination at the time at which the calculations are being carried out, N 1 , is divided by r 1 , and the result rounded down to the nearest whole number, V 1 . The number V 1 is an estimate of the number of weeks before the tube will empty. The above calculations are repeated for each of the denominations used for change, to result in a set of values V i . The smallest non-negative value V S , which is the shortest time before one of the tubes is estimated to run out of coins, is selected. The processor then informs the service centre, via a telephone connection, that the operator needs to visit the machine on a date in V S weeks time. On that visit, the operator replaces the change cassette with a new change cassette, already containing coins at appropriate, predetermined levels. Various modifications are also envisaged. Instead of simply informing the operator of a date on which to visit, the machine can also calculate and output the likely number of coins to be held in each of the stores in V S weeks time so that the operator knows how many coins of each denomination to bring to replenish all the stores. The calculations may be performed at other rates, for example, daily, or once a month. Predictions can be made using other parameters, for example, those described above in relation to the first example, or using other calculations. Instead of calculating when the first tube is likely to empty, the processor may instead predict when a tube is likely to have a given number of coins, for example, two. In the calculation of the date when the operator should visit, a margin of error of, say, a week, may be introduced (that is, the operator is instructed to visit a week before the date on which the processor has estimated that the first tube will run out of coins). As before, the data could be supplied remotely with the calculations being performed remote from the vending machine. In another example, which is an embodiment of the claimed invention, instead of requesting a change to the tubes, the mechanism reallocates an existing tube and uses it for a new denomination of coin. In this example, the vending machine is set up for use in Brazil. Thus, the acceptance criteria within the validator for determining which coins are acceptable correspond to Brazilian currency and the tubes are configured to store coins of Brazilian currency. More specifically, the coin apparatus 2 accepts 25 centavo coins and 50 centavo coins, amongst others. There are two tubes 22, 28 to which 25 centavo coins are directed and 50 centavo coins are directed to the cashbox 21. 25 centavo coins needed for change are dispensed from the first of those tubes 22 unless it is empty in which case they are dispensed from the second tube 28. Accepted 25 centavo coins are directed to the second tube 28 unless it is full, in which case they are directed to the first tube 22. The processor 50 registers how many coins are in each of the tubes 22, 24, 26, 28 at the end of each transaction, and, more particularly, which of the tubes are empty. Using that information, the processor 50 works out for each tube on the basis of the previous 50 transactions a value E, which is an indication of how frequently the tube is empty, as follows: E = no. of transactions at the end of which the tube is empty 50 The more often a tube is empty, the closer E is to 1. The more often a tube is empty, the less useful it becomes, and thus the efficiency of the coin apparatus 2 is reduced. One of the reasons for a tube emptying frequently is if the coins in the tube are often dispensed in change in multiples, in which case the problem of a frequently empty tube can be reduced by providing a coin of a higher denomination for use as change. In this example, when E exceeds the value of 0.6 for the first 25 centavo tube 22, the coin mechanism is adapted so that 50 centavo coins are used for change where appropriate in place of the 25 centavo coins. More specifically, the processor 50 alters the routing of the coins so that 50 centavo coins are directed to what was previously the first 25 centavo coin tube 22, and 25 centavo coins are directed to second tube 28 or, if that tube is full, to the cashbox 21. The shape and size of 25 centavo and 50 centavo coins are similar so that no change of tube is required. Other ways of determining when to reallocate an existing tube are possible, for example, by considering the rate of depletion of a tube, or, as described above, in relation to changes in prices of products or in currency sets. It may be that when a tube is reallocated coins of the previous denomination remain in the tube. In that case, those remaining coins may be diverted to the cashbox, or else dispensed as change in the next transaction (even if that results in incorrect payment of change). Alternatively, because the mechanism knows how many coins of the previous denomination are in the tube at any time, it may continue to dispense change from the tube in the first denomination while filling the tube from the top with the second denomination. In another example, past sales in a vending machine are analysed to predict future stock requirements. The apparatus is similar to the apparatus first described above, but it also stores in the audit device 66 what item of stock is dispensed at each sale. The processor then analyses the stored data and uses it to produce predictions of future sales for each product. Using trends derived from the analysis of past sales and the current stock position, the machine predicts the earliest time when one of the products will go out of stock. Alternatively, for example, the machine predicts the earliest time when one of the products reaches a level of 5% of the maximum level of that product. This information is an indication of the latest time by which a serviceman should visit to replenish the machine. In a similar manner as described in earlier embodiments, the machine can also estimate and output the number of items of each product that will be required to refill the machine at that time. This information can lead to a reduction in the number of visits to a machine by a serviceman needed. Alternatively, the machine is provided with the date on which the serviceman will next visit, and the machine then estimates and outputs the amount of stock to be added of each product so that the machine will have supplies of each product until the serviceman's next visit on that given date. This can prevent overstocking of a machine and also lead to fresher products being provided in the machine. Also, the machine can predict when any product is first likely to go out of stock, or reach a predetermined level, and using that information advise how many items of each of the other products to provide so that they all go out of stock, or reach the given level, at around the same time. In this example, calculations are performed daily, and information is available at the vending machine on a display by pressing an appropriate key. Alternatively, results can be supplied to a remote position. Also, the data can be supplied to a remote position and processed there. The algorithm used in this example is discussed below and shown in the flowchart of Fig. 7. The vending machines offers M different types of products for sale, and the algorithm uses information about sales of all types of products to make a prediction of future sales. According to the algorithm, a number of variables are used to calculate a general trend and a variability component, which are then used to predict future sales over a desired future period. In the following, the subscript n refers to the day number, where n=0 for the day just finished, n=1 for the day before and so on up to n=6 for the last day in the preceding week. Thus if today is Tuesday, then n=0 refers to Monday, n=1 refers to Sunday, etc., and so on up to n=6, referring to Wednesday. Similarly, if today is Wednesday, n=0 refers to Tuesday, etc. F and f are fade factors, representing the fact that, as time passes, information about a day's activity plays a smaller part in predictions. F is the fade factor per week and f is the fade factor per day. In this example, (1-f) 7 = (1-F), and more particularly, F = 0.5. The variables A n and x n are used, where A n is the average sales for product A for day type n, relative to the running average over all days for all products, and x n is the running average daily total sales for all products as calculated on day n. Instead of calculating the averages using all data collected from when the vending machine first started operating, which would require a large amount of memory, the averages are calculated at the end of each day using algorithms, as set out below: A current = A 6 (1-F) + Ft A /x 0 where t A = total number of sales for product A for the day just ended. x current = x 0 (1-f) + fT where T is the total number of sales for all product types for the day just ended. Now, a value W is calculated where W = x current /x 6 . Thus, W represents the running average just calculated relative to the same running average as calculated on the same day the previous week. If W is less than 1, then it is changed to 1 for calculating stock requirements, because an increase in stock requirements is the main interest. Another variable R n is also calculated, where R n is the average total sales for a particular day type (eg Monday), relative to the running average over all days as calculated the previous day. R current = R 6 (1-F) + FT/x 0 Also a variance term V A is calculated where V A = (1-f)V A + fD A 2 D A is the difference between the actual total sales of product A for the day just ended and the expected total sales for product A for the day just ended. Thus: D A =t A -E A where t A = total number of sales for product A for the day just ended and E A = the expected total number of sales for product A for the day just ended. E A is calculated by the equation E A = A 6 x 0 where A 6 and x 0 are as already calculated at the end of the preceding day. If D A is negative, it is set to 0. This gives a different response to rises in product throughput compared with falls. Having performed all the above calculations, the calculated values for x, A and R are renamed for use in subsequent calculations, that is calculations at the end of the day to come, and also for calculations of the general trend, discussed below. More specifically, x 6 is dropped, the values x 5 to x 0 are relabelled x 6 to x 0 respectively and x current is relabelled x 0 . Similarly, A 6 and R 6 are dropped and A current and A 0 to A 5 are relabelled A 0 to A 6 respectively and R current and R 0 to R 5 are relabelled R 0 to R 6 respectively. The general trend is then derived using these newly labelled values x 0 to x 6 , and W as already calculated as set out above. The general trend is given by x n W m , where n is the day of the week, from n=0 to n=6, and m is the week number, starting at m=1 for the week to come. Thus, the general trend for the coming day is x 6 W, for the following day it is x 5 W and so on up to x 0 W. The week after starts with x 6 W 2 , x 5 W 2 and so on. The general trend as set out above gives a broad indication of likely future sales. A respective variability component is also added for each product as an allowance for fluctuations. The variability component for product A is the square root of (kdV A ) where: d = no. of days ahead for the prediction; V A is the variance term as calculated above; and k is a constant. In this example, k = 18, which has the effect of imposing an allowance similar in scale to three standard deviations for a normal distribution. Other algorithms can be used to predict future product requirements. For example, a prediction for each type of product using only sales of the respective product is also possible. Also, for example, the calculations described above in relation to coins can be adapted for use with stock, the main difference being that new stock is not introduced at each end. In an alternative example, a neural network is used to perform predictions of future stock requirements.

Claims: A currency handling apparatus (2) comprising a store (22) used to store currency of a first denomination from a plurality of transactions and for dispensing said currency as change and signal generating means (50), characterised in that in response to a signal from the signal generating means (50) the apparatus (2) directs currency of a second denomination to the store (22). A currency handling apparatus (2) as claimed in claim 1 wherein currency of the first denomination remains in the store when the apparatus directs currency of the second denomination to the store such that currency of the first and second denominations are stored simultaneously in the store (22). A currency handling apparatus (2) as claimed in claim 2 wherein the apparatus (2) continues to dispense currency of the first denomination as change while storing currency of the second denomination. A currency handling apparatus (2) as claimed in claim 3 wherein the apparatus identifies the number of currency items of the first denomination in the store (22). A currency handling apparatus (2) as claimed in any preceding claim wherein the apparatus (2) removes all the currency of the first denomination by diverting it to the cashbox or dispensing it as change in the next transaction when currency of the second denomination is directed to the store. A currency handling apparatus (2) as claimed in any preceding claim wherein the reallocation of the store is related to a change in currency sets. A currency handling apparatus (2) as claimed in any preceding claim wherein the reallocation of the store is related to a change in currency to be made available for change. A currency handling apparatus (2) as claimed in any preceding claim wherein the second denomination is a denomination that was previously directed to a cashbox (21) of the currency handling apparatus (2). A currency handling apparatus (2) as claimed in any preceding claim wherein the second denomination is substantially the same shape and size as the first denomination. A currency handling apparatus (2) as claimed in any preceding claim wherein the apparatus continues to accept the first denomination when directing the second denomination to the store (22). A currency handling apparatus (2) as claimed in any preceding claim comprising means (50) for monitoring currency in the apparatus, wherein an output from the monitoring means influences the signal generating means (50). A currency handling apparatus (2) as claimed in claim 11 wherein the monitoring means (50) monitors the depletion of currency from the store. A currency handling apparatus (2) as claimed in any preceding claim wherein a signal is generated when the rate at which currency is depleted from the store (22) exceeds a predetermined value. A currency handling apparatus (2) as claimed in any preceding claim comprising means (50) for monitoring certain parameters over time, wherein the information so obtained is used by the signal generating means (50). A currency handling apparatus (2) as claimed in any preceding claim wherein the signal generating means (50) is responsive to data indicative of the relative population levels of respective currency denominations in the area in which the apparatus (2) is to be used. A currency handling apparatus (2) as claimed in any preceding claim wherein the signal generating means (50) is responsive to the number of currency units of a particular denomination which have been received by the apparatus (2). A currency handling apparatus (2) as claimed in any preceding claim wherein the signal generating means (50) is responsive to the number of currency units of a particular denomination which have been dispensed by the apparatus (2). A currency handling apparatus (2) as claimed in any preceding claim wherein the signal generating means (50) is responsive to the way in which currency units of a particular denomination have been routed by the apparatus (2). A currency handling apparatus (2) as claimed in any preceding claim wherein the signal generating means (50) is responsive to each denomination which can be dispensed by the apparatus (2). A currency handling apparatus (2) as claimed in any preceding claim wherein the signal generating means (50) is responsive to price data representative of the price of products or services obtained by supplying currency units to said apparatus (2). A currency handling apparatus (2) as claimed in claim 20 wherein the price of products or services selected and the currency units supplied to obtain those products or services are monitored over time and the information so obtained is used by the signal generating means (50). A currency handling apparatus (2) as claimed in any one of claims 1 to 21 wherein the apparatus (2) is for handling coins. A currency handling apparatus (2) as claimed in claim 22 wherein the currency store (22) is a tube arranged within a removable cassette (40). A currency handling apparatus (2) as claimed in claim 23 wherein the tube (22) is removable from the cassette (40). A currency handling apparatus (2) as claimed in any one of claims 1 to 24 comprising recording means (66) for recording details of an event when there is insufficient currency in the stores to supply the correct change for a given transaction. A currency handling apparatus (2) as claimed in any one of claims 1 to 25 comprising means (50) for counting the number of currency items of each denomination inserted for each transaction. A currency handling apparatus (2) as claimed in any one of claims 1 to 26 comprising means (50) for counting the number of currency items of each denomination dispensed for each transaction. A currency handling apparatus (2) as claimed in any preceding claim wherein the signal to direct currency of the second denomination to the store is generated automatically in response to a predetermined condition. A currency handling apparatus (2) as claimed in any preceding claim comprising means (50) for counting the number of currency items in each store (22). A currency handling apparatus (2) as claimed in any preceding claim comprising means (50) for registering when the store (22) is empty. A processor adapted for use in an apparatus according to any one of claims 1 to 30. A vending machine (90) comprising a currency handling apparatus as claimed in any one of claims 1 to 30. A method of operating a currency handling apparatus comprising a store (22) used to store currency from a plurality of transactions and dispensing currency as change, the method comprising initially directing only currency of a first denomination to the store (22), storing currency of said first denomination from a plurality of transactions and dispensing currency of said first denomination as change, characterised in that the method further comprises directing currency of a second denomination to the store (22) in response to a signal from the signal generating means. A method as claimed in claim 33 wherein currency of the first denomination remains in the store when the apparatus directs currency of the second denomination to the store such that currency of the first and second denominations are stored simultaneously in the store (22). A method as claimed in claim 33 or claim 34 comprising identifying the number of currency items of the first denomination in the store (22). A method as claimed in any one of claims 33 to 35 comprising counting the number of currency items of each denomination inserted for each transaction. A method as claimed in any one of claims 33 to 36 comprising counting the number of currency items of each denomination dispensed for each transaction. A method as claimed in any one of claims 33 to 37 wherein the first and second denominations are coins. A method as claimed in any one of claims 33 to 38 wherein the reallocation of the store (22) is related to a change in currency sets. A method as claimed in any one of claims 33 to 39 wherein the reallocation of the store (22) is related to a change in currency made available for change. A method as claimed in any one of claims 33 to 40 wherein the second denomination is a denomination that was previously directed to a cashbox (21) of the currency handling apparatus. A method as claimed in any one of claims 33 to 41 wherein the second denomination is substantially the same shape and size as the first denomination. A method as claimed in any one of claims 33 to 40 wherein the apparatus continues to accept the first denomination when directing the second denomination to the store (22). A method as claimed in any one of claims 33 to 41 in which the signal is generated in response to monitoring means (50) which monitors the depletion of the currency of the first denomination from the store (22). A method as claimed in any one of claims 33 to 44 in which all the currency of the first denomination is removed from the store (22) by diverting it to the cashbox or dispensing it as change in the next transaction when currency of the second denomination is directed to the store (22). A method as claimed in any one of claims 33 to 45 in which the mechanism continues to dispense currency of the first denomination in change after currency of the second denomination is directed to the store (22). A method as claimed in any one of claims 33 to 46 wherein the signal to direct currency of the second denomination of the store (22) is generated automatically in response to a predetermined condition.

Inventors: FLETCHER PAUL ROBERT, FLETCHER, PAUL ROBERT
Applicants: MARS INC, MARS INCORPORATED
Application year: 1998
Main classification: G07F5
IPC codes: G07F5, G07D11, G07D1