Combinatorial weighing apparatus

Abstract

A combinatorial weighing apparatus of the type in which the batches of article charged in a plurality of hoppers are weighed and the best combination of hoppers which provides a total weight equal to or most closely approximating a target weight within a predetermined tolerance is selected, the batches of article in the hoppers constituting the best combination being then discharged to a collecting chute. The combinatorial weighing apparatus has a plurality of weighing hoppers for receiving batches of article to be weighed, weight sensors for weighing the batches of article in the weighing hoppers, storage hoppers disposed beneath the second hopper gates in the weighing hoppers and adapted to receive the batches of article discharged from the weighing hoppers, and a combination control section adapted to select the best combination of hoppers which provides a total weight equal to or most closely approximating the target value, on the basis of the weight values of batches of article in the storage hoppers and the weighing hoppers.

Description

BACKGROUND OF THE INVENTION

The present invention relates to a combinatorial weighing apparatus and, more particularly, to a combinatorial weighing apparatus of the type having a plurality of weighing hoppers and adapted for weighing articles through the steps of finding the weight of batch of article in each weighing hopper, selecting the combination of weighing hoppers which gives a total weight equal to or closest to a present target weight hereafter referred to as the "best" combination and discharging the batches of article from the weighing hoppers constituting the selected combination.

Generally, a combined weighing apparatus incorporating a computer, referred to as "computer scale", is used for accurately weighing articles which exhibit large variation in weight from one to another, e.g. fruits and vegetables, confectionaries, fabricated articles, perishables or the like.

In such a combinatorial weighing apparatus as shown in FIG. 1, batches of the article to be weighed are put into a plurality of weighing hoppers 2d and weighed in respective hoppers by weight sensors 3. Then, the apparatus selects a combination of batches which provides a total weight closest to the target weight within a predetermined tolerance using the weighing outputs derived from the weight sensors 3. The batches constituting the selected combination are then discharged into a collecting hopper 5 and the evacuated weighing hoppers are charged with new batches of the article for the next cycle of weighing operation. This operation is repeated to achieve the automatic weighing of the article.

Referring to FIG. 2 schematically showing the mechanism of a combinatorial weighing apparatus, a distribution table 1 is adapted to disperse the article to be weighed in the radial direction and to distribute the dispersed batches of article to a plurality of weighing stations 2 arranged radially around the distribution table 1. The distribution table 1 is adapted to be vibrated by a vibrator or the like, so that the dispersed article is distributed to the weighing stations 2 as a result of the vibration of the table for a predetermined time length. In the illustrated embodiments, n weighing stations designated at 2-1 to 2-n are arranged, and each weighing station includes a distribution supply device 2a, pool hopper 2b, pool hopper gate 2c, weighing hopper 2d, weight sensor 2e, weighing hopper gate 2f and a hopper drive unit 2g. As shown in FIG. 3, the distribution supply device 2a is composed of a feeder base 2a-1 having a predetermined shape and a trough 2a-2 mounted on the feeder base 2a-1 through a leaf spring 2a -4. A solenoid 2a-3 is fixed to the upper side of the leader base 2a-1. A solenoid 2a-3 is mounted on the feeder base 2a-1. As will be seen from FIGS. 4 and 5, a plurality of distribution supply devices 2a are carried by a circular support member 4 through respective coiled springs 2a-5 and are arranged radially along the outer periphery of the distribution table 1. In operation, the article to be weighed is put on the distribution table 1 while the latter is vibrated reciprocatingly and spirally by an electromagnetic vibrator 6, so that the articles are dispersed radially outwardly along the conical top surface of the distribution table 1 into separate batches which in turn are delivered to respective troughs 2a-2. The batch of articles supplied to each trough 2a-2 is conveyed through the latter in the direction of the arrow in FIG. 3 as a result of a linear reciprocating vibration caused by the magnet 2a-3, and is put into the pool hopper 2b from the end of the trough 2a-2.

Referring back to FIG. 2, each pool hopper 2b is provided with a pool hopper gate 2c. As this pool hopper gate 2c is opened by the operation of the hopper drive unit 2g, the batch of articles contained by the pool hopper 2b is put into the weighing hopper 2d. Each weighing hopper 2d is provided with a weight sensor 3 for weighing the batch of articles put into the weighing hopper 2d. The output from the weight sensors 3 are delivered to a combination controlling section (not shown) which selects the best combination of the batches of articles which provides a total weight most closely approximating the target weight within a predetermined tolerance. Each weighing hopper 2d is provided with a weighing hopper gate 2f. After the selection of the "best" combination, only the weighing hopper gates 2f of the weighing hoppers constituting the best combination are opened by the operation of the hopper driving device 2g to let the batches of article go out of these hoppers. These batches of articles are then collected at the lower central portion of the weighing apparatus through a collecting chute 5. The collecting chute 5 has a form resembling a conical funnel, and the batches of articles dropping onto the peripheral portions of the chute are gathered at the central portion thereof naturally by the force of gravity or forcibly by a scraping means (not shown) or the like.

At the initial stage of the weighing operation, the weighing hoppers 2d are charged with respective batches of articles to be weighed. The weight sensors 2e annexed to these weighing hoppers 2d weigh the batches of articles and deliver weight signals L.sub.1 to L.sub.10 to the combination control section which is not shown. The combination control section then makes a computation of total weight for various hopper combinations and selects a combination which provides a total weight most closely approximating the target weight within a predetermined tolerance. The hopper drive unit 2g then opens the weighing hopper gates of the weighing hoppers constituting the selected "best" combination. In consequence, the batches of articles providing the "best" combination are discharged from these hoppers 2d into the collecting chute 5. Then, after the pool hopper gates 2c are opened to charge the evacuated weighing hoppers with new batches of articles. At the same time, the distribution supply devices 2a corresponding to the evacuated pool hoppers 2b are vibrated for a predetermined time to charge the empty pool hoppers 12b with the articles to be weighed. Then, the selection of the "best" combination is made in the same manner as that explained before. The weighing operation by the combinatorial weighing apparatus is thus performed repeatedly and continuously.

In this combinatorial weighing apparatus, a higher weighing accuracy is obtained as the number of combinatorial weighing cycle is increased. To this end, the known combinatorial weighing apparatus employed a lot of weighing sensors to obtain a greater number of weighing combinations, resulting undesirably in a larger size and complicated construction of the weighing apparatus as a whole. Moreover, the cost of the apparatus as a whole is uneconomically raised by employment of a large number of weight sensors which are generally expensive.

BRIEF SUMMARY OF THE INVENTION

Accordingly, an object of the invention is to provide a combinatorial weighing apparatus which is improved to permit an increase in the number of combinatorial weighing cycles to afford a higher weighing accuracy.

Another object of the invention is to provide a combinatorial weighing apparatus capable of attaining a high weighing accuracy without requiring increase in the size of the apparatus.

Still another object of the invention is to provide a combinatorial weighing apparatus capable of attaining higher weighing accuracy without requiring any increase in the number of the weighing hoppers and weight sensors.

It is a further object of the invention to provide a combinatorial weighing apparatus capable of attaining higher weighing accuracy without being accompanied by any rise in the cost of the apparatus.

Other features and advantages of the invention will be apparent from the following description taken in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic illustration of a conventional combinatorial weighing apparatus;

FIG. 2 shows in detail the general arrangement of the combinatorial weighing apparatus shown in FIG. 1;

FIG. 3 shows a distribution supply device incorporated in the combinatorial weighing apparatus shown in FIG. 2;

FIG. 4 is a front elevational view illustrating the arrangement of the distribution supply device shown in FIG. 3;

FIG. 5 is a top plan view illustrating the arrangement of the distribution supply device shown in FIG. 3;

FIG. 6 is a schematic illustration of a combinatorial weighing apparatus in accordance with an embodiment of the present invention;

FIG. 7 shows the detail of the general arrangement of the combinatorial weighing apparatus shown in FIG. 6; and

FIG. 8 is a block diagram of a memory and a combination control section incorporated in the combinatorial weighing apparatus shown in FIG. 6.

DESCRIPTION OF THE PREFERRED EMBODIMENT

A preferred embodiment of the invention will be described--with reference to the accompanying drawings. A combinatorial weighing apparatus in accordance with an embodiment of the invention is schematically shown in FIG. 6, while the detail of arrangement of the apparatus is shown in FIG. 7. Throughout these Figures, the same reference numerals are used to denote the same parts or members as those explained before in connection with FIGS. 1 to 5. The combinatorial weighing apparatus has a plurality of weighing station as 2-1 to 2-n each of which includes, as will be seen from FIG. 7, a distribution supply device 2a, pool hopper 2b, pool hopper gate 2c, weighing hopper 2d, weight sensor 3 and a hopper driving device 2g.

The distribution supply device 2a, pool hopper 2b and the pool hopper gate 2c are identical to those shown in FIG. 2. Each hopper 2d is provided at its bottom with hopper gates 2e and 2f which constitute two independent discharge openings. The arrangement is such that, in operation, either one of the hopper gates 2e and the hopper gate 2f is opened in accordance with a discharge instruction signal. After the evacuation through opening of the hopper gate 2e or 2f, the weighing hopper 2d is supplied with a new batch of article to be weighed from the pool hopper 2b. The hopper driving device 2g adapted for driving these hopper gates 2e,2f between open position and close position is installed at the center of the apparatus and is supported by a supporting post 2h. A disc-shaped supporting base 4 carrying the distribution supply devices 2a are mounted on the hopper driving device 2g. The weight sensor 3 provided in each weighing hopper 2d is adapted to measure the weight of the article in the associated weighing hopper 2d. The weight sensors 3 are connected to a memory section 8 for storing the weighing results and a combination control section 9 for conducting a combinatorial computation. A storage hopper 7 is disposed under each weighing hopper 2d, and is provided with a hopper gate 7a which constitutes a single discharge opening. This storage hopper 7 has a supply opening disposed below the inner one 2e of the two hopper gates 2e,2f of the weighing hopper 2d. Therefore, as the inner gate hopper 2e of the weighing hopper 2e is opened, the article is discharged into the storage hopper 7 whereas, when the outer hopper gate 2f is opened, the article is discharged into the collecting chute 5.

The combinatorial weighing apparatus having a construction as previously explained operates in a manner which will be explained as follows.

The article distribution supply devices 2a deliver the articles to be weighed to respective pool hoppers 2b. Then, the hopper drive device 2g drives the levers to open the pool hopper gates 2c thereby to let the batches of articles in the pool hoppers 26 drop into respective weighing hoppers. The batch of articles in each weighing hopper 2d is weighed by the associated weight sensor 3 and the weighing result is stored in the memory section 8.

Then, the levers of the hopper driving section 2g are operated to open the inner hopper gates 2e of all weighing hoppers 2d thereby to supply the batches of articles in respective weighing hoppers 2d into corresponding storage hoppers 7.

Subsequently, the evacuated weighing hoppers 2d are supplied with the batches of articles from the associated pool hoppers 2d and the weight sensors 3 weigh the weights of the newly supplied batches of articles in respective weighing hoppers 2d. The weighing results are transmitted to and stored in the memory section 8.

Thus, all of the weighing hoppers 2d and the storage hoppers 7 are charged with batches of articles to be measured. The weights of these batches of the articles are stored in the memory section 8, and the combinatorial computation is conducted with these data stored in the memory section 8. Namely, the combination control section 9 performs a combinatorial computation using weight values of the batches of articles in the storage hoppers 7 measured in the first weighing cycle and the weights of batches of articles now in the weighing hoppers 2d weighed in the second measuring cycle, to select the "best" combination which provides a total weight equal to or most closely approximating the target weight within a predetermined tolerance. Then, the hopper driving device 2g operates the hopper gates 2f and the hopper gates 7a of the selected weighing hoppers 2d and storage hoppers 7 which in combination constitute the "best" combination, and the batches of articles in these hoppers 2d,7d are discharged into the collecting chute 5.

The memory of weight values in these selected hoppers 2d,7 are erased simultaneously with the discharge of the article therefrom.

The weighing hoppers which have been evacuated as a result of the discharge are then charged with new batches of articles after closing of the hopper gates 2f thereof, and the weights of these new articles are weighed by the weight sensors 3 and delivered to and stored in the memory section 8. Similarly, the hoppers gates 7 of the storage hoppers 7 which have been evacuated as a result of the discharge are closed and the hopper gates 2e of the corresponding weighing hoppers 2d are opened so that the batches of articles are shifted from these weighing hoppers 2d to the evacuated storage hoppers 2d. Then, the weights of these shifted batches of articles are stored in the memory section 8 as the weights of the batches of articles in the storage hoppers. Then, the weighing hoppers 2d, which have been evacuated as a result of the shift of the articles, are charged with new batches of articles from the pool hoppers 2b. The weight of these new batches of article are then weighed by the weight sensors 3 and stored in the memory section 8.

Subsequently, as the weight data become available with the weights which were not selected in the preceding weighing cycle and with the newly measured weights, the combinatorial computation is conducted by the combination control section 9 with these data for the selection of the new "best" combination which provides a total weight equal to or most closely approximating the target weight. After the selection of the "best" combination, the above-mentioned operation is repeated to discharge the material of a weight equal to or most closely approximating the target weight in each weighing cycle.

In the described embodiment, when the selected combination includes a weighing hopper and the storage hopper associated therewith, e.g. when the selected combination includes a first weighing hopper 2d and a first storage hopper 7 corresponding to the latter, a troublesome operation is required in which the first weighing hopper charged with a first batch of the articles delivers, after the weighing of the first batch of the articles, the first batch of articles to the first storage hopper and then the first weighing hopper is supplied with the second batch of articles the weight of which is weighed and stored in the memory section 8.

Alternatively, the arrangement may be as follows. (a) The combinatorial computation is made in such a manner as to avoid the simultaneous selection of a weighing hopper and the associated storage hopper, in the determination of the best combination. (b) When a weighing hopper and the associated storage hopper are selected simultaneously, the selected weighing hopper and the storage hopper are excluded from the present combinatorial computation but the weighing results with these hoppers are stored only in the memory section 8 to take part in the next cycle of combinatorial computation. (c) The weighing hopper solely is charged with a new batch of articles and the weight thereof is stored in the memory section to take part in the next cycle of combinatorial computation. If this weighing hopper is not selected in the next cycle of combinatorial computation, the inner hopper gate 2e of this weighing hopper is shifted from this weighing hopper into the associated storage hopper, and the weight of this batch of articles is stored as the weight of the articles in the associated storage hopper. Simultaneously, the evacuated weighing hopper is supplied with a new batch of articles the weight of which is weighed and stored in the memory section. The weights thus stored are taken into consideration in the next cycle of combinatorial computation.

In the combinatorial weighing apparatus of this embodiment having the construction described heretofore, the number (2N) of the weight data available for the combinatorial computation is twice as large as the number (N) of the weight sensors 3 because the weights of the articles in the weighing hoppers and the weights of the articles in the storage hoppers are measured and stored in the memory section to take part in the combinatorial computation. In consequence, the weighing accuracy and, hence, the reliability of the apparatus are improved remarkably. The weighing speed is sufficiently high because each weight sensor is required only to weigh the articles supplied to the associated weighing hopper and storage hopper.

Needless to say, the present invention can be applied to an automatic counting apparatus in which the number of articles are counted by the steps of: calculating the number of articles supplied into each of a plurality of weighing hoppers by dividing the measured weight by the weight of each article, conducting a combinatorial computation on the basis of the thus calculated number of pieces of articles to determine and select the "best" combination which provides a total number equal to or closest to the target number, making the selected weighing hoppers discharge the articles, and collecting the discharged articles by means of a chute or the like.

In the described embodiment, the weighing apparatus is provided with pool hoppers 2d. The pool hopper 2d is intended for the following purposes. Namely, in the combinatorial weighing apparatus of the type described, there is a fear that the article is dropped even after the stop of vibration of the distribution supply device 2a from the end of the trough 2a into the hopper under weighing by the force of gravity or as a result of transmission of vibration from another apparatus. This fear, however, is completely eliminated by the use of the pool hopper 2d in the described embodiment. The use of the pool hopper offers another advantage that the batches of articles to be put into weighing are beforehand pooled in the idle time in which the combinatorial computation is being made, so that the period of the weighing cycle is shortened advantageously.

Thus, the provision of the pool hopper is not essential in the combinatorial weighing apparatus of the invention. Namely, the pool hoppers 2d may be substituted by shutters or the like device which are provided on the ends of the troughs to prevent the articles from dropping into the weighing hoppers. Alternatively, when the stacked articles are such one as can hardly be collapsed or when the rate of supply is so small that the articles form only a thin layer on the trough, the pool hoppers can be completely omitted. It will be understood that the advantage of the invention can never be lost even when the apparatus is modified in the manners stated above.

FIG. 8 is a detailed block diagram of the memory 8 and the combination control section 9 incorporated in the arrangement shown in FIG. 6. The memory 8 includes storage hopper memory section 8a (MP.sub.1 to MP.sub.n) which store the weight values of batches of articles in respective storage hoppers 7 and weighing hopper memory section 8b (MC.sub.1 to MC.sub.n) for storing the weight values of the batches of articles in the weighing hoppers 2d. The weighing hopper memories MC.sub.1 to MC.sub.n are connected to respective weight sensors 3-1,3-2, . . . 3-n, while the storage hopper memories MP.sub.1 to MP.sub.n are connected to respective weighing hopper memories MC.sub.1 to MC.sub.n. A memory control section 8c controls the storing and erasing operation in the storage hopper memory section 8a and weighing hopper memory section 8b.

The combination control section 9 includes a 2N-bit counter 9a adapted to count timing pulses TP of a predetermined period and to produce patterns of combinations of n pieces of weighing hoppers and n pieces of storage hoppers. There are 2n cases of selection when only one hopper is selected from a group of hoppers consisting of n pieces of weighing hoppers and n pieces of storage hoppers. Also, there are 2n(2n-1)/2! cases of selection when 2 hoppers are selected out of 2n pieces of hoppers. When r pieces of hoppers are to be selected out of the 2n pieces of the hoppers, the number of possible cases of selection is represented by 2n(2n-1)(2n-2) . . . (2n-r+1)/r!. In consequence, the total number of the possible combinations is expressed by 2.sup.2n -1. It is, therefore, possible to make the binary 2n-bit counter 9a to generate (2.sup.2n -1 ) kinds of bit patterns (000 . . . 001 to 111 . . . 111) by supplying (2.sup.2n -1) pieces of timing pulse TP. According to the described embodiment, the first bit of the counter 9a is alloted to the first region MP.sub.1 of the storage hopper memory section 8a, and the second bit is alloted to the second region MP.sub.2 of the storage hopper memory section 8a. Similarly, the n the bit of the counter 9a is alloted to the nth region of the storage hopper memory section 8a. On the other hand, the (n+1)th bit, (n+2)th bit and the 2nth bit of the counter 9a are alloted to the first, second and the nth regions MC.sub.1, MC.sub.2 and MC.sub.n of the weighing hopper memory section 8b. According to this arrangement, the bit patterns offered by the counter 9a are the possible patterns of the combination. A reference numeral 9b designates a multiplexer which is adapted to deliver to the computation section the weight values stored in the regions MP.sub.1 to MP.sub.n and MC.sub.1 to MC.sub.n of the memory sections 8a,8b corresponding to respective bit patterns offered by the counter 9a. For instance, when the counted value is 1000101011 where 2n=10, the outputs W.sub.1,W.sub.2,W.sub.4,W.sub.6 and W.sub.10, derived respectively from the first, second and fourth regions MP.sub.1,MP.sub.2 and MP.sub.4 of the storage hopper memory section 8a and the first and fifth regions MC.sub.1 and MC.sub.5 of the weighing hopper memory section 8b, are delivered to the computation section. A reference numeral 9c designates a command value register adapted to store a command weight value Wa, while numerals 9d and 9e denote, respectively, an upper limit setting device and a lower limit setting device for storing the preferred tolerance of the weighing determined by an upper limit value Ma and a lower limit value Mi. The lower limit value is selected to be equal to the command weight value as a practice, in order to avoid any complaint by customers due to the shortage of the total weight which may be caused by a slight possible error.

A reference numeral 9f designates the computation section which computes and outputs the total weight value .SIGMA.Wi (=X), as well as the offset of this total weight value .SIGMA.Wi from the command value Wa and the absolute value of the offset. Namely, the computation section 9f performs the computation in accordance with the following formulae (1) and (2). ##EQU1##

The computation section 9f then outputs the total weight value .SIGMA.Wi (=X) and the absolute value A of offset (referred to simply as "offset", hereinunder) of the total weight value .SIGMA.Wi from the command value Wa. Reference numerals 9g and 9h denote, respectively, a comparator and a moderate number counter. The comparator 9g makes a discrimination as to whether the total weight value X falls within the tolerance, i.e. between Mi and Ma, in accordance with the following formula (3).

Mi.ltoreq.X.ltoreq.Ma (3)

Then, if the condition of the formula (3) is met, the content of the moderate counter 9h is counted up. A reference numeral 9j designates a minimal offset memorizing register which stores the minimal offset. The offset value A is automatically set in this register only for the initial weighing, but the content of this register is altered progressively in a manner explained below. In the case where the lower limit value coincides with the command value, the minimal offset register 9j may initially store the difference between the upper limit value and the command value. A reference numeral 9k designates a "best" combination memory which stores the pattern corresponding to the "best" combination, 9m and 9n designates gates and 9p denotes a comparator. When the total weight value Wi falls within the tolerance, the comparator 9p makes a comparison between the offset value A derived from the computation section 9f and the minimal offset value B stored in the minimal offset storage register 9j. When the offset value A is smaller than the minimal offset value B, the offset value A is delivered through the gate 9m to the minimal offset memory register 9j and stored in the latter and, at the same time, the content (combination pattern) of the counter 9a is stored in the best combination memory 9k.

A reference numeral 10 designates a drive control section which is adapted to activate the hopper driving device 2g in accordance with the "best" combination when the content of the moderate number counter 9h is greater than "1", thereby to open predetermined weighing hopper gates 2f and the storage hopper gate 7a (See FIG. 7) to permit the weighed article to be discharged into the collecting chute 5 from these weighing hoppers 2d and the storage hoppers 7. Meanwhile, the pool hopper gates 2c and the weighing hopper gates 2e are opened to charge the evacuated weighing hoppers 2d and storage hoppers 7 with new batches of article.

The operation of this weighing apparatus will be explained below. At the initial stage of the operation, the weighing hoppers 2d and the storage hoppers 7 are charged with batches of the articles to be weighed. Namely, the distribution supply device 2a delivers the articles to be weighed to respective pool hoppers 2b. Then, the hopper driving portion 2g activates the levers to open the pool hopper gates 2c thereby to permit the batches of the articles to be delivered from the pool hoppers 2b into corresponding weighing hoppers 2d. The batches of articles in respective weighing hoppers 2d are then weighed by respective weight sensors 3. The measured weight values are then stored in corresponding regions MC.sub.1 to MC.sub.n in the weighing hopper memory section 8b, under the control of the memory control section 8c. Then, the hopper drive device 2g is started in accordance with the instruction given by the drive control section 10 so as to open the inner hopper gates 2e of the weighing hoppers 2d thereby to permit the batches of articles to be discharged from the weighing hoppers 2d into corresponding storage hoppers 7. Simultaneously, the memory control section 8c operates to shift the weight values from the regions MC.sub.1 thru MC.sub.n in the weighing hopper memory section 8b to corresponding regions MP.sub. 1 thru MP.sub.n in the storage hopper memory section 8a. Then, the distribution supply device 2a delivers the next batches of articles again to the pool hoppers 2b, and the gates 2c of the pool hoppers are opened so that the batches of articles are put into corresponding weighing hoppers 2d. The batches of articles in the weighing hoppers 2d are weighed by respective weight sensors 3 and the weight values are stored in the corresponding regions MC.sub.1 thru MC.sub.n of the weighing hopper memory section 8b. Thus, batches of articles are put in respective storage hoppers 7 and the weights thereof are stored in the storage hopper memory section 8a and then batches of articles are supplied also to respective weighing hoppers 2d and the weights thereof are stored in the weighing hopper memory section 8b. Then, the multiplexer 9b receives the weight values W.sub.1 to W.sub.n stored in the regions MP.sub.1 to MP.sub.n of the storage hopper memory section 8a and the weight values W.sub.n+1 to W.sub.2n stored in the regions MC.sub.1 to MC.sub.n in the weighing hopper memory section 8b. The 2n-bit counter 9a (2n=10) counts the timing pulses TP of a predetermined period and generates 2.sup.2n -1 pieces of combination patterns. Namely, the content of the counter 9a is changed into 0000000001 upon counting the first timing pulse TP. In consequence, the multiplexer 9b delivers to the computation section 9f the value stored in the first region MP.sub.1 of the storage hopper memory 8a, i.e. the weight value W.sub.1, and the computation section then executes the computation in accordance with the formulae (1) and (2) to output the total weight value .SIGMA.Wi of this combination and the offset A (=.vertline.W.sub.1 -W.sub.a .vertline.) of the total weight value .SIGMA.Wi from the command value Wa. Since the gates 9n and 9m are kept opened only at the time of the first combinatorial computation, so that the offset value A is transferred to and stored in the minimal offset storage register 9j, and the content (combination pattern 000 . . . 01) of the counter 9a is stored in the best combination memory 9k. Meanwhile, the comparator 9g compares the total weight value .SIGMA.Wi (=X) with the upper and lower limit values Ma and Mi. If the following condition is met, the content of the moderate weight counter 9h is counted up.

Mi.ltoreq.X.ltoreq.Ma

Then, as the second timing pulse TP is generated, the content (combination pattern) of the counter 9a is changed to 0000000010. As a result, the value (weight value W.sub.2) stored in the second region MP.sub.2 of the storage hopper memory 8a is delivered to the computation section 9f, so that the computation section 9f conducts the operation in accordance with the formulae (1) and (2) to output the total weight value .SIGMA.Wi (=X) and the offset value A (=.vertline.W.sub.2 -Wa.vertline.). Then, the comparator 9g makes a comparison as to whether the condition expressed by the formula (3) is satisfied. If the condition is met, the content of the moderate counter 9h is counted up by "1". Meanwhile, the comparator 9p compares the offset value A with the content B (=.vertline.W.sub.1 -W.sub.a .vertline.) of the minimal offset memory register 9j. Then, if the condition of A.gtoreq.B is met, the contents of the minimal offset memory register 9j and the best combination memory 9k are not changed, whereas, if the above-mentioned condition is not met, i.e. if the condition is A<B is met, the offset value A and the content of the 2n-bit counter 9a are transferred to and stored in the minimal offset memory register 9j and the best combination memory 9k, respectively. Then, the similar operation is repeated and the minimum offset out of the offset values provided by all of 2.sup.2n -1 pieces of combinations is stored in the minimal offset memory register 9j, while the combination pattern which provides this minimum offset is stored in the "best" combination memory 9k thus completing the selection of the "best" combination pattern. Thereafter, the number counted by the moderate counter 9h and the combination pattern stored in the "best" combination memory 9k are delivered to the drive control section 10. If the number counted by the moderate counter 9h is greater than "1", the drive control section 10 controls the hopper drive section 2g in accordance with the input combination pattern. Namely, the hopper gates 7a and the hopper gates 2f of the storage hoppers 7 and weighing hoppers 2d, selected in accordance with the contents of the bits forming the best combination pattern, are opened to permit the batches of articles in these hoppers 7,2d to be discharged into the collecting chute 5.

According to the invention, the leading n bits of the combination pattern are alloted for the weighing hoppers 2d, while the following n bits are alloted for the storage hoppers 7. Therefore, the pool hopper gates 2c of the pool hoppers 2b, which correspond to the weighing hoppers 2d selected by the leading n bits of the combination pattern, are opened to deliver the batches of articles from these pool hoppers 2b into the selected weighing hoppers 2d. At the same time, the weight values of the batches of articles thus supplied into the weighing hoppers 2d are weighed by the weight sensors 3 and these weight values are stored in the corresponding regions MC.sub.1 to MC.sub.n in the weighing hopper memory section 8b, under he control of the memory control section 8c which receives the combination pattern. Subsequently, the hopper gates 2e of the weighing hoppers 2d, which correspond to the storage hoppers 7 selected by the following n bits of the combination pattern, are opened to deliver the batches of articles from these weighing hoppers 2d into the selected storage hoppers 7. At the same time, the memory control section 8c operates to shift the weight values from the corresponding regions MC.sub.1 to MC.sub.n in the weighing hopper memory section 8b to the corresponding regions MP.sub.1 to MP.sub.n of the storage storage hopper memory section 8a thereby to store these weight values in these regions MP.sub.1 to MP.sub.n. As a result, the weighing hoppers 2d corresponding to the selected storage hoppers 7 become empty. Therefore, using the following n bits of the combination pattern, the pool hopper gates 2c of the pool hoppers 2b corresponding to the empty weighing hoppers 2d are opened thereby to charge the empty weighing hoppers 2d with new batches of articles from these pool hoppers 2b. At the same time, the weight values of these new batches of articles are weighed by the weight sensors 3 and are stored in the corresponding regions MC.sub.1 to MC.sub.n in the weighing hopper memory section 8b, under the control of the memory control section 8c. Meanwhile, the distribution supply devices 2a corresponding to the evacuated pool hoppers are vibrated for a predetermined time to charge the evacuated pool hoppers 2b with new batches of articles.

Subsequently, the combinatorial control is conducted in the manner explained before and the weighing operation is made continuously by the combinatorial weighing apparatus. When the content of the moderate counter 9h is zero, the articles are not discharged but the hoppers are charged with the article for the next combinatorial computation.

As will be understood from the foregoing description, the present invention offers the following advantages. Namely, according to the invention, 2N pieces of weight values are available for the selection of the "best" combination using N pieces of weight sensors, so that the weighing accuracy is improved correspondingly. For the same reason, the cost of the apparatus can be lowered economically because the number of weight sensors is reduced to a half as compared with that in the known weighing apparatus having equal weighing accuracy. In other words, when only N pieces of weighing data are enough to obtain the desired weighing accuracy, it suffices only to employ 2/N pieces of weight sensors. In consequence, it is possible to attain higher weighing accuracy without being accompanied by substantial increase in the size of the weighing apparatus and complication of the construction of the weighing apparatus.

Although the invention has been described through specific terms, it is to be understood that the described embodiment is only illustrative and various changes and modifications may be imparted thereto without departing from the scope of the invention which is limited solely by the appended claims.

Claims

1. A combinatorial weighing apparatus comprising:

(a) a plurality of weighing hoppers adapted to receive batches of article to be weighed, each of said weighing hoppers being provided at its bottom with a first hopper gate and a second hopper gate;

(b) weight sensors corresponding to said weighing hoppers and adapted to weigh said batches of article received by corresponding weighing hoppers;

(c) a plurality of storage hoppers arranged to receive the article discharged from said second hopper gates of said weighing hoppers, each of said storage hoppers having a single third hopper gate;

(d) A combination control section adapted to select the best combination of said storage hoppers and weighing hoppers which provides a total weight equal to or most closely approximating a target weight within a predetermined tolerance, using the weight values of batches of article put in said storage hoppers and the weight values of batches of article received by said weighing hoppers, said weight values being obtained through weighing by said weight sensors, said combination control section being adapted to operate said third hopper gates of selected storage hoppers and said first hopper gates of the selected weighing hoppers, in accordance with the selected best combination; and

(e) a collecting chute which collects the article discharged from said storage hoppers and said weighing hoppers constituting the selected best combination.

2. A combinatorial weighing apparatus according to claim 1, characterized by further comprising a memory section connected to said weight sensors and also to said combination control section said memory section being adapted to store the weight values derived from said weight sensors.

3. A combinatorial weighing apparatus according to claim 2, wherein said memory section includes a storage hopper memory section for storing the weight values of batches of article in said storage hoppers, and a weighing hopper memory section adapted to store the weight values of batches of article in said weighing hoppers.

4. A combinatorial weighing apparatus according to claim 1, wherein said weighing hopper and said storage hopper are arranged in plural, said storage hoppers corresponding to respective weighing hoppers.

5. A combinatorial weighing apparatus according to claim 2, wherein said combination control section includes a counter adapted to produce a plurality of combination patterns, a computation means adapted to compute the total weight of batches of articles in said storage hoppers and said weighing hoppers for each of said combination pattern and adapted to deliver as an output the offset of said total weight from said target weight, and a comparator adapted to determine said best combination from the output from said computation means.

6. A combinatorial weighing apparatus according to claim 4, wherein the computation of said best combination is made in such a manner as to avoid the simultaneous selection of a weighing hopper and the storage hopper associated with said weighing hopper.

7. A combinatorial weighing apparatus according to claim 4, further comprising an article supplying means for supplying articles to said weighing hoppers and to said storage hoppers.

8. A combinatorial weighing apparatus according to claim 7, wherein when the weighing hopper and the storage hopper associated with said weighing hopper are selected simultaneously, the weight values of the articles which are respectively supplied to said weighing hopper and to said storage hopper by the article supplying means, are excluded from the next computation of said best combination.

9. A combinatorial weighing apparatus according to claim 7, wherein the weighing hopper and the storage hopper associated with said weighing hopper are selected simultaneously, the article supplying means supplies afresh the articles to said weighing hopper only, and when said weighing hopper is not selected by the next computation of said best combination, said article supplying means supplies the articles stored in said weighing hopper to said corresponding storage hopper and supplies afresh the articles to said weighing hopper.