CN104699899A - Ship pipeline route optimum design method - Google Patents
Ship pipeline route optimum design method Download PDFInfo
- Publication number
- CN104699899A CN104699899A CN201510102146.1A CN201510102146A CN104699899A CN 104699899 A CN104699899 A CN 104699899A CN 201510102146 A CN201510102146 A CN 201510102146A CN 104699899 A CN104699899 A CN 104699899A
- Authority
- CN
- China
- Prior art keywords
- pipeline
- equipment
- space
- ship
- model
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 61
- 238000013461 design Methods 0.000 title claims abstract description 53
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 47
- 238000005457 optimization Methods 0.000 claims abstract description 34
- 238000010586 diagram Methods 0.000 claims abstract description 17
- 238000004891 communication Methods 0.000 claims abstract description 11
- 238000013439 planning Methods 0.000 claims abstract description 11
- 238000012545 processing Methods 0.000 claims abstract description 4
- 230000002068 genetic effect Effects 0.000 claims description 13
- 239000007787 solid Substances 0.000 claims description 9
- 238000013178 mathematical model Methods 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000000354 decomposition reaction Methods 0.000 claims description 4
- 238000011156 evaluation Methods 0.000 claims description 4
- 230000004888 barrier function Effects 0.000 claims description 3
- 230000009191 jumping Effects 0.000 claims description 3
- 230000035772 mutation Effects 0.000 claims description 3
- 238000009966 trimming Methods 0.000 claims description 3
- 238000012800 visualization Methods 0.000 claims description 3
- 230000002153 concerted effect Effects 0.000 abstract 1
- 239000000446 fuel Substances 0.000 description 9
- 239000000295 fuel oil Substances 0.000 description 9
- 230000000694 effects Effects 0.000 description 7
- 238000004519 manufacturing process Methods 0.000 description 4
- 238000012384 transportation and delivery Methods 0.000 description 4
- 238000010276 construction Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 239000002828 fuel tank Substances 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000004904 shortening Methods 0.000 description 2
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 1
- 210000000349 chromosome Anatomy 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002245 particle Substances 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
Landscapes
- Pipeline Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a ship pipeline route optimum design method which comprises the following steps: establishing a pipeline layout space three-dimensional entity model according to the ship structure and the equipment layout parameters; establishing an equipment model free space and generating an STL form file of an equipment model; processing the STL file of the model to obtain the coordinates and vector coordinates of the vertexes of all triangular plates in the file, and determining the layout space range occupied by the equipment; setting pipeline layout space parameters and constructing a layout space mathematic model; analyzing a pipeline system principle diagram, determining the communication relationship among the equipment connection points and establishing a ship equipment communication relation and pipeline diameter information list; carrying out pipeline route planning by utilizing an optimization algorithm; according to the pipeline diameter and the number of the connection points, planning the pipeline route to obtain a preferred resolution by utilizing a pipeline route optimum design method of combining a maze algorithm, an improved non-dominated sorting algorithm and a concerted evolution algorithm; and constructing a ship pipeline system three-dimensional entity model. The ship pipeline route optimum design method has the advantage of effectively improving the design efficiency of the ship pipeline system.
Description
Technical Field
The invention relates to a ship pipeline design method. In particular to a ship pipeline path optimization design method based on pipeline classification aiming at different pipe diameter specifications and considering equipment free space.
Background
The development of modern industrial technology has profoundly affected the design and manufacture of ships and their related industries. The research of the current ship design and construction technology focuses on: the modern ship CAD/CAE technology is researched, developed and applied, meanwhile, the research result in the field of artificial intelligence is combined, on the basis of collecting, summarizing, analyzing, summarizing and summarizing the knowledge of experts in the existing field, an expert system or other intelligent design tools suitable for the ship industry are developed, a mature, standard and digital simulation-based design method is gradually formed, three-dimensional automatic and intelligent design and flexible manufacturing of a ship are achieved as soon as possible, and the design method is popularized to the whole shipyard management situation, which is the development trend of ship design and manufacturing in the present and a long period of time in the future. The ship pipeline integrated design is the centrality work of each link such as ship design, production, acceptance and the like, and plays a significant role in ship construction quality, construction period and comprehensive layout of ship pipelines. However, the layout space range is large, the pipeline system is complex, various constraint conditions need to be considered in the design process, the period for obtaining the satisfactory layout effect is long, the difficulty is high, and rich design experience knowledge of designers is required.
The essence of pipeline path planning is that on the basis of effective description of a design space, a path which is from an initial position to a target position and has no collision with an obstacle is planned by using engineering rules, communication and optimization algorithms. In recent years, the development of modern optimization algorithms promotes the research of pipeline path planning algorithms, and the adopted optimization algorithms mainly comprise genetic algorithms, ant colony algorithms, particle swarm algorithms and the like.
Therefore, an efficient optimization design method for the ship pipeline path is provided, effective reference is provided for designers, and the method has important significance for shortening the design period of the ship pipeline and improving the pipeline design effect.
Disclosure of Invention
The invention aims to solve the technical problem of providing a ship pipeline path optimization design method capable of generating a good pipeline layout result.
The technical scheme adopted by the invention is as follows: a ship pipeline path optimization design method comprises the following steps:
1) establishing a pipeline layout space three-dimensional solid model according to a hull structure and equipment layout parameters;
2) reconstructing an equipment model, simplifying the equipment model, establishing a free space of the equipment model and generating an STL format file of the equipment model;
3) processing the STL file of the model, acquiring coordinates of vertexes of the triangular plates and vector coordinates of the vertexes in the file, and determining a layout space range occupied by each device;
4) setting pipeline layout space parameters and constructing a layout space mathematical model;
5) analyzing a schematic diagram of a pipeline system, determining the interconnection relationship among equipment connection points, and establishing a ship equipment interconnection relationship and a pipe diameter information list by combining grid coordinate values of the connection points;
6) planning a pipeline path by using an optimization algorithm, planning the pipeline path by using a pipeline path optimization design method combining a maze algorithm, an improved non-dominated sorting algorithm and a coevolution algorithm according to the size of the pipe diameter of the pipeline and the number of connecting points to obtain an optimal solution, and updating the setting of space parameters according to output path codes and pipe diameter information;
7) and constructing a three-dimensional entity model of the ship pipeline system according to the environment modeling parameters and the pipeline coding information.
Step 1) is to establish a three-dimensional entity model of a pipeline layout space by using three-dimensional design software.
The step 2) of simplifying the equipment model comprises the following steps:
simplifying the geometric properties of the equipment model; the simplified specific steps are as follows:
(1) constructing an axis parallel bounding box of the equipment model;
(2) dividing the axis parallel bounding boxes by adopting an unequal grid according to the characteristics of equipment;
(3) for each mesh, finding the part of the device contained in or intersecting the current mesh;
(4) enveloping the crossed part in the step (3) by using an axis-parallel bounding box;
(5) trimming the grids by using the axis parallel bounding boxes obtained in the step (4);
(6) and (4) circularly jumping to the step (3) until all the grids are trimmed.
The free space for establishing the equipment model in the step 2) comprises an operable space, a maintainability space, a movement space of a component and a safety space, wherein the operable space and the maintainability space are used for equipment with operation and maintenance requirements in daily use of the equipment; the motion space of the component is used for equipment containing a motion component in daily use of the equipment; the safety space is used for equipment which has a bottom surface and a mounting surface and is not allowed to pass through a pipeline in the daily use of the equipment.
The STL format file for generating the equipment model in the step 2) is used for converting the equipment model into the STL format file by using three-dimensional design software SolidWorks on the basis of simplifying the geometric properties of the equipment model and establishing a corresponding free space of the equipment model, thereby laying a foundation for automatically setting layout space parameters.
The parameters of the pipeline layout space set in the step 4) are that a grid method is utilized to carry out grid division on the pipeline layout space, the uniformly distributed grids are utilized to approximately express the layout space, the division precision is that the side length of a cubic grid is taken as the size of the minimum pipeline diameter, and the default assignment of a grid value is 0; determining the layout space range occupied by each device according to the data obtained after the STL file is processed in the step 3), obtaining the range of the grid space occupied by each device, and setting the grid value occupied by each device to be "#" as a barrier of the pipeline layout space; on the basis of grid division, the grid coordinate values of all equipment connection points are calibrated, the setting of space parameters is completed, and a mathematical model of a pipeline layout space is constructed.
The step 6) specifically comprises the following processes:
(1) dividing the pipeline connecting points into N, wherein N is an integer greater than or equal to 2;
(2) for the connection problem of a two-point pipeline with the number of connection points being 2, the pipeline layout design is carried out by combining MA and NSGA-II: adopting a maze algorithm to carry out an expansion and backtracking process in a pipeline layout space to generate an initial population; on the basis of the initial population, performing non-dominated sorting on population individuals, and performing genetic operations, namely selection operation, cross operation and mutation operation; outputting an optimal solution set of the pipeline path after the optimization by using the genetic algorithm is finished, and performing optimization by using a fuzzy set theory to obtain a final optimal pipeline path code;
(3) for the connection problem of branch pipelines with the number of the connection points larger than 2, the pipeline layout design is carried out by combining MA and CCNSGA-II: the algorithm takes each branch of the branch pipeline as a two-point connecting pipeline, takes each branch as an independent sub-population, respectively uses the genetic algorithm to carry out design solution, and uses the fuzzy set theory to select the optimal individual sharing of each population; combining the individual in one sub-population with the optimal individual of other sub-populations to jointly form a solution of a branch pipeline, and calculating a fitness function value of the solution to serve as an evaluation standard of the individual of the sub-population; in the design solving process, an initial population is generated by using the MA, genetic operations, namely selection operations, cross operations and variation operations, are carried out, and finally, an optimal pipeline path code is output;
(4) sequentially circulating the processes (2) and (3) until the pipelines of all levels are arranged completely, and outputting the optimal pipeline of the current communication point set; different from the problem of connection of two pipelines, the generation of the initial population of the branch pipeline adopts a pipeline decomposition strategy: and (4) taking the key connecting points as starting points and the rest connecting points as end points, and then constructing the initial sub-population by adopting the same method as the two-point connection.
The pipeline level is defined as: the pipeline with the largest pipe diameter in the pipelines with the communication relation is called a first-level pipeline, the highest-level pipeline, a second-level pipeline and the like, and all the pipelines are classified.
The key connection points are: for a primary pipeline containing n connecting points, each connecting point is taken as a starting point, the sum of Euclidean distances between each starting point and other connecting points is calculated in sequence, and the sum is marked as L in sequenceP1、LP2、....…LPnComparing and finding the minimum sum of distancesSum of minimum distancesThe corresponding connection point is the key connection point of the first-stage pipeline; for other grades of pipeline, thenSequentially taking each connection point of the last-level pipeline as a starting point, taking each connection point in the current-level pipeline as an end point, sequentially calculating the sum of the Euclidean distances between each connection point of the first-level pipeline and each connection point in the current-level pipeline, and marking the sum as LR1、LR2、....…LRnComparing to obtain the minimum sum of distancesAndthe corresponding connection point is the key connection point of the current-level pipeline;
wherein,the calculation formula is as follows:
in the formula,to connect with a point PiThe sum of the path lengths at the source point;is a connection point PiAnd PjThe path length between; n is the number of the connection points; wherein, the source point of the secondary pipeline is one of the connection points of the superior pipeline;is calculated byThe calculation formula of (2) is the same.
And 7) constructing a three-dimensional entity model of the pipeline in three-dimensional design software SolidWorks according to the optimized pipeline path code obtained in the step 6), so as to realize visualization of a layout result.
According to the ship pipeline path optimization design method, the concept of pipeline classification is defined, the free space of equipment is considered, the STL file is used for reading data to automatically realize the space parameter setting, the good layout effect is obtained by using the proposed optimization algorithm, the reliable reference is provided for designers, and the design efficiency of a ship pipeline system can be effectively improved. The method has important significance for shortening the design period of the ship pipeline and improving the pipeline design effect.
Drawings
FIG. 1 is a flow chart of a method for optimally designing a pipeline path of a ship according to the invention;
FIG. 2 is a schematic view of a marine engine compartment fuel piping system;
FIG. 3 is a simplified process diagram of an equipment model;
fig. 4 is a schematic diagram of the device free space establishment process.
FIG. 5 is a flow chart of a pipeline path optimization algorithm;
FIG. 6 is a flow chart of the MA-NSGA-II algorithm;
FIG. 7 is a flow chart of the MA-CCNSGA-II algorithm;
fig. 8 is a layout effect diagram of the optimized design of a ship engine room fuel piping system shown in fig. 2 by adopting the method of the invention.
In the figure:
1: first fuel tank 2: second fuel tank
3: the first fuel daily cabinet 4: second fuel daily cabinet
5: first fuel delivery pump 6: second fuel delivery pump
7: steam auxiliary boiler 8: hot water boiler
9: the first host 10: first diesel generator
11: the second diesel generator 12: second host
Detailed Description
The following describes a method for optimally designing a ship pipeline path according to the present invention in detail with reference to embodiments and accompanying drawings.
As shown in fig. 1, the method for optimally designing a ship pipeline path of the present invention includes the following steps:
1) according to the hull structure and the equipment layout parameters, a pipeline layout space three-dimensional solid model is established, namely the three-dimensional solid model of the ship equipment related to the pipeline layout schematic diagram is established by utilizing three-dimensional design software (such as SolidWorks, ProE, AutoCAD and the like).
The related ship equipment is determined according to a pipeline layout schematic diagram, and a mathematical model of the ship equipment is constructed. FIG. 2 is a schematic diagram of a ship engine room fuel oil piping system, and the main structure and equipment related to the ship engine room fuel oil piping system comprise a first fuel oil tank 1, a second fuel oil tank 2, a first fuel oil daily cabinet 3, a second fuel oil daily cabinet 4, a first fuel oil delivery pump 5, a second fuel oil delivery pump 6, a steam auxiliary boiler 7, a hot water boiler 8, a first main engine 9, a second main engine 12, a first diesel generator 10, a second diesel generator 11 and the like, and a three-dimensional model of the ship engine room fuel oil piping system is established by utilizing SolidWorks; and determining the assembly relation of the equipment in the layout space according to the actual installation position relation of the equipment, and primarily constructing a mathematical model of the pipeline layout space.
2) And (5) equipment model reconstruction. The purpose of model reconstruction is to further process the equipment model and to lay the cushion for simplifying the layout space parameter setting and obtaining good layout effect. Simplifying the equipment model, establishing a free space of the equipment model and generating an STL format file of the equipment model; the simplifying the equipment model comprises the following steps:
simplifying the geometric properties of the equipment model; the three-dimensional solid model completely expresses the geometric information of the equipment, but the model is complex and the storage capacity of the geometric information is large, so the three-dimensional solid model is simplified by adopting an improved method of an axis parallel bounding box, and the concrete steps of the simplification are as follows:
(1) constructing an axis parallel bounding box of the equipment model;
(2) dividing the axis parallel bounding boxes by adopting an unequal grid according to the characteristics of equipment;
(3) for each mesh, finding the part of the device contained in or intersecting the current mesh;
(4) enveloping the crossed part in the step (3) by using an axis-parallel bounding box;
(5) trimming the grids by using the axis parallel bounding boxes obtained in the step (4);
(6) and (4) circularly jumping to the step (3) until all the grids are trimmed.
For the problem of pipeline layout, the free space for establishing the equipment model mainly comprises an operable space, a maintainability space, a movement space of components, a safety space and the like in the environment modeling process, wherein the operable space and the maintainability space are used for equipment with operation and maintenance requirements in daily use of the equipment, and certain operable space and maintainability space are reserved for the equipment; the motion space of the part is used for equipment containing the motion part in daily use of the equipment, and the motion space of the part is reserved for the equipment to meet the normal operation of the equipment; the safety space is used for equipment which has a bottom surface and a mounting surface and is not allowed to pass through in daily use of the equipment, such as an oil-fired boiler, and the space between the bottom surface of the boiler and the mounting surface of the boiler is not allowed to pass through, so a certain safety space needs to be reserved.
The STL format file for generating the equipment model is used for converting the equipment model into the STL format file by using three-dimensional design software SolidWorks on the basis of simplifying the geometric properties of the equipment model and establishing the corresponding free space of the equipment model, thereby laying a foundation for automatically setting the layout space parameters.
Fig. 4 is a schematic diagram of the process of establishing the free space of the equipment, first, a three-dimensional solid model of the air tank is established (left diagram), then, the simplified model is obtained by simplifying the air tank by using the equipment simplifying method (middle diagram), and finally, the operating space is properly expanded to obtain a free space model space diagram (right diagram) considering that the air tank valve needs a certain operating space.
3) Processing the STL file of the model, acquiring coordinates of vertexes of the triangular plates and vector coordinates of the vertexes in the file, and determining a layout space range occupied by each device;
the file in STL format is a set of several small space triangular patches, which are obtained by triangular meshing of a three-dimensional solid model; each triangle patch consists of three vertex coordinates (x) of the triangle1,y1,z1) Andit points to the normal vector outside the model n1,n2,n3Is formed by the following steps; and reading the coordinates of the vertexes of the triangular plates and the vector coordinates thereof in the file by using a Matlab compiler to determine the layout space range occupied by each device, namely the range of obstacle setting.
4) Setting pipeline layout space parameters and constructing a layout space mathematical model;
the method comprises the following steps of setting pipeline layout space parameters, namely, carrying out grid division on a pipeline layout space by using a grid method, approximately expressing the layout space by using uniformly distributed grids, and giving a default assignment of a grid value to 0, wherein the division precision is that the side length of a cubic grid is taken as the size of the minimum pipeline diameter; determining the layout space range occupied by each device according to the data obtained after the STL file is processed in the step 3), obtaining the range of the grid space occupied by each device, and setting the grid value occupied by each device to be "#" as a barrier of the pipeline layout space; on the basis of grid division, the grid coordinate values of all equipment connection points are calibrated, the setting of space parameters is completed, and a mathematical model of a pipeline layout space is constructed.
5) Analyzing a schematic diagram of a pipeline system, determining the interconnection relationship among equipment connection points, and establishing a ship equipment interconnection relationship and a pipe diameter information list by combining grid coordinate values of the connection points, wherein the ship equipment interconnection relationship and the pipe diameter information list are used as input of a Matlab optimization algorithm program;
analyzing the piping connection schematic diagram, determining the interconnection relationship among equipment connection points, combining the grid coordinate values of the connection points, and establishing the interconnection relationship and the pipe diameter information list shown in the table 1 according to the fuel piping schematic diagram shown in the figure 2.
TABLE 1 Ship fuel piping system equipment communication relationship List
6) And planning the pipeline path by using an optimization algorithm. The optimization algorithm solution mainly comprises three parts: pipeline path planning, objective function evaluation and space parameter updating, and all parts interact to obtain an optimal path code. Based on the concept of pipeline classification, according to the size of the pipe diameter of the pipeline and the number of connecting points, as shown in fig. 5, a pipeline path optimization design method combining a maze algorithm, an improved non-dominated sorting algorithm and a coevolution algorithm is utilized to plan the pipeline path to obtain an optimal solution, and the setting of space parameters is updated according to the output path codes and pipe diameter information; the method specifically comprises the following steps:
(1) dividing the pipeline connecting points into N, wherein N is an integer greater than or equal to 2;
(2) for the connection problem of the two-point pipeline with the number of connection points of 2, as shown in fig. 6, the pipeline layout design is performed by using a combination of MA and NSGA-ii: the labyrinth algorithm is adopted in the pipeline layout space for carrying out the expansion and backtracking processes to generate an initial population, thereby effectively avoiding the generation of repeated pipeline sections and overcoming the defect of low searching efficiency of the labyrinth algorithm to a certain extent; on the basis of the initial population, performing non-dominated sorting on population individuals, and performing genetic operations, namely selection operation, cross operation and mutation operation; after optimization by using a genetic algorithm is finished, performing optimization design by using an NSGA-II algorithm to obtain an optimal solution set, outputting the optimal solution set of the pipeline path, performing optimization by using a fuzzy set theory, reasonably selecting and recording the optimal solution of the pipeline at the current level, and obtaining a final optimal pipeline path code which is used as a reference standard for secondary pipeline optimization design;
(3) for the connection problem of the branch pipeline with the number of the connection points larger than 2, as shown in fig. 7, the pipeline layout design is performed by using a combination of MA and CCNSGA-ii: the cooperative coevolution algorithm strategy introduced by the algorithm is to properly decompose the optimization problem, respectively optimize each subproblem and coordinate the solving process of each subproblem so as to achieve the aim of solving the whole problem. The algorithm takes each branch of the branch pipeline as a two-point connecting pipeline, takes each branch as an independent sub-population, respectively uses the genetic algorithm to carry out design solution, and uses the fuzzy set theory to select the optimal individual sharing of each population; combining the individual in one sub-population with the optimal individual of other sub-populations to jointly form a solution of a branch pipeline, and calculating a fitness function value of the solution to serve as an evaluation standard of the individual of the sub-population; in the design solving process, an initial population is generated by using the MA, genetic operations, namely selection operations, cross operations and variation operations, are carried out, and finally, an optimal pipeline path code is output;
for the layout of the ship pipeline, chromosome sets of all branch pipelines in the branch pipelines can be used as an independent population, optimization solution is carried out by using an MA-NSGA-II algorithm respectively, optimal individuals of all sub-populations are selected to share, and a branch pipeline problem solution is formed together to calculate a fitness function value to serve as a judgment standard of a current individual. And (4) repeatedly carrying out evolution and coordination of each population until the evolution is stopped, and finding out the optimal solution of the optimization problem by combining a fuzzy set theory. And the layout algorithm is sequentially carried out until the pipelines of all levels are completely arranged, and the optimal pipeline of the current communication point set is output. Different from the problem of connection of two pipelines, the generation of the initial population of the branch pipeline adopts a pipeline decomposition strategy: and (4) taking the key connecting points as starting points and the rest connecting points as end points, and then constructing the initial sub-population by adopting the same method as the two-point connection.
(4) Sequentially circulating the processes (2) and (3) until the pipelines of all levels are arranged completely, and outputting the optimal pipeline of the current communication point set; different from the problem of connection of two pipelines, the generation of the initial population of the branch pipeline adopts a pipeline decomposition strategy: and (4) taking the key connecting points as starting points and the rest connecting points as end points, and then constructing the initial sub-population by adopting the same method as the two-point connection.
In the above process:
the pipeline level is defined as: the pipeline with the largest pipe diameter in the pipelines with the communication relation is called a first-level pipeline, the highest-level pipeline, a second-level pipeline and the like, and all the pipelines are classified.
The key connection points are: for a primary pipeline containing n connecting points, each connecting point is taken as a starting point, the sum of Euclidean distances between each starting point and other connecting points is calculated in sequence, and the sum is marked as L in sequenceP1、LP2、....…LPnComparing and finding the minimum sum of distancesSum of minimum distancesThe corresponding connection point is the key connection point of the first-stage pipeline; for the pipelines of other levels, sequentially taking each connection point of the previous level of other pipelines as a starting point, taking each connection point in the current level of pipelines as an end point, sequentially calculating the sum of the Euclidean distance between each connection point of the previous level of pipelines and each connection point in the current level of pipelines, and marking the sum as LR1、LR2、....…LRnComparing to obtain the minimum sum of distancesAndthe corresponding connection point is the key connection point of the current-level pipeline;
wherein,the calculation formula is as follows:
in the formula,to connect with a point PiThe sum of the path lengths at the source point;is a connection point PiAnd PjThe path length between; n is the number of the connection points; wherein, the source point of the secondary pipeline is one of the connection points of the superior pipeline;is calculated byThe calculation formula of (A) is the same, namely:
in the process of carrying out optimization solution on the pipeline path, the pipeline generated before should be treated as an obstacle of the pipeline layout space. After the pipeline path planning is carried out by using an optimization algorithm, an optimized feasible pipeline path coding list is output, the grid range occupied by the pipeline is determined according to the pipe diameter information of the pipeline, the grid range is marked as "#", and the space parameter setting is updated.
7) And (3) constructing a three-dimensional entity model of the ship pipeline system according to the environment modeling parameters and the pipeline coding information, constructing the three-dimensional entity model of the pipeline in the three-dimensional design software SolidWorks according to the optimized pipeline path code obtained in the step 6), and realizing the visualization of the layout result.
The final pipeline layout effect of the ship engine room fuel piping system is schematically shown in fig. 8.
Although the preferred embodiments of the present invention have been described above with reference to the accompanying drawings, the present invention is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and those skilled in the art can make many modifications without departing from the spirit and scope of the present invention as defined in the appended claims.
Claims (10)
1. A ship pipeline path optimization design method is characterized by comprising the following steps:
1) establishing a pipeline layout space three-dimensional solid model according to a hull structure and equipment layout parameters;
2) reconstructing an equipment model, simplifying the equipment model, establishing a free space of the equipment model and generating an STL format file of the equipment model;
3) processing the STL file of the model, acquiring coordinates of vertexes of the triangular plates and vector coordinates of the vertexes in the file, and determining a layout space range occupied by each device;
4) setting pipeline layout space parameters and constructing a layout space mathematical model;
5) analyzing a schematic diagram of a pipeline system, determining the interconnection relationship among equipment connection points, and establishing a ship equipment interconnection relationship and a pipe diameter information list by combining grid coordinate values of the connection points;
6) planning a pipeline path by using an optimization algorithm, planning the pipeline path by using a pipeline path optimization design method combining a maze algorithm, an improved non-dominated sorting algorithm and a coevolution algorithm according to the size of the pipe diameter of the pipeline and the number of connecting points to obtain an optimal solution, and updating the setting of space parameters according to output path codes and pipe diameter information;
7) and constructing a three-dimensional entity model of the ship pipeline system according to the environment modeling parameters and the pipeline coding information.
2. The optimal design method for the ship pipeline path according to claim 1, wherein step 1) is to establish a three-dimensional solid model of a pipeline layout space by using three-dimensional design software.
3. The method for optimally designing the pipeline path of the ship as claimed in claim 1, wherein the step 2) of simplifying the equipment model comprises the following steps:
simplifying the geometric properties of the equipment model; the simplified specific steps are as follows:
(1) constructing an axis parallel bounding box of the equipment model;
(2) dividing the axis parallel bounding boxes by adopting an unequal grid according to the characteristics of equipment;
(3) for each mesh, finding the part of the device contained in or intersecting the current mesh;
(4) enveloping the crossed part in the step (3) by using an axis-parallel bounding box;
(5) trimming the grids by using the axis parallel bounding boxes obtained in the step (4);
(6) and (4) circularly jumping to the step (3) until all the grids are trimmed.
4. The optimal design method for the pipeline path of the ship according to claim 1, wherein the free space for establishing the equipment model in the step 2) comprises an operable space, a maintainability space, a movement space of components and a safety space, wherein the operable space and the maintainability space are used for equipment which needs to be operated and maintained in daily use of the equipment; the motion space of the component is used for equipment containing a motion component in daily use of the equipment; the safety space is used for equipment which has a bottom surface and a mounting surface and is not allowed to pass through a pipeline in the daily use of the equipment.
5. The optimal design method for the ship pipeline path according to claim 1, wherein the STL format file for generating the equipment model in the step 2) is used for converting the equipment model into the STL format file by using three-dimensional design software SolidWorks on the basis of geometric property simplification of the equipment model and establishment of a free space corresponding to the equipment model, and lays a foundation for automatic setting of layout space parameters.
6. The optimal design method for the pipeline path of the ship according to claim 1, wherein the parameters for setting the pipeline layout space in the step 4) are that a grid method is used for carrying out grid division on the pipeline layout space, the uniformly distributed grids are used for approximately expressing the layout space, the division precision is that the side length of a cubic grid is taken as the size of the minimum pipeline diameter, and the default assignment value of a grid value is 0; determining the layout space range occupied by each device according to the data obtained after the STL file is processed in the step 3), obtaining the range of the grid space occupied by each device, and setting the grid value occupied by each device to be "#" as a barrier of the pipeline layout space; on the basis of grid division, the grid coordinate values of all equipment connection points are calibrated, the setting of space parameters is completed, and a mathematical model of a pipeline layout space is constructed.
7. The optimal design method for the ship pipeline path according to claim 1, wherein the step 6) specifically comprises the following steps:
(1) dividing the pipeline connecting points into N, wherein N is an integer greater than or equal to 2;
(2) for the connection problem of a two-point pipeline with the number of connection points being 2, the pipeline layout design is carried out by combining MA and NSGA-II: adopting a maze algorithm to carry out an expansion and backtracking process in a pipeline layout space to generate an initial population; on the basis of the initial population, performing non-dominated sorting on population individuals, and performing genetic operations, namely selection operation, cross operation and mutation operation; outputting an optimal solution set of the pipeline path after the optimization by using the genetic algorithm is finished, and performing optimization by using a fuzzy set theory to obtain a final optimal pipeline path code;
(3) for the connection problem of branch pipelines with the number of the connection points larger than 2, the pipeline layout design is carried out by combining MA and CCNSGA-II: the algorithm takes each branch of the branch pipeline as a two-point connecting pipeline, takes each branch as an independent sub-population, respectively uses the genetic algorithm to carry out design solution, and uses the fuzzy set theory to select the optimal individual sharing of each population; combining the individual in one sub-population with the optimal individual of other sub-populations to jointly form a solution of a branch pipeline, and calculating a fitness function value of the solution to serve as an evaluation standard of the individual of the sub-population; in the design solving process, an initial population is generated by using the MA, genetic operations, namely selection operations, cross operations and variation operations, are carried out, and finally, an optimal pipeline path code is output;
(4) sequentially circulating the processes (2) and (3) until the pipelines of all levels are arranged completely, and outputting the optimal pipeline of the current communication point set; different from the problem of connection of two pipelines, the generation of the initial population of the branch pipeline adopts a pipeline decomposition strategy: and (4) taking the key connecting points as starting points and the rest connecting points as end points, and then constructing the initial sub-population by adopting the same method as the two-point connection.
8. The method of claim 7, wherein the pipeline level is defined as: the pipeline with the largest pipe diameter in the pipelines with the communication relation is called a first-level pipeline, the highest-level pipeline, a second-level pipeline and the like, and all the pipelines are classified.
9. The method according to claim 7, wherein the key connection points are: for a primary pipeline containing n connecting points, each connecting point is taken as a starting point, the sum of Euclidean distances between each starting point and other connecting points is calculated in sequence, and the sum is marked as L in sequenceP1、LP2、....…LPnComparing and finding the minimum sum of distancesSum of minimum distancesThe corresponding connection point is the key connection point of the first-stage pipeline; for the pipelines of other levels, sequentially taking each connection point of the previous level of other pipelines as a starting point, taking each connection point in the current level of pipelines as an end point, sequentially calculating the sum of the Euclidean distance between each connection point of the previous level of pipelines and each connection point in the current level of pipelines, and marking the sum as LR1、LR2、....…LRnComparing to obtain the minimum sum of distancesAndthe corresponding connection point is the key connection point of the current-level pipeline;
wherein,the calculation formula is as follows:
in the formula,to connect with a point PiThe sum of the path lengths at the source point;is a connection point PiAnd PjThe path length between; n is the number of the connection points; wherein, the source point of the secondary pipeline is one of the connection points of the superior pipeline;is calculated byThe calculation formula of (2) is the same.
10. The optimal design method for the pipeline path of the ship according to claim 1, wherein in the step 7), a three-dimensional entity model of the pipeline is constructed in three-dimensional design software SolidWorks according to the optimal pipeline path code obtained in the step 6), so that the visualization of the layout result is realized.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510102146.1A CN104699899B (en) | 2015-03-09 | 2015-03-09 | A kind of ship pipeline path optimization design method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510102146.1A CN104699899B (en) | 2015-03-09 | 2015-03-09 | A kind of ship pipeline path optimization design method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104699899A true CN104699899A (en) | 2015-06-10 |
| CN104699899B CN104699899B (en) | 2018-02-09 |
Family
ID=53347015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510102146.1A Active CN104699899B (en) | 2015-03-09 | 2015-03-09 | A kind of ship pipeline path optimization design method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104699899B (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104881560A (en) * | 2015-06-26 | 2015-09-02 | 天津大学 | Simulated model establishing method for ship pipeline layout environment |
| CN105005823A (en) * | 2015-06-26 | 2015-10-28 | 天津大学 | Ship branch pipeline path planning method based on genetic algorithm |
| CN105224722A (en) * | 2015-09-08 | 2016-01-06 | 北京航空航天大学 | A kind of quick Meshing Method of hexagon integrated form many openings ship superstructure |
| CN105320808A (en) * | 2015-09-23 | 2016-02-10 | 辽宁石油化工大学 | NSGA based pipeline multi-target layout optimization method |
| CN105975674A (en) * | 2016-04-29 | 2016-09-28 | 天津大学 | Ship branch pipeline path planning method |
| CN106295081A (en) * | 2016-09-18 | 2017-01-04 | 张选琪 | Flexible manufacturing system Simulation on Decision system |
| CN106980317A (en) * | 2017-03-31 | 2017-07-25 | 大鹏高科（武汉）智能装备有限公司 | A kind of obstacle avoidance method and system under water |
| CN107423360A (en) * | 2017-06-19 | 2017-12-01 | 广东中冶地理信息股份有限公司 | A kind of labyrinth method for solving based on path center line |
| CN109325281A (en) * | 2018-09-13 | 2019-02-12 | 中国船舶重工集团公司第七〇九研究所 | A kind of naval vessel pipeline three-dimensional design method and device |
| CN109902317A (en) * | 2017-12-07 | 2019-06-18 | 江南造船(集团)有限责任公司 | Generation method, system, storage medium and the electronic equipment of three dimensional design delivery object |
| CN110442940A (en) * | 2019-07-25 | 2019-11-12 | 天津大学青岛海洋技术研究院 | A kind of parallel intelligent Layout Design method of efficient ship multi-pipeline |
| CN110688711A (en) * | 2019-09-30 | 2020-01-14 | 哈尔滨工程大学 | Ship engine room pipeline optimization method based on genetic algorithm |
| CN111666637A (en) * | 2020-06-29 | 2020-09-15 | 江苏科技大学 | Knowledge-based ship pipeline layout optimization design method |
| CN111968226A (en) * | 2020-08-18 | 2020-11-20 | 江南造船(集团)有限责任公司 | Ship pipe processing jacking marking calculation method, system and terminal |
| CN112102476A (en) * | 2020-09-11 | 2020-12-18 | 中国核电工程有限公司 | Automatic arrangement method and system for nuclear power plant pipeline |
| CN112364450A (en) * | 2020-10-28 | 2021-02-12 | 东北大学 | Multi-pipeline layout optimization method and system for aircraft engine |
| CN112507448A (en) * | 2020-11-24 | 2021-03-16 | 上海交通大学 | Method for planning path arrangement of heating coil of ship |
| CN112509132A (en) * | 2020-12-01 | 2021-03-16 | 中国舰船研究设计中心 | Ship application-oriented three-dimensional path calculation method |
| CN113673041A (en) * | 2021-09-06 | 2021-11-19 | 江南造船(集团)有限责任公司 | Marine cabin ventilation pipeline arrangement method, system, medium and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6298471B1 (en) * | 1999-08-20 | 2001-10-02 | Hewlett-Packard Company | Interconnect minimization in processor design |
| WO2010066711A1 (en) * | 2008-12-08 | 2010-06-17 | European Aeronautic Defence And Space Company Eads France | Method for optimising the routing of pipes on a structure with small deformations |
| CN102446236A (en) * | 2010-10-13 | 2012-05-09 | 中国石油大学(华东) | Automatically optimized piping arrangement method based on improved genetic algorithm |
| CN103699746A (en) * | 2013-12-26 | 2014-04-02 | 武昌船舶重工有限责任公司 | CADDS5 piping three-dimensional design method and system based on database |
-
2015
- 2015-03-09 CN CN201510102146.1A patent/CN104699899B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6298471B1 (en) * | 1999-08-20 | 2001-10-02 | Hewlett-Packard Company | Interconnect minimization in processor design |
| WO2010066711A1 (en) * | 2008-12-08 | 2010-06-17 | European Aeronautic Defence And Space Company Eads France | Method for optimising the routing of pipes on a structure with small deformations |
| CN102446236A (en) * | 2010-10-13 | 2012-05-09 | 中国石油大学(华东) | Automatically optimized piping arrangement method based on improved genetic algorithm |
| CN103699746A (en) * | 2013-12-26 | 2014-04-02 | 武昌船舶重工有限责任公司 | CADDS5 piping three-dimensional design method and system based on database |
Non-Patent Citations (6)
| Title |
|---|
| ANDI ASMARA等: "Approximate Orthogonal Simplification of 3D Model", 《EVOLUTIONARY COMPUTATION(CEC),2010 IEEE CONGRESS ON》 * |
| SUNAND SANDURKAR等: "GAPRUS-GENETIC ALGORITHMS BASED PIPE ROUTING USING TESSELLATED OBJECTS", 《COMPUTERS IN INDUSTRY》 * |
| 刘建波等: "超大型船舶管路优化设计", 《造船技术》 * |
| 李光: "液压集成块集成化智能化设计理论与方法", 《中国博士学位论文全文数据库 工程科技Ⅱ辑》 * |
| 范小宁: "《管路布局优化方法及应用》", 30 April 2013 * |
| 邬君等: "基于协同进化的舰船分支管路系统路径优化研究", 《航海工程》 * |
Cited By (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105005823A (en) * | 2015-06-26 | 2015-10-28 | 天津大学 | Ship branch pipeline path planning method based on genetic algorithm |
| CN104881560B (en) * | 2015-06-26 | 2017-11-03 | 天津大学 | A kind of simulation of ship pipe-line layout environmental modeling method |
| CN105005823B (en) * | 2015-06-26 | 2018-07-20 | 天津大学 | A kind of ship branch line paths planning method based on genetic algorithm |
| CN104881560A (en) * | 2015-06-26 | 2015-09-02 | 天津大学 | Simulated model establishing method for ship pipeline layout environment |
| CN105224722A (en) * | 2015-09-08 | 2016-01-06 | 北京航空航天大学 | A kind of quick Meshing Method of hexagon integrated form many openings ship superstructure |
| CN105320808A (en) * | 2015-09-23 | 2016-02-10 | 辽宁石油化工大学 | NSGA based pipeline multi-target layout optimization method |
| CN105320808B (en) * | 2015-09-23 | 2018-07-17 | 辽宁石油化工大学 | Pipeline multiple target layout optimization method based on NSGA algorithms |
| CN105975674B (en) * | 2016-04-29 | 2019-11-05 | 天津大学 | A kind of ship branch line paths planning method |
| CN105975674A (en) * | 2016-04-29 | 2016-09-28 | 天津大学 | Ship branch pipeline path planning method |
| CN106295081A (en) * | 2016-09-18 | 2017-01-04 | 张选琪 | Flexible manufacturing system Simulation on Decision system |
| CN106980317A (en) * | 2017-03-31 | 2017-07-25 | 大鹏高科（武汉）智能装备有限公司 | A kind of obstacle avoidance method and system under water |
| CN106980317B (en) * | 2017-03-31 | 2019-11-22 | 大鹏高科（武汉）智能装备有限公司 | A kind of underwater obstacle avoidance method and system |
| CN107423360A (en) * | 2017-06-19 | 2017-12-01 | 广东中冶地理信息股份有限公司 | A kind of labyrinth method for solving based on path center line |
| CN109902317A (en) * | 2017-12-07 | 2019-06-18 | 江南造船(集团)有限责任公司 | Generation method, system, storage medium and the electronic equipment of three dimensional design delivery object |
| CN109902317B (en) * | 2017-12-07 | 2023-09-15 | 江南造船(集团)有限责任公司 | Three-dimensional design delivery object generation method, system, storage medium and electronic equipment |
| CN109325281A (en) * | 2018-09-13 | 2019-02-12 | 中国船舶重工集团公司第七〇九研究所 | A kind of naval vessel pipeline three-dimensional design method and device |
| CN110442940A (en) * | 2019-07-25 | 2019-11-12 | 天津大学青岛海洋技术研究院 | A kind of parallel intelligent Layout Design method of efficient ship multi-pipeline |
| CN110688711A (en) * | 2019-09-30 | 2020-01-14 | 哈尔滨工程大学 | Ship engine room pipeline optimization method based on genetic algorithm |
| CN111666637A (en) * | 2020-06-29 | 2020-09-15 | 江苏科技大学 | Knowledge-based ship pipeline layout optimization design method |
| CN111968226A (en) * | 2020-08-18 | 2020-11-20 | 江南造船(集团)有限责任公司 | Ship pipe processing jacking marking calculation method, system and terminal |
| CN112102476A (en) * | 2020-09-11 | 2020-12-18 | 中国核电工程有限公司 | Automatic arrangement method and system for nuclear power plant pipeline |
| CN112102476B (en) * | 2020-09-11 | 2024-08-16 | 中国核电工程有限公司 | Automatic arrangement method and system for nuclear power plant pipelines |
| CN112364450A (en) * | 2020-10-28 | 2021-02-12 | 东北大学 | Multi-pipeline layout optimization method and system for aircraft engine |
| CN112364450B (en) * | 2020-10-28 | 2023-11-03 | 东北大学 | Multi-pipeline layout optimization method and system for aero-engine |
| CN112507448A (en) * | 2020-11-24 | 2021-03-16 | 上海交通大学 | Method for planning path arrangement of heating coil of ship |
| CN112509132A (en) * | 2020-12-01 | 2021-03-16 | 中国舰船研究设计中心 | Ship application-oriented three-dimensional path calculation method |
| CN112509132B (en) * | 2020-12-01 | 2022-10-11 | 中国舰船研究设计中心 | Ship application-oriented three-dimensional path calculation method |
| CN113673041A (en) * | 2021-09-06 | 2021-11-19 | 江南造船(集团)有限责任公司 | Marine cabin ventilation pipeline arrangement method, system, medium and device |
| CN113673041B (en) * | 2021-09-06 | 2024-06-11 | 江南造船(集团)有限责任公司 | Marine cabin ventilation pipeline arrangement method, system, medium and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104699899B (en) | 2018-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104699899B (en) | A kind of ship pipeline path optimization design method | |
| Niu et al. | Ship Pipe Routing Design Using NSGA‐II and Coevolutionary Algorithm | |
| Tezer et al. | Evaluation of approaches used for optimization of stand-alone hybrid renewable energy systems | |
| CN100468418C (en) | Method and program for generating volume data from boundary representation data | |
| CN105005823B (en) | A kind of ship branch line paths planning method based on genetic algorithm | |
| CN111666637A (en) | Knowledge-based ship pipeline layout optimization design method | |
| Tapia et al. | Optimized micro-hydro power plants layout design using messy genetic algorithms | |
| CN102446236A (en) | Automatically optimized piping arrangement method based on improved genetic algorithm | |
| CN110442940A (en) | A kind of parallel intelligent Layout Design method of efficient ship multi-pipeline | |
| CN110826122B (en) | Voxel method and system for nuclear power three-dimensional layout design model | |
| Kimura | Automatic designing system for piping and instruments arrangement including branches of pipes | |
| Yongxing et al. | Optimization approach for a catamaran hull using CAESES and STAR-CCM+ | |
| CN109193756A (en) | A kind of scene decoupling dynamic economic dispatch model solution method of wind power integration system | |
| Zhou et al. | Research based on lee algorithm and genetic algorithm of the automatic external pipe routing of the aircraft engine | |
| Wu et al. | A synchronization methodology for 3D offshore wind farm layout optimization with multi-type wind turbines and obstacle-avoiding cable network | |
| KR101722393B1 (en) | Method of selecting position for offshore substation in the wind power plant and method of designing for power grid design in the wind power plant | |
| KR20140049132A (en) | 3d cad simplification method of equipment and materials of ship outfitting and offshore plants | |
| Haasenritter et al. | Optimization of the rib structure inside a 2D cooling channel | |
| Li et al. | Key technology of artificial intelligence in hull form intelligent optimization | |
| CN115048797A (en) | Optimization strategy generation method, device and medium for passive waste heat removal system | |
| CN113673042A (en) | Ship noise reduction system design method, system, medium and terminal based on acoustic environment simulation | |
| Zhang et al. | Research and application of intelligent layout design algorithm for 3d pipeline of nuclear power plant | |
| CN112613209A (en) | Full hexahedron unit encryption method based on finite element model | |
| Ang et al. | Evolutionary Computation Automated Design of Ship Hull Forms for the Industry 4.0 Era | |
| Li | HYBRID OPTIMIZATION ALGORITHM FOR CABLE DESIGN OF ELECTROMECHANICAL PRODUCTS BASED ON A* AND GENETIC ALGORITHM |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 300350 District, Jinnan District, Tianjin Haihe Education Park, 135 beautiful road, Beiyang campus of Tianjin University Applicant after: Tianjin University Address before: 300072 Tianjin City, Nankai District Wei Jin Road No. 92 Applicant before: Tianjin University |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |