JP6890765B2 - Material allocation system - Google Patents

Description

The present invention allocates rectangular products of various dimensions, such as wall materials, to several types of raw materials to be supplied, and calculates how to allocate the products so as to minimize the material cost. Regarding the system.

For example, various calculation methods have been developed to minimize the material cost when cutting out rectangular products having various dimensions such as wall materials from a given raw material (Patent Document 1).

Japanese Patent No. 5838047

The known conventional techniques have the following problems to be solved.
A complicated arithmetic process is required for the optimization process as shown in Patent Document 1. As the types of raw materials and products increase, the calculation time also increases. Minimization of industrial waste will also meet environmental demands. In order to operate the production line efficiently, it is desired to obtain the optimized arithmetic processing result in less calculation time. An object of the present invention is to solve the above problems.

The following configurations are means for solving the above problems, respectively.

<Structure 1>
When cutting out m rectangular products from k types of raw materials, find the number of raw materials required for each type, and find out how to allocate the product to each raw material.
It minimizes raw material costs and
In the case of k = 1, one raw material shall be taken out, and the products for which the allocation order has been determined shall be taken out in the allocation order.
The initial allocation process, in which the corners of the raw materials taken out and the corners of the unallocated products taken out are overlapped and allocated if possible, and the above unallocated products are regarded as assigned products.
The raw material is cut by a straight line passing through one of the two sides facing the corner of the allocated product, the raw material is divided into two, and the allocated product is divided into two. Raw material division processing that cuts the containing side with a straight line passing through the other side of the above two sides of the allocated product, and
The corners of the divided raw materials that do not include the above-mentioned allocated products generated by cutting and the corners of the newly extracted unallocated products are overlapped, and if allocation is possible, allocation is performed, and the above-mentioned newly extracted unallocated products The raw material division process is executed after the product is assigned as a product, and if allocation is not possible, the continuous allocation process of returning the newly extracted unallocated product to the original state while maintaining the allocation order is repeated.
Repeat until there are no more products that can be assigned to any of the divided raw materials, and when there are no more products, take out one new raw material and repeat the initial allocation process, the raw material division process, and the continuous allocation process. The first product allocation order allocation means that controls the calculation to determine the required number of raw materials and how to allocate the product to each raw material by repeating until all the unallocated products become allocated products.
When k> 1, the price of each raw material is set, one raw material i of the i-type from i = 1 to k is taken out, and the products for which the allocation order is defined are taken out in the allocation order.
The initial allocation process, the raw material division process, and the repetition of the continuous allocation process are performed.
Repeat until there are no more products that can be assigned to any of the divided raw materials i, and when they are gone,
All k types of raw materials (i = 1 to k), determine the cheapest price per product area pi, the combination of raw materials and products, and execute the price comparison judgment process per product area with the corresponding product as the allocated product.
Take out the remaining unallocated products in order of allocation
The initial allocation process, the raw material division process, the repetition of the continuous allocation process, the price calculation process per product area, and the price comparison determination process per product area
Repeat until all products are allocated products, and control the calculation to find the required number of raw materials for each type, the total price of the raw materials, and how to allocate the product to each raw material. Product allocation order allocation means and
An individual generation means for generating a gene that specifies each of the m rectangular products, a plurality of chromosomes having loci for arranging the genes in the selected allocation order, and the generated individual as a parent individual. , crossover process, or sudden mutation treatment, or by the selection process, to generate a plurality of child individuals, and its multiple offspring and the next generation of parents, by repeating the generation change,
It is provided with a next-generation individual generation means for generating an individual representing the allocation order of the products.
When k = 1, the arithmetic processing by the first product allocation order allocation means and the individual generation means, and when k> 1, the arithmetic processing by the second product allocation order allocation means and the above. A member allocation system characterized by minimizing raw material costs by executing next-generation individual generation means.

<Structure 2>
The member allocation system according to configuration 1, wherein the orientation of the product when the corners of the raw material and the product are overlapped is treated as different genes depending on whether the product is oriented in a certain state or rotated by 90 degrees.

<Structure 3>
In the above crossing process,
Arbitrary two of the above parent individuals are designated as "parent 1" and "parent 2", and the same number of genes of the child individual that inherits a part of the gene sequence from both of them are generated as the same number as the above parent individual.
In the above mutation treatment,
Any two genes at the locus are exchanged with any of the above offspring to generate new offspring.
In the selection process of the above individual,
From the product allocation order represented by the parent individual and the child individual, the same number as the parent individual is selected from the one with the smaller number of required raw materials or the one with the lower cost of the required raw materials to be the next generation. The member allocation system according to the first or second configuration.

<Structure 4>
The member allocation system according to any one of configurations 1 to 3, wherein the next-generation individual generation means selects a product allocation order according to the following procedure.
(1) M initial populations (first generation) are randomly generated.
(2) Two parent individuals are randomly selected from the M population.
(3) M child individuals are produced from two parent individuals by crossover processing.
(4) Mutation treatment is performed on a set number of child individuals out of the obtained M child individuals.
(5) Calculate the required number of raw materials or the raw material cost for a total of 2M individuals, including M parent individuals and M child individuals.
(6) Take out M individuals from the required number of raw materials or the one with the lowest raw material cost,
The next generation (second generation) individual population.
(7) Repeat the generation changes from (1) to (6) above, and calculate when the required number of raw materials or the difference in raw material costs reaches the convergence test, or when the set number of generation changes is reached. finish.
(8) From the smallest or near-minimum solids, the product allocation order is selected with reference to those chromosomes.

<Structure 5>
A computer program that causes a computer to function as the member allocation system according to any one of configurations 1 to 4.

<Structure 6>
A computer-readable recording medium on which the computer program according to configuration 5 is recorded.

By setting a specific allocation order for products and repeating the initial allocation process 38, the raw material division process 48, and the subsequent allocation process 52 in order, and by optimizing the above allocation order by a genetic engineering method, conventionally It is possible to find the optimum allocation method at higher speed than.

It is explanatory drawing which shows the function of the system of this invention. It is a calculation processing example flowchart of the first product allocation order allocation means 54. It is a concrete operation flowchart of the initial allocation process. It is a concrete operation flowchart of a raw material division process. It is a concrete operation flowchart of the continuation allocation process. It is operation example flowchart of the 2nd product allocation order allocation means. It is explanatory drawing of the genetic engineering method. It is a chart exemplifying the product data used in an Example. It is a chart of the allocation result optimized by this invention. It is an illustration of the allocation result optimized by the present invention. It is a chart of the allocation result by the first fit method. It is an illustration of the allocation result by the first fit method. It is a chart of the allocation result optimized by the method of Patent Document 1. It is an illustration of the allocation result optimized by the method of Patent Document 1. It is a comparison table of three types of arithmetic processing results.

Hereinafter, embodiments of the present invention will be described in detail for each example.

FIG. 1 is an explanatory diagram showing a function of the system of the present invention.
The portion surrounded by the broken line frame is the input / output data, and the portion surrounded by the solid line frame is the functional block of the arithmetic processing unit of the computer that controls the member allocation system 12.

As shown in FIG. 1A, this arithmetic processing unit includes a first product allocation order allocation means 54, a second product allocation order allocation means 66, an individual generation means 74, and a next-generation individual generation means 86. .. The first product allocation order allocation means 54 operates when there is only one type of raw material 18. The first product allocation order allocation means 54 repeats the initial allocation process 38, the raw material division process 48, and the continuous allocation process 52, and adopts the product allocation order, the required number of raw materials 20. And how to allocate the product 14 to each raw material 22.

The second product allocation order allocation means 66 operates when there are a plurality of types of raw materials 18. This executes the initial allocation process 38, the raw material division process 48, and the repetition of the continuous allocation process 52 for all types of raw materials 18, and executes the price calculation process 62 per product area and the price comparison determination process 64 per product area. Therefore, when the allocation order of this product is adopted, the total number of required raw materials 20 for each type, the price 24 of the raw materials 24, and the method 22 of allocating the product 14 to each raw material 18 are obtained.

That is, in this system, first, the condition that m rectangular products 14 are cut out from k kinds of raw materials 18 is set, and the allocation order of the products 14 at the time of allocation calculation is set in advance and the calculation is started. k is a parameter that determines the type of raw material.

When k = 1, there is only one type of raw material. In this case, the raw materials 18 are taken out one by one and the products are allocated. Each product arranged in advance in the order of allocation shall be taken out in the order of allocation.

The allocation method differs depending on the order of product allocation. Try different product allocations to find the cheapest way to allocate raw materials. For example, as the soundproof wall material used for the wall of a building, dozens of types of vertical and horizontal dimensions are used for one building. The number of combinations in the allocation order is enormous. It takes a long time to calculate all cases. Therefore, a genetic engineering method is adopted to select the optimum allocation order. The individual generation means 74 and the next-generation individual generation means 86 execute the processing.

The procedure for determining the allocation method will be briefly described with reference to FIGS. 1 (b) and 1 (c). For example, it is assumed that there are three products 14 and they are given identification numbers of 1, 2, and 3. As shown in FIG. 1B, the two sides of the product 14 facing the corner 32 are referred to as one side 44 and the other side 40, respectively.

One raw material 18 is taken out, and the corner 30 of the raw material and the corner 32 of the product 14 whose first identification number is displayed as 1 in the allocation order are overlapped with each other, and if allocation is possible, allocation is performed. This is the procedure shown in FIG. 1 (c).

As a result, the product 14 having the identification number 1 becomes the assigned product 36, and is excluded from the subsequent allocation target. In this way, the unallocated product 34 and the allocated product 36 are distinguished because it is judged whether or not the allocation is possible by returning to the beginning of the allocation order many times. The above is the initial allocation process 38.

Next, here, the raw material 18 is cut by a straight line 42 passing through one side 44 of the allocated product 36, and the raw material 18 is divided into two. Further, the raw material 18 divided into two is cut along a straight line 46 passing through the other side 40 of the allocated product 36. This is the raw material division process 48.

After that, the continuous allocation process 52 is started. This continuous allocation process repeats the following process. The above process produces two divided raw materials 50 and 51 that do not contain the allocated product 36. Here, the corner 30 of the raw material 50 and the corner 32 of the unallocated product 34 whose second identification number in the newly extracted allocation order is displayed as 2 are overlapped with each other, and allocation is performed if allocation is possible. After the allocation, the unallocated product 34 whose newly extracted identification number is displayed as 2 is designated as the allocated product 36, and then the same process as the raw material division process 48 is executed. At this time, since the product is no longer allocated to the two divided raw materials that do not include the allocated product 36, the continuous allocation process is continued for the raw material 51.

If no product can be assigned to either of the divided raw materials 50 and 51, the newly extracted unallocated product 34 is returned to its original state while maintaining the above allocation order. Then, the next unassigned product 34 is taken out and it is determined whether or not the allocation is possible. That is, the continuous allocation process 52 is a process of repeating the allocation process and the raw material division process, and ends the continuous allocation process 52 when none of the products can be allocated to the divided raw materials.

Again, take out one new raw material 18. The products are returned to the beginning of the allocation order, and are taken out in order from the first unassigned product 34. Then, the initial allocation process 38, the raw material division process 48, and the continuous allocation process 52 are repeated. This is repeated until all the unassigned products 34 become the assigned products 36. Then, the calculation is controlled so as to obtain the required number of raw materials 20 and the method of allocating the product 14 to each raw material 18. The first product allocation order allocation means 54 executes the above processing.

Next is the processing of the second product allocation order allocation means 66. When there are a plurality of types of raw materials and k> 1, the price 24 of each raw material is set, and one raw material 18i of the i-type from i = 1 to k is taken out. The products 14 for which the allocation order has been determined are taken out in the allocation order as described above.

The initial allocation process 38, the raw material division process 48, and the continuous allocation process 52 are repeated. When there is no product 14 that can be assigned to any of the divided raw materials 18i, the product 14 assigned to the raw material 18i is obtained. The price pi per product area is obtained from the sum of the price of the above raw material i and the area 16 of the allocated product. This is the price calculation process 62 per product area.

This is performed for all k types of raw materials 18 (i = 1 to k) to obtain the cheapest combination of raw materials 18 and 14 with a price pi per product area. Then, the corresponding product 14 is designated as the assigned product 36. This is the price comparison determination process 64 per product area.

The remaining unallocated products 34 are taken out in the order of allocation, the initial allocation process 38, the raw material division process 48, and the continuous allocation process 52 are repeated, and the price calculation process 62 per product area and the price comparison determination process 64 per product area are repeated. And execute. This process is repeated until all the products 14 become the allocated products 36.

In this way, the required number of raw materials 18 for each type, the total price of the raw materials 24, and the method 22 for allocating the product 14 to each raw material 18 are obtained. The second product allocation order allocation means 66 executes the above processing.

By the above processing, a method of allocating the product 14 to the raw material 18 when a specific allocation order of the products is set is obtained. After that, if the allocation order of various products is selected and the same calculation is repeated, a more economical allocation method is required. The order of allocation is obtained by a genetic engineering method. Here, before the explanation, the operation of the first product allocation order allocation means and the second product allocation order allocation means will be specifically described by a flowchart.

(First product allocation order allocation method)
FIG. 2 is a flowchart of an example of arithmetic processing of the first product allocation order allocation means 54. The specific processing of steps S12, 13 and 14 will be described with reference to FIGS. 3, 4 and 5, respectively.
When the arithmetic processing is started, first, in step S11, the allocation order of the products is determined. And all products are unallocated products. In step S12, the initial allocation process is executed. Here, the first product taken out is assigned to the raw material.

After that, in step S13, the raw material division process is executed. Here, the surplus portion of the raw material is cut off to obtain two new raw materials. Next, in step S14, the continuation allocation process is executed. Here, it is determined whether any unallocated product can be assigned to the two new raw materials.

In the initial allocation process, the raw material division process, and the continuous allocation process, the products are allocated as much as possible to one raw material. If it is determined that no product can be allocated to the new raw material that has been cut out, the subsequent allocation process is terminated.

In step S15, it is determined whether or not all the products have been allocated. If the result of this determination is yes, the process proceeds to step S16, and if no, the process proceeds to step S12.

Every time one new raw material is taken out, the initial allocation process, the raw material division process, and the continuous allocation process are executed, and when all the products are allocated to any of the raw materials, the process proceeds from step S15 to step S16.

In step S16, a method of allocating a product to each raw material is determined based on the results of the arithmetic processing so far. In step S17, the total number of raw materials required to cut out all the products is determined. This result is repeatedly compared while changing the allocation order of products by the genetic engineering method described later, and the allocation method with the lowest raw material cost is obtained.

FIG. 3 is a specific operation flowchart of the initial allocation process.
The initial allocation process is started in step S21. In step S22, one raw material is taken out. In step S23, one unallocated product is taken out. In step S24, as shown in FIG. 1C, the corner 30 of the raw material 18 and the corner 32 of the product 14 are overlapped.

In step S25, it is determined whether or not the allocation is possible. Then, if allocation is possible, the process proceeds to step S26 to determine the allocation position of the product. Then, in step S27, the product is made into an allocated product.

Further, if it is determined in step S25 that the allocation cannot be performed, the process returns to step S23, a new unallocated product is taken out, and the processing of step S24 or less is executed again. Since the dimensions of the raw material are selected to be sufficiently larger than the dimensions of the product, the process always proceeds to step S27 unless it may not be possible to allocate the raw material as it is depending on the orientation of the product.

FIG. 4 is a specific operation flowchart of the raw material division process.
The raw material division process is started in step S31. In step S32, the raw material is cut with a straight line passing through one side of the product. In step S33, the raw material is cut in a straight line passing through the other side of the product. In step S34, the two divided raw materials are taken out and subjected to the continuous allocation process.

FIG. 5 is a specific operation flowchart of the continuous allocation process.
The subsequent allocation process is started in step S41. In S42, it is determined whether or not the products in the last allocation order are finished. If it is not finished, proceed to S43. In other cases, the continuation allocation process is terminated.
In step S43, one raw material obtained by the raw material dividing process is taken out. In step S44, one unallocated product in the following allocation order is taken out.

In step S45, the corners of the raw material and the product are overlapped. In step S46, it is determined whether or not the allocation is possible. If the allocation is not possible, the process returns to step S42 and a determination is made.

If allocation is possible, the allocation position of the product is determined in step S47. In step S48, the product is made into an assigned product. In step S49, the raw material division process is performed, the process returns to S42, and it is determined whether or not the product has been completed.

(Second product allocation order allocation means)
FIG. 6 is an operation example flowchart of the second product allocation order allocation means.
First, the product allocation order is determined in step S51. In the next step S52, the raw material to be taken out is selected. Since there are multiple raw materials with different dimensions, for example, the longest one in the vertical direction is selected and taken out in order. In step S53, the price is set with reference to the price list of raw materials and the like.

After that, in step S54, the above initial allocation process is executed. Further, in step S55, the above-mentioned raw material division process is executed. Then, in step S56, the continuation allocation process is executed.

Here, all the products that can be assigned to the single raw material taken out in step S52 were assigned. In step S57, the price p i per product unit area is calculated. It is obtained by dividing the price of the raw material set in step S53 by the total area of the allocated products.

In the next step S58, it is determined whether or not the p i has been calculated for all the raw materials. If the result of this determination is yes, the process proceeds to step S59, and if no, the process returns to step S25. The loop from step S52 to step S58 completes as much product allocation as possible for all types of raw materials.

Then, if the p i has been calculated for all the raw materials, the process proceeds to step S59 to detect the cheapest p i. The raw material is determined in step S60, and the method of allocating the product is determined in step S61. In step S62, it is determined whether or not all the products have been allocated. If the result of this determination is yes, the process proceeds to step S63, the required number of raw materials for each type and the total price of the raw materials are obtained, and the process is terminated. If no, the process proceeds to step S52.

Through the above processing, the second product allocation order allocation means 66 can also determine the required number of raw materials for each type and the method of allocating the product to those raw materials. Then, in the first step S51, the allocation order of the products based on the genetic engineering process is selected, and the same arithmetic process is repeated to obtain the optimum value.

(Selection of genetic engineering allocation order)

FIG. 7 is an explanatory diagram of the genetic engineering method.
For example, all rectangular products are arranged vertically in advance, and are arranged in order from the longest one to be the initial value of the allocation order. When the product may be rotated 90 degrees, as shown in FIG. 7A, the product 14 is treated as a different gene depending on whether the product 14 is oriented 90 degrees or rotated 90 degrees.

That is, when the gene of product 1 is 1A and rotated by 90 degrees, it is regarded as another gene 1B. When there is one product 1, there is only one of 1A and 1B in the chromosome of one individual. If the product is square, it is the same even if it is rotated, so A and B are not attached to the product labeled as 3. In the example of the figure, three types of allocation order of products 1A-2A-3, 1A-2B-3, and 1B-2A-3 are illustrated. This is the gene sequence.

In the genetic engineering technique, a plurality of chromosomes 72 having a gene 68 for each of m rectangular products 14 and a locus 70 for arranging the genes 68 in the above-selected allocation order are generated as individuals. Then, as shown in FIG. 7B, for example, the individual generation means 74 arranges the three loci 70 in an alternate sequence of various allocation orders, and repeats the above arithmetic processing.

As shown in FIG. 7 (c), the next generation individuals generating means 86, an individual with the generated parent individuals 76, crossover process, or mutation treatment, or by the selection process, it generates a plurality of offspring individuals , The plurality of child individuals 84 are set as the next-generation parent individual 76, and the generation change is repeated to generate an individual representing the allocation order of the product 14.

In the cross-processing 78, any two of the parent individuals 76 are designated as "parent 1" and "parent 2", and the number of genes of the child individual 84 that inherits a part of the gene sequence from both of them is the same as that of the parent individual 76. Generate.

In the mutation treatment, any two genes at the locus 70 are exchanged with any of the offspring 84 to generate a new offspring 84.

After that, from the product allocation order represented by the parent individual 76 and the child individual 84, the same number as the parent individual 76 is selected from the one with the smaller number of required raw materials 20 or the one with the lower cost of the required raw material 18. Then, the individual selection process 82, which is to be the next generation, is executed.

Specifically, the next-generation individual generation means 86 selects the product allocation order by the following procedure.
(1) M initial populations (first generation) are randomly generated.
(2) Two parent individuals 76 are randomly selected from the M population.
(3) From two parent individuals 76, M child individuals 84 are produced by crossing treatment 78.
(4) Of the obtained M child individuals 84, a set number of child individuals 84 are subjected to mutation treatment.
(5) For a total of 2M individuals, M for the parent individual 76 and M for the child individual 84, the allocation order is set for each, and the required number of raw materials is 20, or the raw material cost is calculated.
(6) Here, M individuals are taken out from the required number of raw materials of 20 or the one with the lowest raw material cost, and used as a next-generation (second-generation) individual population.
(7) After that, the generation change of (1) to (6) above is repeated, and the calculation is made when the required number of raw materials or the raw material cost reaches the convergence test, or when the set number of generation changes is reached. To finish.
(8) From among the number of raw materials or the solids whose raw material costs are the minimum or close to the minimum, the product allocation order is selected with reference to those chromosomes 72.

As described above, the calculation for obtaining the required number of raw materials or the raw material cost is repeated while evolving the chromosome 72 corresponding to the allocation order, the optimum raw material is selected, and the product allocation method is determined.

FIG. 8 is a chart illustrating product data used in the examples.
As shown in this figure, there are 60 products. There are seven types of dimensions. Products with the same dimensions were given the same product number. The total area of the product is 34.32 square meters. For example, two types of raw materials, one with a width of 910 mm and a length of 1,820 mm, and the other with the same width and half the length can be used.

FIG. 9 is a chart of the allocation results optimized by the present invention. FIG. 10 is an illustration of the allocation result optimized by the present invention. Further, FIG. 15 is a comparison table of the following three types of arithmetic processing results.
When the product was assigned to the raw material by the above method of the present invention, the results shown in this figure were obtained. That is, all products can be assigned using 25 long raw materials and 1 half raw material. 10-1 is assigned 10 sheets, 10-2 is assigned 3 sheets, 10-3 is assigned 8 sheets, 10-4 is assigned 2 sheets, 10-5, FIG. One raw material was used for each of the 10-6 allocation methods, and one half-sized raw material was used for the allocation method of FIG. 10-7. In this case, the total area of raw materials was 42.2 square meters. As a result, the yield was 81.3%.

FIG. 11 is a chart of the allocation results by the first fit method. FIG. 12 is an illustration of the allocation result.
This is a calculation result using the known first fit method.
10 sheets are assigned in FIG. 12-1, 1 sheet is assigned in FIG. 12-2, 12 sheets are assigned in FIG. 12-3, FIGS. 12-4, 12-5, 12-6, 12 For the allocation method of -7, one raw material was used for each. According to this calculation result, 27 raw materials are used, and half the length is not used. In this case, the total area of raw materials was 47 square meters and the yield was 76.7%.

FIG. 13 is a chart of the allocation results optimized by the method of Patent Document 1. FIG. 14 is an illustration of the allocation result.
10 sheets are assigned in FIG. 14-1, 3 sheets are assigned in FIG. 14-2, 8 sheets are assigned in FIG. 14-3, 2 sheets are assigned in FIG. 14-4, and FIGS. 14-5 and 14-5 are used. One raw material was used for each of the allocation methods of 14-6, and one raw material of half the size was used for the allocation method of FIG. 14-7. In this case, as in the case of the present invention, all the products can be assigned by using 25 long raw materials and one half the length of the raw material. At this time, the total area of raw materials was 42.2 square meters. As a result, the yield was 81.3%.

Although the method of the present invention and the method of Patent Document 1 can obtain the same results, the method of the present invention has an advantage that the calculation processing time can be shortened as compared with the method of Patent Document 1.

12 Material allocation system 14 Product 16 Product area 18 Raw material 20 Number of required raw materials 22 Allocation method 24 Raw material price 26 Raw material cost 28 Allocation order 30 Raw material corner 32 Unallocated product corner 34 Unallocated product 36 Allocated product 38 Initial allocation processing 40 Straight line passing through one side 42 side 44 Straight line passing through the other side 46 side 48 Raw material division processing 50 Divided raw material 51 Divided raw material 52 Subsequent allocation processing 53 Yield calculation processing 54 First product allocation Ordering means 62 Price calculation processing per product area 64 Price comparison judgment processing per product area 66 Second product allocation Ordering means 68 Genes that specify products 70 Gene locus 72 Chromium 74 Individual generation means 76 Parents 78 Crossing processing 80 Selection Processing 84 Child 86 Next-generation individual generation means

Claims (6)

When cutting out m rectangular products from k types of raw materials, find the number of raw materials required for each type, and find out how to allocate the product to each raw material.
It minimizes raw material costs and
In the case of k = 1, one raw material shall be taken out, and the products for which the allocation order has been determined shall be taken out in the allocation order.
The initial allocation process, in which the corners of the raw materials taken out and the corners of the unallocated products taken out are overlapped and allocated if possible, and the above unallocated products are regarded as assigned products.
The raw material is cut by a straight line passing through one of the two sides facing the corner of the allocated product, the raw material is divided into two, and the allocated product is divided into two. Raw material division processing that cuts the containing side with a straight line passing through the other side of the above two sides of the allocated product, and
The corners of the divided raw materials that do not include the above-mentioned allocated products generated by cutting and the corners of the newly extracted unallocated products are overlapped, and if allocation is possible, allocation is performed, and the above-mentioned newly extracted unallocated products The raw material division process is executed after the product is assigned as a product, and if allocation is not possible, the continuation allocation process of returning the newly extracted unallocated product to the original state while maintaining the allocation order is divided. Repeat until there are no products that can be assigned to any of the raw materials.
When there are no more products that can be assigned, one new raw material is taken out, and the initial allocation process, the raw material division process, and the continuation allocation process are repeated, and all the unallocated products become allocated products. The first product allocation order allocation means that controls the calculation to obtain the required number of raw materials and how to allocate the product to each raw material.
When k> 1, the price of each raw material is set, one raw material i of the i-type from i = 1 to k is taken out, and the products for which the allocation order is defined are taken out in the allocation order.
The initial allocation process, the raw material division process, and the repetition of the continuous allocation process are performed.
Repeat until there are no more products that can be assigned to any of the divided raw materials i, and when they are gone,
All k types of raw materials (i = 1 to k), determine the cheapest price per product area pi, the combination of raw materials and products, and execute the price comparison judgment process per product area with the corresponding product as the allocated product.
Take out the remaining unallocated products in order of allocation
The initial allocation process, the raw material division process, the repetition of the continuous allocation process, the price calculation process per product area, and the price comparison determination process per product area are performed.
Repeat until all products are allocated products, and control the calculation to find the required number of raw materials for each type, the total price of the raw materials, and how to allocate the product to each raw material. Product allocation order allocation means and
An individual generation means for generating an individual having a gene for designating each of the m rectangular products and a plurality of chromosomes having a locus for arranging the genes in the selected allocation order, and the generated individual as a parent individual. , crossover process, or sudden mutation treatment, or by the selection process, to generate a plurality of child individuals, and its multiple offspring and the next generation of parents, by repeating the generation change,
It is provided with a next-generation individual generation means for generating an individual representing the allocation order of the products.
When k = 1, the arithmetic processing by the first product allocation order allocation means and the individual generation means, and when k> 1, the arithmetic processing by the second product allocation order allocation means and the above. A member allocation system characterized by minimizing raw material costs by executing next-generation individual generation means.
The member allocation system according to claim 1, wherein the orientation of the product when the corners of the raw material and the product are overlapped is treated as different genes depending on whether the product is oriented in a certain state or rotated by 90 degrees. In the above crossing process,
Arbitrary two of the above parent individuals are designated as "parent 1" and "parent 2", and the same number of genes of the child individual that inherits a part of the gene sequence from both of them are generated as the same number as the above parent individual.
In the above mutation treatment,
Any two genes at the locus are exchanged with any of the above offspring to generate new offspring.
In the selection process of the above individual,
From the product allocation order represented by the parent individual and the child individual, the same number as the parent individual is selected from the one with the smaller number of required raw materials or the one with the lower cost of the required raw materials to be the next generation. The member allocation system according to claim 1 or 2, wherein the member allocation system is characterized in that. The member allocation system according to any one of claims 1 to 3, wherein the next-generation individual generation means selects a product allocation order according to the following procedure.
(1) M initial populations (first generation) are randomly generated.
(2) Two parent individuals are randomly selected from the M population.
(3) M child individuals are produced from two parent individuals by crossover processing.
(4) Mutation treatment is performed on a set number of child individuals out of the obtained M child individuals.
(5) Calculate the required number of raw materials or the raw material cost for a total of 2M individuals, including M parent individuals and M child individuals.
(6) Take out M individuals from the required number of raw materials or the one with the lowest raw material cost,
The next generation (second generation) individual population.
(7) Repeat the generation changes from (1) to (6) above, and calculate when the required number of raw materials or the difference in raw material costs reaches the convergence test, or when the set number of generation changes is reached. finish.
(8) From the smallest or near-minimum solids, the product allocation order is selected with reference to those chromosomes. A computer program that causes a computer to function as the member allocation system according to any one of claims 1 to 4. A computer-readable recording medium on which the computer program according to claim 5 is recorded.

Images