Tube distribution map creation method and tube distribution map creation device

Abstract

A pipe distribution diagram creation device distributes a plurality of straight pipes and cut pipes between each intersection, thereby generating an imaginary pipe route determined by characteristic evaluation data represented by a number with the joining angle θi of each joint of the straight pipes and the cut pipes and the adjustment margin Lj of the cut pipe length as variables, calculates an evaluation value of each imaginary pipe route based on the total number of intersections and control points, the difference value of the number of consecutive intersections and control points from the starting point whose error with the imaginary pipe route and each intersection and each control point is below a prescribed threshold value, the error at the intersection or control point that first exceeds the threshold value, the average value of the error at the intersection and control point whose error is below the threshold value, and the proportion of the number of joints whose joining angle θi is other than 0 degrees within the range from the starting point to the intersection and control point whose error is below the threshold value, and generates a pipe joint diagram based on the imaginary pipe route whose evaluation value is superior.

Description

Technical Field

[0001] This invention relates to a method and apparatus for creating pipe distribution diagrams. Background Technology

[0002] Patent Document 1 discloses a drawing information management device, which includes: a storage unit that stores the installation drawing information of fluid supply facilities as a piping network, the piping network consisting of the intersection points of fluid supply pipes and a single pipeline, the single pipeline being a series of multiple fluid supply pipes connecting the intersection points; a region determination unit that determines the construction target region in the stored information of the storage unit; and an output unit that outputs the installation drawing information of the construction target region determined by the region determination unit to a drawing device for producing construction drawings. In this drawing information management device, pipe allocation processing is performed, using multiple straight pipes to connect the intersection points of a single pipeline.

[0003] In the past, when designing new pipelines or updating existing pipelines using a pipeline mapping device with an application for pipeline mapping installed, the positions of bends and other irregular pipes on the pipeline layer that overlaps with the map layer displayed on the screen are used as intersection points to indicate the planned pipeline route by connecting the irregular pipes at each intersection point with multiple straight pipes.

[0004] Given the complexity of manually selecting and configuring pipe distribution along the planned piping route by designers, there are also pipe distribution diagram generation devices equipped with automatic pipe distribution functions that automatically perform pipe distribution processing.

[0005] Existing technical documents

[0006] Patent documents

[0007] Patent Document 1: Japanese Patent Application Publication No. 08-287132

[0008] The technical problem that the invention aims to solve

[0009] However, as Figure 1 As shown in (a), in the case where a branch pipe 2, which forms a branch from the main pipe 1 that connects the intersections IP1 to IP3 in a straight line, branches at a predetermined intersection IP2, and the branch pipe 2, which connects the intersection IP4 of the branch point IP2 and the branch target, is tilted at an arbitrary angle relative to the main pipe 1, if the automatic pipe allocation function described above is used for pipe allocation processing, then as follows... Figure 1As shown in (b), the socket of the double-seat T-shaped pipe or other irregular pipe DP arranged at the branch point IP2 is designed with an angle different from the original shape. In addition, the bending pipe that utilizes the allowable bending angle of the joint of the straight pipe SP cannot be formed and is arranged in a straight shape. There is a problem that only pipe distribution diagrams that connect the intersection points in a straight shape can be generated.

[0010] It is impossible to lay out a pipe network based on such a pipe distribution diagram. Therefore, in reality, the automatic pipe distribution function cannot be used. Designers have to manually select and configure the pipe network, which is a complicated process. Summary of the Invention

[0011] The purpose of this invention is to provide a pipe distribution diagram manufacturing method and apparatus that can automatically generate pipe distribution diagrams that can be flexibly applied to actual layout projects, regardless of the angle of the branches, in view of the above-mentioned problems.

[0012] Technical means to solve technical problems

[0013] To achieve the above objectives, the first characteristic structure of the pipe distribution map making method of the present invention is as follows: it is a pipe distribution map making method that connects multiple intersection points (IPs) from a starting point to an end point specified on a map and passes through control points (CPs) selectively specified between each intersection point (IP), and includes the following steps.

[0014] The first step is to select the irregularly shaped pipes to be configured at each intersection (IP);

[0015] The second step is to determine the number of straight pipes required, the presence or absence of pipe cuts, and the length of each pipe cut based on the distance between each intersection (IP) and the length of the straight pipe.

[0016] The third step is to generate a hypothetical pipeline, which is a hypothetical pipeline in which the straight pipes and cut pipes determined in the second step are assigned to each intersection (IP) and determined by characteristic evaluation data. The characteristic evaluation data is represented by the following sequence, which takes the joint angle θi (i is the number of joints) of each joint of the straight pipes and cut pipes that constitute the hypothetical pipeline and the adjustment margin Lj of the cut pipe length (j is the number of cut pipes) as variables that can be set within a specified allowable range.

[0017] The fourth step involves calculating the evaluation value of each hypothetical pipeline generated in the third step based on the first, second, third, and fourth characteristic values. The first characteristic value is determined by the difference between the sum of the intersection points (IPs) and the control points (CPs) and the number of consecutive intersection points (IPs) and control points (CPs) with errors below a predetermined threshold, starting from the starting point. This error is the positional offset of the hypothetical pipeline from each intersection point (IP) and each control point (CP). The second characteristic value is determined by the error at intersection points (IPs) or control points (CPs) that initially exceed the threshold. The third characteristic value is determined by the average of the errors at intersection points (IPs) and control points (CPs) with errors below the threshold. The fourth characteristic value is determined by the proportion of the number of joints with an engagement angle θi other than 0 degrees within the range from the starting point to the intersection points (IPs) and control points (CPs) with errors below the threshold.

[0018] The fifth step is to select a hypothetical pipeline from the hypothetical pipelines based on the evaluation value; and

[0019] The sixth step is to generate a pipe connection diagram based on the characteristic evaluation data of the hypothetical pipeline selected in the fifth step.

[0020] In the first step, irregularly shaped pipes are selected and configured at multiple intersections (IPs) from the starting point to the ending point specified on the map. In the second step, the required number of straight pipes, the presence or absence of cut pipes, and the length of each cut pipe are determined based on the distance between each intersection (IP) and the length of the straight pipe. In the third step, a hypothetical pipeline is generated to allocate the previously determined straight pipes and cut pipes to each intersection (IP). This hypothetical pipeline is determined by characteristic evaluation data, which is represented by the following sequence, which uses the joint angle θi of each joint of the straight pipe and cut pipe (i is the number of joints) and the adjustment margin Lj of the cut pipe length (j is the number of cut pipes) as variables that can be set within a specified allowable range.

[0021] In the fourth step, the first, second, third, and fourth characteristic values ​​are calculated. Based on these values, an evaluation value is calculated for each hypothetical pipeline determined by the characteristic evaluation data. The first characteristic value is the difference between the total number of intersections (IPs) and control points (CPs) and the number of consecutive intersections (IPs) and control points (CPs) with errors below a specified threshold, starting from the starting point. This error represents the positional offset of the hypothetical pipeline from each intersection (IP) and each control point (CP). The second characteristic value is the error at the intersection (IP) or control point (CP) that initially exceeded the threshold. The third characteristic value is the average of the errors at intersections (IPs) and control points (CPs) with errors below the threshold. The fourth characteristic value is the proportion of the number of joints with an angle θi other than 0 degrees among the intersections (IPs) with errors below the threshold.

[0022] In the fifth step, a hypothetical pipeline is selected from the hypothetical pipelines based on the evaluation value. In the sixth step, a pipeline connection diagram is generated based on the characteristic evaluation data of the hypothetical pipeline selected in the fifth step.

[0023] The second feature of the pipe distribution diagram production method of the present invention is as follows: based on the first feature described above, the evaluation value is the cumulative value of the product of each characteristic value and the weighting coefficient specified for each characteristic value.

[0024] For multiple hypothetical pipelines determined by characteristic evaluation data, the cumulative value of each characteristic value multiplied by a specified weighting coefficient for each characteristic value is used as the evaluation value. In this way, the contribution rate of each characteristic value to the evaluation value can be adjusted by the weighting coefficient, thus obtaining a well-balanced evaluation value.

[0025] The third feature of the tube junction diagram generation method of the present invention is as follows: based on the first or second feature structure described above, the third step is to construct each hypothetical tube using individuals that have the following characteristics in their genes: the junction angle θi (i is the number of junctions) of each junction of straight tubes and slit tubes and the adjustment margin Lj (j is the number of slit tubes) of the slit tube length; the fifth step is to generate an individual with an optimized gene by executing a genetic algorithm, which repeatedly performs generation alternation processing, and the generation alternation processing includes any one of the following: selection processing based on the evaluation value of each individual to select a specified individual, crossover processing of genes between recombinant individuals, and mutation processing to change the gene of an individual; the sixth step is to generate a tube junction diagram based on the gene of the optimized individual.

[0026] Each hypothetical tube is defined as an individual whose genes contain the junction angle θi (where i is the number of junctions) of straight and slit tubes and the adjustment margin Lj (where j is the number of slit tubes) of each junction. A genetic algorithm is then executed on the hypothetical tubes of multiple individuals with different genes to automatically generate an appropriate tube junction map based on the genes of individuals after generational alternation. Generational alternation includes any one of selection, crossover, and mutation treatments, or a combination of them.

[0027] The fourth feature of the tube allocation map production method of the present invention is as follows: based on the third feature described above, the selection process includes an elite strategy method and a tournament method. The elite strategy method extracts the individual with the best evaluation value from all individuals. The tournament method repeatedly selects any number of individuals from the remaining individuals and selects individuals with relatively good evaluation values ​​until the number of individuals in the generation is equal to the number of individuals in that generation.

[0028] The population is defined as the number of individuals in a hypothetical pipeline for a given generation. If an elite strategy is used, the individuals with the best evaluation values ​​from a given generation's hypothetical pipeline can be retained in the next generation. Alternatively, a tournament strategy can be used, repeatedly selecting any number of individuals from a given generation and choosing those with relatively high evaluation values ​​until the number equals the population, thus ensuring that superior genes are passed on to the next generation.

[0029] The fifth feature of the tube allocation map production method of the present invention is as follows: based on the third or fourth feature described above, the crossover process includes taking adjacent even-numbered and odd-numbered individuals with a predetermined probability and performing gene crossover through a two-point crossover method.

[0030] As a crossover process, it is preferable to select the even-numbered and odd-numbered individuals adjacent to each other with a specified probability and perform gene crossover using a two-point crossover method.

[0031] The sixth feature of the tube distribution map making method of the present invention is as follows: based on the feature structures of any one of the third to fifth items above, the mutation treatment includes the process of selecting individuals with a specified proportion of evaluation value differences from the individuals and setting all genes of these individuals to 0.

[0032] By implementing a mutation treatment that sets all genes of individuals with a specified percentage difference in evaluation value to 0, it is possible to retain a specified percentage of hypothetical tubes with straight tube shapes in the next generation. By repeating this operation, in the case of straight tubes, it is possible to generate tubes with excellent straightness and less wobbling, rather than straight tubes with more wobbling due to repeated small bends.

[0033] The seventh feature of the tube allocation map production method of the present invention is as follows: based on the feature structures of any one of the third to sixth items above, the mutation treatment includes the treatment of replacing any adjacent arbitrary genes of an individual extracted with a predetermined probability.

[0034] Replacing any chosen gene has a greater impact on the entire pipeline, making it difficult to increase the evaluation value even with generational alternation. However, replacing adjacent genes allows for fine-tuning while suppressing the impact on the entire pipeline.

[0035] The eighth feature of the pipe distribution diagram making method of the present invention is as follows: based on the feature structures of any one of the first to seventh items above, it further includes a pre-determination step, which determines whether the pipe distribution along the straight line connecting the intersections (IPs) can be constructed based on the shape of the irregular pipes laid at each intersection or the presence or absence of control points (CPs) specified between each intersection (IP). If it is determined in the pre-determination step that the pipe distribution along the straight line connecting the intersections (IPs) cannot be constructed, the second to sixth steps are executed.

[0036] If the pipe distribution along the straight line connecting the intersections cannot be constructed after the previous determination step, the process can be made more efficient by performing the second to sixth steps described above.

[0037] The first characteristic structure of the pipe distribution map making apparatus according to the present invention is as follows: it is a pipe distribution map making apparatus that connects multiple intersections (IPs) from a starting point to an end point specified on a map and passes through control points (CPs) selectively specified between each intersection (IP), and includes: a first calculation unit that selects irregularly shaped pipes disposed at each intersection (IP); a second calculation unit that determines the required number of straight pipes, the presence or absence of pipe cuts, and the length of each pipe cut based on the distance between each intersection (IP) and the length of the straight pipe; and a third calculation unit that generates a hypothetical pipe. The hypothetical pipeline is a network of straight and cut pipes determined by the second calculation unit and distributed between various intersections (IPs). This network is determined by characteristic evaluation data, represented by the following sequence, which sets the joint angle θi (i is the number of joints) of each joint of the straight and cut pipes constituting the hypothetical pipeline, and the adjustment margin Lj (j is the number of cut pipes) of the cut pipe length as variables that can be set within a specified allowable range. The fourth calculation unit calculates the result of the third calculation based on the first, second, third, and fourth characteristic values. The evaluation values ​​of each hypothetical pipeline generated by the department are as follows: The first characteristic value is determined by the difference between the total number of intersections (IPs) and control points (CPs) and the number of consecutive intersections (IPs) and control points (CPs) below a predetermined threshold, starting from the starting point. This error is the positional offset of the hypothetical pipeline from each intersection (IP) and the positional offset of the hypothetical pipeline from each control point (CP). The second characteristic value is determined by the error at the intersections (IPs) or control points (CPs) that initially exceeded the threshold. The third characteristic value is determined by the error... The fourth characteristic value is determined by the average value of the errors at the intersection (IP) and control point (CP) below the threshold, and is determined by the proportion of the number of joints where the joint angle θi is an angle other than 0 degrees within the range from the starting point to the intersection (IP) and control point (CP) where the error is below the threshold; a fifth calculation unit selects a hypothetical pipeline from the hypothetical pipelines based on the evaluation value; and a sixth calculation unit generates a pipeline joint diagram based on the characteristic evaluation data of the hypothetical pipeline selected by the fifth calculation unit.

[0038] The second feature of the pipe distribution diagram making apparatus of the present invention is that, based on the first feature described above, the evaluation value is the sum of the product of each characteristic value and a weighted coefficient specified for each characteristic value.

[0039] The third feature of the tube distribution diagram generation apparatus of the present invention is as follows: based on the first or second feature described above, the third operation unit is an operation unit that uses individuals to construct each hypothetical tube, wherein the individuals have in their genes the joint angle θi (i is the number of joints) of each joint of straight tubes and cut tubes and the adjustment margin Lj (j is the number of cut tubes) of the joint length of the cut tubes; the fifth operation unit is an operation unit that executes a genetic algorithm to generate an individual with optimized genes, wherein the genetic algorithm repeatedly performs generation alternation processing, and the generation alternation processing includes any one of the following: selection processing based on the evaluation value of each individual to select a specified individual, crossover processing of genes between recombinant individuals, and mutation processing to change the genes of a certain individual; and the sixth operation unit is an operation unit that generates a tube connection diagram based on the genes of the optimized individual.

[0040] The fourth feature of the tube distribution map making apparatus of the present invention is as follows: based on the third feature described above, the selection process includes an elite strategy method and a tournament method. The elite strategy method extracts the individual with the best evaluation value from all individuals, and the tournament method repeatedly performs the process of randomly selecting any number of individuals from the remaining individuals and selecting individuals with relatively excellent evaluation values ​​until it is equal to the number of individuals in that generation.

[0041] The effects of the invention

[0042] As explained above, according to the present invention, a pipe distribution diagram manufacturing method and a pipe distribution diagram manufacturing apparatus can be provided that can automatically generate pipe distribution diagrams that can be flexibly applied to actual layout projects without relying on the angle of the branches, etc. Attached Figure Description

[0043] Figure 1 (a) is a diagram illustrating the paths connecting the main and branch lines at the specified intersections. Figure 1 (b) is an explanatory diagram of the pipe distribution diagram generated by a conventional automatic pipe distribution device. Figure 1 (c) is an explanatory diagram of the pipe distribution diagram generated by the pipe distribution diagram making apparatus of the present invention.

[0044] Figure 2 This is an explanatory diagram of a pipe distribution diagram making apparatus based on the present invention.

[0045] Figure 3 This is a flowchart illustrating the pipe distribution diagram creation method based on the present invention.

[0046] Figure 4 This is a flowchart illustrating another method for creating a pipe distribution diagram based on the present invention.

[0047] Figure 5 This is an explanatory diagram of the characteristic evaluation data.

[0048] Figure 6A This is an explanatory diagram of the specified intersections and control points.

[0049] Figure 6B This is an explanatory diagram of path numbering and intersection numbering.

[0050] Figure 7 yes Figure 5 The diagram (a) shows the coordinates of the intersection and control points, as well as the allowable movement.

[0051] Figure 8 This is an explanatory diagram of the irregularly shaped tubes positioned at the intersection.

[0052] Figure 9 (a) is an explanatory diagram of the coordinates of the control points. Figure 9 (b) is a diagram illustrating the relationship between path numbers and connection points.

[0053] Figure 10 This is an explanatory diagram of a pipe allocation diagram generated by the pipe allocation diagram production method of the present invention. Detailed Implementation

[0054] The following describes the pipe distribution diagram manufacturing method and pipe distribution diagram manufacturing apparatus based on the present invention with reference to the accompanying drawings.

[0055] [First method for creating a pipe distribution diagram]

[0056] exist Figure 2 The functional block structure of the pipe allocation diagram generation apparatus 10 is shown. The pipe allocation diagram generation apparatus 10 generates pipe allocation diagrams for the following pipelines (referred to as planning lines) (see reference). Figure 1 The device (a) to (c) of the pipeline connects multiple intersection points IP from the starting point to the end point specified on the map and passes through control points CP selectively specified between each intersection point IP. The pipeline map making apparatus 10 includes a computer main body 10A, an input device 10B connected to the computer main body 10A, a display device 10C, and a storage device 10D.

[0057] Input device 10B uses a pointing device such as a mouse and a keyboard; display device 10C uses an LCD display; and storage device 10D uses a hard disk. Additionally, although not shown, output devices such as a printer are also connected.

[0058] The storage device 10D stores component information, map information, and previously created piping diagrams, which constitute the piping required for creating piping diagrams. Component information includes pipe types such as straight pipes and irregularly shaped pipes, as well as their nominal diameter and length.

[0059] The main computer 10A includes a motherboard with a CPU and a memory board, etc. An application program for designing pipeline diagrams is installed in the memory on the memory board. The CPU executes this application to implement the various functional blocks described later.

[0060] That is, the computer body 10A has a function block for setting intersection and control points on the piping layer, a first arithmetic unit 11, a second arithmetic unit 13, a third arithmetic unit 14, a fourth arithmetic unit 15, a fifth arithmetic unit 16 and a sixth arithmetic unit 17.

[0061] The intersection control point setting unit 11 reads the map information of the pipe layout predetermined area stored in the storage device 10D into the memory on the memory board (hereinafter referred to as "internal memory") through the operation of the operator, unfolds the map information in the area set in the internal memory as the map layer and displays it on the display device 10C.

[0062] When an operator uses a pointing device such as a mouse to draw the location for pipe laying on a map displayed on display device 10C, the coordinates representing that location are drawn as an intersection point (IP) on the pipe layer overlapping the map layer and stored in internal memory. This intersection point is as described above. Figure 1 The intersections of (a) are IP1, IP2, IP3, IP4, etc. At each intersection IP1, IP2, IP3, IP4, there are bends, double-bearing T-shaped pipes, and other irregularly shaped pipes.

[0063] Straight pipes are used to connect the irregularly shaped pipes positioned at intersection IP. Preferably, the pipes are arranged along the curvature of the road; therefore, when a control point (CP) is indicated on the pipe layer as an indicator for bending the straight pipes within a permissible range of bending angles at the joints, this control point CP is displayed on the pipe layer as well as the intersection IP and is stored in internal memory. In the following description, it is sometimes abbreviated as "intersection" or "control point".

[0064] The first calculation unit 12 performs the following process: selecting irregularly shaped tubes configured at a plurality of intersections set by the intersection control point setting unit 11. When the operator selects each intersection, the configurable irregularly shaped tubes are displayed as a drop-down menu, and the irregularly shaped tubes selected by using the mouse to select the desired irregularly shaped tubes are assigned to that intersection.

[0065] The second calculation unit 13 determines the required number of straight pipes, the presence or absence of cut pipes, and the length of the cut pipes based on the distance between each intersection point and the length of the straight pipe. The required number of straight pipes is calculated by dividing the distance obtained by subtracting the length of the irregularly shaped pipes placed at each intersection point from the distance between the intersection points by the length of the straight pipe. The calculated number of straight pipes is used, and any shortfall in length is made up by cut pipes. This determines the number of straight pipes connecting each intersection point and the length of the cut pipes.

[0066] The third calculation unit 14 generates a hypothetical pipeline that distributes the straight pipes determined by the second calculation unit 13 to each intersection point.

[0067] exist Figure 5 The diagram shows the pipe allocation connecting the specified intersections IPA (0, 0), IPB (10, 10), and IPC (20, 10) on the xy-plane. This hypothetical pipe route characteristic evaluation data is determined using a sequence that sets the joint angle θi (where i is the number of joints) of each joint between the straight pipe SP and the cut pipe CtP constituting the hypothetical route, as well as the adjustment margin Lj (where j is the number of cut pipes) of the cut pipe length, as variables that can be set within a specified tolerance range.

[0068] Straight and cut pipes that can be set at the joint angle θi are pipes that become connectors on the spigot side, excluding pipes connected to shaped pipes and pipes integrated in a way that prevents bending. Specifically, the bending angle along the plane relative to the maximum bending angle ±4° of each connector can be selected from any of the options ±2°, ±1°, and 0°. 0° means a straight connection without bending. Furthermore, the value of the option is not limited to this example and can be set at any interval within an angle range smaller than the maximum bending angle ±4°.

[0069] The adjustment margin Lj for the cut length is used to adjust the length Lc calculated in the previous calculation. The adjusted length is Lc + Lj. It is set to Lj = ΔL × d, and ΔL = 0.01m, selected from any one of the options d = ±2, ±1, or 0. That is, Lj = any one of ±2cm, ±1cm, or 0cm. Furthermore, in this embodiment, ΔL = 0.01m is exemplified, but the value of ΔL is not particularly limited. The value of option d is also not limited to this example.

[0070] exist Figure 5 In the tube assignment diagram shown, the characteristic evaluation data is represented as a sequence [θ1, θ2, θ3, L1, θ4, θ5, L2]. By selecting the variables θ1, θ2, θ3, L1, θ4, θ5, and L2 from the above options, a tube assignment diagram with a factorial of 5 can be defined.

[0071] The fourth calculation unit 15 calculates a first characteristic value CV1, a second characteristic value CV2, a third characteristic value CV3, and a fourth characteristic value CV4 for each hypothetical pipeline for which the variables θ1, θ2, θ3, L1, θ4, θ5, and L2 of the characteristic evaluation data are set to arbitrary values ​​that converge to a specified allowable range. In this embodiment, for each hypothetical pipeline determined by appropriately selecting the characteristic evaluation data of each variable from the above options, the fourth calculation unit 15 calculates an evaluation value based on each characteristic value.

[0072] The first characteristic value CV1 is determined by the difference between the total number of intersections and control points and the number of consecutive intersections and control points starting from the starting point, where the error is below a specified threshold. The error is the positional offset of the hypothetical pipeline from each intersection point and the positional offset of the hypothetical pipeline from each control point. The smaller the difference value CV1, the less positional offset the hypothetical pipeline can be evaluated as.

[0073] The traditional design method, which imitates the manual operation of the pipe distribution diagram making device, emphasizes the process of arranging pipe materials sequentially along the planning line from the starting point in such a way that the error at the intersection and control points converges to the threshold.

[0074] In this embodiment, the threshold is set to 0.3m, but the threshold is not limited to 0.3m and can be appropriately set according to the actual situation. Furthermore, although the same threshold value is set for all intersections and control points, different thresholds can be set for intersections and control points, or different thresholds can be set for each intersection and control point. This is because it allows for flexible adaptation to the surrounding environment of the pipeline installation site.

[0075] The second characteristic value CV2 is determined by the error at the intersection or control point where the threshold was initially exceeded. Similar to the first characteristic value CV1, the smaller the error of the second characteristic value CV2, the smaller the deviation of the hypothetical pipeline from the threshold at the intersection and control point, and the less certainty there is that the subsequent configuration of the pipe material will deviate significantly from the planned line.

[0076] The third characteristic value CV3 is determined by the average of the errors at the intersection and control points where the error is below the threshold. The smaller the average error of the third characteristic value CV3, the less the hypothetical pipeline can be evaluated as having a positional deviation along the planned line.

[0077] The fourth characteristic value CV4 is determined by the proportion of the number of joints with an angle θi other than 0 degrees within the range from the starting point to the intersection (IP) and control point (CP) where the error is below the threshold. The smaller the proportion of the fourth characteristic value CV4, the less fluctuation in the linearity of the hypothetical pipeline can be evaluated.

[0078] Furthermore, the fourth calculation unit 15 calculates the evaluation value EV shown in the following formula based on each characteristic value CV1 to CV4.

[0079] EV=CV1×S1+CV2×S2+CV3×S3+CV4×S4

[0080] The weighting coefficients S1, S2, S3, and S4 are coefficients used to adjust the contribution of each characteristic value CV1, CV2, CV3, and CV4 when evaluating each hypothetical pipeline defined by characteristic evaluation data. These values ​​are set based on which characteristic value (CV1, CV2, CV3) is prioritized. In this embodiment, S1~S3 are set to 1, and S4 is set to 0.2, but this is not particularly limiting.

[0081] The fifth calculation unit 16 selects a hypothetical pipeline from the hypothetical pipelines based on the evaluation value EV of each hypothetical pipeline calculated by the fourth calculation unit 15. Specifically, the hypothetical pipeline with the smallest evaluation value EV is selected.

[0082] The sixth calculation unit 17 generates a pipeline connection diagram based on the sequence [θ1, θ2, θ3, L1, θ4, θ5, L2] of the characteristic evaluation data of the hypothetical pipeline selected by the fifth calculation unit 16.

[0083] When calculating the evaluation value EV from all settable characteristic evaluation data, the computational load increases. Therefore, by setting a threshold that limits the range of characteristic evaluation data that can be used, the increase in computational load can be suppressed. Alternatively, the fourth calculation unit 15 can calculate the evaluation value CV from all settable characteristic evaluation data and generate a piping connection diagram based on the characteristic evaluation data with the smallest evaluation value CV.

[0084] based on Figure 3 The method for creating a pipe distribution diagram based on the present invention will be described.

[0085] The intersection control point setting unit 11 displays the road map unfolded in the map layer on the display device 10C (SA1), instructs the input of the intersection point IP for configuring irregularly shaped pipes in the pipeline layer that overlaps with the map layer, and instructs the input of the control point CP for configuring straight pipes in a bend (SA2).

[0086] Next, the first arithmetic unit 12 selects the irregular tubes configured at multiple intersection IPs and assigns the irregular tubes (SA3) to each intersection IP.

[0087] The first calculation unit 12 determines whether construction can proceed along the straight lines connecting the intersection points IPs based on the shape of the irregularly shaped pipes laid at each intersection point IP or the presence or absence of control points CP specified between each intersection point IP. If construction is possible (SA4, OK), the process proceeds to the execution step of the automatic pipe allocation process (SA10). The automatic pipe allocation process is as follows: based on the distance along the straight lines connecting the intersection points IPs, the required number of straight pipes and the length of the cut pipes are calculated, and a pipe allocation diagram is generated showing how the calculated straight pipes and cut pipes are connected to the irregularly shaped pipes arranged at the intersection points IP. The result of the automatic pipe allocation process is stored in the storage device 10D in step SA11.

[0088] The feasibility of constructing a pipe network along the straight lines connecting the intersection points (IPs) is determined by whether the socket of the irregularly shaped pipe at each intersection point (IP) is aligned with the direction of the straight lines connecting the IPs. If they are aligned, construction is deemed feasible; otherwise, construction is deemed impossible. If construction is impossible (SA4, NG), the process of generating a hypothetical pipeline begins.

[0089] In step SA5, the second calculation unit 13 determines the required number of straight pipes, the presence or absence of pipe cuts, and the length of pipe cuts based on the distance between each intersection point and the length of the straight pipe. Further, the third calculation unit 14 generates a hypothetical pipeline based on the above-mentioned characteristic evaluation data (SA6), and the fourth calculation unit 15 sets the variables constituting the characteristic evaluation data to values ​​selected from a preset option table (SA7).

[0090] The options table represents the options for each variable θ1, θ2, θ3, L1, θ4, θ5, and L2 in the characteristic evaluation data. It shows the values ​​that can be selected as any value that converges to a specified allowable range. In the example above, as an option for the joining angle θi, any value among ±2°, ±1°, and 0° becomes an option; as an option for the adjustment margin Lj of the pipe cutting length, any value among ±2cm, ±1cm, and 0cm becomes an option.

[0091] Furthermore, the fourth calculation unit 15 repeatedly performs the process of calculating the evaluation value EV of the hypothetical pipeline based on the characteristic evaluation data selected in step SA7 for all options set in the option table, and the fifth calculation unit 16 selects the hypothetical pipeline defined by the characteristic evaluation data that has the smallest evaluation value among all the evaluation values ​​EV calculated by the fourth calculation unit 15 as a hypothetical pipeline (SA7, SA8).

[0092] The sixth arithmetic unit 17 generates a pipe connection diagram (pipe allocation diagram) (SA9) based on the characteristic evaluation data of a hypothetical pipe selected by the fifth arithmetic unit 16, and stores it in the storage device 10D (SA11).

[0093] [Second method of pipe distribution diagram making device]

[0094] The following describes a second embodiment of the pipe distribution diagram fabrication apparatus 10. The main focus is on structures that differ from the first embodiment described above; descriptions of identical structures are omitted.

[0095] In the first method, the process involves updating the characteristic evaluation data and calculating and evaluating the evaluation value repeatedly using the third operation unit 14 and the fourth operation unit 15. However, the second method differs in that multiple characteristic evaluation data are generated in advance, and the characteristic evaluation data are optimized using a genetic algorithm (GA).

[0096] That is, the third calculation unit 14 generates a hypothetical pipeline determined by multiple individuals, and these multiple individuals use the joint angle θi (i is the number of joints) of each joint of the straight pipe constituting the hypothetical pipeline and the adjustment margin Lj of the pipe cutting length (j is the number of pipe cuttings) as genes.

[0097] The trait evaluation data represented by the above sequence [θ1, θ2, θ3, L1, θ4, θ5, L2] constitutes an individual, and each variable θ1, θ2, θ3, L1, θ4, θ5, L2 is located as a gene. In this embodiment, the number of individuals in the first generation is set to 300. The number of individuals is not particularly limited and can be set appropriately.

[0098] The fourth calculation unit 15 calculates each characteristic value CV1 to CV4 for each entity generated by the third calculation unit 14 in the same manner as the first method described above, and calculates the evaluation value EV based on each characteristic value CV1 to CV4.

[0099] The fifth calculation unit 16 performs selection processing to select a specified individual based on the evaluation value EV of each individual, and executes a genetic algorithm that repeatedly performs generation alternation processing to generate an individual with an excellent evaluation value optimized by genes. Generation alternation processing includes either crossover processing or mutation processing. Crossover processing is a process of recombining genes among a portion of the individuals, while mutation processing is a process of changing the genes of a certain individual.

[0100] The selection process executed by the fifth computation unit 16 includes an elite strategy method and a tournament method. The elite strategy method extracts the individual with the best evaluation value EV (that is, the evaluation value EV is the minimum value) from each individual. The tournament method repeatedly selects an arbitrary number of individuals from the remaining individuals and selects an individual with a relatively good evaluation value EV until the number of individuals in the generation is equal. The crossover process includes taking the even-numbered and odd-numbered adjacent individuals with a predetermined probability and performing gene crossover using a two-point crossover method. The mutation process includes selecting individuals with a predetermined proportion of evaluation value differences from each individual and setting all their genes to 0, as well as replacing any adjacent genes of the individuals extracted with a predetermined probability.

[0101] The fifth calculation unit 16 performs generational alternation processing until the preset generation is reached, and selects the individual with the smallest evaluation value EV among the individuals in the final generation as the best hypothetical pipeline.

[0102] The sixth calculation unit 17 generates a tube connection diagram (tube allocation diagram) based on the genes of an individual selected by the fifth calculation unit 16 to become a hypothetical tube.

[0103] exist Figure 4 This illustrates the process of creating the pipe distribution diagram using the second method. Steps SB6-SB9 and... Figure 3 The process of creating the pipe distribution diagram shown is different, but everything else is the same.

[0104] In step SB5, the second calculation unit 13 determines the required number of straight pipes, the presence or absence of pipe cuts, and the length of pipe cuts based on the distance between each intersection point and the length of the straight pipe.

[0105] Furthermore, the third calculation unit 14 generates a hypothetical pipeline (SB6) that uses the characteristic evaluation data as the number of individuals of the first generation of 300 individuals, the fourth calculation unit 15 calculates the evaluation value EV for each individual (SB7), and the fifth calculation unit 16 performs generation alternation processing (SB8).

[0106] During the alternation process, up to the preset number of generations (40 generations in this embodiment), the evaluation value calculation process of step SB7 and the generation alternation process of step SB8 are repeated. When the evaluation value calculation process ends at the preset number of generations, the hypothetical pipeline with the smallest evaluation value EV is selected from the hypothetical pipelines with 300 individuals in the final generation as the best hypothetical pipeline (SB8, OK). A pipeline allocation diagram is generated based on the characteristic evaluation data of a hypothetical pipeline (SB9).

[0107] [Generational change handling]

[0108] The handling of generational succession is described in detail.

[0109] Use [θ1] Nm θ2 Nm θ3 Nm L1 Nm θ4 Nm θ5 Nm L2 Nm ] represents the individual I in the Nth generation. Nm The genes. Here, m is the number of individuals, or population. First, calculate the genes of m individuals I for the first generation. 1m The gene [θ1] 1m θ2 1m θ3 1m L1 1m θ4 1m θ5 1m L2 1m The evaluation value EV for each of them. 1m .

[0110] First, the selection process employed both an elite strategy and a tournament-style selection method. The elite strategy refers to selecting from m individuals I in the first generation... 1m Unconditionally extract the evaluation value EV 1m The smallest individual is selected as the next generation's individual. The tournament method refers to the following process: starting with m individuals I from the first generation... 1m Randomly select any number of individuals (three in this embodiment), and then select one individual with a relatively high EV value (one in this embodiment). Repeat this process until the number of individuals equals the population size (number of individuals) of that generation. If the EV value... 1m If the value is relatively small, the individual is judged to have a high fitness. The number of individuals selected for comparison is preferably around 3, but it is not limited to this value and can be set appropriately. In addition, the number of individuals selected as those with relatively excellent EV values ​​is not limited to 1. Multiple individuals can be selected as those with relatively excellent EV values ​​based on their relationship with the number of individuals selected for comparison.

[0111] By selecting the processing method, the evaluation value EV is determined. 1m Individuals with high fitness values ​​(i.e., low fitness) are eliminated, while those with high fitness survive into the next generation. In this implementation, selection is repeated to achieve a value equal to the population size (number of individuals), thus ensuring the same number of individuals as in the first generation. Alternatively, a roulette wheel selection method can be used instead of a tournament selection process.

[0112] Next, a crossover process is performed on each of the selected individuals. This crossover process involves selecting the even-numbered and odd-numbered adjacent individuals with a predetermined probability and performing gene crossover using a two-point crossover method. In this embodiment, the crossover probability is set to 70%. Therefore, 30% of the individuals that survived the selection process are retained as is.

[0113] The individuals after crossover are subjected to a first mutation treatment and a second mutation treatment. The first mutation treatment is configured with a transposition method, which involves replacing any adjacent gene of an individual extracted with a predetermined probability (30% in this embodiment). The number of replacements is not limited to 1 and can be appropriately set according to the number of genes. Furthermore, the transposition method is a method that reverses the order of two random genes.

[0114] Replacing any chosen gene has a greater impact on the entire pipeline, making it difficult to increase the evaluation value even with generational alternation. However, replacing adjacent genes allows for fine-tuning while suppressing the impact on the entire pipeline. The specified probability is not limited to 30% and can be adjusted appropriately.

[0115] The second mutation treatment is as follows: Individuals with a predetermined percentage (15% in this embodiment) of the difference in evaluation value are selected from all individuals, and all their genes are set to 0. Furthermore, in this embodiment, "difference in evaluation value" refers to a high evaluation value.

[0116] By implementing a mutation treatment that sets all genes of individuals with a specified percentage of evaluation value differences to 0, it is possible to retain a specified percentage of hypothetical tubules with straight tubular shapes in the next generation. By repeating this operation, in the case of straight tubules, it is possible to generate straight tubules with excellent straightness and minimal wobble, rather than straight tubules with excessive wobble due to repeated minor bends. The specified percentage is not limited to 15% and can be adjusted appropriately.

[0117] In this way, the second-generation individual I is generated. 2m The gene [θ1] 2m θ2 2m θ3 2m L1 2m θ4 2m θ5 2m L2 2m Repeat the same process.

[0118] [Third Method for Creating Pipe Distribution Diagrams]

[0119] The third method is an example where the characteristic value calculated by the fourth calculation unit 15 is different from the characteristic value described in the first and second methods above.

[0120] The fourth calculation unit 15 sets the variables θ1, θ2, θ3, L1, θ4, θ5, and L2 of the characteristic evaluation data to any value that converges within a specified allowable range for each hypothetical pipeline. Based on the fifth characteristic value Cv5, the sixth characteristic value Cv6, and the seventh characteristic value Cv7, it calculates the evaluation value, i.e., the suitability, of each hypothetical pipeline. The fifth characteristic value Cv5 is the cumulative value of the error between each intersection point and the position of each hypothetical pipeline corresponding to each intersection point. The sixth characteristic value Cv6 is the cumulative value of the number of joints with an angle other than 0 degrees. The seventh characteristic value Cv7 is the cumulative value of the distance between each control point and each hypothetical pipeline.

[0121] The fifth characteristic value CV5 is expressed as CV5 = Σ(ΔE) ip ). ΔE ip It is the error between the intersection point and the position of each hypothetical pipeline corresponding to the intersection point. The cumulative error value over all intersection points is called the fifth characteristic value CV5. The smaller the cumulative error value, the higher the fitness level.

[0122] The sixth characteristic value CV6 is expressed as CV6 = Σ(J f J f The number of bent joints is represented by the sixth characteristic value, CV6. The fewer the number of bent joints, the higher the suitability.

[0123] The seventh characteristic value CV7 is represented as CV7 = Σ(D pp D pp This represents the distance between the control point and the pipeline (the shortest distance from the control point to the pipeline). The total distance between the control point and the pipeline is called the seventh characteristic value, CV7. The smaller the total distance between the control point and the pipeline, the closer the location is to the control point, and therefore the higher the suitability is determined.

[0124] The evaluation value EV for each hypothetical conduit is represented by the cumulative sum of the product of each characteristic value and the weighting coefficient specified for each characteristic value: EV = CV5 × S5 + CV6 × S6 + CV7 × S7. The weighting coefficients S5, S6, and S7 are coefficients used to adjust the contribution of each characteristic value CV5, CV6, and CV7 when evaluating each hypothetical conduit defined by the characteristic evaluation data. These values ​​are set based on which characteristic value (CV5, CV6, CV7) is prioritized; for example, if the location of the intersection is prioritized, the weighting coefficient S5 is set to a larger value than the other weighting coefficients S6 and S7.

[0125] The seventh characteristic value CV7 mentioned above is an evaluation item when control points are set. When no control points are set, only the fifth characteristic value CV5 and the sixth characteristic value CV6 are used for evaluation. Furthermore, when the number of control points set is small, it is also possible to use only the fifth characteristic value CV5 and the sixth characteristic value CV6 for evaluation.

[0126] That is, the third-party pipe distribution diagram production method includes the following steps: for each hypothetical pipe obtained by setting each variable of the characteristic evaluation data to arbitrary values ​​within a specified allowable range, the method calculates the evaluation value of each hypothetical pipe based on the fifth characteristic value CV5 and the sixth characteristic value CV6, where the fifth characteristic value CV5 is the cumulative value of the error between each intersection point and the position of each hypothetical pipe corresponding to each intersection point, and the sixth characteristic value CV6 is the cumulative value of the number of joints with an angle other than 0 degrees; and generates a pipe joint diagram based on the characteristic evaluation data of hypothetical pipes whose evaluation values ​​are lower than a specified threshold.

[0127] Furthermore, preferably, the evaluation value calculated in the step of calculating the evaluation value of each hypothetical pipeline also includes a seventh characteristic value CV7, which is the cumulative value of the interval distance between each hypothetical pipeline and each control point.

[0128] [Fourth method of pipe distribution diagram production device]

[0129] The fourth method is a slightly modified version of the third method mentioned above.

[0130] That is, the fourth calculation unit 15 sets each variable θ1, θ2, θ3, L1, θ4, θ5, L2 of the characteristic evaluation data to any value that converges within a specified allowable range for the hypothetical pipeline. Based on the eighth characteristic value, the ninth characteristic value, and the tenth characteristic value, it calculates the evaluation value, i.e. the suitability, of each hypothetical pipeline. The eighth characteristic value is the average error between each intersection point and the position of each hypothetical pipeline corresponding to each intersection point. The ninth characteristic value is the ratio of the number of joints with an angle other than 0 degrees to the total number of joints. The tenth characteristic value is the average distance between each control point and each hypothetical pipeline.

[0131] In the first, second, and third methods described above, examples were given of generating and evaluating hypothetical pipelines based on individual characteristic evaluation data in the entire area of ​​a pipeline layer with specified intersection points. However, when the pipeline contains branch points, hypothetical pipelines based on characteristic evaluation data can also be generated and evaluated for each pipeline connecting the branch points.

[0132] Example

[0133] The following is an example of tube allocation using the second method of the genetic algorithm GA.

[0134] exist Figure 6A The diagram shows the intersections and control points specified in the piping layer, with dashed lines representing piping connections made up of straight lines. Figure 6B The diagram shows the identification symbols for each intersection of the main pipeline (path 1) and the branch pipelines (path 2, path 3) branching from the main pipeline.

[0135] exist Figure 7 It shows Figure 6B The path number and intersection number, x and y coordinates of each intersection, and allowable movement (1m) are shown. Figure 4 In step SB7, under the "convergence condition," each intersection point is within the allowable movement range. Figure 8 The table shows a list of irregularly shaped tubes configured at each intersection. Bends are configured in empty spaces other than the starting and ending points.

[0136] exist Figure 9 (a) shows the path containing the x and y coordinates of the specified control points. Figure 9 (b) shows path connection information indicating whether to connect the branch pipe to the intersection in the presence of a T-pipe (branch pipe).

[0137] When setting intersection points and control points using the aforementioned intersection control point setting unit 11, input... Figures 7 to 9 The value of (b).

[0138] exist Figure 10 The image shows the results of pipe allocation processing using the second method of the Genetic Algorithm (GA) on pipes with such intersections and control points. White circles represent control points, and black circles represent pipe joints. If the number of individuals in the first generation is set to 300 and the number of generations is set to 40, a pipe allocation map of approximately 100m in length can be generated in about a few seconds using approximately 20 pieces of pipe material. This is comparable to manual input. Figure 10 Compared to the several hours required to process the pipe allocation diagram shown, this can be done extremely efficiently. Furthermore, Figure 10 The tube assignment diagram shown is a sample and does not represent the optimal tube assignment diagram.

[0139] The above-described embodiments represent one aspect of the present invention and are not intended to limit the technical scope of the present invention. Of course, appropriate modifications can be made within the scope of achieving the desired effect of the present invention.

[0140] Explanation of symbols

[0141] 10: Pipe distribution diagram making device

[0142] 10A: Computer Main Body

[0143] 10B: Input device

[0144] 10C: Display device

[0145] 10D: Storage device

[0146] 11: Intersection Control Point Setting Unit

[0147] 12: First Arithmetic Division

[0148] 13: Second Arithmetic Unit

[0149] 14: Third Computational Unit

[0150] 15: Fourth Arithmetic Division

[0151] 16: Fifth Arithmetic Division

[0152] 17: Sixth Arithmetic Division

Claims

1. A method for creating a pipe distribution map, comprising: connecting multiple intersection points (IPs) from a starting point to an ending point specified on a map and passing through control points (CPs) selectively specified between each intersection point (IP); the method comprising: The first step involves the operator selecting the irregularly shaped pipes configured at each intersection (IP); The second step is to determine the number of straight pipes required, the presence or absence of pipe cuts, and the length of each pipe cut based on the distance between each intersection (IP) and the length of the straight pipe. The third step involves generating a hypothetical conduit. This hypothetical conduit is formed by allocating the straight and cut pipes determined in the second step to the various intersection points (IPs). This hypothetical conduit is determined by characteristic evaluation data, represented as a series of numbers. This series uses the joint angle θi of each joint of the straight and cut pipes constituting the hypothetical conduit and the adjustment margin Lj of the cut pipe length as variables that can be set within a specified allowable range. i is the number of joints, and j is the number of cut tubes; The fourth step involves calculating the evaluation value of each hypothetical pipeline generated in the third step based on the first, second, third, and fourth characteristic values. The first characteristic value is determined by the difference between the total number of intersection points (IPs) and control points (CPs) and the number of consecutive intersection points (IPs) and control points (CPs) with errors below a specified threshold, starting from the starting point. This error is the positional offset of the hypothetical pipeline from each intersection point (IP) and the positional offset of the hypothetical pipeline from each control point (CP). The second characteristic value is determined by the error at the intersection (IP) or control point (CP) where the threshold was initially exceeded. The third characteristic value is determined by the average of the errors at the intersection point (IP) and the control point (CP) where the error is below the threshold. The fourth characteristic value is determined by the proportion of the number of joints, excluding 0 degrees, within the range from the starting point to the intersection (IP) and control point (CP) where the error is below the threshold. The fifth step is to select a hypothetical pipeline from the hypothetical pipelines based on the evaluation value. as well as The sixth step is to generate a pipe connection diagram based on the characteristic evaluation data of the hypothetical pipeline selected in the fifth step.

2. The method for preparing a pipe distribution diagram according to claim 1, characterized in that, The evaluation value is the sum of the product of each characteristic value and the weighting coefficient specified for each characteristic value.

3. The method for preparing a pipe distribution diagram according to claim 1, characterized in that, The third step involves constructing each hypothetical tubule using an individual that possesses in its genes the junction angle θi of each junction of straight and slit tubes, as well as an adjustment margin Lj for the length of the slit tubes, where i is the number of junctions and j is the number of slit tubes. The fifth step is to execute a genetic algorithm to generate individuals with optimized genes. This genetic algorithm repeatedly performs generational alternation, which includes any one of the following: selection based on the evaluation value of each individual to select a specified individual, crossover of genes between recombinant individuals, or mutation to change the genes of a particular individual. The sixth step is to generate a tubular junction diagram based on the genes of the optimized individual.

4. The method for preparing a pipe distribution diagram according to claim 3, characterized in that, The selection process includes an elite strategy and a tournament method. The elite strategy extracts the individual with the best evaluation value from all individuals. The tournament method repeats the process of randomly selecting any number of individuals from the remaining individuals and selecting individuals with relatively good evaluation values ​​until the number of individuals in that generation is equal to the number of individuals.

5. The method for preparing a pipe distribution diagram according to claim 3 or 4, characterized in that, The crossover process includes taking adjacent even-numbered and odd-numbered individuals with a specified probability and performing gene crossover using a two-point crossover method.

6. The method for preparing a pipe distribution diagram according to claim 3 or 4, characterized in that, The mutation treatment includes selecting individuals with a specified proportion of differences in evaluation values ​​from the individuals and setting all genes of these individuals to 0.

7. The method for preparing a pipe distribution diagram according to claim 3 or 4, characterized in that, The mutation treatment includes replacing any adjacent genes of an individual extracted with a predetermined probability.

8. The method for preparing a pipe distribution diagram according to any one of claims 1 to 4, characterized in that, It also includes a pre-judgment step, which determines whether the pipe distribution along the straight line connecting the intersections (IPs) is feasible for construction based on the shape of the irregularly shaped pipes laid at each intersection or the presence or absence of control points (CPs) specified between each intersection (IP). If, in the previous determination step, it is determined that pipe distribution along the straight line between connection intersections (IPs) cannot be constructed, then the second to the sixth steps are executed.

9. A pipe distribution map making apparatus, comprising a pipe connecting multiple intersection points (IPs) from a starting point to an ending point specified on a map and passing through control points (CPs) selectively specified between each intersection point (IP), and further comprising: The first arithmetic unit selects the irregular tubes configured at each intersection (IP) based on the selection process performed by the operator; The second calculation unit determines the required number of straight pipes, the presence or absence of pipe cuts, and the length of each pipe cut based on the distance between each intersection (IP) and the length of the straight pipe. The third calculation unit generates a hypothetical pipeline. This hypothetical pipeline is a network that allocates straight pipes and cut pipes, determined by the second calculation unit, to each intersection (IP). The hypothetical pipeline is determined by characteristic evaluation data, which is represented by a sequence of numbers. This sequence uses the joint angle θi of each joint of the straight pipes and cut pipes constituting the hypothetical pipeline and the adjustment margin Lj of the cut pipe length as variables that can be set within a specified allowable range. i is the number of joints, and j is the number of cut tubes; The fourth calculation unit calculates the evaluation value of each hypothetical pipeline generated by the third calculation unit based on the first characteristic value, the second characteristic value, the third characteristic value, and the fourth characteristic value. The first characteristic value is determined by the difference between the total number of intersection points (IPs) and control points (CPs) and the number of consecutive intersection points (IPs) and control points (CPs) with errors below a specified threshold, starting from the starting point. This error is the positional offset of the hypothetical pipeline from each intersection point (IP) and the positional offset of the hypothetical pipeline from each control point (CP). The second characteristic value is determined by the error at the intersection (IP) or control point (CP) where the threshold was initially exceeded. The third characteristic value is determined by the average of the errors at the intersection point (IP) and the control point (CP) where the error is below the threshold. The fourth characteristic value is determined by the proportion of the number of joints, excluding 0 degrees, within the range from the starting point to the intersection (IP) and control point (CP) where the error is below the threshold. A fifth calculation unit selects a hypothetical pipeline from the hypothetical pipelines based on the evaluation value; and The sixth calculation unit generates a pipeline connection diagram based on the characteristic evaluation data of the hypothetical pipeline selected by the fifth calculation unit.

10. The pipe distribution diagram making apparatus according to claim 9, characterized in that, The evaluation value is the sum of the product of each characteristic value and the weighting coefficient specified for each characteristic value.

11. The pipe distribution diagram making apparatus according to claim 9 or 10, characterized in that, The third computational unit is a computational unit that uses individuals to construct each hypothetical tube, wherein the individuals possess in their genes the junction angle θi of each junction of straight tubes and slit tubes, and the adjustment margin Lj of the slit tube length, where i is the number of junctions and j is the number of slit tubes. The fifth operation unit is the operation unit that executes the genetic algorithm to generate individuals with optimized genes. This genetic algorithm repeatedly performs generational alternation, which includes any one of the following: selection processing based on the evaluation value of each individual to select a specified individual, crossover processing of genes between recombinant individuals, and mutation processing to change the genes of a certain individual. The sixth arithmetic unit is an arithmetic unit that generates pipeline connection diagrams based on the genes of the optimized individual.

12. The pipe distribution diagram making apparatus according to claim 11, characterized in that, The selection process includes an elite strategy and a tournament method. The elite strategy extracts the individual with the best evaluation value from all individuals. The tournament method repeats the process of randomly selecting any number of individuals from the remaining individuals and selecting individuals with relatively good evaluation values ​​until the number of individuals in the generation is equal to the number of individuals.

Images