JP4467015B2 - Material assortment system - Google Patents

Description

  The present invention relates to a material assembling system, a material assembling program, a recording medium, a material assembling method, and a precut device.

For pre-cutting of house structural materials, raw materials of several types of length (3 m to 6 m) are prepared for each specification such as cross-sectional shape, tree type, grade, and layer. A member (product) of a predetermined length is cut out from there. In the case of a general-sized house, there are about 20 types of structural materials called horizontal members such as beams, girders, and foundations. An average of 10 of these structural materials are cut out from several lengths of raw materials prepared for each product specification, and about 200 products are cut out for the total of one building. Depending on the product specifications, the product size, and the combination of raw materials to be cut out, the amount of waste (remaining material) that is cut off from the raw materials differs. Therefore, a technique for improving the material assembling method has been developed (see Patent Document 1).
Japanese Patent No. 3565262

  The purpose of the calculation of the material assembling method as described above is to cut out a required product with a small amount of raw materials (the highest yield) from a raw material group of several lengths prepared for each product specification. Various other technologies have been developed, and it is generally said that the primary yield at a precut factory using these technologies is approximately 90%. In the case of a building designed and produced according to a certain standard, the yield can be further improved by determining the size of the structural material suitable for the size of the raw material. However, when a structural material is cut out from a raw material based on a variety of designs by custom production, development of a calculation method that further improves the yield is required. In fact, a large amount of waste can be reduced simply by improving the yield by 1%.

  There is a known bin packing problem of minimizing the number of bins used when a given group of items is placed in a fixed volume bin. One solution to this problem is called the Minimum Bin Slack method (MBS method). This MBS method is a method of finding a combination having the smallest slack by putting all the items in the bin into the round robin. Each item is applied to the bin one after another until all items are placed in the bin. An object of the present invention is to apply this known solution to improve the combination of materials of a plurality of material types so as to obtain a high yield. Furthermore, a complicated calculation process for obtaining an optimum value requires a long calculation time. The present invention provides a material assembling system, a material assembling program, a recording medium, a material assembling method, and a precut device that can obtain optimum values equivalent to those of various superior methods that precede in a short calculation processing time. For the purpose.

The following configurations are means for solving the above-described problems.
<Configuration 1>
Material data in which materials for allocating products are arranged in descending order of the length is stored, and products P = {P (1), P (2)... P (n)} to be allocated are in descending order of the length. Storage means for storing the product data to be allocated arranged in the above, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing; An initial allocating unit that selects one of the materials from the storage unit and always allocates the longest product that can be allocated to the material, and the length of s products currently allocated to the selected material It is determined whether the total length LQ matches the length b of the material. If LQ = b, the currently assigned product list Q is set as the optimum allocation result Ak for the material, and the Ak (that Result) The process of storing the allocation candidate data for the selected material is finished, and if LQ = b, the process proceeds to the process by the next allocation possibility determination unit, and the optimal allocation determination unit and the product P (j) When assigned to Q (s), determine whether the total LQ length of currently assigned s products is less than the selected material length b, and if LQ <b, then s = Proceed to the provisional allocation result storage means as s + 1, and if LQ <b, proceed to the process of the separate product allocation means, the allocation availability determination means, and the total length LQ of the products currently allocated to the material The maximum value L _max of the total product lengths (total product lengths) temporarily allocated so far (the total product length) is compared, and if LQ> L _max , L _max = LQ and L _max Product length Compare the above-mentioned j and n with temporary allocation result storage means for replacing the total Q (total product length) LQ and storing the currently allocated (allocated) product list Q as the temporary allocation result Ak. Thus, it is determined whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s), and the process of the optimal allocation determination means the return, j <else n, the process proceeds to allocation changing means compares a separate product allocation unit, and a minimum value s _min and s preset s, if s = s _min, already The result saved as Ak is saved as a provisional assignment result (the result is assigned), and if s = s _min , s = s-1 is set, and the product assigned immediately before is assigned. take Then, the allocation changing means for returning to the processing of the different product allocation means, the temporary allocation trial means for repeatedly trying the storage process of the allocation candidate data for a plurality of materials, and the allocation candidate data stored for a plurality of materials In comparison, according to the allocation pass / fail criterion, the allocation determination means that adopts any allocation candidate data as allocation data of the corresponding product, and the remaining unallocated products are regarded as new allocation target products, and the allocation candidate data The allocation data acquisition process from the storage process to the process of the allocation determination unit is repeated. During the repetition of the allocation data acquisition process by the repeated allocation unit and the repetition allocation unit, the current allocation data acquisition process is repeated twice. For all products in the allocation data acquisition process A final adjustment timing determination means for determining the final adjustment timing for ending allocation, and a plurality of allocation pattern candidates for allocating the remaining unallocated products before acquisition of the current allocation data to any material when the final adjustment timing is determined. A material assembling system comprising: final adjustment means for executing final adjustment processing for acquiring and comparing the allocation pattern that minimizes the material length to be used in the allocation data of the corresponding product.

  First, the longest product is assigned to one selected material, and the remaining product is temporarily assigned to the remaining material. An allocation method that minimizes the remaining material for the material is found and used as allocation candidate data. Similar calculation processing is performed for another material to obtain a plurality of allocation candidate data. A plurality of allocation candidate data are compared, and the best provisional allocation method is selected on the basis of the maximum yield or the minimum remaining material length to obtain allocation data. Furthermore, the remaining unallocated products will be allocated in the same manner. Immediately before the end of this repeated allocation data acquisition process, the temporary allocation process according to the conventional method is interrupted. The time when allocation can be completed for all products in two allocation data acquisition processes is determined as the final adjustment timing. There may be an allocation method that ends with the remaining two times, and an allocation method that ends with the remaining three or four times. In any case, an allocation pattern that allocates the remaining unallocated product to any material is obtained by an arbitrary method. Then, an allocation pattern that minimizes the material length used is employed. As a result, it is possible to prevent wrinkling at the end because the optimal allocation is selected at the beginning.

<Configuration 2>
Material data in which materials for allocating products are arranged in descending order of the length is stored, and products P = {P (1), P (2)... P (n)} to be allocated are in descending order of the length. Storage means for storing the product data to be allocated arranged in the above, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing; An initial allocating unit that selects one of the materials from the storage unit and always allocates the longest product P (j) that can be allocated to the material, and the product P (j). The total length of all products P (j) to P (n) shorter than j) is obtained, and the total is compared with the length b of the material. The length b of the material is the length of the product. P (j), ... P (n) is stored in Ak as the final allocation result. To determine whether the total length LQ of s products currently assigned to the selected material matches the length b of the material, and if LQ = b, The assigned product list Q is set as the optimum allocation result Ak for the material, the Ak (result thereof) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and LQ = If not b, the optimal allocation determination means that proceeds to the processing of the next temporary allocation result storage means, the total LQ of the lengths of the products currently allocated to the material, and the products that have been temporarily allocated in the past (to date) Are compared with the maximum value L _max of the total length (product length total), and if LQ> L _max , L _max = LQ and L _max is the total length of the current product (total product length) ) Replace with LQ, save the currently assigned (allocated) product list Q as the temporary allocation result Ak, and the allocation space Slack = b for the allocation result stored in Ak -LQ is calculated, and the allocation margin Sack is compared with the product length of the smallest product P (n). When the allocation margin Sack is less than the product length of the smallest product P (n), j = n is assigned. When the margin Slack is equal to or greater than the product length of the smallest product, the product length is compared with the allocation margin Slack from the product P (j) to P (n-1) in order, and the longest assignable product is detected. Then, s is set to (s + 1), and the process proceeds to the processing of the next separate product allocating means, and the above-mentioned j and n are compared with the surplus length determining means to determine whether allocation is possible for all products (provisional allocation) If j <n, the product P (j + 1) is newly assigned to Q (s) and returned to the optimum assignment determination means. If j <n, the assignment is made. Comparing the different product allocating means, which proceeds to the processing of the changing means, with the preset minimum value s _min and s of s, and if s = s _min , the result already stored as Ak is ( As a temporary allocation result, the result is saved as allocation candidate data. If s = s _{min is} not set, s = s-1 is set, and an allocation margin Slack is calculated in a state where allocation of the product allocated immediately before is canceled. If this allocation margin Slack is less than twice the length of the smallest product P (n), j = n, and if the allocation margin Sack is more than twice the length of the smallest product P (n). Once judged, An allocation changing means for detecting the longest product that can be assigned to the margin Sack together with P (n) and returning it to the processing of another product allocation means after being assigned to the next allocation; Compare the temporary allocation trial means for repeatedly trying multiple materials with the above-mentioned allocation candidate data stored for multiple materials, and adopt any allocation candidate data as allocation data for the corresponding product according to the allocation pass / fail judgment criteria Repetitive allocation means for repeating the allocation data acquisition processing from the allocation candidate data storage processing to the processing of the allocation determination means, considering the remaining unallocated products as new allocation target products, Repeated allocation data acquisition processing by repeated allocation means During the return, when the final adjustment time determination means for determining the final adjustment time for ending the allocation for all products in the two allocation data acquisition processes including the current allocation data acquisition process, and when the final adjustment time is determined , Obtain and compare multiple assignment pattern candidates that assign the remaining unassigned products to any material before obtaining the current assignment data, and use the assignment pattern that minimizes the material length to be used for the assignment data of the corresponding product And a final adjustment means for executing a final adjustment process.

  The first allocation quality determination criterion includes the expectation that a criterion “maximum allocated product length” is selected and a good result is obtained later. Furthermore, the one with the lowest yield is selected as the second allocation quality criterion. If the final yield is the same, the worse the yield in the first allocation, the better the yield in the subsequent allocation.

<Configuration 3>
In the material arrangement system according to Configuration 1 or 2, when the final adjustment time determination unit stores any of the allocation candidate data in a storage device, the total length of the remaining unallocated products is the longest material. The material assembling system is characterized in that when it is equal to or less than the length (material length), the final adjustment time is determined.

  Each time allocation candidate data is acquired, the total length of the remaining unallocated products is compared with the material length of the longest material. If all the remaining products can be allocated to the longest material, allocation can be completed for all the products in the remaining two allocation data acquisition processes.

<Configuration 4>
In the material assembling system according to any one of Configurations 1 to 3, the temporary allocation trial unit can allocate a material to a material when the material is selected and the initial allocation unit cannot temporarily allocate the longest product. A material assembling system characterized in that the next longest (longest) product is regarded as the longest product and the allocation candidate data is stored.

  When the longest product cannot be provisionally assigned first, the next longest product that can be assigned to the material can be provisionally assigned, and options for adopting the assignment data can be increased.

<Configuration 5>
In the material assembling system according to any one of Configurations 1 to 4, the allocation determination means regards the remaining unallocated products as new allocation target products for the plurality of allocation candidate data stored in the storage device. The allocation data acquisition process is repeated to finish the allocation process for all products, and the result of the allocation process for the plurality of allocation candidate data is compared according to a predetermined allocation pass / fail criterion, and the plurality of allocation candidate data A material assembling system that repeats the process of adopting any of the above as allocation data for the corresponding product.

  In order to employ any of the plurality of allocation candidate data, the final allocation processing end result when each allocation candidate data is employed is actually calculated and compared. It is possible to adopt allocation candidate data that is expected to finally obtain a good yield.

<Configuration 6>
In the material arrangement system according to Configuration 5, the allocation determination unit calculates a yield in the final result of the allocation process, and assigns allocation candidate data when the yield is maximized to allocation data of the corresponding product. A material assembling system characterized by using an allocation pass / fail criterion.

  The yield in the final allocation processing end result may be calculated from the sum of all product lengths and the sum of all material lengths.

<Configuration 7>
In the material assembling system described in Structure 6, the allocation determining means adopts the one having the maximum yield of only allocation candidate data when the quality determination cannot be made even if the yield in the final result of the allocation process is compared. When the quality determination is still impossible, the material assembling system is characterized in that the quality determination is performed so that the product with the largest allocation product length of only allocation candidate data is adopted.

  When the allocation candidate data is judged to be good or bad according to the final result of the allocation process, if the final yield is equal, only the allocation candidate data may be compared. At that time, the yields of the allocation candidate data are compared, and if that still fails, the one with the maximum allocation product length is adopted. By such control, optimization and automation including determination processing can be achieved.

<Configuration 8>
In the material assembling system described in Structure 6, when the allocation determination means cannot determine pass / fail even if the yield in the final result of the allocation process is compared, the allocation product length of the allocation candidate data alone is the largest. A material assembling system, which adopts a pass / fail judgment so that the yield of only the temporary allocation result is adopted when the pass / fail judgment is still impossible.

  The criterion for comparing the provisional allocation results was reversed from that in Configuration 6. Depending on the case, a method that can obtain any good result may be adopted.

<Configuration 9>
In the material assembling system described in Structure 6, when the allocation determination means cannot determine pass / fail even if the yield in the final result of the allocation process is compared, the allocation product length of the allocation candidate data alone is the largest. A material assembling system characterized by adopting a pass / fail judgment so that a yield with only a temporary allocation result is adopted when the pass / fail judgment is still impossible.

  This method is adopted because the yield that is poor in the first allocation may improve the yield in the subsequent allocation.

<Configuration 10>
The computer stores material data in which materials for allocating products are arranged in descending order of the length, and the product P = {P (1), P (2)... P (n)} to be allocated is stored in the computer. Stores product data to be allocated arranged in descending order of length, and stores information indicating products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. Means, an initial allocating means for selecting one of the materials from the storage means and allocating the longest product that can be allocated to the material, and s number of items currently allocated to the selected material. It is determined whether the total product length LQ and the material length b match, and if LQ = b, the currently assigned product list Q is set as the optimum allocation result Ak for the material, Divide Ak (the result) The allocation candidate data is stored as the allocation candidate data, and the allocation candidate data storage process for the selected material is terminated. If LQ = b, the process proceeds to the next allocation possibility determination unit, the optimal allocation determination unit, and the product P (j ) Is assigned to Q (s), it is determined whether the total LQ length of the currently assigned s products is less than the selected material length b, and if LQ <b, The process proceeds to the provisional allocation result storage means with s = s + 1. If LQ <b, the process proceeds to the process of another product allocation means, and the sum of the lengths of the products currently allocated to the material. and LQ, is compared with the maximum value _{L max} of the past (to date) to the sum of the lengths of the tentative allocation has been products (total length), _{LQ> L max if, L} max = _{L max} as LQ Is replaced with the total length of the current product (total product length) LQ, and the currently assigned (allocated) product list Q is stored as a temporary allocation result Ak, and the above j And n are compared to determine whether or not the allocation possibility determination (provisional allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s), Returning to the process of the optimal allocation determination means, if j <n, the process proceeds to the process of the allocation change means. The other product allocation means is compared with the preset minimum value s _min and s of s, and s = If it is s _min , the result that has already been saved as Ak is saved as a provisional assignment result (the result is assigned), and if it is not s = s _min , then s = s−1 and immediately before Assigned products Allocation changing means for canceling allocation and returning to processing of another product allocation means, temporary allocation trial means for repeatedly trying the storage process of the allocation candidate data for a plurality of materials, and the allocation candidates stored for a plurality of materials Compare the data, and in accordance with the assignment pass / fail judgment criteria, the assignment determination means that adopts any assignment candidate data to the assignment data of the corresponding product and the remaining unassigned products are regarded as new assignment products, and the above assignment Repeat the allocation data acquisition process from the candidate data storage process to the process of the allocation determination unit, and repeat the allocation data acquisition process by the repeated allocation unit, including the current allocation data acquisition process. In the allocation data acquisition process A final adjustment timing determination means for determining the final adjustment timing for ending the allocation for all products, and a plurality of allocations of the remaining unallocated products before acquisition of the current allocation data to any material when the final adjustment timing is determined. A material assembling program that acquires and compares allocation pattern candidates, and functions as final adjustment means for executing final adjustment processing that uses an allocation pattern that minimizes the material length to be used for allocation data of a corresponding product.

<Configuration 11>
The computer stores material data in which materials for allocating products are arranged in descending order of the length, and the product P = {P (1), P (2)... P (n)} to be allocated is stored in the computer. Stores product data to be allocated arranged in descending order of length, and stores information indicating products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. Means, an initial allocating means for selecting one of the materials from the storage means and allocating the longest product that can be allocated to the material, and s number of items currently allocated to the selected material. It is determined whether the total product length LQ and the material length b match, and if LQ = b, the currently assigned product list Q is set as the optimum allocation result Ak for the material, Divide Ak (the result) The allocation candidate data is stored as the allocation candidate data, and the allocation candidate data storage process for the selected material is terminated. If LQ = b, the process proceeds to the next allocation possibility determination unit, the optimal allocation determination unit, and the product P (j ) Is assigned to Q (s), it is determined whether the total LQ length of the currently assigned s products is less than the selected material length b, and if LQ <b, The process proceeds to the provisional allocation result storage means with s = s + 1. If LQ <b, the process proceeds to the process of another product allocation means, and the sum of the lengths of the products currently allocated to the material. and LQ, is compared with the maximum value _{L max} of the past (to date) to the sum of the lengths of the tentative allocation has been products (total length), _{LQ> L max if, L} max = _{L max} as LQ Is replaced with the total length of the current product (total product length) LQ, and the currently assigned (allocated) product list Q is stored as a temporary allocation result Ak, and the above j And n are compared to determine whether or not the allocation possibility determination (provisional allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s), Returning to the process of the optimal allocation determination means, if j <n, the process proceeds to the process of the allocation change means. The other product allocation means is compared with the preset minimum value s _min and s of s, and s = If it is s _min , the result that has already been saved as Ak is saved as a provisional assignment result (the result is assigned), and if it is not s = s _min , then s = s−1 and immediately before Assigned products Allocation changing means for canceling allocation and returning to processing of another product allocation means, temporary allocation trial means for repeatedly trying the storage process of the allocation candidate data for a plurality of materials, and the allocation candidates stored for a plurality of materials Compare the data, and in accordance with the assignment pass / fail judgment criteria, the assignment determination means that adopts any assignment candidate data to the assignment data of the corresponding product and the remaining unassigned products are regarded as new assignment products, and the above assignment Repeat the allocation data acquisition process from the candidate data storage process to the process of the allocation determination unit, and repeat the allocation data acquisition process by the repeated allocation unit, including the current allocation data acquisition process. In the allocation data acquisition process A final adjustment timing determination means for determining the final adjustment timing for ending allocation for all products, and a plurality of allocations of the remaining unallocated products before acquisition of the current allocation data to any material when the final adjustment timing is determined. A computer recording a material assembling program that functions as a final adjustment means that executes final adjustment processing that obtains and compares allocation pattern candidates and compares the allocation pattern that minimizes the material length used in the allocation data of the corresponding product. -Readable recording media.

<Configuration 12>
The storage means stores material data in which materials for allocating products are arranged in descending order of the length, and products P = {P (1), P (2)... P (n)} to be allocated are stored. The allocation target product data arranged in descending order of the length is stored, and information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing is stored. A step in which an initial allocation means selects one of the materials from the storage means and assigns the longest product that can be allocated to the material; and an optimal allocation determination means includes the selected material. It is determined whether the total length LQ of the s products currently allocated to the number L matches the length b of the material. If LQ = b, the list Q of currently allocated products is determined as the material. Allocation result A for And saving the Ak (result thereof) as allocation candidate data, ending the allocation candidate data storage process for the selected material, and if not LQ = b, proceeding to the process by the next allocation availability determination means; When the product P (j) is assigned to Q (s), whether the total LQ of the lengths of s products currently assigned is less than the length b of the selected material. If LQ <b, it is determined that s = s + 1, and the process proceeds to the provisional allocation result storage means. If LQ <b, the process proceeds to the process of the separate product allocation means, and the material is currently allocated. the total LQ length of the product are, past (until now) to the temporary dividing the provisional allocation result storage means, compares the maximum value L _max of the total length of the attached to products (products total length) If _{LQ> L max, L max} = the sum of the length of this product _{L max} as LQ (product total length) replaced by LQ, (assigned) are currently allocated temporary allocation results list Q products The step of saving as Ak and the separate product allocating means compare the above j and n to determine whether the allocation feasibility determination (provisional allocation) has been completed for all products, and if j <n, P (j + 1) is newly allocated to Q (s) and returned to the process of the optimal allocation determination means. If j <n, the step of proceeding to the process of the allocation changing means and the allocation changing means are preset. by comparing the minimum value _{s min} and s of s, if _{s = s min,} (a) as Ak previously saved results (and tentative allocation results, and the results) as allocation candidate data Resides, s = s _min Otherwise, the s = s-1, and returning from the cancel the allocation of products allocated immediately before the processing of another product allocation means, is provisionally allocated trial unit, the allocation candidate data The step of repeatedly trying the storage process for a plurality of materials and the allocation determination means compare the allocation candidate data stored for a plurality of materials, and assign any of the allocation candidate data according to the allocation pass / fail criterion. Steps adopted in the allocation data of the products to be assigned and the repeated allocation means regard the remaining unallocated products as new allocation target products, and obtain allocation data from the allocation candidate data storage process to the allocation determination means process The step of repeating the process and the final adjustment timing determination means Determining the final adjustment timing for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process during the repetition of the allocation data acquisition process by the allocation means; When it is determined that it is the final adjustment time, obtain and compare multiple allocation pattern candidates that allocate the remaining unallocated products before acquiring the current allocation data to any material, and compare the allocation pattern that minimizes the material length used. And a step of executing a final adjustment process adopted for the allocation data of the corresponding product.

<Configuration 13>
Material data in which materials for allocating products are arranged in descending order of the length is stored, and products P = {P (1), P (2)... P (n)} to be allocated are in descending order of the length. Storage means for storing the product data to be allocated arranged in the above, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing; An initial allocating unit that selects one of the materials from the storage unit and always allocates the longest product that can be allocated to the material, and the length of s products currently allocated to the selected material It is determined whether the total length LQ matches the length b of the material. If LQ = b, the currently assigned product list Q is set as the optimum allocation result Ak for the material, and the Ak (that Result) The process of storing the allocation candidate data for the selected material is finished, and if LQ = b, the process proceeds to the process by the next allocation possibility determination unit, and the optimal allocation determination unit and the product P (j) When assigned to Q (s), determine whether the total LQ length of currently assigned s products is less than the selected material length b, and if LQ <b, then s = Proceed to the provisional allocation result storage means as s + 1, and if LQ <b, proceed to the process of the separate product allocation means, the allocation availability determination means, and the total length LQ of the products currently allocated to the material The maximum value L _max of the total product lengths (total product lengths) temporarily allocated so far (the total product length) is compared, and if LQ> L _max , L _max = LQ and L _max Product length Compare the above-mentioned j and n with temporary allocation result storage means for replacing the total Q (total product length) LQ and storing the currently allocated (allocated) product list Q as the temporary allocation result Ak. Thus, it is determined whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s), and the process of the optimal allocation determination means the return, j <else n, the process proceeds to allocation changing means compares a separate product allocation unit, and a minimum value s _min and s preset s, if s = s _min, already The result saved as Ak is saved as a provisional assignment result (the result is assigned), and if s = s _min , s = s-1 is set, and the product assigned immediately before is assigned. take Then, the allocation changing means for returning to the processing of the different product allocation means, the temporary allocation trial means for repeatedly trying the storage process of the allocation candidate data for a plurality of materials, and the allocation candidate data stored for a plurality of materials In comparison, according to the allocation pass / fail criterion, the allocation determination means that adopts any allocation candidate data as allocation data of the corresponding product, and the remaining unallocated products are regarded as new allocation target products, and the allocation candidate data The allocation data acquisition process from the storage process to the process of the allocation determination unit is repeated. During the repetition of the allocation data acquisition process by the repeated allocation unit and the repetition allocation unit, the current allocation data acquisition process is repeated twice. For all products in the allocation data acquisition process A final adjustment timing determination means for determining the final adjustment timing for ending allocation, and a plurality of allocation pattern candidates for allocating the remaining unallocated products before acquisition of the current allocation data to any material when the final adjustment timing is determined. Obtain and compare, and select the material using the final adjustment means that executes final adjustment processing that uses the allocation pattern that minimizes the material length to be used for the allocation data of the corresponding product, and the allocation data. A precut device comprising a material selection supply device and a material cutting device for precutting a product assigned to the material.

<Configuration 14>
The computer stores material data in which materials for allocating products are arranged in descending order of the length, and the product P = {P (1), P (2)... P (n)} to be allocated is stored in the computer. Stores product data to be allocated arranged in descending order of length, and stores information indicating products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. Means, an initial allocating unit that selects one of the materials from the storage unit, and always allocates the longest product P (j) that can be allocated to the material, and the product P (j), The sum of the lengths of all products P (j) to P (n) shorter than the product P (j) is obtained, the total is compared with the length b of the material, and the length b of the material is the product. P (j),... P (n) is the final allocation result Then, the process is terminated by storing in Ak, and it is determined whether the total length LQ of the s number of products currently allocated to the selected material matches the length b of the material, If LQ = b, the currently assigned product list Q is set as the optimum allocation result Ak for the material, the Ak (result) is stored as allocation candidate data, and the allocation candidate data is stored for the selected material. If LQ = b is not satisfied, the optimal allocation determination means that proceeds to the processing of the next temporary allocation result storage means, the total LQ of the lengths of products currently allocated to the material, and the past (to date) Is compared with the maximum value L _max of the total length of products temporarily allocated to (total product length), and if LQ> L _max , L _max = LQ and L _max of the current product length For the allocation result stored in the temporary allocation result storage means that replaces the total (product length total) LQ and stores the currently allocated (allocated) product list Q as the temporary allocation result Ak. The allocation margin Sack = b−LQ is calculated, and the allocation margin Sack is compared with the product length of the smallest product P (n). When the allocation margin Sack is less than the product length of the smallest product P (n), j = N, and when the allocation margin Sack is equal to or greater than the product length of the smallest product, the product length and the allocation margin Sack are compared in order from the product P (j) to P (n-1), and allocation is possible. The longest product is detected, s is set to (s + 1), and the process proceeds to the next separate product allocating means. The extra length discriminating means is compared with the above j and n, and all products are allocated. It is determined whether or not the determination (provisional allocation) has been completed. If j <n, the product P (j + 1) is newly allocated to Q (s) and returned to the processing of the optimal allocation determination unit, and j <n Otherwise, the process of the allocation changing means proceeds to another product allocation means, and the preset minimum value s _min and s of s are compared. If s = s _min, it is already stored as Ak. The result is stored as candidate allocation data (the result is a provisional allocation result). If s = s _{min is} not satisfied, s = s-1 is set, and the allocation of the product allocated immediately before is canceled. The margin Sack is calculated. When the allocation margin Sack is less than twice the length of the smallest product P (n), j = n is set, and the length of the product P (n) having the smallest allocation margin Sack is 2 It is more than double The allocation changing means for detecting the longest product that can be allocated to the allocation margin Sack together with P (n) and returning it to the next allocation target process before returning to the processing of another product allocation means; The temporary allocation trial means for repeatedly trying the storage process for a plurality of materials is compared with the above allocation candidate data stored for a plurality of materials, and any allocation candidate data is assigned to the corresponding product according to the allocation pass / fail judgment criteria. Iterative allocation that repeats the allocation data acquisition process from the allocation candidate data storage process to the above allocation determination means process, considering the allocation determination means adopted for the allocation data and the remaining unallocated products as new allocation target products And the allocation data by the above repeated allocation means A final adjustment timing determination means for determining a final adjustment timing for ending allocation for all products in two allocation data acquisition processes including a current allocation data acquisition process, and a final adjustment timing; When a decision is made, multiple allocation pattern candidates that allocate the remaining unallocated product before acquisition of the current allocation data to any material are acquired and compared, and the allocation pattern that minimizes the material length used is determined for the corresponding product. A material assembling program that functions as a final adjustment means for executing a final adjustment process to be adopted for allocation data.

<Configuration 15>
The computer stores material data in which materials for allocating products are arranged in descending order of the length, and the product P = {P (1), P (2)... P (n)} to be allocated is stored in the computer. Stores product data to be allocated arranged in descending order of length, and stores information indicating products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. Means, an initial allocating unit that selects one of the materials from the storage unit, and always allocates the longest product P (j) that can be allocated to the material, and the product P (j), The sum of the lengths of all products P (j) to P (n) shorter than the product P (j) is obtained, the total is compared with the length b of the material, and the length b of the material is the product. P (j),... P (n) is the final allocation result Then, the process is terminated by storing in Ak, and it is determined whether the total length LQ of the s number of products currently allocated to the selected material matches the length b of the material, If LQ = b, the currently assigned product list Q is set as the optimum allocation result Ak for the material, the Ak (result) is stored as allocation candidate data, and the allocation candidate data is stored for the selected material. If LQ = b is not satisfied, the optimal allocation determination means that proceeds to the processing of the next temporary allocation result storage means, the total LQ of the lengths of products currently allocated to the material, and the past (to date) Is compared with the maximum value L _max of the total length of products temporarily allocated to (total product length), and if LQ> L _max , L _max = LQ and L _max of the current product length For the allocation result stored in the temporary allocation result storage means that replaces the total (product length total) LQ and stores the currently allocated (allocated) product list Q as the temporary allocation result Ak. The allocation margin Sack = b−LQ is calculated, and the allocation margin Sack is compared with the product length of the smallest product P (n). When the allocation margin Sack is less than the product length of the smallest product P (n), j = N, and when the allocation margin Sack is equal to or greater than the product length of the smallest product, the product length and the allocation margin Sack are compared in order from the product P (j) to P (n-1), and allocation is possible. The longest product is detected, s is set to (s + 1), and the process proceeds to the next separate product allocating means. The extra length discriminating means is compared with the above j and n, and all products are allocated. It is determined whether or not the determination (provisional allocation) has been completed. If j <n, the product P (j + 1) is newly allocated to Q (s) and returned to the processing of the optimal allocation determination unit, and j <n Otherwise, the process of the allocation changing means proceeds to another product allocation means, and the preset minimum value s _min and s of s are compared. If s = s _min, it is already stored as Ak. The result is stored as candidate allocation data (the result is a provisional allocation result). If s = s _{min is} not satisfied, s = s-1 is set, and the allocation of the product allocated immediately before is canceled. The margin Sack is calculated. When the allocation margin Sack is less than twice the length of the smallest product P (n), j = n is set, and the length of the product P (n) having the smallest allocation margin Sack is 2 It is more than double The allocation changing means for detecting the longest product that can be allocated to the allocation margin Sack together with P (n) and returning it to the next allocation target process before returning to the processing of another product allocation means; The temporary allocation trial means for repeatedly trying the storage process for a plurality of materials is compared with the above allocation candidate data stored for a plurality of materials, and any allocation candidate data is assigned to the corresponding product according to the allocation pass / fail judgment criteria. Iterative allocation that repeats the allocation data acquisition process from the allocation candidate data storage process to the above allocation determination means process, considering the allocation determination means adopted for the allocation data and the remaining unallocated products as new allocation target products And the allocation data by the above repeated allocation means A final adjustment timing determination means for determining a final adjustment timing for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process, When a decision is made, multiple allocation pattern candidates that allocate the remaining unallocated product before acquisition of the current allocation data to any material are acquired and compared, and the allocation pattern that minimizes the material length used is determined for the corresponding product. A computer-readable recording medium having recorded thereon a material assembling program that functions as final adjusting means for executing final adjustment processing employed for allocation data.

<Configuration 16>
The storage means stores material data in which materials for allocating products are arranged in descending order of the length, and products P = {P (1), P (2)... P (n)} to be allocated are stored. The allocation target product data arranged in descending order of the length is stored, and information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing is stored. A step, an initial allocation means selecting one of the materials from the storage means, and allocating the longest product P (j) that can be allocated to the material; and an optimal allocation determination means, The total length of all products P (j) to P (n) including product P (j) and shorter than the product P (j) is obtained, and the total is compared with the length b of the material. When the length b of the material is equal to or greater than the total length of the products, P (j), .. P (n) is stored in Ak as the final allocation result, and the process is terminated. The total LQ of the lengths of the s products currently allocated to the selected material and the length b of the material If LQ = b, the currently assigned product list Q is set as the optimum allocation result Ak for the material, and Ak (the result) is stored as allocation candidate data and selected above. If the allocation candidate data storage process for the selected material is finished and LQ = b, the process proceeds to the next temporary allocation result storage means, and the temporary allocation result storage means is the product currently allocated to the material the total LQ length of, by comparing the maximum value L _max of the past (to date) to the sum of the lengths of the tentative allocation has been products (total length), LQ> L _max if, L _{ax =} Replace L _max total length of this product (product length total) LQ as LQ, and storing currently allocated to (the allocated) list of products Q as the temporary allocation result Ak, extra The length discriminating means calculates the allocation margin Slack = b−LQ for the allocation result stored in Ak, compares the allocation margin Slack with the product length of the smallest product P (n), and the allocation margin Slack is minimum. J = n when the product length of the product P (n) is less than the product length of the product P (n). Comparing the product length with the allocation room Slack, detecting the longest product that can be assigned, setting s to (s + 1) and proceeding to the processing of the next separate product assignment means; The attaching means compares the above j and n to determine whether or not the assignment possibility determination (provisional assignment) has been completed for all products. If j <n, the product P (j + 1) is newly assigned to Q ( s), the process returns to the process of the optimal allocation determination means. If j <n, the process proceeds to the process of the allocation change means, and the allocation change means sets the minimum values s _min and s of s set in advance. If s = s _min , the result that has already been stored as Ak is stored as a provisional allocation result, and the result is stored as allocation candidate data. If not s = s _min , s = s-1 is calculated, and an allocation margin Slack is calculated in a state in which the allocation of the product allocated immediately before is canceled, and when this allocation margin Slack is less than twice the length of the minimum product P (n), j = N If the allocation margin Slack is determined to be more than twice the length of the smallest product P (n), the longest product that can be allocated to the allocation margin Slack together with P (n) is detected and Step S for returning to the processing of the separate product allocating means after the allocation target, a step in which the temporary allocation trial means repeatedly tries the storage process of the allocation candidate data for a plurality of materials, and an allocation determination means for the plurality of materials Comparing the saved allocation candidate data and adopting any allocation candidate data in the allocation data of the corresponding product according to the allocation pass / fail judgment criteria, the remaining unallocated products are regarded as new allocation target products, Allocation data acquisition processing from the allocation candidate data storage processing to the allocation determination means processing The repeated allocation means step and the final adjustment timing determination means repeat the processing, and the allocation data acquisition process is repeated by all the allocation data acquisition processes including the current allocation data acquisition process during the repetition of the allocation data acquisition process by the repeat allocation means. A step of determining a final adjustment time for ending assignment for the product, and a plurality of assignments for assigning the remaining unallocated products before acquisition of the current assignment data to any material when the final adjustment means is determined to be the final adjustment time. Executing a final adjustment process in which pattern candidates are acquired and compared, and an allocation pattern that minimizes the material length to be used is applied to allocation data of the corresponding product.

<Configuration 17>
Material data in which materials for allocating products are arranged in descending order of the length is stored, and products P = {P (1), P (2)... P (n)} to be allocated are in descending order of the length. Storage means for storing the product data to be allocated arranged in the above, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing; An initial allocating unit that selects one of the materials from the storage unit and always allocates the longest product P (j) that can be allocated to the material, and the product P (j). The total length of all products P (j) to P (n) shorter than j) is obtained, and the total is compared with the length b of the material. The length b of the material is the length of the product. P (j), ... P (n) is stored in Ak as the final allocation result. To determine whether the total length LQ of s products currently assigned to the selected material matches the length b of the material, and if LQ = b, The assigned product list Q is set as the optimum allocation result Ak for the material, the Ak (result thereof) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and LQ = If not b, the optimal allocation determination means that proceeds to the processing of the next temporary allocation result storage means, the total LQ of the lengths of the products currently allocated to the material, and the products that have been temporarily allocated in the past (to date) Are compared with the maximum value L _max of the total length (product length total), and if LQ> L _max , L _max = LQ and L _max is the total length of the current product (total product length) ) Replace with LQ, save the currently assigned (allocated) product list Q as the temporary allocation result Ak, and the allocation space Slack = b for the allocation result stored in Ak -LQ is calculated, and the allocation margin Sack is compared with the product length of the smallest product P (n). When the allocation margin Sack is less than the product length of the smallest product P (n), j = n is assigned. When the margin Slack is equal to or greater than the product length of the smallest product, the product length is compared with the allocation margin Slack from the product P (j) to P (n-1) in order, and the longest assignable product is detected. Then, s is set to (s + 1), and the process proceeds to the processing of the next separate product allocating means, and the above-mentioned j and n are compared with the surplus length determining means to determine whether allocation is possible for all products (provisional allocation) If j <n, the product P (j + 1) is newly assigned to Q (s) and returned to the optimum assignment determination means. If j <n, the assignment is made. Comparing the different product allocating means, which proceeds to the processing of the changing means, with the preset minimum value s _min and s of s, and if s = s _min , the result already stored as Ak is ( As a temporary allocation result, the result is saved as allocation candidate data. If s = s _{min is} not set, s = s-1 is set, and an allocation margin Slack is calculated in a state where allocation of the product allocated immediately before is canceled. If this allocation margin Slack is less than twice the length of the smallest product P (n), j = n, and if the allocation margin Sack is more than twice the length of the smallest product P (n). Once judged, An allocation changing means for detecting the longest product that can be assigned to the margin Sack together with P (n) and returning it to the processing of another product allocation means after being assigned to the next allocation; Compare the temporary allocation trial means for repeatedly trying multiple materials with the above-mentioned allocation candidate data stored for multiple materials, and adopt any allocation candidate data as allocation data for the corresponding product according to the allocation pass / fail judgment criteria Repetitive allocation means for repeating the allocation data acquisition processing from the allocation candidate data storage processing to the processing of the allocation determination means, considering the remaining unallocated products as new allocation target products, Repeated allocation data acquisition processing by repeated allocation means During the return, when the final adjustment time determination means for determining the final adjustment time for ending the allocation for all products in the two allocation data acquisition processes including the current allocation data acquisition process, and when the final adjustment time is determined , Obtain and compare multiple allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material, and adopt the allocation pattern that minimizes the material length to be used for the allocation data of the corresponding product A final adjustment means for executing the final adjustment process, a material selection supply device for selecting the material using the allocation data, and a material cutting device for pre-cutting the product allocated to the material. A pre-cut device.

  In the present invention, a material is selected one by one, and a recursive algorithm developed to enable high-speed computation, the products sorted in order of length are combined and temporarily allocated. Try the same process on multiple materials and compare the results to find the optimal allocation method. Assign the remaining products in the same way. If this process is repeated until all products have been allocated, optimal allocation may not always be possible. This is because if you preempt a good allocation, wrinkles may come towards the end. Therefore, for example, when the shortest one product remains and is allocated to a long material and the processing is completed, the yield is extremely poor at the end. Therefore, the final adjustment time that satisfies a certain condition is determined, and the allocation is optimized at this final adjustment time. In addition, since there are multiple materials to be allocated, the number of options for selecting the optimal allocation is increased. Hereinafter, embodiments of the present invention will be described in detail for each example.

FIG. 1 is a block diagram of a material assembling system 10 according to the first embodiment.
The material assembling system 10 shown in the drawing is operated by a computer program installed in the computer 12. This system is used, for example, by a terminal device 16 connected to the computer 12 via the network 14. The terminal device 16 is provided, for example, in a precut factory that precuts building structural materials. The material assembling system 10 receives condition data for precut from the terminal device 16, executes assortment calculation processing, and returns allocation data. The terminal device 16 controls the precut device 17 using the returned allocation data. For the pre-cut device 17, for example, a mechanism as described in Patent Document 1 can be used. The entire computer 12 functioning as the material assembling system 10 may be integrated into the precut device 17.

  The main body case 3 of the computer 12 accommodates an arithmetic processing device 20 and a storage device 40. As shown in the figure, the arithmetic processing unit 20 executes initial assignment processing, temporary assignment trial means 24, assignment determination means 25, repeat assignment means 26, final adjustment time, in order to execute repeated assignment processing and output the result. Computer programs such as determination means 27, final adjustment means 28, and input / output data processing means 30 are installed. In addition, for temporary allocation processing during repetitive processing, computer programs such as optimum allocation determination means 31, allocation possibility determination means 32, temporary allocation result storage means 33, separate product allocation means 34, allocation change means 35, etc. are installed. Yes. These computer programs cooperate to execute arithmetic processing. In the storage device 40, as shown in the figure, material data 41, allocation target product data 42, allocation result 43, allocation data 44, unallocated product 45, allocation pattern 46, allocation candidate data 47, allocation quality determination criteria 50, allocation Data such as pass / fail judgment criteria 51 and parameters 52 are stored. These data are input by input means such as the keyboard 4 and the mouse 5 and processed by the input / output data processing means 30. Alternatively, it is generated by the operation of the above computer program and stored in the storage device 40. Prior to specific description of each part, computer hardware, a computer program, and data stored in the storage device 40 will be specifically described.

FIG. 2 is a hardware block diagram of a computer constituting the material assembling system 10.
The material assembling system 10 is configured by hardware as shown in the figure. As this hardware itself, a known computer can be adopted. As shown in the figure, an internal bus 110 housed in the main body case 3 of the computer 12 (FIG. 1) includes a CPU (Central Processing Unit) 111, a ROM (Read Only Memory) 112, and a RAM (Random Access Memory). 113, HDD (hard disk) 114, input / output interface 115, and network interface 116 are connected. A display 2, a keyboard 4, and a mouse 5 are connected to the input / output interface 115. A terminal device 16 of a precut factory is connected to the network interface 116 via the network 14. The terminal device 16 supplies the allocation data to the material selection supply device 120 of the precut device 17. As a result, the designated material is selected and supplied to the material cutting device 121 and is cut with the designated assignment. The cut product is conveyed and discharged by the product conveying device 122.

  The storage device 40 illustrated in FIG. 1 includes a ROM 112, a RAM 113, and an HDD 114. The arithmetic processing unit 20 illustrated in FIG. 1 includes a CPU 111, a ROM 112, a RAM 113, and the like. Various data are mainly stored and stored in the HDD 114. A computer program executed by the CPU 111 is stored in the ROM 112 or loaded into the RAM 113 as appropriate. The terminal device may have the same configuration. The network 14 may be the Internet or an intranet.

[Prerequisites]
FIG. 3 is a flowchart of a processing operation for generating allocation candidate data.
In the present invention, an algorithm as shown in the figure is employed for temporary allocation in order to enable high-speed computation. The initial allocation means 21 and the temporary allocation trial means 24 execute this processing. In order to execute this arithmetic processing, processing conditions and parameters are determined as follows.
There are n target products. Let P be a list of target products arranged in length order. The target products are represented as P (1), P (2)... P (n), respectively. P = {P (1), P (2)... P (n)}. These products are arranged in descending order of length and stored in the storage device 40 as material data 41.

  When there is a state in which s products are assigned to the material k being processed, let Q be the list of assigned products. The assigned products are represented as Q (1), Q (2)... Q (s), respectively. These products are arranged in descending order of length. Q = {Q (1), Q (2),... Q (s)}. The allocation results 43, the allocation candidate data 47, and the allocation data 44 generated during the arithmetic processing are stored in the storage device 40 in the descending order of the product length.

The length of the assigned i-th product is represented as l _{Q (i)} .
i is a parameter taking a value from 1 to s.
The total s product lengths assigned is LQ.

Formula 1

である。
割り付け対象とされた材料ｋの長さをｂとする。
材料ｋにＱを割り付けたという意味の割り付け結果をＡｓとする。Ａｓに保存される割り付け結果は、演算処理中に次々に書き換えられる。割り付け判定手段２５に渡されるデータを割り付け候補データ４７と呼ぶ。初期割り付け手段２１は、記憶手段４０の材料データ４１を参照して、そこから材料を一つ選択する。そして、その材料に対して割付け可能な最も長い製品を必ず割付ける処理を実行する機能を持つ。最も長い製品を最初に必ず割付けると良い結果が得られる確率が高いからである。

It is.
Let the length of the material k to be allocated be b.
An assignment result that means that Q is assigned to the material k is assumed to be As. The allocation results stored in As are rewritten one after another during the arithmetic processing. Data passed to the allocation determination unit 25 is referred to as allocation candidate data 47. The initial allocation means 21 refers to the material data 41 of the storage means 40 and selects one material therefrom. And it has a function to execute a process of allocating the longest product that can be allocated to the material. This is because if the longest product is always assigned first, a good result is likely to be obtained.

  The temporary allocation trial unit 24 has a function of executing temporary allocation calculation processing for a plurality of materials. As a result of this temporary allocation calculation process, a plurality of allocation candidate data is obtained. The allocation determination means 25 compares the plurality of stored allocation candidate data according to the allocation pass / fail determination criteria, and employs any allocation candidate data as allocation data for the corresponding product. The repetitive allocation unit 26 has a function of controlling the repetitive processing for acquiring allocation data from the allocation candidate data acquisition processing to the allocation determination processing by regarding the remaining unallocated products as new allocation target products. The final adjustment time determination unit 27 and the final adjustment unit 28 have a function of executing a process for optimizing the allocation at the final stage of the iterative process. Hereinafter, first, the processing of the flowchart of FIG. 3 will be described in detail.

[Initial parameter setting]
The initial allocation means 21 initializes parameters before starting the temporary allocation process.
First, in step S100, processing is started from a state in which the longest product P (1) is assigned to any material. Assuming j = 1 and s = 1, Q (s) = P (j). The initial value of the maximum value L _max of the total product length temporarily allocated is set to 0. L _max holds the maximum value of the total product length during the provisional allocation calculation process. In the temporary allocation of this embodiment, the allocation of the longest product Q (1) is fixed and other products are allocated sequentially for optimization. s is a parameter for designating the assigned product. Since the assembling of the products assigned to the second and later is processed, the minimum value of s is set to 2. These processes are executed by the initial allocation means 21.

  By setting the minimum value of s to 2, the longest product that can be assigned to the material is surely assigned. That is, in this step S100, the products included in the target product list P arranged in descending order of the product length are skipped until the length becomes equal to or shorter than the length of the selected material. When an assignable product is found for the first time, the product is initialized in the assigned list Q.

[Optimal allocation judgment]
In step S101 in FIG. 3, it is determined whether or not the total length LQ of the allocated s products matches the material length b. If LQ = b, the product list Q assigned in step S102 is used as the assignment result Ak, and the process is terminated. This is because, when s products can be allocated to the material of length b so that there is no remaining material, the provisional allocation result can be determined to be optimal. If LQ = b is not satisfied, the process proceeds to [assignment availability determination] in step S201 and the subsequent steps. These processes are executed by the optimum allocation determining means 31.

[Assessment of allocation]
In step S202, j = {j | P (j) = Q (s)}. This is a process of setting a parameter j for designating the next product to be selected from the product group P. The parameter j of the product assigned at the end (latest) is obtained and set. When any product is assigned to one material in order, s increases in order. If 3 products are assigned, s becomes 3. On the other hand, for example, when 5 products are allocated and the next 6th product cannot be allocated, the allocation of the product allocated immediately before as Q (s) is canceled and s is set to s-1. The parameter s increases or decreases in this way. When P (j) is newly assigned to the current Q (s), it is determined whether or not the total LQ of s product lengths is less than the material length b. That is, it is determined whether or not the newly selected product can be assigned. If LQ <b, the allocation is possible, so in step S203, s = s + 1 is set and the next longest product is selected as the allocation target. Then, the process proceeds to [Temporary allocation result storage] in step S301. If LQ <b, since the total LQ of the assigned s product lengths exceeds the material length b, the process proceeds to [Select next product] in step S401. These processes are executed by the allocation possibility determination unit 32.

[Save temporary assignment result]
In step S301, it is determined whether LQ> L _max . L _max holds the maximum value of the total product length temporarily allocated so far. Compare the result of this temporary allocation with this. If _{LQ> L max,} in step _S302, and _L max = _LQ, replacing the _{L max} in the product the total length of this time. In step S303, Q is set to Ak, and the temporary allocation result is stored. Then, it progresses to step S401 [separate product allocation]. (Proceed to [Select next product].) If LQ> L _max is not satisfied, the allocation result is not saved, and steps S302 and S303 are passed and the process proceeds to step S401 [separate product allocation]. These processes are executed by the temporary allocation result storage means 33.

[Separate product assignment]
In step S401, it is determined whether j <n. Thus, it is determined whether or not provisional allocation has been performed for all products. If j <n, Q (s) = P (j + 1) is set in step S402, and the process returns to [optimum allocation determination] in step S101. Now, this time, the process is executed as if a new product P (j + 1) was assigned to Q (s). If j <n, the process proceeds to [Reassign] in step S501. The separate product assignment unit 34 executes these processes.

In step S501, it is determined whether s = s _min . The limit for reducing s is s = 2. If s = s _min , since the processing from [optimum allocation determination] to [alternate product allocation (next product selection)] has been completed for all products, the provisional allocation process ends. At this time, the result with the best yield is included in Ak in the processing so far. The total product length at that time is LQ> L _max . If s = s _{min is} not satisfied, s = s-1 is set in step S502, the previous allocation result is restored, and temporary allocation is attempted again. When LQ <b is not satisfied, s is returned by one, the allocation target is canceled, and another shorter product is selected. In step S503, j = {j | P (j) = Q (s)} and returns to [optimum allocation determination] in step S101 via steps S401 and S402. These processes are executed by the allocation changing means 35.

  That is, under the condition that the longest product is always assigned, the remaining products are assigned in order, and the optimum assignment of LQ = b is found in the process of [optimum assignment determination]. When the combination of LQ = b is not found, the best result with the best yield among the results of provisional assignment according to the above procedure is set as the optimum assignment result for the material. Thus, one allocation candidate data 4 is acquired.

FIG. 4 is an explanatory diagram of a specific processing example.
At the left end of the figure, the number of the state that changes in order is No .. 1-No. 9 is displayed. On the right side, changes in parameters, variables, s, j, LQ, L _max , Q, and Ak are shown in order.

[Input data settings]
First, input data and variables are set. A material having a length of 100 is selected as an object to be allocated. b = 100. In addition, it is assumed that there are six target products whose lengths are 60, 50, 30, 20, 20, and 20, respectively. The list of target products arranged in descending order of length is P = {60, 50, 30, 20, 20, 20}. Since the target products are represented as P (1), P (2)... P (n), n = 6. For example, {P (1)} = {60}. When s products are assigned to this material k, the assigned product list is Q = {Q (1), Q (2),... Q (s)}. s can take a value of 1-6. The total s product lengths assigned is LQ. Let the assignment result in the sense that Q is assigned to the material k be Ak.

[No. Processing]
[Initial parameter setting]
s = 1 Start from the state where the longest product P (1) is assigned to Q (1) first. That is, the product P (1) having a length of 60 is first allocated to the material of b = 100. A minimum value 0 is set to the variable L _max that holds the maximum value of the total product length temporarily allocated at the start of processing. Since the allocation of the longest product is not canceled, s _min = 2 is set.

[Optimum allocation determination] (step S101)
In the first process, it is determined whether the total length LQ = 60 of one assigned product matches the material length b = 100. Since LQ = b is not satisfied, the process proceeds to [Allocation availability determination].

[Allocation availability determination] (step S201-203)
Let j = {j | P (j) = Q (s)}. That is, j of P (j) corresponding to Q (1) is set. Since P (1) is assigned to Q (1), j = 1. It is determined whether the total length LQ = 60 of one assigned product is less than the material length b = 100. Since LQ <b, s = s + 1, that is, s is incremented to 2, and the process proceeds to [Temporary allocation result storage]. Since it is determined that P (1) can be assigned to Q (1), the process proceeds to a process of assigning a new product to Q (2).

[Temporary allocation result storage] (steps S301-303)
It is determined whether LQ> L _max . LQ = 60. The initial state L _max = 0. Therefore, LQ> L _max . Therefore, L _max = 60. Further, Q is set to Ak. Here, Ak is represented as {P (1)} = {60}.

[Separate product allocation (next product selection)] (steps S401-402)
It is determined whether j <n. j is 1. n is 6. Since j <n, it is assumed that Q (s) = P (j + 1). Currently, s = 2. P (2) is now assigned to Q (2). As a result, the state No. 2 is obtained, and the process returns to the first [optimum allocation determination].

[No2. Processing]
[Optimum allocation determination] (step S101)
Now s = 2. Product Q (2) is allocated. The assigned products are {P (1), P (2)} = {60, 50}. It is determined whether or not the total length LQ = 60 + 50 of the assigned product matches the material length b = 100. Since LQ = b is not satisfied, the process proceeds to [Allocation availability determination].

[Allocation availability determination] (step S201-202)
Let j = {j | P (j) = Q (s)}. That is, j corresponding to (()) P (j) corresponding to Q (2) is set. j = 2. It is determined whether the total length LQ = 60 + 50 = 110 of the assigned (one) product is less than the material length b = 100. Since LQ> b, it is determined that P (2) cannot be allocated. Therefore, the process proceeds to [Separate Product Assignment].

[Other Product Assignment] (Steps S401-402)
It is determined whether j <n. Since j = 2 and n = 6, Q (s) = P (j + 1). Q (2) = P (3), that is, P (2) = 50 could not be allocated, so the allocation was stopped and the third product P (3) = 30 was allocated again, and the first [optimum Return to Allocation Judgment].

[No3. Processing]
[Optimum allocation determination] (step S101)
Now s = 2. Products are allocated up to Q (2). The assigned products are {P (1), P (3)} = {60, 30}. It is determined whether the total length LQ = 60 + 30 of the assigned product matches the material length b = 100. Since LQ = b is not satisfied, the process proceeds to [Allocation determination].

[Allocation availability determination] (step S201-203)
Let j = {j | P (j) = Q (s)}. That is, j of P (j) corresponding to Q (2) is set. j = 3. It is determined whether the total length LQ = 60 + 30 = 90 of the assigned (one) product is less than the material length b = 100. Since LQ <b, s = s + 1, that is, s is incremented to 3, and the process proceeds to [Preliminary allocation result storage].

[Temporary allocation result storage] (steps S301-303)
It is determined whether LQ> L _max . LQ = 90. L _max = 60. Therefore, LQ> L _max . Therefore, L _max = 90. Further, Q is set to Ak. Ak is {P (1) P (3)} = {60, 30}.

[Separate product allocation (next product selection)] (steps S401-402)
It is determined whether j <n. j is 3. n is 6. Since j <n, it is assumed that Q (s) = P (j + 1). Currently, s = 3. P (4) is now assigned to Q (3). This returns to the first [optimum allocation determination].

[No4. Processing]
[Optimum allocation determination] (step S101)
Now s = 3. Products are assigned up to Q (3). The assigned products are {P (1), P (3), P (4)} = {60, 30, 20}. It is determined whether the total length LQ = 60 + 30 + 20 of the assigned product matches the material length b = 100. Since LQ = b is not satisfied, the process proceeds to [Allocation availability determination].

[Allocation availability determination] (step S201-202)
Let j = {j | P (j) = Q (s)}. That is, j is set when Q (3) is P (j). j = 4. It is determined whether the total length LQ = 60 + 30 + 20 = 110 of the assigned (one) product is less than the material length b = 100. Since LQ> b, go to [Allocation to another product (next product)]

[Separate Product Assignment (Next Product)] (Steps S401-402)
It is determined whether j <n. Since j = 4 and n = 6, Q (s) = P (j + 1). Q (3) = P (4), that is, P (4) = 20 could not be allocated, so the allocation was stopped and the fifth product P (5) = 20 was allocated again, and the first [optimum Return to Allocation Judgment].

[No5. Processing]
[Optimum allocation determination] (step S101)
Now s = 3. Products are assigned up to Q (3). The assigned products are {P (1), P (3), P (5)} = {60, 30, 20}. It is determined whether the total length LQ = 60 + 30 + 20 of the assigned product matches the material length b = 100. Since LQ = b is not satisfied, the process proceeds to [Allocation availability determination].

[Allocation availability determination] (step S201-202)
Let j = {j | P (j) = Q (s)}. That is, j of P (j) corresponding to Q (2) is set. j = 5. It is determined whether the total length LQ = 60 + 30 + 20 = 110 of the assigned (one) product is less than the material length b = 100. Since LQ> b, the process proceeds to [Allocation of another product (next product)].

[Separate Product Assignment (Next Product)] (Steps S401-402)
It is determined whether j <n. Since j = 5 and n = 6, Q (s) = P (j + 1). Q (3) = P (5), that is, P (5) = 20 could not be allocated, so the allocation was stopped and the sixth product P (6) = 20 was allocated again, and the first [optimum Return to Allocation Judgment].

[No6. Processing]
[Optimum allocation determination] (step S101)
Now s = 3. Products are assigned up to Q (3). The assigned products are {P (1), P (3), P (6)} = {60, 30, 20}. It is determined whether the total length LQ = 60 + 30 + 20 of the assigned product matches the material length b = 100. Since LQ = b is not satisfied, the process proceeds to [Allocation availability determination].

[Allocation availability determination] (step S201-202)
Let j = {j | P (j) = Q (s)}. That is, j of P (j) corresponding to Q (2) is set. j = 6. It is determined whether the total length LQ = 60 + 30 + 20 = 110 of the assigned (one) product is less than the material length b = 100. Since LQ> b, the process proceeds to [Allocation of another product (next product)].

[Separate Product Assignment (Next Product)] (Steps S401-402)
It is determined whether j <n. Since j = 6 and n = 6, the condition of j <n is not satisfied. At this time, in order to try another temporary allocation from the previous (second) allocation, the process proceeds to [Change allocation].

[Change Allocation] (Steps S501-503)
Here, s is returned to the previous value. At this time, first, it is determined whether or not s = s _min . Since processing is performed under the condition that the longest product is always assigned, s is not returned to s _min = 2 or less. Since s = 3 at present, it is not s = s _min . Therefore, s = s−1 = 2. Then, j is set such that P (j) = Q (s). As a result, the search parameter j is returned to the position s. j = 3 (2). Thereafter, the process proceeds to [Separate Product Assignment (Next Product)]. That is, no. 3 assigned product P (3) to Q (2), then selected all products shorter than P (3), and assigned them to Q (3) in order. However, none could be assigned. Therefore, in the method of assigning the product P (3) to Q (2), No. The state of 3 is the best yield. Ak at that time is stored. Therefore, no. In 3, the allocation is changed so that a shorter product other than the product P (3) is allocated, and it is searched whether there is any other arrangement with a better yield.

[Separate Product Assignment (Next Product)] (Steps S401-402)
It is determined whether j <n. Since j = 3 and n = 6, Q (s) = P (j + 1). Since s = 2, Q (2) = P (4) and return to the first [optimum allocation determination].

[No8. Processing]
[Optimum allocation determination] (step S101)
Now s = 2. Products are allocated up to Q (2). The assigned products are {P (1), P (4)} = {60, 20}. It is determined whether the total length LQ = 60 + 20 of the assigned product matches the material length b = 100. Since LQ = b is not satisfied, the process proceeds to [Allocation availability determination].

[Allocation availability determination] (step S201-203)
Let j = {j | P (j) = Q (s)}. That is, j of P (j) corresponding to Q (2) is set. Since the product newly assigned to Q (2) is P (4), j = 4. It is determined whether the total length LQ = 60 + 20 = 80 of the assigned (one) product is less than the material length b = 100. Since LQ <b, s = s + 1, that is, s is incremented to 3, and the process proceeds to [Provisional allocation result storage].

[Temporary allocation result storage] (steps S301-402)
It is determined whether LQ> L _max . LQ = 80. L _max = 90. Therefore, LQ> L _max is not satisfied. Therefore, L _max = 90 is maintained. Ak remains the same. Accordingly, the process proceeds to [Assign another product (next product)].

[Separate Product Assignment (Next Product)] (Steps S401-402)
It is determined whether j <n. j is 4. n is 6. Since j <n, Q (s) = P (j + 1). Currently, s = 3. P (5) is now assigned to Q (3). Thereafter, the process returns to the first [optimum allocation determination].

[No. Processing]
[Optimum Allocation Determination] (Steps S101-102)
Now s = 3. Product Q (3) is allocated. The assigned products {P (1), P (4), P (5)} = {60, 20, 20}. It is determined whether the total length LQ = 60 + 20 + 20 of the assigned product matches the material length b = 100. Since LQ = b, the assigned product list Q is taken as the assigned result Ak. That is, Ak is set as {P (1), P (4), P (5)} = {60, 20, 20}, and the process is terminated.

  In the above example, when b = 100 material was selected, the best combination with a yield of 100% could be found while observing the constraint of assigning the longest product first. However, in general, the arithmetic processing in FIG. 3 is terminated in a state where the best combination of 90% and 92% yield is achieved. This is the allocation candidate data acquisition process. Thereafter, the same calculation process is performed for another material. Thus, a plurality of allocation candidate data is obtained. As will be described below in the second embodiment, the allocation candidate data is compared to make a pass / fail judgment, and, for example, an arrangement with the best yield is adopted. That is, when a certain material is selected and a certain number of products are allocated, if the yield is the best, the combination is adopted. At this time, some products remain. For the remaining products, allocation candidate data acquisition and comparison pass / fail determination are performed again. This process is repeated, and if there are no unallocated products, all the allocation processes are terminated. The above method is a method suitable for performing high-speed arithmetic processing of assembling of products that can be sequentially taken out of materials having different lengths and optimally allocated to the materials. As will be described later, a highly accurate result is obtained in a short time. (A plurality of allocation candidate data are obtained by this method, and optimum allocation data is obtained from them by a predetermined standard.)

FIG. 5 is a flowchart showing an embodiment of the all-allocation data generation processing operation.
Thus, an embodiment of a computer program for all assignment data generation processing operation including comparison of assignment candidate data generated in the first embodiment and pass / fail judgment processing will be described. First, the input / output data processing unit 30 illustrated in FIG. 1 stores, for example, the material data 41 and the allocation target product data 42 input from the terminal device 16 in the storage device 40. At this time, the target products are sorted in order of product length in step S11 of FIG. In step S12, the materials are sorted in order of material length. This is for reading data in this order. In step S13, the longest material is selected. Thereafter, in step S14, the allocation candidate data storage process described above with reference to FIG. 3 is executed. Step S14 is a process including the entirety of step S101 to step S503 in FIG.

  In step S15, the next longest material is selected after the material previously selected in step S13. In step S16, it is determined whether or not the longest product can be provisionally allocated to the selected material. If the result of this determination is yes, the process proceeds to step S14, and if no, the process proceeds to step S17. The temporary allocation trial unit 24 executes control to repeat the operations from step S14 to step S16 until the longest product cannot be temporarily allocated to the selected material. As a result, a plurality of allocation candidate data 47 is stored in the storage device 40.

  Next, the allocation determination means 25 refers to the allocation candidate data 47 in the storage device 40 in step S17. Further, in step S18, the determination is made with reference to the allocation quality criterion 50 in the storage device 40. This is, for example, a criterion of maximum yield. In step S19, the allocation data 44 for one time is acquired and stored in the storage device 40. Next, the repetitive allocation means 26 sets the remaining unallocated products as target products in step S20. This is variable replacement processing for iterative processing.

  Thereafter, the final adjustment time determination means 27 determines whether or not it is the final adjustment time in step S21. If the result of this determination is yes, the process proceeds to step S22, and if no, the process proceeds to step S13. The repetitive allocation unit 26 controls repetitive processing from step S13 to step S21. In step S22, final adjustment processing is performed. This is to solve the problem of wrinkling at the end by preferentially allocating from long products.

  The final adjustment time determination means 27 (FIG. 1) determines whether or not the assignment is completed in the remaining two times. The reason will be described with reference to FIG. For this determination, it is preferable to perform a calculation process of obtaining the total length of the remaining unallocated products when the current allocation data acquisition process is completed. If the total length of the remaining unallocated products is equal to or less than the material length of the longest material, there is at least one method in which allocation is completed in the remaining two times. The final adjustment time determination unit 27 performs this determination at a predetermined timing while the repeated allocation unit 26 (FIG. 1) is executing the repeated allocation process. Of course, the final adjustment time can be determined after allocating to the end.

FIG. 6 is a diagram for explaining the operation of the final adjustment process.
For example, assume that there are four types of unallocated products 45 as shown in the figure at the final adjustment time. There are three types of materials that can be assigned. Here, as shown in FIG. 4, the products (1) and (2) are provisionally allocated to the material 1. At this time, the total length of the remaining unallocated products (3) and (4) is equal to or less than the length of the material 1. Therefore, the final adjustment time determination means 27 (FIG. 1) determines that the assignment is completed in the remaining two times.

  When the final adjustment means 28 temporarily allocates the products (1) and (2) to the material 1, the final adjustment means 28 also executes allocation of the remaining unallocated products (3) and (4). The shorter material 2 is selected as the assignment target of the products (3) and (4). In this way, a set of allocation pattern data in which products (1) and (2) are allocated to material 1 and products (3) and (4) are allocated to material 2 is acquired. Since the temporary allocation is completed in the current time and the final time, the final allocation is uniquely determined. Thus, a set of allocation pattern data is obtained.

  Subsequently, as shown in FIG. 6, the products (1) and (4) are provisionally allocated to the material 2, and the remaining unallocated products (2) and (3) are also allocated to the material 2. Thus, the second set of allocation pattern data in which the products (1) and (4) are allocated to the material 2 and the products (2) and (3) are allocated to the material 2 is acquired. According to the control of the repeated allocation means 26 (FIG. 1), there is an option of allocating the product (1) to the material 3. In this case, the total length of the remaining unallocated products (2) to (4) exceeds the length of the longest material 1. Therefore, in the second time, the products (2) and (3) are allocated to the material 2, and the product (4) is allocated to the material 3 in the third time to acquire the third set of allocation pattern data. When allocating three times, another allocation pattern may be included. A case where the allocation is finished after four times may be included. In the final adjustment, it is better to assign with an arbitrary algorithm. In any case, since the number of remaining unallocated products is small, the number of allocation patterns does not increase so much even if allocation is made brute force or any other allocation method is adopted. Therefore, at this stage, appropriate and better allocation pattern data can be generated as options.

  The final adjustment means 28 of FIG. 1 compares the above three sets of allocation patterns with each other. The allocation quality criterion used at this time is whether the yield is the maximum. In this embodiment, an allocation pattern having the minimum total length of materials used in the last two times is adopted as allocation data with a maximum yield. As shown in FIG. 6, when the three sets of allocation patterns are compared, the total value of the used material length is smaller in the second set. Therefore, an allocation pattern in which the products (1) and (4) are allocated to the material 2 and the products (2) and (3) are allocated to the material 2 is adopted as the final allocation data.

  For example, if there is no final adjustment process, the first set of allocation patterns may have been automatically determined. However, when final adjustment processing is performed as in this embodiment, the second set can be adopted to improve the yield as a whole. Thereby, the yield can be optimized at the final stage of the allocation without imposing a heavy load on the arithmetic processing.

FIG. 7 is a flowchart illustrating an example of the final adjustment process.
In step S41, an unallocated product list is acquired. In step S42, an allocation method is selected. Any algorithm may be selected. In step S43, a set of allocation patterns is generated using the selected allocation method. It does not matter whether it is allocated twice or three times. In step S44, the generated allocation pattern is stored in the storage device. In step S45, it is determined whether there is another allocation method. If there is another allocation method, the result of this determination is yes and the process returns to step S42. If no, the process proceeds to step S46.

In step S46, the allocation pattern in the storage device is referred to. In step S47, reference is made to the quality determination criteria for allocation. As a result, one of the allocation patterns is adopted in step S48. As a result, in the final adjustment process, the one with the highest yield can be adopted, and all of the optimized allocation data can be output in step S23 of FIG.

FIG. 8 is an explanatory diagram illustrating the operation of the third embodiment.
The temporary allocation trial means 24 (FIG. 1) performed temporary allocation while changing the material length to be selected to obtain a plurality of allocation candidate data. In any case, in order to employ any of several types of options, an allocation quality determination criterion such as maximum yield or minimum remaining material length is employed.

  On the other hand, in this embodiment, for example, as shown in FIG. 8, when three types of allocation candidate data for material 1, material 2 and material 3 are obtained, each allocation candidate data is stored in the storage device as an option. Keep it. Then, when the material 1, the material 2, and the material 3 are selected, the remaining unallocated products are regarded as new allocation target products, and the allocation data acquisition process described in the first embodiment is repeated to the end. What is necessary is just to perform the process of step S13 to step S23 of FIG.

  As a result, three allocation end results are obtained. These results are compared according to the same allocation quality criteria as described above. In Example 2 (1), each allocation candidate data was directly compared, and, for example, the one with the best final yield was adopted. On the other hand, in Example 3, assuming that each of Material 1, Material 2, and Material 3 was selected, the allocation process was terminated by the method of Example 2 (1) for the remaining unallocated products, and the result was Compare. For example, what has been completed by the allocation process with the best yield may be adopted. In the method of Example 2 (1), even if the result of provisional assignment to the material 1 is adopted, according to the method of Example 3, the result of provisional assignment to the material 2 as shown in FIG. Yield may be maximized at 95.6%.

  In the third embodiment, as described above, the process of adopting any allocation candidate data is repeated, and the allocation candidate data is selected one after another. Note that in the trial process for comparing the temporary allocation results, for example, even if the material 2 is selected since the final yield of 95.6% is obtained in FIG. 8, the trial process for comparing the subsequent temporary allocation results. You might choose one with a final yield of 96.2%. In other words, the maximum yield of 95.6%, which was the reason for “adopting one provisional allocation,” was “a higher yield can be obtained in the process of selecting materials and provisional allocation through subsequent trials. It can be said to be “minimum guaranteed yield” in the sense of “should be”.

FIG. 9 is a flowchart illustrating a process example according to the third embodiment.
In step S61, allocation candidate data storage processing (the processing described in step S11-16 in FIG. 5) is performed. In step S62, the allocation candidate data stored in the storage device is referred to. In step S63, it is determined whether a plurality of allocation candidate data is stored in the storage device. If the result of this determination is yes, the process proceeds to step S64, and if no, there is no need for selection, and the process proceeds to step S72. In step S64, one allocation candidate data is extracted from the storage device and referred to. In step S65, an unallocated product is set as a target product. Thereafter, in step S66, an allocation data acquisition process (the process described in step S11-23 in FIG. 5) is executed.

  In step S67, the allocation end result is stored in the storage device. In step S68, it is determined whether another allocation candidate data is stored in the storage device. If the result of this determination is yes, the process proceeds to step S64, and if no, the process proceeds to step S69. When the allocation of the unallocated products is completed for all allocation candidate data, the process proceeds to step S69. In step S69, reference is made to the quality determination criteria for allocation. In step S70, the allocation candidate data is compared. In step S71, one allocation candidate data is adopted. For example, allocation candidate data having the maximum final yield is adopted. Thus, it is possible to select the optimum allocation candidate data from among the plurality of allocation candidate data and adopt it as the allocation data.

  Next, in step S71, it is determined whether unallocated products remain. If the result of this determination is yes, the process proceeds to step S73, and if no, the process proceeds to step S74. In step S73, an unallocated product is set as a target product. And it returns to step S61 and repeats the process from step S61 to step S73 until the allocation data acquisition process is complete | finished about all the products. Finally, in step S74, all allocation data is output and the process is terminated.

  Since the above arithmetic processing includes almost only comparison operation and simple arithmetic operation, all the arithmetic processing can be completed in almost several seconds according to experiments. That is, it does not include arithmetic processing that causes stress due to a long waiting time. In addition, since allocation candidate data is selected while verifying whether or not wrinkles come towards the end, more rational allocation calculation processing can be performed.

FIG. 10 is an explanatory diagram of the constraint conditions.
In the first embodiment, the calculation process for always allocating the longest product among the allocation target products is performed in step S16 of FIG. Therefore, materials shorter than the longest product are not subject to allocation. This is called “strong constraint” as shown in the figure. However, when making a pass / fail determination, it may be better to have more options. Therefore, the longest product that can be assigned to the material must be assigned. This is called “weak constraint” as shown in the figure. That is, the provisional allocation trial unit 24 regards the longest product that can be allocated to the material as the longest product, and executes the initial allocation process, the subsequent allocation process, and the allocation candidate data storage process.

  In step S100 in FIG. 3, by setting the minimum value of s to 2, the longest product that can be assigned to the material is surely assigned. That is, the products in the target product list P arranged in descending order of the product length are skipped until the length becomes equal to or shorter than the length of the selected material. When an assignable product is found for the first time, the product is initialized in the assigned list Q. At the same time, by removing the process of step S16 in FIG. In other words, if the longest product that can be assigned to the material is selected in order from the longest, the product assignment is fixed and combined with other products in a brute force manner, giving the maximum yield. To ask. As a result, a material for which there is a product that can be assigned at least one is assigned. This is an effective method for obtaining more options, that is, more allocation candidate data. In particular, it is effective to employ the embodiment described with reference to FIGS.

FIG. 11 is an operation flowchart of the fifth embodiment.
In Example 3, in order to select any of a plurality of allocation candidate data, the final allocation processing end result when it was assumed that each allocation candidate data was selected was compared. In this trial process, even if the allocation candidate data having the maximum final yield (formula e7 in FIG. 13) is adopted, the final yield may be the same value. At that time, the plurality of allocation candidate data are compared as they are. In this case, when only the allocation candidate data is viewed, the allocation candidate is determined using a criterion such as the one with the maximum yield (e8 equation in FIG. 13) or the one with the maximum allocation product length (e9 equation in FIG. 13). Compare the data.

  Here, when only allocation candidate data is viewed, if there are a plurality of data with the same yield, the data with the maximum allocation product length is adopted. This is a method in which the criterion for the maximum yield is the previous determination and the criterion for the maximum assigned product length is the subsequent determination. On the other hand, if there are multiple products with the maximum assigned product length, the product with the highest yield is adopted. This is a method in which the criterion for the maximum allocated product length is the previous determination, and the criterion for the maximum yield is the subsequent determination. Results may vary depending on which method is used. What is the basis for obtaining optimal results depends on the combination of product length and material length. Therefore, it is advisable to use various methods as much as possible and adopt the optimum one.

  From the above, the determination for selecting the allocation candidate data is performed up to three times. In the flowchart of FIG. 11, first, in step S91, the result of the final allocation by the trial process is compared. The e7 formula criterion for determining whether the yield is maximum is adopted. In step S92, it is determined whether the determination is impossible. If the result of this determination is yes, the process proceeds to the next step S93, and if no, the allocation candidate data can be selected based on this criterion, and the process proceeds to step S98. In step S93, the first allocation quality criterion is selected. For example, the standard of e8 formula “maximum yield” is selected. In this case, it is preferable to select either the criterion “maximum yield (e8 equation)” or the criterion “maximum assigned product length (e9 equation)”. When the first allocation pass / fail judgment criterion is “maximum yield”, the process of the second embodiment remains as a result. In addition, when the first allocation pass / fail judgment criterion is “maximum allocated product length”, the principle of the FF (First Fit) method of obtaining a better result by allocating the longest product first is prioritized.

  In step S94, the allocation candidate data is compared. In step S95, it is determined whether or not determination is possible. If the result of this determination is yes, the process proceeds to step S96. If the result is no, the allocation candidate data can be selected based on this criterion, and the process proceeds to step S98. In step S96, the second allocation quality criterion is selected. For example, the criterion “maximum assigned product length” is selected. In step S97, the allocation candidate data is compared based on this criterion. In step S98, any allocation candidate data is adopted based on the comparison result.

  In this embodiment, the criterion “maximum allocated product length” is selected as the first allocation pass / fail criterion in step S93 of FIG. This is to include the expectation of getting good results later. Further, in step S96 of FIG. 11, a method of selecting the one with the lowest yield as the second allocation pass / fail judgment criterion is adopted. Here, the reason why the worst yield is selected without choosing the best yield is as follows. In step S91 of FIG. 11, when the final allocation result by trial was compared, the final yield was the same. Therefore, it is not possible to determine which one is selected based on the first allocation pass / fail criterion (step S91 in FIG. 11). However, if the final yield is the same, the yield that is good in the first allocation is poor in the subsequent allocation, and the yield that is poor in the first allocation is good in the subsequent allocation. Therefore, the one with the worst yield is selected from the viewpoint of expecting the subsequent yield improvement. Experiments using this method have shown that the yield has been improved compared to other methods. By the above method, various methods can be used to find a combination of a material and a product with the best yield.

[Verification data]
FIG. 12 is an explanatory diagram showing the meaning of the symbols in the arithmetic expression shown in FIG. FIG. 13 is an explanatory diagram of main arithmetic expressions.
An example of main arithmetic expressions specifically used when executing the program of the above embodiment will be introduced with reference to FIGS. First, the arithmetic expression of FIG. 13 will be described.
Equation (e1) represents the objective function of the material assembling problem. The expression on the left represents the purpose of minimizing the total cost J. In the above embodiment, the calculation is performed by replacing the cost with the material length. In other words, the objective function is the expression on the right. The right-hand side of the right-hand formula represents the total length of all materials needed to allocate all products. The ratio of the total product length to J in this equation is the yield.
Expression (e2) is an arithmetic expression used to determine whether or not it is the final adjustment time in step S21 of FIG. The left side of this formula indicates the total length of the products remaining after this temporary allocation. The right side shows the length of the longest material. The center represents subtracting the total length of products temporarily allocated from the total length of products remaining this time. The calculation process may be performed while using the parameter t for repeated control. Conditional branching is performed depending on whether this conditional expression is satisfied or not.
Formula (e3) calculates the total value of the lengths of materials necessary for allocating all the remaining products when a certain material is selected for an unallocated product. This equation can also be used in step S21 in FIG. Even without assigning to the end, the final processing time can be determined by calculation. The left side is the total length of materials required to allocate all remaining products. In the upper expression, provisional allocation is completed once in the remaining time, that is, twice including the current time. The lower expression is an expression when the two assignments are not completed under the condition that the maximum material length is not more than twice the minimum material length. β indicates the type of material reallocated when three materials are required. The case where the remaining material is four or more is also included. Equation (e4) is a generalization of the lower equation of equation (e3) and represents the total length of the remaining necessary materials.
Formula (e5) is an arithmetic expression used for pass / fail judgment of the allocation candidate data in step S18 of FIG. This formula represents that materials are taken out in descending order of length and the one with the highest yield is selected.
Expression (e6) is an arithmetic expression used for determining the quality of the allocation pattern in step S47 of FIG. This formula represents that the minimum value of the total length of the allocated material is selected.
Expressions (e7), (e8), and (e9) are arithmetic expressions showing examples of different allocation pass / fail judgment criteria. Expression (e7) is a criterion that the final yield of the result of the trial until the end is maximized. Equation (e8) is a criterion that the individual yield is maximized for a material in a temporary allocation step. Formula (e9) is a criterion that the longest material is allocated. Both are criteria for reducing the subsequent burden. The use of these criteria is illustrated in FIG.

FIG. 14 is an explanatory diagram showing the result of the assortment calculation process for 10 typical typical wooden houses.
Example 4 (R (Recurcive) -RMBS (Reviset Minimum Bin Slack) method) and Example 2 (RMBS method) were compared. The fourth embodiment also adopts the two types of allocation pass / fail judgment (judgment) processing of the fifth embodiment. The GA method of the comparative example is an arithmetic processing method that can obtain a very high yield by improving the one-dimensional material assembling problem. Although this is high in accuracy, it has a drawback that the arithmetic processing is complicated and the processing time is long. The P method of the comparative example is a method described in Patent Document 1. The RFFD (Reviset First Fit Decending) method of the comparative example is another latest method developed by the present inventors and has not been disclosed. Although the part of Example 1 is different, a method similar to Example 4 is adopted. A general-purpose personal computer was used for the allocation process for comparison, and the calculation speed was 3 GHz (per second).

  The GA method of the comparative example employs a genetic algorithm, and the assignment result changes stochastically. Therefore, an allocation result in which the yield reaches the maximum value by repeating the number of arithmetic processing times is adopted. In this example, the maximum value of the yield obtained by repeating the calculation process 50 times for each lot is adopted, and it is known that the result of Mansion 2 is the optimum value. The GA method of the comparative example can finally obtain a very good result, but has a disadvantage that the processing time becomes long. Since the RFFD method of the comparative example is very similar to the example, a result close to that of the example is obtained as compared with the comparative examples 1 and 2.

  In the figure, for the R-RMBS method, the RMBS method, and the RFFD method, the yield is displayed, and the execution time (seconds) for processing all lots for one house is shown in parentheses. The RMBS method and the RFFD method could be processed in 3 seconds or less. In the R-RMBS method, there was a large variation depending on the residence, which was 16 seconds at Residence 1 and 40 seconds at Residence 5, while the others were less than 4 seconds. In the GA method, a total of about 40 minutes was required, including the time required for 50 iterations. In the comparative method P, the processing time was several minutes.

  Comparing these, it can be seen that the calculation processing time of the R-RMBS method, the RMBS method, and the RFFD method is extremely short. Moreover, the results of the R-RMBS method and the RMBS method are almost equal to those of the GA method. In view of the calculation processing time, it was proved that the method of the embodiment is a very practical method. Although there are variations in the processing results, both the fourth and second embodiments are executed, and further, the processing with the assigned pass / fail judgment criteria replaced is selected, and the one with the better result is selected. It can absorb differences in processing conditions. Since arithmetic processing is fast, it is advantageous in that such a combination can be achieved.

FIG. 15 shows the calculation processing result for each lot for House 1 and House 2 in FIG.
In the GA method of the comparative example, lot no. Lot No. 8 of House 8 7 made a difference. Lot No. Lot No. 8 of House 8 7 uses 5 kinds of materials between 3 m and 6 m, and more than half of them assign short products of 0.7 m to 1 m. Therefore, the number of combinations is larger than other lots. Lots with a large number of combinations are unavoidable because there is a high possibility that optimal values cannot be obtained. Moreover, the superiority and inferiority of each arithmetic processing method occurs depending on the combination of materials and products. However, as described above, it can be said that the arithmetic processing method of the embodiment is highly practical in that the processing time is overwhelmingly short and results equivalent to or higher than the GA method of the comparative example can be obtained.

16 and 17 are explanatory diagrams of the performance improvement effect of the embodiment. FIG. 16 is an explanatory diagram of effects by residence, and FIG. 17 is an explanatory diagram of effects by lot.
In the second embodiment which has already been described, the criterion for selecting the temporary allocation result in the final stage is changed. In Example 3, in order to select a temporary allocation result, each temporary allocation result was allocated to the end and evaluated. In order to confirm the effect of such a change in the criterion, a comparison with the case where the criterion is not changed is shown in FIG. The effect of changing the criteria is clearly seen throughout. In the RMBS method, selection of a temporary allocation result is repeated on the basis that the final yield is maximum. In some cases, the yield may be greatly reduced by assigning to the last material. It can be seen that this is saved by changing the standard.

FIG. 18 and FIG. 19 are explanatory diagrams of the effect due to the difference in the constraint conditions.
In the embodiment of FIG. 10, the “strong constraint” and the “weak constraint” have been described. The processing of (RMBS method) described in FIG. In algorithm 3, processing was performed using the “strong constraint” in the description of FIG. In FIG. 18 and FIG. 19, the result of employing the “strong constraint” and the result of employing the “weak constraint” were compared. Further, the processing of (R-RMBS method) described with reference to FIGS. In Algorithm 4, first, “weak constraint” is adopted for the initial provisional allocation, and “strong constraint” is adopted for the repeated trial processing. The result was indicated as (R-RMBS). For the experimental data described as the next “strong constraint”, the “strong constraint condition” was adopted for both the initial provisional allocation and the repeated trial processing. Furthermore, for the experimental data described as “weak constraint” on the rightmost side, “weak constraint” was adopted for both the initial provisional assignment and the repeated trial processing.

  As a result, as can be seen from the comparison of the tables in the figure, for Algorithm 3, a better result is obtained when the calculation process is performed under the “weak constraint” than the “strong constraint”. That is, it has been found that good results may be obtained even if the method of always allocating the longest product is not necessarily adopted uniformly. In Algorithm 4, it was found that when “weak constraint” is adopted in the calculation processing for obtaining allocation candidate data, the rate of obtaining good results is high. However, it has been found that adopting “weak constraints” in the process of repeating trials to the end does not lead to good results overall. In other words, when “weak constraint” is adopted in the calculation processing for obtaining allocation candidate data, it has been proved that any method increases the rate of obtaining good results by increasing the number of options.

FIG. 20 is a flowchart of processing operations according to the seventh embodiment.
This process is a modification of part of the process of FIG. Step S100 in FIG. 3 is replaced with steps S100 to S112 in FIG. Steps S201 to S203 in FIG. 3 are deleted. Steps S310 to S315 of FIG. 22 are inserted immediately before step S401 of FIG. The step S503 in FIG. 3 is replaced with steps S510 to S516 in FIG.

FIG. 21 is an initial operation flowchart of the seventh embodiment.
In this embodiment, step S100 in FIG. 3 is changed as follows. First, the initial allocation means 21 initializes parameters before starting the temporary allocation process. First, in step S100, processing is started from a state in which the longest product P (1) is assigned to any material. The expression on the left side of step S100 is an expression for searching for a product that is shorter than the material length b and has the smallest i, that is, the longest product. In this process, when the selected material is shorter than the longest product P (1), the longest product P (j) assigned to the material can be assigned first. This is assigned by the expression Q (s) = P (j) on the right side of step S100. This product P (j) is regarded as the longest product below.

  Next, in step S110, the total length of all products P (j) to P (n) including this product P (j) and shorter than this product P (j) is obtained. In step S111, the total is compared with the material length b. If the material length is greater than or equal to the total product length, all products can be assigned to this material. Therefore, the subsequent processing is omitted, and in step S112, P (j),... P (n) are stored as the final allocation result, and the processing ends.

On the other hand, when the material length is less than the total product length, the process proceeds to step S101 and subsequent steps in FIG. The processing in steps S201 to S203 in FIG. 3 is deleted because the same processing is performed in steps S312 to S314.

FIG. 22 is a flowchart of processing executed immediately before step S401 in FIG.
In the process of FIG. 3, a new process is performed every time, and a repeated process is performed to determine whether allocation is possible. That is, the process of returning from step S101 of FIG. 3 to step S101 through steps S401 and S402 was repeated. For example, in FIG. 4-No. 7 is repeated. At that time, in order to know the length of the product to be allocated next, the computer program sequentially reads out the corresponding data and determines whether LQ <b in step S202 of FIG.

On the other hand, in this embodiment, the product length of the product having the smallest length is stored separately as a constant beforehand. The product with the smallest length is changed each time the list of unallocated products is changed by the iterative process. Therefore, this constant storage process may be executed in step S100, for example. In FIG. 22, in step S310, j corresponding to the last product Q (S) assigned last in the product group Q is detected. In step S311, it is determined whether j <n. If the result of this determination is yes, the process proceeds to step S312. If the answer is no, it indicates the shortest product, and the process proceeds to step S315 to exit the process. In step S312 and step S313, the longest product that can be assigned is detected in order from the next product shorter than the product P (j) as a product to be further assigned.

In step S312, the room for allocation Slack = b−LQ is calculated. Here, a room (Slack) is calculated for the current assignments Q (1) to Q (s). Q is a temporary allocation result storage area, and is set to Ak in step S303 in FIG. In the next step S313, the allocation margin Slack is compared with the product length of the smallest product. If the allocation margin Slack is less than the product length of the minimum product, it is determined that there is no product that can be allocated any more even if allocation is attempted to the end in the current allocation margin Slack, and the process proceeds to step S316. And j = n. This exits the process.

If the allocation margin Slack is equal to or greater than the product length of the smallest product, in step S314, the product length and the allocation margin Slack are compared in order from the product P (j) to detect the longest product that can be allocated. As described above, by skipping products that cannot be assigned in step S313, No. 1 in FIG. 4-No. Processing such as 7 can be omitted, and the calculation processing time can be shortened. Thereafter, s is incremented by one in step S315 so that the detected product can be newly assigned to Q.

FIG. 23 is a flowchart of the part after step S502 in FIG.
In step S502, s is counted down, and the last assigned product is removed. That is, the product assigned just before was canceled. For the remaining assigned product group Q, j corresponding to the new last product Q (s) is detected in step S510. In step S511, a product to be assigned instead of the last product is detected. That is, the longest product that can be assigned is detected in order from the next product shorter than the product P (j). In other cases, since j indicates the shortest product, the process ends and the process returns to step S401.

In step S511, an allocation margin Slack when the last product is removed is calculated. Here, unless two or more products including the smallest product can be allocated to the allocation room Sack, there is no possibility of obtaining a result with a better yield than the previous allocation results. Therefore, when it is determined in step S512 that the allocation margin Slack is less than twice the minimum product length, j = n is set in step S514. If it is determined in step S512 that the allocation margin Slack is at least twice the minimum product length, even if it is allocated in place of the last product allocated in step S513, the allocation margin Sack is at least more than the shortest product Detect the longest product that grows. If products of the same length are lined up, the one lined up first is detected. With the above processing, it is possible to omit the processing in steps S101 to S502 in FIG. 3 for products that are meaningless for yield improvement and products that cannot be assigned.
[Explanation of effect table]
FIG. 24 is an explanatory diagram illustrating the effect of the arithmetic processing according to the seventh embodiment.
In the seventh embodiment, compared with the first embodiment, good and bad yields are mixed. However, when the processing time displayed as “seconds” is compared, a large improvement in the processing speed is seen for those with a large load. In the first embodiment, when the calculation processing time is 1 to 2 seconds, the repetitive processing load is small, so the improvement effect is not known. However, in the case where the arithmetic processing time is several tens of seconds, the processing time can be reduced to 1 to 2 seconds in Example 7.

  In this embodiment, the criterion “maximum allocated product length” is selected as the second allocation pass / fail judgment criterion in step S93 of FIG. This is to include the expectation of getting good results later. Further, in step S96 of FIG. 11, a method of selecting the one with the lowest yield as the third allocation quality determination criterion is adopted. Here, the reason why the worst yield is selected without choosing the best yield is as follows. In step S91 of FIG. 11, when the final allocation result by trial was compared, the final yield was the same. Therefore, it is not possible to determine which one is selected based on the first allocation pass / fail criterion (step S91 in FIG. 11). However, if the final yield is the same, the yield that is good in the first allocation is poor in the subsequent allocation, and the yield that is poor in the first allocation is good in the subsequent allocation. Therefore, the one with the worst yield is selected from the viewpoint of expecting the subsequent yield improvement. As a result of trial calculation using this method, there was a case where the yield was improved as compared with other methods. By the above method, various methods can be used to find a combination of a material and a product with the best yield.

FIG. 25 is a diagram for comparing yields with and without final adjustment.
As shown in the figure, in the R-RMBS method and the RMBS method, when the final adjustment was made, the yield was improved as indicated by “difference”. In particular, the results show that the improvement effect is remarkable in the RMBS method.

  Note that the computer program executed by the arithmetic processing unit may be modularized in units illustrated in functional blocks, or may be integrated by combining a plurality of functional blocks. Further, the above computer program may be used by being incorporated into an existing application program. The computer program for realizing the present invention can be recorded on a computer-readable recording medium such as a CD-ROM and installed in an arbitrary information processing apparatus for use.

1 is a block diagram of a material assembling system 10 of Example 1. FIG. 2 is a hardware block diagram of a computer constituting the material assembling system 10. FIG. It is a processing operation flowchart for allocation candidate data generation. It is explanatory drawing of the specific process example. It is a flowchart which shows the Example of all the allocation data generation processing operation | movement. It is operation | movement explanatory drawing of the last adjustment process. It is an Example flowchart of a final adjustment process. FIG. 10 is an explanatory diagram illustrating an operation of the third embodiment. 10 is a flowchart illustrating a processing example according to the third embodiment. It is explanatory drawing of a constraint condition. 10 is an operation flowchart of the fifth embodiment. It is explanatory drawing which shows the meaning of the symbol of the computing equation shown in FIG. It is explanatory drawing of main arithmetic expressions. It is explanatory drawing which shows the result of an arrangement | positioning calculation process about 10 typical typical wooden houses. FIG. 15 shows the calculation processing results by lot for House 1 and House 2 in FIG. 14. It is explanatory drawing according to the house of the performance improvement effect of an Example. It is explanatory drawing according to lot of the performance improvement effect of an Example. It is explanatory drawing according to the house of the effect by the difference of a constraint condition. It is explanatory drawing according to lot of the effect by the difference of constraint conditions. 18 is a flowchart illustrating a processing operation according to the seventh embodiment. 18 is an initial operation flowchart of the seventh embodiment. It is a flowchart of the process performed immediately before step S401 of FIG. It is a flowchart of the part after step S502 of FIG. It is explanatory drawing which shows the effect of the arithmetic processing of Example 7. It is yield comparison explanatory drawing by the presence or absence of final adjustment.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Material arrangement system 12 Computer 14 Network 16 Terminal device 20 Arithmetic processor 21 Initial allocation means 22 Continuous allocation means 23 Temporary allocation result storage means 24 Temporary allocation trial means 25 Allocation determination means 26 Repeat allocation means 27 Final adjustment time determination means 28 Final Adjustment means 30 Input / output data processing means 40 Storage device 41 Material data 42 Allocation target product data 43 Temporary allocation result 44 Allocation data 45 Unallocated product 46 Allocation pattern 50 Allocation pass / fail judgment criteria 51 Allocation pass / fail judgment criteria

Claims (17)

Material data in which materials for allocating products are arranged in descending order of their lengths is stored, and the product P = {P (1), P (2)... P (n)} to be allocated is the length. Storage means for storing the product data to be allocated arranged in descending order, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. When,
Initial allocation means for selecting one of the materials from the storage means and for allocating the longest product that can be allocated to the material;
It is determined whether the total length LQ of the s products currently assigned to the selected material matches the length b of the material, and if LQ = b, the current assigned product The list Q is the optimal allocation result Ak for the material, the Ak (result) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and if LQ = b, Optimal allocation determination means, which proceeds to processing by the allocation possibility determination means,
When the product P (j) is assigned to Q (s), it is determined whether the total length LQ of s products currently assigned is less than the length b of the selected material, and LQ < If b, set s = s + 1 and proceed to processing of the temporary allocation result storage means, and if LQ <b, proceed to processing of another product allocation means;
The total length LQ of the products currently assigned to the material is compared with the maximum value L _max of the total length of products (total product length) temporarily assigned so far (the total product length). If> L _max , L _max = LQ and L _max is replaced with the total length of the current product (total product length) LQ, and the list Q of currently assigned (allocated) products is the provisional allocation result Ak. As a temporary allocation result storage means,
The above j and n are compared to determine whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s). Return to the process of the optimal allocation determination means, and if j <n, proceed to the process of the allocation change means, another product allocation means,
By comparing the minimum value s _min and s of s set in advance, and s = s _min , the result that has already been stored as Ak is set as a temporary allocation result (the result is set as allocation candidate data). If not s = s _min , allocation changing means for setting s = s−1, canceling the allocation of the product allocated immediately before and returning to the processing of another product allocation means,
Temporary allocation trial means for allowing the allocation candidate data to be stored repeatedly for a plurality of materials;
An allocation determination means that compares the allocation candidate data stored for a plurality of materials and adopts any allocation candidate data for allocation data of the corresponding product according to the allocation quality determination criteria;
Repetitively allocating means that regards the remaining unallocated products as new allocation target products and repeats the allocation data acquisition process from the allocation candidate data storage process to the allocation determination unit process;
Final adjustment time determination means for determining the final adjustment time for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process during repetition of the allocation data acquisition process by the repetitive allocation means When,
When it is determined that it is the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared, and the allocation pattern that minimizes the material length used is A material assembling system comprising: a final adjustment unit that executes a final adjustment process to be used for allocation data of a corresponding product. Material data in which materials for allocating products are arranged in descending order of their lengths is stored, and the product P = {P (1), P (2)... P (n)} to be allocated is the length. Storage means for storing the product data to be allocated arranged in descending order, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. When,
Initial allocation means for selecting one of the materials from the storage means and for allocating the longest product P (j) that can be allocated to the material;
The total length of all products P (j) to P (n) including the product P (j) and shorter than the product P (j) is obtained, and the total is compared with the length b of the material. If the length b of the material is greater than or equal to the total length of the product, P (j),... P (n) are stored in Ak as the final allocation result, the process is terminated, and the selected It is determined whether the total length LQ of s products currently assigned to the selected material matches the length b of the material. If LQ = b, the list Q of currently assigned products is obtained. The optimal allocation result Ak for the material is set, the Ak (result thereof) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and if LQ = b, the next temporary allocation is performed. Optimal allocation judgment procedure to proceed to result storage means And,
The total length LQ of the products currently assigned to the material is compared with the maximum value L _max of the total length of products (total product length) temporarily assigned so far (the total product length). If> L _max , L _max = LQ and L _max is replaced with the total length of the current product (total product length) LQ, and the list Q of currently assigned (allocated) products is the provisional allocation result Ak. As a temporary allocation result storage means,
For the allocation result stored in Ak, the allocation margin Slack = b−LQ is calculated, and the allocation margin Sack is compared with the product length of the smallest product P (n), and the product P (n having the smallest allocation margin Sack is obtained. ) J = n when the product length is less than the product length, and when the allocation space Slack is equal to or greater than the product length of the smallest product, the product length and the allocation space from the product P (j) to P (n-1) in order. A surplus length discriminating means that compares the Slack and detects the longest assignable product, sets s to (s + 1), and proceeds to the processing of another product assigning means;
The above j and n are compared to determine whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s). Return to the process of the optimal allocation determination means, and if j <n, proceed to the process of the allocation change means, another product allocation means,
By comparing the minimum value s _min and s of s set in advance, and s = s _min , the result that has already been stored as Ak is set as a temporary allocation result (the result is set as allocation candidate data). If it is not s = s _min , s = s−1 is set, the allocation margin Slack is calculated in the state in which the allocation of the product allocated immediately before is canceled, and the product P (n having the smallest allocation margin Sack is calculated. ) Is less than twice the length of j), j is set to n, and if it is determined that the allocation margin Slack is at least twice the length of the smallest product P (n), P (n) is assigned to the allocation margin Sack. An allocation changing unit that detects the longest product that can be allocated together with the item and assigns it to the next allocation target and returns to the processing of another product allocation unit;
Temporary allocation trial means for allowing the allocation candidate data to be stored repeatedly for a plurality of materials;
An allocation determination means that compares the allocation candidate data stored for a plurality of materials and adopts any allocation candidate data for allocation data of the corresponding product according to the allocation quality determination criteria;
Repetitively allocating means that regards the remaining unallocated products as new allocation target products and repeats the allocation data acquisition process from the allocation candidate data storage process to the allocation determination unit process;
Final adjustment time determination means for determining the final adjustment time for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process during repetition of the allocation data acquisition process by the repetitive allocation means When,
When it is determined that it is the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared, and the allocation pattern that minimizes the material length used is A material assembling system comprising: a final adjustment unit that executes a final adjustment process to be used for allocation data of a corresponding product. The material assembling system according to claim 1 or 2,
When the final adjustment time determination means stores any of the allocation candidate data in a storage device, when the total length of the remaining unallocated products is equal to or less than the length of the longest material (material length), A material assembling system characterized by the final adjustment time. The material assembling system according to any one of claims 1 to 3,
The temporary allocation trial means regards the next longest (longest) product that can be allocated to the material as the longest product when the initial allocation means cannot temporarily allocate the longest product when a certain material is selected. A material assembling system that executes a storage process of the allocation candidate data. The material assembling system according to any one of claims 1 to 4,
The allocation determination means regards the remaining unallocated products as new allocation target products for each of the plurality of allocation candidate data stored in the storage device, repeats the allocation data acquisition process, and allocates all the products. A process of ending the process, comparing the end result of the allocation process for the plurality of allocation candidate data according to a predetermined allocation pass / fail judgment criterion, and adopting any of the plurality of allocation candidate data as the allocation data of the corresponding product A material assembling system characterized by repeating. The material assembling system according to claim 5, wherein
The allocation determination means uses an allocation pass / fail criterion that calculates the yield in the final allocation processing end result and adopts the allocation candidate data when the yield is maximized as the allocation data of the corresponding product. A material assembling system characterized by: The material assembling system according to claim 6, wherein
The allocation determination means adopts the one with the highest yield of only the allocation candidate data when the quality determination cannot be made even if the yield in the final result of the allocation process is compared, and if the quality determination is still impossible, the allocation A material assembling system characterized in that a pass / fail judgment is made so that the product with the largest assigned product length of only candidate data is adopted. The material assembling system according to claim 6, wherein
The allocation determination means adopts the allocation product data with the maximum allocation product data only when the yield in the final allocation processing end result cannot be compared, and when the yield cannot be determined. The material assembling system is characterized in that the quality is judged so as to adopt the one with the maximum yield of only the temporary allocation result. The material assembling system according to claim 6, wherein
The allocation determination means adopts the allocation product data with the maximum allocation product data only when the yield in the final allocation processing end result cannot be determined even when the yield is compared, and still cannot determine the quality A material assembling system characterized in that a pass / fail judgment is made so that a yield with only a temporary allocation result is adopted. Computer
Material data in which materials for allocating products are arranged in descending order of their lengths is stored, and the product P = {P (1), P (2)... P (n)} to be allocated is the length. Storage means for storing the product data to be allocated arranged in descending order, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. When,
Initial allocation means for selecting one of the materials from the storage means and for allocating the longest product that can be allocated to the material;
It is determined whether the total length LQ of the s products currently assigned to the selected material matches the length b of the material, and if LQ = b, the current assigned product The list Q is the optimal allocation result Ak for the material, the Ak (result) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and if LQ = b, Optimal allocation determination means, which proceeds to processing by the allocation possibility determination means,
When the product P (j) is assigned to Q (s), it is determined whether the total length LQ of s products currently assigned is less than the length b of the selected material, and LQ < If b, set s = s + 1 and proceed to processing of the temporary allocation result storage means, and if LQ <b, proceed to processing of another product allocation means;
The total length LQ of the products currently assigned to the material is compared with the maximum value L _max of the total length of products (total product length) temporarily assigned so far (the total product length). If> L _max , L _max = LQ and L _max is replaced with the total length of the current product (total product length) LQ, and the list Q of currently assigned (allocated) products is the provisional allocation result Ak. As a temporary allocation result storage means,
The above j and n are compared to determine whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s). Return to the process of the optimal allocation determination means, and if j <n, proceed to the process of the allocation change means, another product allocation means,
By comparing the minimum value s _min and s of s set in advance, and s = s _min , the result that has already been stored as Ak is set as a temporary allocation result (the result is set as allocation candidate data). If not s = s _min , allocation changing means for setting s = s−1, canceling the allocation of the product allocated immediately before and returning to the processing of another product allocation means,
Temporary allocation trial means for allowing the allocation candidate data to be stored repeatedly for a plurality of materials;
An allocation determination means that compares the allocation candidate data stored for a plurality of materials and adopts any allocation candidate data for allocation data of the corresponding product according to the allocation quality determination criteria;
Repetitively allocating means that regards the remaining unallocated products as new allocation target products and repeats the allocation data acquisition process from the allocation candidate data storage process to the allocation determination unit process;
Final adjustment time determination means for determining the final adjustment time for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process during repetition of the allocation data acquisition process by the repetitive allocation means When,
When it is determined that it is the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared, and the allocation pattern that minimizes the material length used is Final adjustment means for executing final adjustment processing to be used for the allocation data of the corresponding product,
Assortment program to function as. Computer
Material data in which materials for allocating products are arranged in descending order of their lengths is stored, and the product P = {P (1), P (2)... P (n)} to be allocated is the length. Storage means for storing the product data to be allocated arranged in descending order, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. When,
Initial allocation means for selecting one of the materials from the storage means and for allocating the longest product that can be allocated to the material;
It is determined whether the total length LQ of the s products currently assigned to the selected material matches the length b of the material, and if LQ = b, the current assigned product The list Q is the optimal allocation result Ak for the material, the Ak (result) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and if LQ = b, Optimal allocation determination means, which proceeds to processing by the allocation possibility determination means,
When the product P (j) is assigned to Q (s), it is determined whether the total length LQ of s products currently assigned is less than the length b of the selected material, and LQ < If b, set s = s + 1 and proceed to processing of the temporary allocation result storage means, and if LQ <b, proceed to processing of another product allocation means;
The total length LQ of the products currently assigned to the material is compared with the maximum value L _max of the total length of products (total product length) temporarily assigned so far (the total product length). If> L _max , L _max = LQ and L _max is replaced with the total length of the current product (total product length) LQ, and the list Q of currently assigned (allocated) products is the provisional allocation result Ak. As a temporary allocation result storage means,
The above j and n are compared to determine whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s). Return to the process of the optimal allocation determination means, and if j <n, proceed to the process of the allocation change means, another product allocation means,
By comparing the minimum value s _min and s of s set in advance, and s = s _min , the result that has already been stored as Ak is set as a temporary allocation result (the result is set as allocation candidate data). If not s = s _min , allocation changing means for setting s = s−1, canceling the allocation of the product allocated immediately before and returning to the processing of another product allocation means,
Temporary allocation trial means for allowing the allocation candidate data to be stored repeatedly for a plurality of materials;
An allocation determination means that compares the allocation candidate data stored for a plurality of materials and adopts any allocation candidate data for allocation data of the corresponding product according to the allocation quality determination criteria;
Repetitively allocating means that regards the remaining unallocated products as new allocation target products and repeats the allocation data acquisition process from the allocation candidate data storage process to the allocation determination unit process;
Final adjustment time determination means for determining the final adjustment time for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process during repetition of the allocation data acquisition process by the repetitive allocation means When,
When it is determined that it is the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared, and the allocation pattern that minimizes the material length used is Final adjustment means for executing final adjustment processing to be used for the allocation data of the corresponding product,
A computer-readable recording medium on which a material assembling program that functions as a computer is recorded. The storage means stores material data in which materials for allocating products are arranged in descending order of their lengths , and products P = {P (1), P (2)... P (n)} to be allocated. Are assigned product data arranged in descending order of their lengths, and information indicating products Q (1), Q (2)... Q (s) sequentially assigned to the material during arithmetic processing. Memorizing step;
Initial allocating means selecting one of the materials from the storage means and allocating the longest product that can be allocated to the material;
The optimum allocation determining means determines whether or not the total length LQ of s products currently allocated to the selected material matches the length b of the material, and if LQ = b, The assigned product list Q is set as the optimum allocation result Ak for the material, the Ak (result) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and LQ = If not b, the step proceeds to processing by the next allocation possibility determination means;
Whether the allocation determination unit determines whether the total LQ of the lengths of s products currently allocated is less than the length b of the selected material when the product P (j) is allocated to Q (s) If LQ <b, the process proceeds to the provisional allocation result storage unit as s = s + 1, and if LQ <b, the process proceeds to the process of another product allocation unit;
The total length LQ of the products currently allocated to the material, and the maximum value L of the total length of the products (total product length) that the temporary allocation allocation result storage means has assigned in the past (to date) by comparing the _max, if _{LQ> L max, L max} = replace the _{L max} sum of the length of the current products (total length) to LQ as LQ, is currently allocated (allocation was) of the product Storing the list Q as a temporary allocation result Ak;
Another product allocation means compares the above j and n to determine whether the allocation feasibility determination (provisional allocation) has been completed for all products. If j <n, a new product P (j + 1) is newly determined. Allocating to Q (s) and returning to the process of the optimal allocation determining means, and if j <n, proceeding to the process of the allocation changing means;
The allocation changing means compares the minimum value s _min and s of s set in advance, and if s = s _min , the result already stored as Ak is set as (temporary allocation result, and the result is ) Saving as allocation candidate data, and if not s = s _min , set s = s−1, cancel the allocation of the product allocated immediately before, and return to the processing of another product allocation means;
A temporary allocation trial means for repeatedly trying the storage process of the allocation candidate data for a plurality of materials;
An allocation determining means comparing the allocation candidate data stored for a plurality of materials, and adopting any allocation candidate data as allocation data of the corresponding product according to the allocation quality determination criteria;
Repetitive allocation means, considering the remaining unallocated products as new allocation target products, repeating the allocation data acquisition process from the allocation candidate data storage process to the allocation determination unit process;
The final adjustment time determination means determines the final adjustment time for ending assignment for all products in the two assignment data acquisition processes including the current assignment data acquisition process during the repetition of the assignment data acquisition process by the repeat assignment means. A step of judging;
When the final adjustment means is determined to be the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared, and the material length used is minimized. A final adjustment process for adopting the allocation pattern as the allocation data of the corresponding product,
The material assembling method characterized by including. Material data in which materials for allocating products are arranged in descending order of their lengths is stored, and the product P = {P (1), P (2)... P (n)} to be allocated is the length. Storage means for storing the product data to be allocated arranged in descending order, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. When,
Initial allocation means for selecting one of the materials from the storage means and for allocating the longest product that can be allocated to the material;
It is determined whether the total length LQ of the s products currently assigned to the selected material matches the length b of the material, and if LQ = b, the current assigned product The list Q is the optimal allocation result Ak for the material, the Ak (result) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and if LQ = b, Optimal allocation determination means, which proceeds to processing by the allocation possibility determination means,
When the product P (j) is assigned to Q (s), it is determined whether the total length LQ of s products currently assigned is less than the length b of the selected material, and LQ < If b, set s = s + 1 and proceed to processing of the temporary allocation result storage means, and if LQ <b, proceed to processing of another product allocation means;
The total length LQ of the products currently assigned to the material is compared with the maximum value L _max of the total length of products (total product length) temporarily assigned so far (the total product length). If> L _max , L _max = LQ and L _max is replaced with the total length of the current product (total product length) LQ, and the list Q of currently assigned (allocated) products is the provisional allocation result Ak. As a temporary allocation result storage means,
The above j and n are compared to determine whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s). Return to the process of the optimal allocation determination means, and if j <n, proceed to the process of the allocation change means, another product allocation means,
By comparing the minimum value s _min and s of s set in advance, and s = s _min , the result that has already been stored as Ak is set as a temporary allocation result (the result is set as allocation candidate data). If not s = s _min , allocation changing means for setting s = s−1, canceling the allocation of the product allocated immediately before and returning to the processing of another product allocation means,
Temporary allocation trial means for allowing the allocation candidate data to be stored repeatedly for a plurality of materials;
An allocation determination means that compares the allocation candidate data stored for a plurality of materials and adopts any allocation candidate data for allocation data of the corresponding product according to the allocation quality determination criteria;
Repetitively allocating means that regards the remaining unallocated products as new allocation target products and repeats the allocation data acquisition process from the allocation candidate data storage process to the allocation determination unit process;
Final adjustment time determination means for determining the final adjustment time for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process during repetition of the allocation data acquisition process by the repetitive allocation means When,
When it is determined that it is the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared. A final adjustment means for executing a final adjustment process to be applied to the allocation data of the corresponding product;
A precut device comprising: a material selection supply device that selects the material using the allocation data; and a material cutting device that precuts a product allocated to the material. Computer
Material data in which materials for allocating products are arranged in descending order of their lengths is stored, and the product P = {P (1), P (2)... P (n)} to be allocated is the length. Storage means for storing the product data to be allocated arranged in descending order, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. When,
Initial allocation means for selecting one of the materials from the storage means and for allocating the longest product P (j) that can be allocated to the material;
The total length of all products P (j) to P (n) including the product P (j) and shorter than the product P (j) is obtained, and the total is compared with the length b of the material. If the length b of the material is greater than or equal to the total length of the product, P (j),... P (n) are stored in Ak as the final allocation result, the process is terminated, and the selected It is determined whether the total length LQ of s products currently assigned to the selected material matches the length b of the material. If LQ = b, the list Q of currently assigned products is obtained. The optimal allocation result Ak for the material is set, the Ak (result thereof) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and if LQ = b, the next temporary allocation is performed. Optimal allocation judgment procedure to proceed to result storage means And,
The total length LQ of the products currently assigned to the material is compared with the maximum value L _max of the total length of products (total product length) temporarily assigned so far (the total product length). If> L _max , L _max = LQ and L _max is replaced with the total length of the current product (total product length) LQ, and the list Q of currently assigned (allocated) products is the provisional allocation result Ak. As a temporary allocation result storage means,
For the allocation result stored in Ak, the allocation margin Slack = b−LQ is calculated, and the allocation margin Sack is compared with the product length of the smallest product P (n), and the product P (n having the smallest allocation margin Sack is obtained. ) J = n when the product length is less than the product length, and when the allocation space Slack is equal to or greater than the product length of the smallest product, the product length and the allocation space from the product P (j) to P (n-1) in order. A surplus length discriminating means that compares the Slack and detects the longest assignable product, sets s to (s + 1), and proceeds to the processing of another product assigning means;
The above j and n are compared to determine whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s). Return to the process of the optimal allocation determination means, and if j <n, proceed to the process of the allocation change means, another product allocation means,
By comparing the minimum value s _min and s of s set in advance, and s = s _min , the result that has already been stored as Ak is set as a temporary allocation result (the result is set as allocation candidate data). If it is not s = s _min , s = s−1 is set, the allocation margin Slack is calculated in the state in which the allocation of the product allocated immediately before is canceled, and the product P (n having the smallest allocation margin Sack is calculated. ) Is less than twice the length of j), j is set to n, and if it is determined that the allocation margin Slack is at least twice the length of the smallest product P (n), P (n) is assigned to the allocation margin Sack. An allocation changing unit that detects the longest product that can be allocated together with the item and assigns it to the next allocation target and returns to the processing of another product allocation unit;
Temporary allocation trial means for allowing the allocation candidate data to be stored repeatedly for a plurality of materials;
An allocation determination means that compares the allocation candidate data stored for a plurality of materials and adopts any allocation candidate data for allocation data of the corresponding product according to the allocation quality determination criteria;
Repetitively allocating means that regards the remaining unallocated products as new allocation target products and repeats the allocation data acquisition process from the allocation candidate data storage process to the allocation determination unit process;
Final adjustment time determination means for determining the final adjustment time for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process during repetition of the allocation data acquisition process by the repetitive allocation means When,
When it is determined that it is the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared, and the allocation pattern that minimizes the material length used is Final adjustment means for executing final adjustment processing to be used for the allocation data of the corresponding product,
Assortment program to function as. Computer
Material data in which materials for allocating products are arranged in descending order of their lengths is stored, and the product P = {P (1), P (2)... P (n)} to be allocated is the length. Storage means for storing the product data to be allocated arranged in descending order, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. When,
Initial allocation means for selecting one of the materials from the storage means and for allocating the longest product P (j) that can be allocated to the material;
The total length of all products P (j) to P (n) including the product P (j) and shorter than the product P (j) is obtained, and the total is compared with the length b of the material. If the length b of the material is greater than or equal to the total length of the product, P (j),... P (n) are stored in Ak as the final allocation result, the process is terminated, and the selected It is determined whether the total length LQ of s products currently assigned to the selected material matches the length b of the material. If LQ = b, the list Q of currently assigned products is obtained. The optimal allocation result Ak for the material is set, the Ak (result thereof) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and if LQ = b, the next temporary allocation is performed. Optimal allocation judgment procedure to proceed to result storage means And,
The total length LQ of the products currently assigned to the material is compared with the maximum value L _max of the total length of products (total product length) temporarily assigned so far (the total product length). If> L _max , L _max = LQ and L _max is replaced with the total length of the current product (total product length) LQ, and the list Q of currently assigned (allocated) products is the provisional allocation result Ak. As a temporary allocation result storage means,
For the allocation result stored in Ak, the allocation margin Slack = b−LQ is calculated, and the allocation margin Sack is compared with the product length of the smallest product P (n), and the product P (n having the smallest allocation margin Sack is obtained. ) J = n when the product length is less than the product length, and when the allocation space Slack is equal to or greater than the product length of the smallest product, the product length and the allocation space from the product P (j) to P (n-1) in order. A surplus length discriminating means that compares the Slack and detects the longest assignable product, sets s to (s + 1), and proceeds to the processing of another product assigning means;
The above j and n are compared to determine whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s). Return to the process of the optimal allocation determination means, and if j <n, proceed to the process of the allocation change means, another product allocation means,
By comparing the minimum value s _min and s of s set in advance, and s = s _min , the result that has already been stored as Ak is set as a temporary allocation result (the result is set as allocation candidate data). If it is not s = s _min , s = s−1 is set, the allocation margin Slack is calculated in the state in which the allocation of the product allocated immediately before is canceled, and the product P (n having the smallest allocation margin Sack is calculated. ) Is less than twice the length of j), j is set to n, and if it is determined that the allocation margin Slack is at least twice the length of the smallest product P (n), P (n) is assigned to the allocation margin Sack. An allocation changing unit that detects the longest product that can be allocated together with the item and assigns it to the next allocation target and returns to the processing of another product allocation unit;
Temporary allocation trial means for allowing the allocation candidate data to be stored repeatedly for a plurality of materials;
An allocation determination means that compares the allocation candidate data stored for a plurality of materials and adopts any allocation candidate data for allocation data of the corresponding product according to the allocation quality determination criteria;
Repetitively allocating means that regards the remaining unallocated products as new allocation target products and repeats the allocation data acquisition process from the allocation candidate data storage process to the allocation determination unit process;
Final adjustment time determination means for determining the final adjustment time for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process during repetition of the allocation data acquisition process by the repetitive allocation means When,
When it is determined that it is the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared, and the allocation pattern that minimizes the material length used is Final adjustment means for executing final adjustment processing to be used for the allocation data of the corresponding product,
A computer-readable recording medium on which a material assembling program that functions as a computer is recorded. The storage means stores material data in which materials for allocating products are arranged in descending order of their lengths , and products P = {P (1), P (2)... P (n)} to be allocated. Are assigned product data arranged in descending order of their lengths, and information indicating products Q (1), Q (2)... Q (s) sequentially assigned to the material during arithmetic processing. Memorizing step;
Initial allocating means selecting one of the materials from the storage means and allocating the longest product P (j) that can be allocated to the material;
The optimum allocation determining means obtains the sum of the lengths of all products P (j) to P (n) including the product P (j) and shorter than the product P (j), and the sum of the product and the material Compared with the length b, if the length b of the material is equal to or greater than the total length of the product, P (j),... P (n) is stored in Ak as the final allocation result and processed. And determine whether the total length LQ of the s products currently assigned to the selected material matches the length b of the material, and if LQ = b, the currently assigned The list Q of the existing products is set as the optimal allocation result Ak for the material, the Ak (result thereof) is stored as allocation candidate data, the storage processing of the allocation candidate data for the selected material is terminated, and LQ = b For example, the next temporary allocation result storage means processing A step of advance,
The temporary allocation result storage means has a maximum value L _max of the total length LQ of products currently allocated to the material and the total length of products temporarily allocated so far (total product length). If LQ> L _max , and L _max = LQ, L _max is replaced with the total length of the current product (total product length) LQ, and a list of currently assigned (assigned) products Storing Q as a temporary allocation result Ak;
The surplus length discriminating means calculates the allocation margin Slack = b−LQ with respect to the allocation result stored in Ak, and compares the allocation margin Slack with the product length of the smallest product P (n). When the product length of the minimum product P (n) is less than j = n, and when the allocation space Slack is equal to or greater than the product length of the minimum product, the product P (j) is sequentially ordered to P (n−1). Comparing the product length with the allocation room Slack, detecting the longest product that can be assigned, setting s to (s + 1), and proceeding to the processing of the next separate product assignment means;
Another product allocation means compares the above j and n to determine whether the allocation feasibility determination (provisional allocation) has been completed for all products. If j <n, a new product P (j + 1) is newly determined. Allocating to Q (s) and returning to the process of the optimal allocation determining means, and if j <n, proceeding to the process of the allocation changing means;
The allocation changing means compares the minimum value s _min and s of s set in advance, and if s = s _min , the result already stored as Ak is set as (temporary allocation result, and the result is ) If it is saved as allocation candidate data and s = s _{min is} not satisfied, s = s-1 is set, and an allocation margin Slack is calculated in a state where the allocation of the product allocated immediately before is canceled, and this allocation margin Sack is the minimum When the length of the product P (n) is less than twice the length of the product P (n), j = n is set, and if it is determined that the allocation margin Slack is more than twice the length of the minimum product P (n), the allocation margin Slack Detecting the longest product that can be assigned together with P (n) to the next assignment object and returning to the processing of another product assignment means;
A temporary allocation trial means for repeatedly trying the storage process of the allocation candidate data for a plurality of materials;
When the allocation determination means compares the allocation candidate data stored for a plurality of materials and adopts any allocation candidate data in the allocation data of the corresponding product according to the allocation quality determination criteria,
Repetitive allocation means step of regarding the remaining unallocated products as new allocation target products and repeating the allocation data acquisition process from the allocation candidate data storage process to the allocation determination means process; and
The final adjustment time determination means determines the final adjustment time for ending assignment for all products in the two assignment data acquisition processes including the current assignment data acquisition process during the repetition of the assignment data acquisition process by the repeat assignment means. A step of judging;
When the final adjustment means is determined to be the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared, and the material length used is minimized. A final adjustment process for adopting the allocation pattern as the allocation data of the corresponding product,
A material assembling method. Material data in which materials for allocating products are arranged in descending order of their lengths is stored, and the product P = {P (1), P (2)... P (n)} to be allocated is the length. Storage means for storing the product data to be allocated arranged in descending order, and storing information indicating the products Q (1), Q (2)... Q (s) sequentially allocated to the material during the arithmetic processing. When,
Initial allocation means for selecting one of the materials from the storage means and for allocating the longest product P (j) that can be allocated to the material;
The total length of all products P (j) to P (n) including the product P (j) and shorter than the product P (j) is obtained, and the total is compared with the length b of the material. If the length b of the material is greater than or equal to the total length of the product, P (j),... P (n) are stored in Ak as the final allocation result, the process is terminated, and the selected It is determined whether the total length LQ of s products currently assigned to the selected material matches the length b of the material. If LQ = b, the list Q of currently assigned products is obtained. The optimal allocation result Ak for the material is set, the Ak (result thereof) is stored as allocation candidate data, the allocation candidate data storage process for the selected material is terminated, and if LQ = b, the next temporary allocation is performed. Optimal allocation judgment procedure to proceed to result storage means And,
The total length LQ of the products currently assigned to the material is compared with the maximum value L _max of the total length of products (total product length) temporarily assigned so far (the total product length). If> L _max , L _max = LQ and L _max is replaced with the total length of the current product (total product length) LQ, and the list Q of currently assigned (allocated) products is the provisional allocation result Ak. As a temporary allocation result storage means,
For the allocation result stored in Ak, the allocation margin Slack = b−LQ is calculated, and the allocation margin Sack is compared with the product length of the smallest product P (n), and the product P (n having the smallest allocation margin Sack is obtained. ) J = n when the product length is less than the product length, and when the allocation space Slack is equal to or greater than the product length of the smallest product, the product length and the allocation space from the product P (j) to P (n-1) in order. A surplus length discriminating means that compares the Slack and detects the longest assignable product, sets s to (s + 1), and proceeds to the processing of another product assigning means;
The above j and n are compared to determine whether or not the allocation possibility determination (temporary allocation) has been completed for all products. If j <n, the product P (j + 1) is newly allocated to Q (s). Return to the process of the optimal allocation determination means, and if j <n, proceed to the process of the allocation change means, another product allocation means,
By comparing the minimum value s _min and s of s set in advance, and s = s _min , the result that has already been stored as Ak is set as a temporary allocation result (the result is set as allocation candidate data). If it is not s = s _min , s = s−1 is set, the allocation margin Slack is calculated in the state in which the allocation of the product allocated immediately before is canceled, and the product P (n having the smallest allocation margin Sack is calculated. ) Is less than twice the length of j), j is set to n, and if it is determined that the allocation margin Slack is at least twice the length of the smallest product P (n), P (n) is assigned to the allocation margin Sack. An allocation changing unit that detects the longest product that can be allocated together with the item and assigns it to the next allocation target and returns to the processing of another product allocation unit;
Temporary allocation trial means for allowing the allocation candidate data to be stored repeatedly for a plurality of materials;
An allocation determination means that compares the allocation candidate data stored for a plurality of materials and adopts any allocation candidate data for allocation data of the corresponding product according to the allocation quality determination criteria;
Repetitively allocating means that regards the remaining unallocated products as new allocation target products and repeats the allocation data acquisition process from the allocation candidate data storage process to the allocation determination unit process;
Final adjustment time determination means for determining the final adjustment time for ending allocation for all products in two allocation data acquisition processes including the current allocation data acquisition process during repetition of the allocation data acquisition process by the repetitive allocation means When,
When it is determined that it is the final adjustment time, a plurality of allocation pattern candidates that allocate the remaining unallocated products before acquisition of the current allocation data to any material are acquired and compared. A final adjustment means for executing a final adjustment process to be applied to the allocation data of the corresponding product;
A precut device comprising: a material selection supply device that selects the material using the allocation data; and a material cutting device that precuts a product allocated to the material.

Images