JPH108706A - Planning method for replacement of temporary scaffolding - Google Patents

Abstract

PROBLEM TO BE SOLVED: To enhance sophistication of a construction plan and to reduce the number of construction processes by a method wherein, by using genetic algorithm, a replacement timing and a region for temporary scaffolding used for construction are optimized, and further the progress state of optimization calculation is confirmed. SOLUTION: Necessary regions 41, 42, and 3 for scaffoldings for each of parts 21, 22, and 23 to be installed are defined, and the parts and the regions are arranged, in order, according to a predetermined order. Thereafter, by using genetic algorithm, production processing for a replacement plan is executed. When, in all the necessary regions, a part common regarding the direction of the height of the scaffoldings is not present or either a part or a necessary region interferes, it is decided that a replacement time for the scaffoldings comes, and a plurality of proposal replacement plans are produced. A gene brought into a visible state is displayed on a display device, the proposals are combined or partially corrected to decide an optimum a replacement plan. This constitution easily optimizes a replacement time and arrangement for temporary scaffoldings.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a computer system for supporting construction of a construction plan for construction work of a power plant or the like, and more particularly, to a temporary construction suitable for use in studying the arrangement of a temporary scaffold used for construction. The present invention relates to a scaffolding change planning method and device.

[0002]

2. Description of the Related Art In order to reduce the number of man-hours for plant construction,
There is a need for more sophisticated construction plans. The temporary scaffold undergoes disassembly and assembling operations called “replacement” as the construction progresses, and its shape is changed. The quality of the scaffold arrangement determined by this rearrangement greatly affects the number of man-hours, and therefore, in preparing a construction plan, an optimum rearrangement plan is required.

[0003] As one of the techniques for optimization, a genetic algorithm is known. This is a technique that simulates the process of living beings adapting to the environment and evolving over successive generations. In this method, a candidate for a solution to a problem is considered as an individual organism having genetic information, and this is called an individual. This genetic information is coded so as to express the problem, and is specifically stored in the form of a character string or a list on a computer. Then, in one generation, the procedure is determined so that only individuals having a high degree of adaptation to the conditions given by the problem leave offspring that inherit their own genetic properties to the next generation. Then, in a certain later generation, the algorithm evolves the individual by inheritance, and only the individual optimized for the condition, that is, only the optimal solution survives. Specifically, genetic operations called selective crossing, crossover, and mutation are repeatedly applied to each individual of each generation. Here, selective mating is a process of preferentially selecting individuals having high fitness and excellent genetic properties. Crossover is a process for exchanging a part of genetic information between selected individuals to generate more excellent genetic properties. Furthermore, mutations are independent of their genetic nature,
This is a process of randomly changing a part of genetic information. Through the above genetic operations, an optimal solution to the problem can be obtained.

In the problem of optimizing the arrangement of objects, for example, in the Institute of Electrical Engineers of Japan, Vol. 115, No. 4, pg. A method for applying the algorithm is shown. In this method, a list of coordinate values for arranging elements is considered as a gene code, and a genetic operation such as crossover or mutation is applied to the gene code to obtain an optimum arrangement position of each element.

[0005]

In the construction of a plant, as shown in FIG.
3, the worker 11 has a component 21 such as piping and equipment,
In order to install 22, scaffolds 31 and 32 are required. Since the installation is performed sequentially from the high part near the ceiling,
Every time the height of the installation object changes, disassembling and assembling the temporary scaffolding, which is called refilling, is performed. In FIG. 1, scaffold 1 (31) is set to the height shown in level 1 for installation of part 1, and then scaffold 2 (32) is leveled by rearranging for part 2 (22). 2 is shown as being reset. In other words, the parts are sequentially installed while changing the shape of the scaffold by the rearrangement.

[0006] In the above-described prior art, since the optimal arrangement of objects having a fixed shape is handled, it is not possible to process the arrangement of an object whose shape changes with time, such as a scaffold to be changed. . Also, it has been difficult for the user to grasp the contents indicated by the gene of the genetic algorithm.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a method and an apparatus for reordering temporary scaffolds, which can optimize the arrangement of scaffolds to be rearranged by a genetic algorithm and can easily confirm the progress of calculation. is there.

[0008]

The object of the present invention is to define a scaffold required area where a scaffold is to be arranged for each component to be installed,
Judgment of the time when refilling is necessary is determined based on the arrangement relationship between the parts and the required scaffolding area. This can be achieved by combining the candidates or correcting some of them, and determining the optimal rearrangement while displaying the candidates on a display using a model in which the degree of detail is changed according to the number of types of the candidates.

The details of the present invention are as follows.

According to one aspect of the present invention, the scaffold is once disassembled and then reassembled to change the planar shape and height of the temporary scaffold while changing predetermined components in predetermined sections in a predetermined order. A method of planning the contents of scaffolding change for the work of installing the work, wherein a workable area is defined as a work space when an operator stands at a work reference point, and the work is performed at the time of installation on the parts. Is defined as a work range, and when the work space is moved so as to encompass the work range, a shape determined from the range in which the work reference point moves is set as a scaffolding required area for each of the parts. When sequentially arranging the parts and the required scaffolding area in the compartment in accordance with the order, all the arranged scaffolding required areas are arranged in the compartment. If there is no common part with respect to the height direction of the scaffold, or if any of the arranged parts and any of the required scaffold areas interfere with each other more than a predetermined volume including zero, before installation. The present invention further provides a method for planning the change of the temporary scaffolding, which is characterized by determining that the scaffolding needs to be changed.

More specifically, a character string having a character length equal to the number of installations of the component is provided, and the scaffolding is changed or not changed at the time of installation of each component according to the order from the beginning of the character string. The character string is created by a predetermined number of character strings by randomly setting a time point at which resizing is to be performed by a random number at a time before the resizing limit, and by a predetermined number of characters. From among the character strings, the character strings are selected with priority given to those that match, based on the small number of times that there is a change, and the change is made simultaneously among the selected character strings. The character string is cut at the time and the characters are exchanged with each other, and in the exchanged character string, the time at which the refilling is made is changed to a time before the refilling limit and before the time at which the next refilling is made. And said The adaptation operation consisting of the selection, the exchange, and the change is repeated for a predetermined number of operations to generate a character string that is most suitable for the evaluation criterion, and determines the point in time when the most suitable character string indicates that there is a change of character. It is preferable that the temporary scaffold be replaced.

In order to display the result of the adaptation operation,
For the content indicated by the character string, a plurality of display models having different degrees of detail depending on the information that can be displayed are prepared, and the number of types of the character string is calculated by comparing and referencing the contents of the character strings. When the number of types is larger than a predetermined value, a display model in which information that can be displayed is reduced and the display model is omitted is selected, and when the number of types is smaller than a predetermined value, the information that can be displayed is increased. It is preferable to select a display model that has been refined and display the contents of the change of the character string indicated on the display according to the selected display model.

[0013] Further, at the time when there is a change in the character string, for all the scaffolding necessary areas arranged up to that time, the scaffolding is selected from the portions common to the height direction of the scaffolding in the section. Determine the height of the
It is preferable to determine the planar shape of the scaffold from a shape determined by projecting all the required scaffold regions on a plane perpendicular to the height direction.

It is preferable that the evaluation criterion includes that a scaffold area calculated from the planar shape of the scaffold is small.

In the evaluation criteria, it is preferable that a scaffold shape determined from the height of the scaffold and the planar shape has a small volume that interferes with the shape of the component.

In the above-mentioned parts, it is preferable that the parts to be connected and installed belong to the same system, and the evaluation criteria include that the number of types of the system to which the parts to be installed belong is small. .

According to another aspect of the present invention, the scaffold is once disassembled and then reassembled to change the plan shape and height of the temporary scaffold while changing the temporary scaffold in a predetermined order in a certain section. An apparatus for planning the contents of scaffolding rearrangement for an operation of installing a plurality of parts, the scaffold necessary area setting for setting a scaffold required area corresponding to a spatial range necessary for the installation for each of the parts Means, from at least one of the relative positional relationship between the component and the scaffold required area and the relative positional relationship between the scaffold required areas for each component, a refill limit determining means for determining a refill limit of the scaffold, An initial generation generating means for initializing a plurality of character strings indicating the presence or absence of a re-arrangement time within a range not exceeding the determined re-arrangement limit; By finding an optimal solution that best matched the criteria defined, planner servings replacement temporary scaffold which is characterized by having a optimal solution calculating means for determining a prime replacement timing of the scaffold is provided.

[0018]

FIG. 2 is a flow chart of a method for planning the re-arrangement of temporary scaffolds, and an embodiment of the present invention will be described below.

Step 101 is an input step in which the design information of the installed parts and the control parameters of the genetic algorithm are read. Details of this step will be described with reference to the flowchart of the input processing method in FIG.

In step 101.1, the shape, arrangement and system information of the component to be installed are read. It is assumed that the shape and arrangement information of the part is determined by a separate CAD system at the time of design, and the information is acquired therefrom. In a plant, systems are classified in order to indicate the type of medium flowing inside piping and equipment and the group of components that are connected continuously. The system information is an identifier indicating the affiliation of a component, and is a content composed of a system name and a number.
This information is also assumed to have been determined by the CAD system, and is acquired therefrom.

In step 101.2, information on the order in which components are installed is read. In the present embodiment, it is assumed that the order in which the components are to be installed has already been determined by a separate process planning system or the like, and information is acquired therefrom.
Here, the installation order is not changed, and the scaffolding rearrangement when installing in the given order is optimized.

In step 101.3, a rule for generating a required area of the scaffold is read. The contents of the necessary area are shown in FIG. A range in which the scaffold is to be arranged for each component is calculated from the component shape and arrangement information already input in step 101.1, and this range is set as a necessary area. The method for calculating the necessary area at this time is a generation rule. For example, part 1 (21) in FIG.
, A required area 1 (41) is defined. This indicates that the scaffold may be set to any height in the space of the necessary area.

As an example of a specific generation rule, FIG. 16 shows a method of setting a required area of a scaffold. First, when the worker 11 stands at a certain work reference point 17, a spatial range in which the worker 11 can work is given as a work space 60. Next, a range in which work is to be performed on the component 20, that is, a range on the component 20 that requires work when the component 20 is attached is given as a work range 50. Then, in the XY plane, a movement range of the work reference point 17 necessary for the work space 60 to cover the work range 50, that is, a necessary range in the X and Y directions is determined. Similarly, for the Z direction, the necessary range of the work reference point 17 in the Z direction can be determined.
The space determined from the necessary range in these XYZ directions is the required area 40 of the scaffold.

In step 101.4, a required area of the scaffold is generated for each component. As described in the previous step, the necessary area is defined for each component from the read generation rule.

In step 101.5, control parameters for genetic operations such as the number of generations, the number of individuals, the crossover rate, and the mutation rate are read. Here, the number of generations is the number of times that individuals change generations, and the number of individuals is the total number of individuals per generation. The crossover rate is the ratio of individuals to be crossed out of all individuals, and the mutation rate is the ratio of mutations.

In step 101.6, evaluation parameters for calculating the fitness of the individual, such as the weighting factor of the fitness function, are read. The contents of the fitness calculation will be described later, but here, various parameters necessary for the calculation are acquired.

In step 101.7, display parameters such as the correspondence between the number of types of individuals and the display model are read. It is acquired here as information necessary for visualizing the gene. Thus, the input step ends, and the process returns to the flowchart of FIG.

Step 102 in FIG. 2 is a step of generating an initial generation, and randomly generates a change timing within the range of the constraint condition and stores it as genetic information. Details of this step are shown in the flowchart of the initial generation generation processing method in FIG.

Step 102.1 means that the processing of steps 102.2 to 106 is repeated for each individual.

Step 102.2 means that the processing from steps 102.3 to 102.12 is repeated for each scaffold. Here, it is assumed that one scaffold has a fixed scaffold height and exists only during a period between specific rearrangements.

Step 102.3 means that the processing from steps 102.4 to 102.8 is repeated for each part. The order of these processes is determined in step 101.
This is performed according to the installation order entered in step 2.

In step 102.4, the part and the necessary area are added to the current installation state. For example, FIG.
5 shows a state in which the part 1 (21) and the part 2 (22) are fixed and installed, and the required area 1 (41) and the required area 2 (42) are defined respectively. The process of this step is to create a state in which the part 3 (23) and the necessary area 3 (43) are further added, and try to determine the necessity of rearrangement by the following process.

In step 102.5, the presence or absence of a common scaffold height is detected. In FIG. 3, required area 1 (41)
Since there is a common section in the Z direction between and the required area 2 (42), the height of the scaffold 1 (31) may be determined within this section. In this case, it is determined that the common scaffold height is present. However, the necessary area 3 (4
With the addition of 3), there is no longer Z between these required areas.
There is no section common to the directions. Therefore, it is determined that there is no common scaffold height, and the process of step 102.6 is selected. The height of the scaffold is determined from the area determined by the logical operation of AND of the necessary area.

In step 102.6, the current time is recorded as the change limit. This does not change the scaffold height,
It means that it is time to stop refilling.

In step 102.7, the presence or absence of interference with the scaffold is detected. This content is shown in the explanatory diagram of the method of judging the necessity of rearrangement in FIG. As in FIG. 3, the part 1 (2
1) and the part 2 (22) are in a state of being installed, and a state is going to add the part 3 (23). Here, the presence or absence of interference between the shape of the component 3 (23) and the common section 15 of the required area of the scaffold is checked. These interferences can be determined from the minimum and maximum values in the XYZ directions of the parts and the required area. In the example of FIG. 4, since there is a large interference between the two, when the part 3 (23) is added, the scaffold 1
This means that the installation position of (31) cannot be secured. In this case, it is determined that the interference with the scaffold is present, and 10
Select the process of 2.8. If there is interference but smaller than a predetermined interference volume, it is determined that there is no interference. Here, the interference volume is the volume of portions that interfere with each other.

In this embodiment, as shown in FIG. 16, the work range 50 and the required area 40 of the scaffold are different. Therefore, even if the necessary areas interfere with each other, if the work space 60 that can cover the work range 50 can be secured, the work can be performed on the scaffold, so that no problem occurs. In the present embodiment, whether or not to secure the work space is determined according to the value of the interference volume.

At step 102.8, the current time is recorded as the change limit. The content of this step is Step 1.
Same as 02.6.

At step 102.9, a time before the refilling limit is selected by a random number as a refilling time. This content is shown in the explanatory diagram of the coding method in FIG. Assume that eight components are to be installed, and the order is to be performed in the order registered in a list called an installation order list 50 as shown in the figure. Then, the start time of the installation is set to t = 0, and the end time of the installation is set to t = 8.

Next, for such an installation condition, data called a refilling time list 51 is defined. In this list 51, the element storing the character "1" means that there is a change, and the element of character "0" means that there is no change. Treat as For example, the character “1” of the second element indicates that the rearrangement 1 is performed before the component 3 is installed. Similarly, the rearrangement 2 is performed before the component 7 and the rearrangement 3 is performed before the component 6. In this way, the re-arrangement timing list 51 records all the re-arrangement timings. Note that, as characters indicating the presence or absence of the change, numbers and characters other than “0” and “1” may be used as long as they are distinguished.

The selection of the timing of the change is made within the limits of each scaffold. For example, in the case of scaffold 1 in FIG. 5, t = 3 is the refilling limit, and therefore three locations from t = 1 to 3 before that are selection candidates for the refilling time. In the figure, the selection candidates are indicated by “○”, and the time of t = 2 to which “*” is added is selected by a random number. In addition, changing at the installation start point at t = 0 is meaningless, and is excluded from selection and is indicated by “●”.

In step 102.10, the state at the time of the change is set as the current installation state. In the previous step, the change timing is determined, and the components up to this time are set in the installed state. In the subsequent scaffolds, parts will be added one by one to this state, and the timing of the refill limit will be further examined.

In step 102.11, the end of the installation is determined. When all parts are in the installed state, it is determined that the installation has been completed, and step 1
Step 02.12 is selected.

In step 102.12, the process exits from the processing loop for each scaffold.

In step 102.13, a reordering time list is generated. By the above processing, the time for changing the scaffolding of all scaffolds has been determined, and the results are shown in FIG.
Is recorded in the reordering time list 51 as shown in FIG. In the present embodiment, the genetic information of an individual is, specifically, this reordering time list.

In step 106, the following method is used.
Calculate the fitness of the individual. Thus, the initial generation generation process is completed, and the process returns to the flowchart of FIG.

Step 103 in FIG. 2 is a step of selective mating, and selects an individual to be subjected to a genetic operation at a probability proportional to the fitness of each individual. The details will be described with reference to the flowchart of the selective mating process in FIG.

In step 103.1, a total sum of the fitness values of all individuals is calculated, and this is set to ΣA.

In step 103.3, the selection probability is determined from the fitness of the individual and the total sum of the fitness of all individuals. For example, assuming that the fitness of the individual is Ai and the selection probability is Si, the calculation is as follows: Si = Ai / ΣA (Equation 1) Based on the already calculated fitness, the selection probability of the individual is set so that the individual having excellent properties is preferentially selected.

In step 103.4, step 103.
5 and 103.6 are repeated for the number of individuals.

In step 103.5, a random number is generated.

In step 103.6, an individual to be a candidate for a genetic operation is selected from the random number value and the selection probability of each individual. For example, if there are three individuals a, b, and c, and their fitness levels are 1, 2, and 3, respectively, the selection probabilities are 1/6, 2/6, and 3/6 from Equation 1. . Here, if random numbers from 0 to 6 are to be generated, the random number value is 0
A is in the range of 1 to 1, b is 3 in the range of 1 to 3.
In the range from to 6, c is selected.

In this processing, in order to maintain the total number of individuals at the same number as that of the initial generation, individuals with high fitness are selected a plurality of times, and individuals with low fitness are never selected at all. is there. This means that the selected individual can survive the next generation, and is a candidate for genetic manipulation processing such as crossover and mutation. Thus, the selective mating process ends, and the process returns to the flowchart of FIG.

Step 104 in FIG. 2 is a crossover step in which part of the genetic information is exchanged between individuals selected within the range of the constraint condition. The details will be described with reference to the flowchart of the crossover processing method in FIG.

In step 104.1, individuals to be crossed are selected from the genetic manipulation candidates according to the crossover rate.
The number of individuals to be crossed is determined by specifying the crossover rate, and the individuals to be crossed are selected by random numbers.

Step 104.2 means that the following processing is repeated only for the individual that crosses.

In step 104.3, the reordering time list is referred to. The subsequent processing contents are shown in the explanatory diagram of the crossover calculation method in FIG. The figure shows that parent 1 and parent 2 are selected as the individuals to be crossed over, and individuals that are children 1 and 2 are generated by the crossover. In this step,
The reordering list of the parents 1 and 2 is acquired.

In step 104.4, the time when the rearrangement is performed simultaneously is set as a crossover candidate. The timing at which the parent 1 and the parent 2 simultaneously perform the rearrangement is detected from the previously obtained rearrangement timing list. This can be done by examining the position of the element storing the character "1" in the list. In the example of FIG. 6, since the rearrangement times indicated by the second and fourth elements are the same, both of them are set as crossover candidates. If crossovers are allowed outside of the same period, impractical solutions such as placing a scaffold beyond the refilling limit may appear, so these restrictions are imposed.

In step 104.5, the crossover time is determined from the crossover candidates by using random numbers. In FIG. 6, the fourth element to which "*" is added is selected, and the intersection between the fourth element and the fifth element is determined.

At step 104.6, the reordering time list is divided at the crossover time and exchanged. The child 1 and child 2 in FIG. 6 are the reordering time lists generated in this manner. Thus, the crossover process is completed, and the process returns to the flowchart of FIG.

Step 105 in FIG. 2 is a mutation step in which a part of the genetic information of the individual selected within the range of the constraint condition is changed. The details will be described with reference to the flowchart of the mutation processing method in FIG.

In step 105.1, an individual to be mutated is selected from the genetic manipulation candidates according to the mutation rate. Similar to step 104.1 in the case of crossover, only the individual selected here is mutated.

Step 105.2 means that the following processing is repeated for the individual to be mutated.

At step 105.3, the reordering time list is referred to. The following detailed contents are shown in the explanatory diagram of the mutation calculation method in FIG. The illustrated reordering time list is for an individual to be mutated, and the information is acquired here.

In step 105.5, the changing limit is referred to. Here, steps 102.6 and 102.
The information on the change limit of each scaffold recorded in step 8 is acquired.

In step 105.6, the time before the reordering limit and before the repositioning of the next scaffold is set as a mutation candidate. In FIG. 7, the one with “*” added is the current reordering time, and “○” is a mutation candidate. “●” indicates a period during which the candidate is not a mutation candidate. Regarding the constraint of scaffold 2, the change of scaffold 3 of the next scaffold is t = 5.
Therefore, even at a time before the refilling limit, the time at t = 6 is not a candidate. Such a restriction is provided to prevent an infeasible solution from appearing due to mutation.

At step 105.7, a mutation time is selected from mutation candidates by random numbers. In the example of FIG.
Only one is selected from the three periods indicated by “O”. Here, only one mutation is included in one reordering time list.

In step 105.8, the rearrangement timing is moved by mutation, and the rearrangement timing list is changed. Specifically, the position of the character “1” in the reordering time list moves. Thus, the mutation process is completed, and the process returns to the flowchart of FIG.

Step 106 in FIG. 2 is a fitness calculation step, in which the fitness is calculated to evaluate the generated individual. The details will be described with reference to the flowchart of the fitness calculation processing method in FIG.

In step 106.1, the weight coefficient of the fitness function is referred to. In later processing, this weighting factor
A plurality of evaluation items for fitness calculation will be weighted.

In step 106.3, the number of refills is calculated from the refill timing list. The number of refills
What is necessary is just to count the number of characters "1" in the reordering time list.
For each refill, disassemble and assemble the scaffold 2
Since one operation occurs, the effect on the construction man-hour is large. Therefore, the fact that the degree of fitness is high when the number of rearrangements is small is included in the evaluation criteria for optimizing the rearrangement of scaffolds.

In step 106.4, the shape of the scaffold is determined from the required area of the scaffold for each component, and the scaffold area is calculated. As can be seen from FIG. 3 or FIG. 4, the planar shape of each scaffold is a shape determined by the logical operation of the OR of the necessary area related thereto. For example, the scaffold 1 is obtained as an OR area of the required area 1 and the required area 2 on the XY plane.
The plane area on the XY plane is calculated from the shape thus determined,
This is the scaffold area. Since the scaffold area is a criterion for calculating the number of construction steps, the evaluation criterion includes that the smaller the scaffold area is, the higher the fitness is.

In this embodiment, since most of the parts of the plant have a rectangular parallelepiped or a columnar shape, the required area of the scaffold is rectangular in the XY plane. However, the required area in the present invention has a rectangular shape. The present invention is not limited to this, and may be any one determined in accordance with the shape of the part where the component is attached.

In step 106.5, an interference volume is calculated from the shape of the scaffold and the shape of the part. The volume of the part where the scaffold interferes with the component is as shown in FIG.
7, the value at that time is used. If the interference volume is large, there are many obstacles on the scaffold and the workability deteriorates. Therefore, the evaluation criteria include that the adaptability is high if the interference volume is small.

In step 106.6, the average value of the number of system types to which the components to be installed on one scaffold belongs is calculated. Since the system information of the parts has already been input in step 101.1, it can be determined whether or not the parts are of the same system. Based on this, the number of system types of parts to be installed for each scaffold is determined, and then the average value of the number of system types per scaffold is determined. If the same system is used, the same installation work is performed. Therefore, if too many systems are mixed on one scaffold, the workability is deteriorated. Therefore, it is also included in the evaluation criteria that the smaller the number of system types, the higher the fitness is.

In step 106.7, the fitness is calculated from the weighting factor, the number of times of changing, the scaffold area, the interference volume, and the number of system types. For example, if the number of refills is M, the scaffold area is R, the interference volume is C, and the number of system types is S, and the weighting factors are w1, w2, w3, and w4, the fitness A is A = w1 × M + w2. × R + w3 × C + w4 × S (Equation 2) Note that these weighting factors w1, w
2, w3, and w4 take one of positive and negative values depending on whether the increase in the variable corresponding to the coefficient is preferable in light of the above evaluation criteria. For example,
When it is not preferable to increase the value of the variable M, the weight coefficient W1 becomes a negative value, and when the value is the opposite, it takes a positive value. Further, since the order of possible values of each variable is usually different, the value of each weight coefficient is set so that appropriate weighting is performed between the variables. Here, the value input in step 101.6 is used as the value of the weight coefficient.

In the present embodiment, the fitness is calculated from the four evaluation criteria. However, not all of them are required. If at least one of the evaluation criteria is provided, the fitness can be calculated. Further, in the present invention, the form of the fitness calculation formula is not limited to the above equation (2).
It suffices if evaluation criteria to be considered are included. As described above, the fitness calculation processing ends, and the process returns to the flowchart of FIG.

Step 107 in FIG. 2 is a step of visualizing a gene, and displays the status of gene information in the current generation on a display. The details will be described with reference to the flowchart of the gene visualization processing method in FIG.

In step 107. 1, the number of gene types is calculated by comparing the reordering time list. In the genetic algorithm, in the selective mating in step 103, individuals having higher fitness are preferentially selected. Therefore, usually, as the generation progresses, individuals having specific genes with high fitness occupy a large number in the population. In this case, by comparing the individual refilling time lists as character strings and detecting the same gene,
Calculate the number of gene types in the current generation.

In step 107.2, one of steps 107.3 to 107.5 is selected according to the difference in the number of gene types. Since the association between the number of gene types and the display model has been input in step 101.7, the model to be displayed is determined based on this relationship.

At step 107.3, an abbreviated display model is selected. This step is executed when it is determined that the number of gene types is large. Here, the contents of the processing are shown in FIG.
An illustration of visualization using display models with different levels of detail is shown in FIG. In the early generations, the number of gene types is large, and the number of models to be displayed is also large in order to visualize the processing. In this case, a model with low detail is selected as shown in FIG. 15A so as not to increase the calculation time required for visualization. In this example, it is selected to display on the display screen a model obtained by replacing the contents of the reordering time list with an array of rectangular patterns as they are. The display information at this time is the gene itself of each individual.

At step 107.4, a standard display model is selected. This step is executed when the number of gene types is determined to be standard. In this case, as shown in FIG. 15B, a model having a standard level of detail is selected. In this example, a step 1 is added to a projection created by projecting a part in a certain direction.
It is selected that only the position and height of the scaffold obtained in step 06.4 (FIG. 13) are simply displayed in a two-dimensional model. The display information at this time is the content indicated by the gene of each individual.

At step 107.5, a detailed display model is selected. This step is executed when it is determined that the number of gene types is small. In this case, a model with a high degree of detail is selected as shown in FIG. In this example, a three-dimensional model of the component 20 and the scaffold 30 in the section 10 is created, and it is selected to display the shape of the scaffold 30 in detail. The display information at this time is the details of the content indicated by the gene of each individual.

In step 107.7, step 10
The display model selected in 7.3 to 107.5 is displayed on the display screen. Thus, the gene visualization process is completed, and the process returns to the flowchart of FIG.

Step 108 in FIG. 2 is a step of changing the generation, and stores the genetic information of the current generation as the genetic information of the previous generation. More specifically, this means that the reordering time list created as a “child” by genetic operation is re-registered as a “parent” for next-generation calculations.

Step 109 is an output step, in which the individual having the highest fitness in the last generation is determined as the optimum solution, and the rearrangement timing and the scaffold arrangement area indicated by the contents are output. Here, the changing timing is extracted from the contents of the changing timing list. Next, the scaffold arrangement area is determined from a combination of necessary areas of the related scaffolds. For example, as shown in FIG. 3, since the common range of the scaffold height has already been obtained from the AND operation of the required area of the scaffold, the scaffold height is output as the center value of the range. The planar shape of the scaffold at that scaffold height is
It is output as a shape determined by the OR operation of the required area of the scaffold projected on the XY plane. By this scaffold height and plane shape,
Determine the placement area of the temporary scaffold.

One embodiment of an apparatus for executing the above-described method for planning the change of the temporary scaffold will be described with reference to FIG.

The device of this embodiment is realized by a computer system, a workstation, or the like, and includes, for example, a display device, a storage device, and an arithmetic device as shown in FIG.

The arithmetic unit performs an input processing unit 201, an initial generation generation processing unit 202, a selective crossing processing unit 203, a crossover processing unit 204, and a sudden processing unit for executing the processing steps 101 to 109 described in FIG. Mutation processing unit 20
5. Fitness calculation processing unit 206, gene visualization processing unit 20
7, a generation change processing unit 208 and an output processing unit 209.

In the storage device, for example, installed part design information 201. 1 created by an external CAD system and genetic algorithm control parameters 201. 2 used for processing in the arithmetic unit are stored in advance. I have.

The display device outputs a gene information output unit 209.1 for displaying the display model generated by the gene visualization processing unit 207, and outputs a rearrangement timing and a scaffold arrangement area indicated by the finally obtained optimal solution. And a scaffold arrangement area output unit 209.2.

As described above, according to the present invention, when planning a scaffold with re-arrangement for work such as various plant construction, it is possible to obtain an optimum re-arrangement time and arrangement area of a temporary scaffold. Will be possible. In addition, as the optimization calculation progresses, the contents of the re-arrangement candidates can be confirmed on the display screen.

Therefore, the construction plan can be made more sophisticated than before, and there is also an effect of reducing the number of construction steps of the plant.

[0093]

According to the present invention, there is provided a method and an apparatus for reordering temporary scaffolds, which can optimize the arrangement of scaffolds to be rearranged by a genetic algorithm and can easily confirm the progress of calculation. be able to.

[Brief description of the drawings]

FIG. 1 is an explanatory diagram of changing a temporary scaffold.

FIG. 2 is a flowchart of a method for planning a change of a temporary scaffold to which the present invention is applied.

FIG. 3 is an explanatory diagram of a method of determining whether to change the arrangement.

FIG. 4 is an explanatory diagram of a method of determining whether or not to change the arrangement.

FIG. 5 is an explanatory diagram of a coding method.

FIG. 6 is an explanatory diagram of a crossover calculation method.

FIG. 7 is an explanatory diagram of a mutation calculation method.

FIG. 8 is a flowchart of an input processing method.

FIG. 9 is a flowchart of an initial generation generation processing method.

FIG. 10 is a flowchart of a selective mating processing method.

FIG. 11 is a flowchart of a crossover processing method.

FIG. 12 is a flowchart of a mutation processing method.

FIG. 13 is a flowchart of a fitness calculation processing method.

FIG. 14 is a flowchart of a gene visualization processing method.

FIG. 15A is an explanatory diagram of a display model when the number of types of solids is large. FIG. 15B is an explanatory diagram of a display model when the number of types of solids is standard. FIG. 15C is an explanatory diagram of a display model when the number of types of solids is small.

FIG. 16 is an explanatory diagram of a method for setting a required area of a scaffold.

FIG. 17 is a block diagram of a planning device for changing a temporary scaffold to which the present invention is applied.

[Explanation of symbols]

10 ... section, 20 ... parts, 30 ... scaffold, 40 ... necessary area.

Claims (12)

[Claims] 1. A work for mounting a plurality of parts in a predetermined section in a predetermined section while changing the planar shape and height of a temporary scaffold by disassembling and reassembling the scaffold once. A method of planning the contents of scaffolding re-arrangement, wherein a spatial range in which a worker standing at a work reference point can work is defined as a work space, and a space around the part required at the time of installation work of each part is required. A range is defined as a work range, and when the work space is moved for each part so as to encompass the work range, a shape determined from the range in which the work reference point has moved is defined as a scaffold required area for the part. Setting, when sequentially arranging the component and the scaffold necessary area in the compartment in accordance with the installation order of the component, the scaffolding is performed for all of the arranged scaffold necessary areas. If there is no common part in the height direction and if any of the arranged parts interferes with any of the required scaffolding areas, the scaffolding is replaced before installation. A method of planning the change of the temporary scaffolding, which is determined to be the limit of the change of the rehabilitation that must be performed. 2. The method according to claim 1, wherein, in determining the refilling limit, when there is no common part in the height direction of the scaffold in all of the arranged scaffold necessary areas, and In any of the cases where any one of the scaffold required areas interferes with a larger volume than a predetermined volume, it is determined that the refilling limit is reached, Planning method. 3. The scaffold according to claim 1, wherein a character string having a character length equal to the number of installations of the component is provided, and the character string is provided at the time of installation of each component according to the installation sequence of the component from the beginning. The character string is stored in a predetermined number by setting a random number at the time before the limit of the re-arrangement by a random number at a point before the re-arrangement limit. Is selected, and a character string is selected from among the predetermined number of character strings in preference to a character string having a high degree of conformity, based on an evaluation criterion that the degree of conformity is high if the number of times of reordering is small. Then, between the selected character strings, the character strings are cut off at the same time that there is a change of characters, and the characters are exchanged with each other. At the point before the point at which the change is made, the point at which the change is made is changed, and the adaptation operation including the selection, the exchange, and the change is repeated for a predetermined number of times, and the finally generated character is generated. A method of planning the relocation of a temporary scaffold, wherein a time point at which a re-arrangement indicated by a character string most suitable for the evaluation criterion is present is a relocation time of a temporary scaffold. 4. A display model according to claim 3, wherein a plurality of display models having different degrees of detail are prepared for the contents indicated by the character string in order to display the result of the adaptation operation. The number of types of the character string is calculated by referencing and comparing the contents of the columns, and when the number of types is larger than a predetermined value, a display model in which information that can be displayed is reduced and which is omitted is selected. If the number of types is smaller than a predetermined value, the display model is selected by increasing the information that can be displayed, and selecting a detailed display model. A method of planning a change of a temporary scaffold, which is displayed on a display. 5. The system according to claim 3, wherein at the time when the character string has a change of order, all of the necessary scaffolding regions arranged up to that time are selected from the portions common to the height direction of the scaffold. Determining the height of the scaffold, and determining the planar shape of the scaffold from a shape determined by projecting all of the required scaffolding area on a plane perpendicular to the height direction. How to plan. 6. The temporary scaffold replacement according to claim 5, wherein the evaluation criterion further includes that if the scaffold area calculated from the planar shape of the scaffold is smaller, the fitness is higher. Planning method. 7. The evaluation criterion according to claim 5, wherein the evaluation criterion further states that the scaffold shape determined from the height and the planar shape of the scaffold has a higher fitness if the volume that interferes with the shape of the component is smaller. A method for planning the rehabilitation of a temporary scaffold, characterized by including: 8. The system according to claim 3, wherein, among the components, components that are mutually connected and installed belong to the same system, and the evaluation criterion includes the number of types of the system to which the components to be installed belong. A method of planning a change of a temporary scaffold, further comprising a higher degree of fit if smaller. 9. A work for installing a plurality of parts in a predetermined section in a predetermined section while changing the plane shape and height of a temporary scaffold by disassembling and reassembling the scaffold once. A method of planning the contents of scaffolding re-arrangement, wherein a character string having a character length equal to the number of installations of the part is provided, and the character string is set in advance from the beginning according to the installation order of the part. One character indicating whether or not scaffolding has been replaced or not at the time of installation of each part, determined by the replacement limit determination method, shall be stored. A predetermined number of the character strings are created by setting them at random by using random numbers. From the predetermined number of character strings, the degree of conformity is high if the number of times when there is a change is small. With that being the evaluation criterion, a character string is preferentially selected from those with a high degree of conformity, and the character strings are cut off at the same time as the selected character strings are re-arranged, and the characters are mutually exchanged. Exchange, in the exchanged character string, change the time when the refilling is to be performed, before the refilling limit and before the time when the next refilling is to be performed, from the selection, the exchange, and the change. The adaptation operation is repeated for a predetermined number of operations, and, among the finally generated character strings, the time point at which the character string that best matches the evaluation criterion is present is the time when the temporary scaffold is replaced. A method of planning the rehabilitation of a temporary scaffold. 10. A work for installing a plurality of parts in a predetermined section in a predetermined section while changing the planar shape and height of a temporary scaffold by disassembling and reassembling the scaffold once. A scaffold necessary area setting means for setting a scaffold necessary area corresponding to a spatial range necessary for installation of each component, the scaffold necessary area setting means, A repositioning limit determining means for determining a repositioning limit of a scaffold from at least one of a relative positional relationship with a region and a relative positional relationship between scaffolding-required regions for each component; A plurality of initial generation generation means for initial setting within a range that does not deviate from the determined rearrangement limit, and most suitable for a predetermined evaluation criterion from the plurality of initially set character strings. An apparatus for calculating a temporary scaffold change, wherein the optimal solution is determined by determining an optimum solution when the scaffold is changed. 11. The scaffold required area setting means according to claim 10, wherein a spatial range in which a worker standing at a work reference point can work is defined as a work space, and the area around the part necessary for installation of each part is set. A spatial range is defined as a work range, and when the work space is moved so as to encompass the work range for each part, a shape determined from the range in which the work reference point has moved is a scaffolding required area for the part. When the rearrangement limit determination means sequentially arranges the component and the scaffold necessary area in the section according to the installation order of the component, all of the arranged scaffold necessary areas are arranged. If there is no common part in the height direction of the scaffold, and if any of the arranged components and any of the scaffold necessary areas If any of the cases interfere greater than meth volume,
A scaffold change planning apparatus characterized in that the scaffold change is required to be performed before installation. 12. The apparatus according to claim 10, wherein said initial generation generation means comprises a character string having a character length equal to the number of installations of said component, and said character string is installed at the time of installation of each component according to said order from the beginning. In this example, one character indicating whether or not the scaffolding has been changed is stored, and the character string is determined in advance by setting a time at which the changing of the scaffolding is performed by a random number at a time before the limit of the changing of the scaffolding. The optimal solution calculating means uses the evaluation criterion such that the smaller the number of periods in which there is a change from the predetermined number of character strings, the higher the fitness is, and The character string is selected with higher priority, and the character strings are cut off and exchanged with each other at the time that the selected character strings are simultaneously re-arranged. At the time before the refilling limit and before the time when the next refilling is performed, the time when the refilling is performed is changed, and the adaptation operation including the selection, the replacement, and the change is performed a predetermined number of times. A temporary scaffold refilling time is defined as a time when a refilling indicated by a character string most suitable for the evaluation criterion among the finally generated character strings is performed. Planning device for scaffolding change.