2016
DOI: 10.1016/j.isatra.2016.03.008
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective global optimization of a butterfly valve using genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
12
0
1

Year Published

2017
2017
2020
2020

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(16 citation statements)
references
References 13 publications
1
12
0
1
Order By: Relevance
“…This disc has a vertical axis of rotation whereby the closing of the valve produces a change in the fluid flow direction by diverting velocity profiles towards paths perpendicular to this axis of rotation. When the valve is completely open, it reduces the section of water way, increasing the average water velocity in the pipe [34]. This behaviour may be confirmed in other studies that used CFD techniques to simulate distortion water flow with butterfly valves with different degrees of closure [35,36].…”
Section: Computational Fluid Simulationsupporting
confidence: 66%
“…This disc has a vertical axis of rotation whereby the closing of the valve produces a change in the fluid flow direction by diverting velocity profiles towards paths perpendicular to this axis of rotation. When the valve is completely open, it reduces the section of water way, increasing the average water velocity in the pipe [34]. This behaviour may be confirmed in other studies that used CFD techniques to simulate distortion water flow with butterfly valves with different degrees of closure [35,36].…”
Section: Computational Fluid Simulationsupporting
confidence: 66%
“…However, no mathematical modeling is given to the problem. In [9], authors suggest a multiobjective approach relying on Pareto dominance genetic algorithms to resolve the problem of designing butterfly valve. However, the proposed approach is based on a simple standard genetic algorithm.…”
Section: Related Work On the 2d-3d Deployment Problem Using Optimizamentioning
confidence: 99%
“…-The execution time of acMaMaPSO is high compared to other algorithms: in acMaMaPSO, we lose more execution time than acMaPSO but we gain the performance and the quality of the solution (although acMaPSO behavior is not so far from acMaMaPSO: see Figs. [6][7][8][9]. This runtime cost of acMaMaPSO is due to the time allocated to the communication between agents.…”
Section: Computational Complexity and Runtime Analysismentioning
confidence: 99%
“…The population size of 110 is considered with a maximum generation number of 100. For complicated search space, the typical values for crossover probability are in the range of 0.6-0.95 and the mutation rate conventionally takes values in the range of 0.005-0.01 (33)(34)(35). Hence, the crossover probability and mutation rate are considered 0.7 and 0.01, respectively.…”
Section: Algorithmmentioning
confidence: 99%