2016
DOI: 10.1007/s11465-016-0384-z
|View full text |Cite
|
Sign up to set email alerts
|

Branch-pipe-routing approach for ships using improved genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
21
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 48 publications
(21 citation statements)
references
References 14 publications
0
21
0
Order By: Relevance
“…As shown in Figures 17-19, the individuals of each subpipe grade in the design example converge to the some appropriate route after around 60th generation. The same branch pipeline example executed by a modified geneticalgorithm-based approach proposed in literature [40] shows that the individuals converge to near-optimal solution after 21 generations. According to the simulation test result, the convergence speed of the proposed method is relatively slow compared with that of literature [40].…”
Section: Optimal Solution Set Of the Branch Pipelinementioning
confidence: 87%
See 2 more Smart Citations
“…As shown in Figures 17-19, the individuals of each subpipe grade in the design example converge to the some appropriate route after around 60th generation. The same branch pipeline example executed by a modified geneticalgorithm-based approach proposed in literature [40] shows that the individuals converge to near-optimal solution after 21 generations. According to the simulation test result, the convergence speed of the proposed method is relatively slow compared with that of literature [40].…”
Section: Optimal Solution Set Of the Branch Pipelinementioning
confidence: 87%
“…The same branch pipeline example executed by a modified geneticalgorithm-based approach proposed in literature [40] shows that the individuals converge to near-optimal solution after 21 generations. According to the simulation test result, the convergence speed of the proposed method is relatively slow compared with that of literature [40]. For the best compromise solution obtained by the proposed method, the total length is 197 and the number of bends is 8 (2 Tjunctions included), which is same with the near-optimal solution obtained by the literature [40].…”
Section: Optimal Solution Set Of the Branch Pipelinementioning
confidence: 87%
See 1 more Smart Citation
“…Projection and geodesic-based pipe routing algorithms have also been considered [13]. Genetic algorithms are commonly applied since they are most useful when the objective has several local minimums where deterministic methods could easily be stuck in [14][15][16][17][18]. Genetic algorithms are more effective to find the globally best solutions.…”
Section: Introductionmentioning
confidence: 99%
“…The technology of manufacturing and installation of the fit pipe includes actual measurements between two rigidly fixed connections and fitting work on the installation of welded joints [9][10][11][12][13][14][15]. Increasing a technological level of pipeline routes in ship systems is limited by the fact that during the installation, actual design dimensions and configuration of the fit pipes are not allowed to be changed.…”
Section: Introductionmentioning
confidence: 99%