KR102521781B1 - Tube matching system and method thereof - Google Patents

Abstract

The present invention relates to a tube matching system and a method thereof. The tube matching system comprises: a piping group generation unit which extracts required piping data based on a bill of material (BOM) and generates a plurality of piping groups by grouping required piping by size and material; a matching plan generation unit which generates a first combination list and a second combination list by applying a first matching algorithm and a second matching algorithm to each piping group based on the length of each required piping and the unit length of a raw material piping for each of the plurality of piping groups; and a matching plan optimization unit which analyzes the first combination list and the second combination list for each of the plurality of piping groups to derive an optimal matching plan which minimizes the amount of raw material piping input. The optimal matching plan for the required piping is derived through the system, thereby minimizing the quantity and loss rate of the input raw material piping.

Description

Tube matching system and method {TUBE MATCHING SYSTEM AND METHOD THEREOF}

The present invention creates a plurality of pipe groups by grouping required pipes by size and material based on the bill of materials (BOM Report), and tube matching that can minimize the loss rate of raw material pipes through optimization of matching plans for each pipe group It relates to systems and methods.

The pipe loss rate (remaining materials after use) of the current construction occurs up to 15 to 20% of the total pipe material, and the risk must be borne by the company that manufactures and provides the pipe. However, in the past, there were many cases in which the pipe was manually manufactured and the loss rate was not taken into account.

In general, when manufacturing piping, raw material piping is ordered by size and material. However, in the existing manual manufacturing method, it is difficult to calculate the demand (or input) for each size and material of piping, resulting in inconvenience in inventory management.

In addition, since the remaining piping materials become waste materials, not only are profits reduced from the standpoint of piping manufacturers and providers, but also environmental pollution due to waste material treatment is emerging as a problem.

In addition, unnecessary expenditure is increased by excessive use of raw material piping, which in some cases could have been used less.

Patent Publication No. 10-2021-0031113 (published date: March 19, 2021) Publication No. 10-2013-0074612 (published date: July 04, 2013)

The present invention has been made to improve the above-mentioned problems, and the present invention has a task to provide a tube matching system and method for generating an optimized matching plan capable of minimizing the input amount and loss rate of raw material pipes during pipe manufacturing.

In order to achieve the above object, the tube matching system according to an embodiment of the present invention extracts required pipe data based on a bill of material (BOM) and groups required pipes by size and material to obtain a plurality of A first combination list by applying a first matching algorithm and a second matching algorithm to each pipe group based on the length of each required pipe and the unit length of raw material pipe for each pipe group. and a matching plan generation unit that generates a second combination list and a matching plan that derives an optimal matching plan that minimizes the input amount of raw material pipes by analyzing the first combination list and the second combination list for each of the plurality of pipe groups. It is characterized in that it includes an optimization unit.

The first matching algorithm adds a first combination obtained by combining each required pipe for each pipe group at the maximum approximation to the unit length of the raw material pipe to the first combination list, and adds the remaining required pipe to the unit length of the raw material pipe. Up to the Mth combination combined with the maximum approximation is added to the first combination list, and the second matching algorithm sorts in descending order from the longest required pipe among each required pipe for each pipe group, and the raw material from the longest required pipe. The first combination obtained by combining the unit length of the pipe at the maximum approximation is added to the second combination list, and the remaining required pipe is added to the second combination list up to the Nth combination obtained by combining the unit length of the raw material pipe at the maximum approximation. it may be

The matching plan optimization unit compares the first combination list and the second combination list for each pipe group, determines a combination list having a smaller amount of raw material pipe input as the final combination list, and sets the final combination list for each pipe group as the optimal combination list. A matching plan can be derived.

The matching plan optimizer may extract at least one or more combinations that are combined in 60% or less of the unit length of the raw material pipe from the final combination list for each pipe group, and recombine the at least one or more combinations to a minimum approximation.

The maximum approximation may be 70% or more of the unit length of the raw material pipe.

A tube matching method according to another embodiment of the present invention is a first step of generating a plurality of pipe groups by extracting required pipe data based on a bill of material (BOM) and grouping required pipes by size and material; A second combination list for generating a first combination list and a second combination list by applying a first matching algorithm and a second matching algorithm for each pipe group based on the length of each required pipe for each pipe group and the unit length of the raw material pipe. and a third step of deriving an optimal matching plan that minimizes an input amount of raw material pipes by analyzing the first combination list and the second combination list for each of the plurality of pipe groups.

In the third step, the first combination list and the second combination list are compared for each pipe group, and a combination list having a smaller raw material pipe input is determined as the final combination list, and the final combination list for each pipe group is selected as the optimal combination list. A matching plan can be derived.

In the third step, at least one or more combinations combined in 60% or less of the unit length of the raw material pipe from the final combination list for each pipe group may be extracted and the at least one or more combination may be recombined to a minimum approximation.

The tube matching system according to an embodiment of the present invention can minimize the loss rate of raw material pipes when manufacturing pipes.

According to one embodiment of the present invention, it is possible to obtain a cost reduction effect by minimizing the input amount of raw material piping.

According to one embodiment of the present invention, it is possible to provide consistency and transparency of the required pipe preparation process by deriving an optimized matching plan.

1 is a block diagram schematically showing a tube matching system according to an embodiment of the present invention.
2 is a flowchart illustrating a process for deriving an optimal matching plan in a tube matching method according to an embodiment of the present invention.
Figure 3 is a chart showing the amount of raw material pipe input for each size and material before applying the tube matching method and the corresponding loss rate.
4A to 4B are charts showing input amounts of raw material pipes for each size and material in a state where a first matching algorithm and a second matching algorithm are applied to each pipe group, and a corresponding loss rate.
5 is a chart showing the amount of raw material pipe input for each size and material in a state where the optimal matching plan is applied and the corresponding loss rate.

The present invention as described above will be described in detail through the accompanying drawings and embodiments.

It should be noted that technical terms used in the present invention are only used to describe specific embodiments and are not intended to limit the present invention. In addition, technical terms used in the present invention should be interpreted in terms commonly understood by those of ordinary skill in the art to which the present invention belongs, unless specifically defined otherwise in the present invention, and are excessively inclusive. It should not be interpreted in a positive sense or in an excessively reduced sense. In addition, when the technical terms used in the present invention are incorrect technical terms that do not accurately express the spirit of the present invention, they should be replaced with technical terms that those skilled in the art can correctly understand. In addition, general terms used in the present invention should be interpreted as defined in advance or according to context, and should not be interpreted in an excessively reduced sense.

Also, singular expressions used in the present invention include plural expressions unless the context clearly dictates otherwise. In the present invention, terms such as "consisting of" or "comprising" should not be construed as necessarily including all of the various elements or steps described in the invention, and some of the elements or steps are included. It should be construed that it may not be, or may further include additional components or steps.

In addition, terms including ordinal numbers such as first and second used in the present invention may be used to describe components, but components should not be limited by the terms. Terms are used only to distinguish one component from another. For example, a first element may be termed a second element, and similarly, a second element may be termed a first element, without departing from the scope of the present invention.

Hereinafter, a preferred embodiment according to the present invention will be described in detail with reference to the accompanying drawings, but the same or similar components are assigned the same reference numerals regardless of reference numerals, and redundant description thereof will be omitted.

In addition, in describing the present invention, if it is determined that a detailed description of a related known technology may obscure the gist of the present invention, the detailed description will be omitted. In addition, it should be noted that the accompanying drawings are only for easily understanding the spirit of the present invention, and should not be construed as limiting the spirit of the present invention by the accompanying drawings.

1 is a block diagram schematically showing a tube matching system 100 according to an embodiment of the present invention.

Referring to FIG. 1 , a tube matching system 100 according to an embodiment of the present invention may include a pipe group generator 110, a matching plan generator 120, and a matching plan optimizer 130.

The pipe group creation unit 110 may generate a plurality of pipe groups by extracting required pipe data based on a bill of material (BOM) and grouping required pipes by size and material.

A bill of materials (BOM) is a list of parts or materials required for production of a product, and generally, the parts/materials required for construction or product production are clearly arranged. The pipe group creation unit 110 creates a plurality of pipe groups by extracting required pipe data from the bill of materials and grouping them by size and material. The size here means the diameter of the pipe.

The matching plan generating unit 120 applies a first matching algorithm and a second matching algorithm to each pipe group based on the length of each required pipe for each pipe group and the unit length of raw material pipe to obtain a first combination list and a second matching algorithm. 2 You can create a combination list.

Here, the first matching algorithm adds a first combination obtained by combining each required pipe for each pipe group at the maximum approximation to the unit length of the raw material pipe to the first combination list, and adds the remaining required pipe to the unit length of the raw material pipe. is added to the first combination list, and the second matching algorithm sorts in descending order from the longest required pipe among each required pipe for each pipe group, and the raw material from the longest required pipe. The first combination obtained by combining the unit length of the pipe at the maximum approximation is added to the second combination list, and the remaining required pipe is added to the second combination list up to the Nth combination obtained by combining the unit length of the raw material pipe at the maximum approximation. is to do

Here, the maximum approximation may be limited to 70% or more of the unit length of the raw material pipe.

The matching plan optimization unit 130 may derive an optimal matching plan that minimizes the input amount of raw material pipes by analyzing the first combination list and the second combination list for each of the plurality of pipe groups.

More specifically, the matching plan optimization unit 130 compares the first combination list and the second combination list for each pipe group, determines a combination list with a smaller amount of raw material pipe input as the final combination list, and determines the final combination list for each pipe group. A final combination list can be derived as the optimal matching plan.

According to an embodiment, the matching plan optimization unit 130 extracts at least one or more combinations that are combined in 60% or less of the unit length of the raw material pipe from the final list of combinations for each pipe group, and minimizes the one or more combinations. It can be recombined to an approximation. For example, if the unit length of the raw material pipe is 3000mm and two combinations in the final combination list of a specific pipe group are 1800mm or less, the matching plan optimization unit 130 calculates two Each combination is recombined to a minimum approximation. The third combination and the seventh combination are 1800 mm or less, which is 60% of the unit length of 3000 mm of the raw material pipe, that is, the third combination is a total of 1700 mm in which the required pipes A, B and C are 350 mm, 550 mm, and 800 mm, respectively, and the seventh combination It can be assumed that the required pipes for D, E, and F are 450 mm, 700 mm, and 550 mm, respectively, for a total of 1700 mm. At this time, the matching plan optimizer 130 may recombine the required pipes A and D into a third combination, and recombine the required pipes B, C, E, and F into a seventh combination. Therefore, the recombined third combination has a total length of 800 mm, and since a length of 2200 mm remains from the pipe requiring raw materials, it can be reused for other constructions or facilities later. On the other hand, the recombined seventh combination has a total length of 2600 mm. Therefore, the 3rd combination and the 7th combination before recombination leave 1300mm long pipes from the raw material piping, respectively, and the 2200mm and 400mm long piping left from the raw material piping by the recombined 3rd and 7th combinations, respectively, are utilized. It is known that sexuality can be improved.

Such a tube matching system 100 may be implemented in the form of a server, communicates with other systems or servers, exchanges information or data with each other, and processes data for tube matching. This server has the same configuration as a normal web server in terms of hardware, and in terms of software, program modules that implement various functions through various types of languages such as C, C++, Java, Visual Basic, Visual C, etc. can include In addition, it is provided in various ways depending on the operating system such as DOS, Windows, Linux, Unix, Macintosh, Android, and iOS in general server hardware. It can be implemented using a web server program that is being developed.

2 is a flowchart illustrating a process for deriving an optimal matching plan in a tube matching method according to an embodiment of the present invention.

Referring to FIG. 2, the tube matching method includes a first step of extracting data (S310), a second step of generating a first and second combination list for each pipe group (S320), and a step of deriving an optimal matching plan. It may consist of three steps (S330).

In the first step (S310), required pipe data is extracted based on a bill of material (BOM), and a plurality of pipe groups are created by grouping required pipes according to size and material.

In the second step (S320), a first combination list and a second matching algorithm are applied by applying a first matching algorithm and a second matching algorithm for each pipe group based on the length of each required pipe and the unit length of the raw material pipe for each of the plurality of pipe groups. Create a combination list.

In the third step (S330), the first combination list and the second combination list are analyzed for each of the plurality of piping groups to derive an optimal matching plan that minimizes the input amount of raw material piping.

More specifically, the third step (S330) compares the first combination list and the second combination list for each pipe group, determines a combination list with a smaller amount of raw material pipe input as the final combination list, and determines the final combination list for each pipe group. A combination list can be derived as the optimal matching plan. Accordingly, there is a cost reduction effect by being configured to use less raw material piping.

Here, the first matching algorithm adds a first combination obtained by combining each required pipe for each pipe group at the maximum approximation to the unit length of the raw material pipe to the first combination list, and adds the remaining required pipe to the unit length of the raw material pipe. is added to the first combination list, and the second matching algorithm sorts in descending order from the longest required pipe among each required pipe for each pipe group, and the raw material from the longest required pipe. The first combination obtained by combining the unit length of the pipe at the maximum approximation is added to the second combination list, and the remaining required pipe is added to the second combination list up to the Nth combination obtained by combining the unit length of the raw material pipe at the maximum approximation. is to do

Here, the maximum approximation may be limited to 70% or more of the unit length of the raw material pipe.

According to one embodiment, the third step (S330) is to extract at least one or more combinations that are combined in 60% or less of the unit length of the raw material pipe from the final combination list for each pipe group, and determine the at least one or more combination as a minimum approximation. can be recombined with Accordingly, at least one or more combinations recombined to a minimum approximation are configured to use less raw material pipes, so that the remaining raw material pipes can be appropriately recycled when used in other constructions or facilities later.

Figure 3 is a chart showing the amount of raw material pipe input for each size and material before applying the tube matching method and the corresponding loss rate.

Referring to FIG. 3, piping groups are formed by size (pipe diameter) and material, and the number of raw material piping to be input for each piping group, the length of remaining piping, and the loss rate are specified.

For example, a material group called AP of size 13 requires 27 raw material pipes and shows a loss rate of 18.7%. Surplus means the remaining length of raw material piping being used.

In conclusion, in FIG. 3, it can be seen that 78 raw material pipes are required for 4 pipe groups, and a loss rate of 19.6% is shown.

4A to 4B are charts showing input amounts of raw material pipes for each size and material in a state where a first matching algorithm and a second matching algorithm are applied to each pipe group, and a corresponding loss rate.

Referring to FIG. 4A, the first matching algorithm is applied to the four pipe groups, and the group made of AP of size 13 requires 23 raw material pipes and shows a loss rate of 4.6%. Overall, the four piping groups to which the first matching algorithm is applied require a total of 66 raw material piping and show a loss rate of 5.0%.

Referring to FIG. 4B, the second matching algorithm is applied to the four pipe groups, and the group made of AP of size 13 requires 25 raw material pipes and shows a loss rate of 12.2%. Overall, the four piping groups to which the second matching algorithm is applied require a total of 70 raw material piping and show a loss rate of 10.4%.

5 is a chart showing the amount of raw material pipe input for each size and material in a state where the optimal matching plan is applied and the corresponding loss rate.

The matching plan optimizer 130 is a combination list of pipe groups showing a smaller loss rate based on the data of FIGS. 4A to 4B to which the first matching algorithm and the second matching algorithm are applied for each pipe group, that is, a list of specific pipe groups. By selecting one of the first combination list and the second combination list, it is possible to create an optimal matching plan showing a loss rate of 3.5% while requiring a total of 65 raw material pipes for the four pipe groups as shown in FIG. 5 .

In the above, preferred embodiments according to the present invention have been shown and described. However, the present invention is not limited to the above-described embodiments, and various modifications can be made by anyone having ordinary knowledge in the technical field to which the present invention belongs without departing from the gist of the present invention appended within the scope of the claims. .

100: tube matching system
110: piping group creation unit
120: matching plan generation unit
130: matching plan optimization unit

Claims (9)

A pipe group creation unit that extracts required pipe data based on a bill of material (BOM) and creates a plurality of pipe groups by grouping required pipes by size and material;
A first combination list and a second combination list are generated by applying a first matching algorithm and a second matching algorithm to each pipe group based on the length of each required pipe for each of the plurality of pipe groups and the unit length of the previously prepared raw material pipe. a matching plan generating unit; and
For each of the plurality of pipe groups, a matching plan optimization unit for selecting a pipe group having a smaller raw material pipe input amount among the same pipe groups in the first combination list and the second combination list to derive a final combination list,
The first matching algorithm combines at least one required pipe for each pipe group and sets a combination having the smallest difference from the unit length of the raw material pipe without exceeding the unit length of the raw material pipe as the first combination. Add to the combination list, and combine at least one or more required pipes remaining except for the first combination, and a combination having the smallest difference from the unit length of the raw material pipe without exceeding the unit length of the raw material pipe is a second combination. By repeating the adding process, up to the M combination is added to the first combination list,
The second matching algorithm sorts each pipe group in descending order from the longest required pipe among each required pipe, and when the longest required pipe and at least one required pipe among the remaining required pipes are combined, the unit length of the raw material pipe A combination having the smallest difference with is added to the second combination list as a first combination, and when the longest required pipe among the remaining required pipes and at least one required pipe are combined, the unit length of the raw material pipe and the longest By repeating the process of adding a combination having a small difference as a second combination, up to the Nth combination is added to the second combination list,
The matching plan optimization unit,
With respect to the required pipes from the first to the last combination in the final combination list, at least one required pipe among the shortest required pipe and the remaining required pipe is combined in less than 60% of the unit length of the raw material pipe to obtain one Generating a unit combination, and generating another unit combination by combining at least one required pipe among the shortest required pipe and the remaining required pipe in 60% or less of the unit length of the raw material pipe with respect to the remaining required pipe The process is repeated, and one unit recombination is created with the shortest required pipe among any one unit combination and the shortest required pipe among the other unit combinations, and the remaining required pipes except for the shortest required pipe among any one unit combination. And another unit recombination is to be created by combining the remaining required pipes except for the shortest required pipe among the other unit combinations, the tube matching system.
delete delete delete delete In the tube matching method performed by the tube matching system,
A first step of generating a plurality of pipe groups by extracting required pipe data based on a bill of material (BOM) and grouping required pipes by size and material by a pipe group generator;
A first combination list by applying a first matching algorithm and a second matching algorithm for each pipe group based on the length of each required pipe for each of the plurality of pipe groups and the unit length of the previously prepared raw material pipe by the matching plan generator. and a second step of generating a second combination list; and
Third, for each of the plurality of pipe groups, the matching plan optimizer selects a pipe group having a smaller raw material pipe input among the same pipe groups in the first combination list and the second combination list to derive a final combination list. contains steps,
The first matching algorithm combines at least one required pipe for each pipe group and sets a combination having the smallest difference from the unit length of the raw material pipe without exceeding the unit length of the raw material pipe as the first combination. Add to the combination list, and combine at least one or more required pipes remaining except for the first combination, and a combination having the smallest difference from the unit length of the raw material pipe without exceeding the unit length of the raw material pipe is a second combination. By repeating the adding process, up to the M combination is added to the first combination list,
The second matching algorithm sorts each pipe group in descending order from the longest required pipe among each required pipe, and when the longest required pipe and at least one required pipe among the remaining required pipes are combined, the unit length of the raw material pipe A combination having the smallest difference with is added to the second combination list as a first combination, and when the longest required pipe among the remaining required pipes and at least one required pipe are combined, the unit length of the raw material pipe and the longest By repeating the process of adding a combination having a small difference as a second combination, up to the Nth combination is added to the second combination list,
The third step,
By the matching plan optimization unit, at least one required pipe among the shortest required pipe and the remaining required pipe for the required pipe from the first to the last combination in the final combination list is selected according to the unit length of the raw material pipe. One unit combination is created by combining at 60% or less, and at least one required pipe among the remaining required pipes and the shortest required pipe length is combined with less than 60% of the unit length of the raw material pipe. The process of generating another unit combination is repeated, and one unit recombination is created with the shortest required pipe of any one unit combination and the shortest required pipe of another unit combination, and the shortest required pipe of any one unit combination. A tube matching method of generating another unit recombination by combining the remaining required pipes except for the short required pipe and the remaining required pipe except for the shortest required pipe among the other unit combinations.
delete delete delete

Images