JPS63255625A - Mixed and combination weighing and counting apparatus - Google Patents

Abstract

PURPOSE:To achieve high speed processing, by mounting a large number of weighing machines each composed of a plurality of groups and operating the first combination equal or near to the set number of articles at every group with respect to a plurality of sets to store the same and selecting the second combination near to the set wt. sum. CONSTITUTION:For example, this apparatus is constituted of a large number of weighing machines G11-G17, G21-G27 for weighing the articles of two groups 1, 2, an operational control part 5 and setting parts 6, 7 for respectively setting the number and wt. of the articles of the groups 1, 2. Next, when weighing is performed by the group 1, a set value is inputted to the setting part 6 and the article of the group 1 is weighed by the weighing machine to be inputted to the control part 5 which is turn calculates a plurality of combinations each consisting of the number of articles equal or near to the set number of the articles of the group 1 to store the same. The same calculation is performed with respect to the group 2. The memory values of the groups 1, 2 are combined and one set of a combination equal or near to the set number and wt. sum of the articles of the respective groups is selected.

Description

[Detailed Description of the Invention] (Industrial Application Field) This invention is a setting type that weighs and counts the combinations of a plurality of types of items by type, and sets a predetermined composition weight ratio and a predetermined composition number ratio! The present invention relates to a mixing combination weighing/counting device for a plurality of types of items, and for obtaining a predetermined number of mixtures.

(Prior Art) Recently, in stores, supermarkets, etc., weighing and counting devices that perform combination weighing and combination counting have come to be used. Here, in combination weighing, when trying to obtain an item of arbitrary weight, the item is weighed in small amounts with n units of weighing machines with variations, and the combinations are added for each combination of weight values. , a combination suitable for the set weight is selected, and the items are discharged from the weighing machine of that combination to obtain the item of the set weight.

In addition, in combination counting, when an arbitrary number of specific items are to be weighed, the items are separated and placed separately in small amounts with n units of weighing machines, and each weight value is divided by the individual weight of the item. ,
Obtain the number of pieces for each weighing machine, combine and add these piece values, select a combination that matches the set number of pieces, and get the set number of items by discharging the items from the weighing machine of that combination. This is what I did.

The above combination weighing and combination counting target a single type of item or a mixture of multiple types of items mixed in a predetermined ratio, and multiple types of items are individually fed by different feeding devices. However, by the method of weighing these aggregates as they are, it is not possible to obtain an aggregate with an accurate constituent weight ratio or constituent number ratio.

For this reason, in Japanese Patent Application Laid-open No. 58-19516,
Mixing and combinations of a plurality of types of items are performed based on weight conditions and number conditions for each item, and if the conditions are not met, the following processing is performed.

That is, (1) When there is no combination of one type of item that matches the set number, for example, when weighing three types of items A, B, and C,
If the set number of items B is 5, the set number of items C is 5, and A, 'B, and C are mixed to obtain a combination of 15 items with a predetermined mixed weight, then If there is no combination that yields 5 items, the set numbers of items A and B are changed to 4 and 6, respectively, and a combination matching the changed set numbers is found. If there are a plurality of matching combinations, a chain combination is performed to find one combination each of A, B, and C that is equal to or closest to the set mixing weight.

(2) If there is no combination of two types of items that match the set number of items, for example, if there is no combination of items A and B that match the set number of items, the set number of items will be changed from the original 5 and 5. Perform the same process as in (1) by changing the numbers to 4 and 6.

(3) If there is no combination that matches the set number of A, B, and C types, for example, set the set number of A, B, and C to 4.6.6, totaling 1.
The same process as in (1) is performed with 6 pieces.

(Problems to be Solved by the Invention) As described above, in the conventional example, (1) For example, when weighing three types of items A, B, and C, the set number of items for each of A, B, and C is (2) If there are multiple matching combinations, perform chain combinations and select one combination that is equal to or closest to the set mixing weight; (3) If there is no matching combination, the following three processes are performed: changing the set number and recalculating (searching) a combination that matches the changed set number. Therefore, it is necessary to process the cases in which there are combinations that match the set number of items for each item and cases where there is no matching combination. If there is no matching combination, change the set number of items and reprocess. There is a problem in that additional processing is required in addition to calculation (search), making the processing complicated.

Therefore, the present invention provides a mixing and combination weighing and counting device aimed at solving the problems of the prior art.

(Means for Solving the Problems) The mixing and combination weighing and counting device of the present invention is configured as follows. That is, it is equipped with a large number of weighing machines consisting of a plurality of groups with a plurality of weighing machines as one group, weighs separate items for each group, and calculates the weight and number of each weighed item in combination, means for calculating and storing a plurality of first combinations equal to or close to a set number; and further calculating a combination of the plurality of first combinations selected for each of these groups to obtain a second combination. , means for selecting a set of optimal combinations that are equal to or close to the set sum of numbers and equal to or close to the set sum of weights.

(Function) By having the above configuration, the present invention can select one optimal combination by one calculation process, regardless of whether there is a combination that matches the set number of items in multiple groups, and the matching combination can be selected. Since there is no need to change the set number or recalculate when there is no data, calculation processing becomes simple and high-speed processing can be realized.

(Example) Hereinafter, one embodiment of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram showing a schematic configuration of the present invention.

In the figure, 1 and 2 are items from different groups,
For example, there are multiple weighing machine groups that weigh two groups of items G, G2, and in the example shown in the figure, there are seven weighing machines, 3 is a multiplexer, 4 is an A/D converter, and 5 is a calculation unit consisting of a CPU, ROM, RAM, etc. The controllers 6 and 7 are setting units corresponding to the weighing machine groups 1 and 2, and the target number, upper limit number, lower limit number, unit weight, target weight, upper limit weight, and lower limit weight are set.

Next, the operation of this device will be explained. For example, when weighing items in group G1, the setting unit 6
By inputting the setting value of each item using keys etc.,
stored in memory. Items in group G1 are G1, ~
It is weighed by the G 1 y weighing machine, and the multiplexer 3
reads out the weight of each weighing machine in sequence according to a switching signal from the arithmetic control section, and the weight converted into a digital value by the A/D converter 4 is input to the arithmetic control section 5. In the calculation control section,
The number of pieces is obtained by dividing the weight by a preset unit weight, and a combination calculation is performed according to a predetermined pattern to obtain and store a plurality of combinations whose number of pieces is equal to or close to the set number of group G1.

Regarding the items of group G2, each weighing machine G22~G
The number of pieces is determined from the weight obtained in step 27, a combination calculation is performed, and a plurality of combinations whose number of pieces is equal to or close to the set number are determined and stored.

After performing the storage process for the optimal combination for the items in groups G1 and 02, the stored values for groups G1 and 62 are combined, and the set number of items for group G1 and group G2 are combined.
A value equal to or close to the sum of the set number of pieces, and equal to or close to the set weight of G1 and 02.
Select a combination of pairs.

Figure 2 shows 7 items each in groups G and 02 (
7 is a flowchart showing a procedure performed by a weighing machine with 7 heads.

Next, this flowchart will be explained.

(a) Items in group G1 are weighed using seven weighing machines, and (2'-1) = 127 weight combinations are performed and stored in memory.

(b) Divide the weight by the unit weight to find the number of pieces, and similarly 127
Execute the exact number combination and store it in memory.

(c) From the weight development data obtained in (a) above, calculate the combined weight - set weight = deviation weight (WDV), and if lower limit set weight value ≦WDV ≦ upper limit set weight value, W
DV is stored, and if WDV is outside this range, infinity is stored.

(d) From the number expansion data obtained in (b) above, calculate the combination number - set number = deviation number (ND V), and if lower limit set number ≦ NDV ≦ upper limit set number, ND
V is stored, and if NDV is outside this range, infinity is stored.

(e) Sort the number of deviations (NDV) obtained in the above (d) in descending order, and select 16 combinations close to the set number. At that time, if the deviations are the same, the above (
Compare the weight deviations obtained in step c) and select the one with the smaller weight deviation (closer to the set target).

(a' to e') Processes a' to e are performed for the items in group G2 in the same way as for the items in group G1.

(f) Group G selected in (e) and (e') above
,, counting combinations of G2 items, (16 ways) GIX (16 ways) G2=2511i
Find the number combinations in the street.

(g) Based on the patterns found in (e) and (e') above, find (16 ways) GIX (16 ways) G2 = 256 weight combinations.

(h) From the data obtained in (f) and (g) above, the preset number of group G1 and group G
The optimal combination is selected that is equal to or closest to the sum of the set numbers of groups G, .

In addition, in the above process of selecting the optimal combination, if the extracted combination has the same deviation as the minimum one,
The sums of the absolute values of the numbers of deviation data obtained in (d) and (d') above are compared.

If the results are the same or smaller than the minimum deviation, compare the deviation weights obtained in (g) above, and if the results are smaller, replace the patterns and the deviation data, and continue until the optimal combination is obtained. Repeat.

Figures 3 (a) and (b) are explanatory diagrams showing the results of sorting by (e) and (e') in Figure 2 and an example of the processing in (f), (g), and (h). be. It is assumed that the respective setting values for the items of group G1 and the items of group G2 are determined as shown in FIG. 3(a).

FIG. 3(b) shows an example of selecting one optimal combination from the combinations of ■ to [phase] of the items in group G1 and the combinations of []-4] of the items in group G2 in the process of (h). This is explained by:

(1) Combination ■ and Problem (a) Sum of number deviations for combinations = 0 + 0 = 0 pieces (b) Sum of absolute value of combination number deviations = 101 + 101 - 0 pieces (c) Sum of combination weight deviations = +5 - 4 = 5 -4 = 1 combination @ and (4) (a) Sum of combination number deviations = +1-1 = O pieces (b) Absolute value sum of combination number deviations = 1 + 11 + 1-11 = 2 pieces (c) Sum of combination weight deviations =+20-11=9g(3)
Combination @ and stones (a) Sum of combination number deviations = +1-2--1 piece (b) Absolute value sum of combination number deviations = l + 11 + 1-21 = 3 pieces (c) Sum of combination weight deviations - + 220-20 = OHere, the priority order conditions are: (A) The sum of the number deviations is zero.

(B) There are 2 combinations where the sum of the number deviations in (1) above is τ
If there are more than one set, the one with the smaller sum of the absolute values of the number deviations.

(C) If the sum of the numbers is the same, the sum of the weight deviations is larger.

Therefore, in the above example, the priority is (1).

The order is (2) and (3), and the optimal combination is (1)
is selected.

By the way, if there is no combination of items in group G1 with a number deviation of zero, then the number deviation of G is +1, -1, . +2.
-2. ... etc. and the number deviation of group G2 is O,
+1. -1. +2. -2, . . . , and the sum of the number of deviations is equal to or close to zero, and the sum of the deviation weights is equal to or close to the sum of the deviation weights, and a combination is selected as the optimal combination.

Furthermore, if there is no combination in which the number deviation of both groups G, G2 is a drop, the number deviation of group G1 is +1. -1
．． +2. . . . and the number deviation of group G2 is +1. -1. +2. ..., etc., and select one set of optimal combinations.

In the above explanation, the number deviation and weight deviation of the items in each group are calculated and stored, but instead of these deviations, the combined number and combined weight of group G, and the combined number and combination of group G2 are calculated and stored. Remember the weight, G1 and 02
It is also possible to select an optimal combination by combining the following.

Although the gist of the present invention has been described above with reference to specific embodiments thereof, it is clear that various modifications or modifications of the present invention based on what has been described above are possible.

(Effects of the Invention) As explained above, according to the present invention, even if there is a combination that matches the set number of items in each group or not,
The optimum combination can be selected by performing both calculations once, and the calculation processing can be executed quickly. Furthermore, if there is no combination that matches the set number, the optimal combination is selected from the combinations that are close to the set number, eliminating the need to change the set number and recalculating, and simplifying the process.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing a schematic configuration of the present invention, FIG. 2 is a flowchart, and FIGS. 3(a) and 3(b) are explanatory diagrams. 1.2... Weighing machine group, 3... Multiplexer, 4... A/D converter, 5... Arithmetic control unit, 6゜7
...Settings section.

Claims (1)

[Claims] It is equipped with a large number of weighing machines consisting of a plurality of weighing machines as one group, and each group weighs a separate item, calculates the combination of the weight and number of each weighed item, and calculates the set number of pieces. the first equal to or close to
means for calculating and storing a plurality of combinations, and further calculating a combination of the plurality of first combinations selected for each group to obtain a second combination, which is equal to or close to the set sum of numbers. 1. A mixing and combination weighing and counting device, comprising means for selecting a set of optimal combinations that are equal to or close to a set weight sum.