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

Comparison of particle swarm optimization and simulated annealing for locating additional boreholes considering combined variance minimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 29 publications
(7 citation statements)
references
References 39 publications
0
7
0
Order By: Relevance
“…It has been extensively used in the last years, particularly in the field of geosciences (e.g. Berné and Baselga, 2004;Santé-Riveira et al, 2008;Baselga, 2011;Sharma, 2012;Chimi-Chiadjeu et al, 2013;and Soltani-Mohammadi et al, 2016).…”
Section: Optimization Methodsmentioning
confidence: 99%
“…It has been extensively used in the last years, particularly in the field of geosciences (e.g. Berné and Baselga, 2004;Santé-Riveira et al, 2008;Baselga, 2011;Sharma, 2012;Chimi-Chiadjeu et al, 2013;and Soltani-Mohammadi et al, 2016).…”
Section: Optimization Methodsmentioning
confidence: 99%
“…In this paper, we use a distance-based generalized sensitivity analysis (DGSA) method (Fenwick et al, 2014;Park et al, 2016) to perform sensitivity analysis. Compared to the other global sensitivity analyses, such as variance-based methods (e.g., Sobol, 2001Sobol, , 1993, regionalized methods (e.g., Pappenberger et al, 2008;Spear and Hornberger, 1980), or treebased method (e.g., Wei et al, 2015), DGSA has its specific advantages for high-dimensional problems while requiring no functional form between model responses and model parameters. It can efficiently compute global sensitivity, which makes it preferred for our geological UQ problem where the models are large and computationally intensive.…”
Section: Reviewmentioning
confidence: 99%
“…All of them perform well in seeking the optimised solution, but SA and GA generally cost more computation times, especially for the cases with the complicated objective function. On the contrary, the PSO algorithm is faster in convergence and more convenient in digital implementation [32,33,34].…”
Section: Introductionmentioning
confidence: 99%