Combinatorial weighing method and apparatus

Claim 2

A combinatorial weighing or counting method in which a plurality of articles are weighed to provide a plurality of weight values or count values, said values are combined, and the optimum combination of said values is found whose total value is equal or closest to a set target value, said method comprising: (a) dividing said plurality of weight values into a plurality of groups; (b) computing summed weight values for each group by adding the weight values in each and every combination of weight values that constitute said group; (c) finding every combination of the summed weight values, in which a single summed weight value, including a combination containing no weighed values resulting in a zero summed weight, is permitted, computing first group differences between said set target value and a total value obtained by adding the summed weight values in each and every combination of the summed weight values in the first group and using the first group differences in the next group of summed weighed values for computing next group differences; and (d) finding the optimum combination of weight values whose sum gives the smallest of the first and next group differences when subtracted from said set target value and discharging or counting the articles associated with the optimum.

Claim 3

A combinatorial weighing or counting method according to claim 1, wherein the step (d) comprises the steps of: (di) comparing the difference, each time it is computed, with the smallest difference computed previously; (dii) storing the smaller of the two compared differences as well as the combination of weight values that gives said smaller difference; and (diii) executing said comparison step and said storage step for all combinations of weight values.

Claim 4

A combinatorial weighing or counting method according to claim 1 or claim 2, wherein the step (b) comprises the steps of: (bi) expressing all 2 n combinations of weight values in each group in the form of binary n-bit combination codes by establishing a correspondence between each weight value G i (where i=1, 2, . . . , n) and the i-th bit of a binary n-bit number, where one group of weight values is composed of n-number of weight values G l through G n ; (bii) computing summed weight values on the basis of the combination indicated by said combination codes; and (biii) establishing a corresponding relationship between the combination codes and the addresses of memory means where said summed weight values are stored.

Claim 5

A combinatorial weighing or counting method according to claim 1 or claim 2, further comprising the step of computing the number of articles by dividing the weight of said articles by the weight of an individual article, whereby said weight values are converted into discrete article numbers and said set target value is converted into a set target number.

Claim 6

A combinatorial weighing or counting method in which a plurality of articles are weighed to provide a plurality of weight values or count values, said values are combined, and the optimum combination of said weight values or count values is found whose sum is equal or closest to a set target value within a predetermined range, said method comprising: (a) dividing said plurality of weight values into n-number of groups (where n is a positive integer greater than or equal to 2) and ranking said groups into first, second, . . . ,n-th groups; (b) computing summed weight values for each group by adding the weight values in each and every combination of weight values that constitute said group; (c) computing every combination of the summed weight value, in which at least a single summed weight value, including a combination containing no weighed values resulting in a zero summed weight, is permitted from the first group to the i-th group (where i=1, 2, 3 . . . n-1), computing first group differences between said set target value and a total value obtained by adding the summed weight values in each and every combination of the summed weight values in the first group and using the first group differences in the n+1th group of summed weighed values for computing n+1th group differences; (d) determining whether each said difference is within said predetermined range; (e) comparing, when each said difference is within said predetermined range, said difference with the smallest difference previously computed, wherein further weight combinations including the summed weight values of the combination providing said difference are regarded as not providing the optimum combination and are not compared; (f) storing the smaller of the two compared differences as well as the combination of weight values that gives said smallest difference; and (g) treating the combination of weight values whose total value gives the smallest difference when subtracted from said set target weight, as the optimum combination of all possible combinations and discharging or counting the articles associated with the optimum combination.

Claim 7

A combinatorial weighing or counting method in which a plurality of articles are weighed to provide a plurality of weight values or count values, said values are combined, and the optimum combination of said weight values or count values is found whose sum is equal or closest to a set target value within a predetermined range, said method comprising: (a) dividing said plurality of weight values into n-number of groups (where n is a positive integer greater than or equal to 2) and ranking said groups into first, second, . . . ,n-th groups; (b) computing summed weight values for each group by adding the weight values in each and every combination of weight values that constitute said group; (c) computing every combination of the summed weight value, in which at least a single summed weight value, including a combination containing no weighed values resulting in a zero summed weight, is permitted from the first group to the i-th group (where i=1, 2, 3 . . . n-1), computing first group differences between said set target value and a total value obtained by adding the summed weight values in each and every combination of the summed weight values in the first group and using the first group differences in the n+1th group of summed weighed values for computing n+1th group differences; (d) determining whether each said difference is within said predetermined range; (e) comparing, when each said difference is within said predetermined range, said difference with the smallest difference previously computed, wherein further weight combinations including the summed weight values of the combination providing said difference are regarded as not providing the optimum combination and are not compared; (f) storing the smaller of the two compared differences as well as the combination of weight values that gives said smallest difference; and (g) treating the combination of weight values whose total value gives the smallest difference when subtracted from said set target weight, as the optimum combination of all possible combinations and discharging or counting the articles associated with the optimum combination.

Claim 8

A combinatorial weighing or counting method according to claim 5, wherein the step (b) comprises the steps of: (bi) expressing all 2 m combinations of weight values in each group in the form of binary m-bit combination codes by establishing a correspondence between each weight value G 1 (where i=1, 2, . . . ,m) and the i-th bit of a binary m-bit number, where one group of weight values is composed of m-number of weight values G l through G m ; (bii) computing summed weight values on the basis of the combinations indicated by said combination codes; and (biii) establishing a corresponding relationship between the combination codes and the addresses of memory means where said summed weight values are stored.

Claim 9

A combinatorial weighing or counting method according to claim 5 or claim 6, further comprising the step of computing the number of articles by dividing the weight of said articles by the weight of an individual article, whereby said weight values are converted into discrete article numbers and said set target value is converted into a set target number.

Claim 10

A combinatorial weighing or counting apparatus in which a plurality of articles are weighed by weighing machines to provide a plurality of weight values or count values, said values are combined, and the optimum combination of said values is found whose sum is equal or closest to a set target weight, said apparatus comprising: first computation means for dividing said plurality of weight values into a plurality of groups and for computing summed weight values for each group by adding the weight values in each and every combination of weight values that comprise said group including a combination that contains no weighed values that results in a zero summed weight; first memory means for storing said summed weight values; means for generating all combination codes for said summed weight values from each of said groups; second computation means for computing first group differences between said set target value and a total value obtained by adding the summed weight values in each and every combination of the summed weight values in the first group and for using the first group differences in the next group of summed weighed values for computing next group differences; and means for selecting the combination of summed weight values whose sum gives the smallest of the differences when subtracted from said set target value.

Claim 11

A combinatorial weighing or counting apparatus in which a plurality of articles are weighed by weighing machines to provide a plurality of weight values or count values, said values are combined, and the optimum combination of said values is found whose sum is equal or closest to a set target weight, said apparatus comprising: first computation means for dividing said plurality of weight values into a plurality of groups and for computing summed weight values for each group by adding the weight values in each and every combination of weight values that comprise said group including a combination that contains no weighed values that results in a zero summed weight; first memory means for storing said summed weight values; means for generating all combination codes for said summed weight values from each of said groups; second computation means for computing first group differences between said set target value and a total value obtained by adding the summed weight values in each and every combination of the summed weight values in the first group and for using the first group differences in the next group of summed weighed values for computing next group differences; and means for selecting the combination of summed weight values whose sum gives the smallest of the differences when subtracted from said set target value.

Claim 12

A combinatorial weighing or counting apparatus according to claim 8, wherein said means for selecting the combination of summed weight values whose sum gives the smallest difference comprises: comparison means for comparing the difference, each time it is computed, with the smallest difference previously computed; and second memory means for storing the smaller of the two compared differences as the minimum difference, and for storing the combination of summed weight values that gives said minimum difference.

Claim 13

A combinatorial weighing or counting apparatus according to claim 8 or claim 9, further comprising third computation means for computing the number of articles by dividing the weight of said articles by the weight of an individual article, whereby said weight values are converted into discrete article numbers.

Claim 14

A combinatorial weighing or counting apparatus in which a plurality of articles are weighed by weighing machines to provide a plurality of weight values or count values, said values are combined, and the optimum combination of said values is found whose sum is equal or closest to a set target value within a predetermined range, which apparatus comprises: first computation means for dividing said plurality of weight values into n-number of groups (where n is a positive integer greater than or equal to 2) and for computing summed weight values for each group by adding the weight values in each and every combination of weight values that comprise said group including a combination that contains no weight values and results in a zero summed weight; first memory means for storing said summed weight values; means for generating all combination codes for said summed weight values from each of said groups from the first group through i-th group (where i=1, 2, . . ., n-1); second computation means for computing nth group differences between said set target value and a total value obtained by adding the summed weight values in each and every combination of summed weight values in the nth group and using the nth group differences with the n+1th group of summed weighed values to obtain n+1th group differences; discrimination means for discriminating whether said differences are within said predetermined range; comparison means for comparing, when a difference is within said predetermined range, said difference with the smallest difference computed previously; and second memory means for storing the smaller of the two compared differences as the minimum difference and for storing the combination of the summed weight values that gives said minimum difference; wherein, when said difference is within said predetermined range, said combination code generating means does not generate combination codes for further combinations including the summed weight values which comprise the combination providing said difference, these combinations of summed weight values being regarded as not providing the optimum combination and are not compared.

Claim 15

A combinatorial weighing or counting apparatus in which a plurality of articles are weighed by weighing machines to provide a plurality of weight values or count values, said values are combined, and the optimum combination of said values is found whose sum is equal or closest to a set target value within a predetermined range, which apparatus comprises: first computation means for dividing said plurality of weight values into n-number of groups (where n is a positive integer greater than or equal to 2) and for computing summed weight values for each group by adding the weight values in each and every combination of weight values that comprise said group including a combination that contains no weight values and results in a zero summed weight; first memory means for storing said summed weight values; means for generating all combination codes for said summed weight values from each of said groups from the first group through i-th group (where i=1, 2, . . ., n-1); second computation means for computing nth group differences between said set target value and a total value obtained by adding the summed weight values in each and every combination of summed weight values in the nth group and using the nth group differences with the n+1th group of summed weighed values to obtain n+1th group differences; discrimination means for discriminating whether said differences are within said predetermined range; comparison means for comparing, when a difference is within said predetermined range, said difference with the smallest difference computed previously; and second memory means for storing the smaller of the two compared differences as the minimum difference and for storing the combination of the summed weight values that gives said minimum difference; wherein, when said difference is within said predetermined range, said combination code generating means does not generate combination codes for further combinations including the summed weight values which comprise the combination providing said difference, these combinations of summed weight values being regarded as not providing the optimum combination and are not compared.

Claim 16

A combinatorial weighing or counting apparatus according to claim 11, further comprising third computation means for computing the number of articles by dividing the weight of said articles by the weight of an individual article, whereby said weight values are converted into discrete article numbers.

Claim 17

A combinatorial weighing method for weighing articles divided into numbered groups and for providing a total weight closest to a target weight, said method comprising: (a) computing the combination sums in each numbered group for all combinations of weighted values including one combination in each numbered group where no weighed values are combined resulting in a zero value combination sum; (b) subtracting the combination sums of the highest numbered group from the target weight resulting in highest group differences; (c) subtracting the combination sums of the next lowest numbered group from each of the highest differences resulting in next highest group differences until all numbered groups have been subtracted; (d) comparing the next highest group differences and the highest group differences and selecting the smallest difference as the combination of weighed values closest to the target weight; and (e) discharging the combination of weighed articles.

Claim 18

A combinatorial weighing method for weighing articles divided into numbered groups and for providing a total weight closest to a target weight, said method comprising: (a) computing the combination sums in each numbered group for all combinations of weighted values including one combination in each numbered group where no weighed values are combined resulting in a zero value combination sum; (b) subtracting the combination sums of the highest numbered group from the target weight resulting in highest group differences; (c) subtracting the combination sums of the next lowest numbered group from each of the highest differences resulting in next highest group differences until all numbered groups have been subtracted; (d) comparing the next highest group differences and the highest group differences and selecting the smallest difference as the combination of weighed values closest to the target weight; and (e) discharging the combination of weighed articles.

Claim 19

A combinatorial weighing method for weighed articles divided into numbered groups and for providing a total weight closest to a target weight, said method comprising: (a) computing the combination sums in each numbered group for all combinations of weighed values including one combination sum in each numbered group where no weighed values are combined resulting in a zero value combination sum; (b) subtracting combination sums of the highest numbered group from the target weight resulting in highest group differences; (c) determining whether each highest group difference is within a predetermined range; (d) comparing each highest group difference with a prior difference and substituting the smaller as the prior difference if the difference is within the predetermined range; (e) subtracting the combination sums of the next lowest numbered group from each highest group difference which is outside the predetermined range resulting in a next highest group difference; (f) comparing each next highest group difference with the prior difference and substituting the smaller as the prior difference if the differences are within the predetermined range; and (g) discharging the combination of weighed articles corresponding to the prior difference.

Claim 20

A combinatorial weighing method for weighed articles divided into numbered groups and for providing a total weight closest to a target weight, said method comprising: (a) computing the combination sums in each numbered group for all combinations of weighed values including one combination sum in each numbered group where no weighed values are combined resulting in a zero value combination sum; (b) subtracting combination sums of the highest numbered group from the target weight resulting in highest group differences; (c) determining whether each highest group difference is within a predetermined range; (d) comparing each highest group difference with a prior difference and substituting the smaller as the prior difference if the difference is within the predetermined range; (e) subtracting the combination sums of the next lowest numbered group from each highest group difference which is outside the predetermined range resulting in a next highest group difference; (f) comparing each next highest group difference with the prior difference and substituting the smaller as the prior difference if the differences are within the predetermined range; and (g) discharging the combination of weighed articles corresponding to the prior difference.

Claim 21

A method according to claim 14, wherein the predetermined range is from zero to less than zero.