Production optimization is an effective technique to maximize the oil recovery or the net present value in reservoir development. Recently, the stochastic simplex approximation gradient (StoSAG) optimization algorithm...
详细信息
Production optimization is an effective technique to maximize the oil recovery or the net present value in reservoir development. Recently, the stochastic simplex approximation gradient (StoSAG) optimization algorithm draws significant attention in the optimization algorithm family. It shows high searching quality in largescale engineering problems. However, its optimization performance and features are not fully understood. This study evaluated and analyzed the influence of some key parameters related to the optimization process of StoSAG including the ensemble size to estimate the approximation gradient, the step size, the cut number, the perturbation size, and the initial position by using 47 mathematical benchmark functions. Statistical analysis was employed to diminish the randomness of the algorithm. The quality of the optimization results, the convergence, and the computational time consuming were analyzed and compared. The parameter selection strategy was presented. The results showed that a larger ensemble size was not always favorable to obtain better optimization results. The increase of the search step size was favorable to escape from the local optimum. A large step size needed to match a large cut number. The increase of cut number was beneficial to increase the local searchability, but also made the algorithm more easily fall into the local optimum. The random initial position was beneficial to find the global optimal point. Moreover, the effectiveness of the parameter selection strategy was tested by a classical reservoir production optimization example. The final net present value (NPV) for water flooding reservoir production optimization substantially increased, which indicated the excellent performance of StoSAG by adjusting the key parameters.
An adaptive model is proposed to describe time-varying seasonal effects. The seasonal average function is constructed using an iterative algorithm that provides a neat decomposition of the signal into a generalized tr...
详细信息
An adaptive model is proposed to describe time-varying seasonal effects. The seasonal average function is constructed using an iterative algorithm that provides a neat decomposition of the signal into a generalized trend, seasonal and residual components. By a trend, we mean long-term evolutionary changes in the average signal level, both unidirectional and chaotic, in the form of a slow random drift. This algorithm allows one to obtain unbiased estimates for each of the signal components, even in the presence of a significant number of missing observations. The series length is not required to be a multiple of an integer number of years. In contrast to the usual "Climate Normals" (CN) model, the considered adaptive model of seasonal effects assumes a continuous slow change in the properties of the seasonal component over time. The degree of allowable variability in seasonal effects from year to year is entered as a tunable parameter of the model. In particular, this allows one to show the dynamics of the growth of the amplitude of seasonal fluctuations in time in the form of a continuous (smooth) function without necessarily linking these changes to predetermined calendar epochs. The algorithm was tested on the atmospheric CO2 concentration monitoring series at Barrow, Mauna Loa, Tutuila, and South Pole stations located at different latitudes. The form of the seasonal variation was estimated, and the average amplitude of the seasonal variation and the rate of its change at each station were calculated. Noticeable differences in the dynamics of the studied parameters between stations are demonstrated. Mean amplitude of seasonal variation in CO2 concentration at Barrow, Mauna Loa, Tutuila, and South Pole stations in the epoch 2010-2019 was estimated as 18.15, 7.08, 1.30, and 1.26 ppm, respectively, and the average rate of increase in the amplitude of the seasonal variation in the increase in CO2 concentration in the interval 1976-2019 is 0.085, 0.0100, 0.0165, and 0.
An iterative algorithm for the decomposition of data series into trend and residual (including the seasonal effect) components is proposed. This algorithm is based on the approaches proposed by the authors in several ...
详细信息
An iterative algorithm for the decomposition of data series into trend and residual (including the seasonal effect) components is proposed. This algorithm is based on the approaches proposed by the authors in several previous studies and allows unbiased estimates for the trend and seasonal components for data with a strong trend containing different periodic (including seasonal) variations, as well as observational gaps and omissions. The main idea of the algorithm is that both the trend and the seasonal components should be estimated using a signal that is maximally cleaned of any other variations, which are considered a noise. In estimating the trend component, seasonal variation is a noise, and vice versa. The iterative approach allows a priori information to be more completely used in the optimization of models of both trend and seasonal components. The approximation procedure provides maximum flexibility and is fully controllable at all stages of the process. In addition, it allows one to naturally solve the problems in the case of missing observations and defective measurements without filling these dates with artificially simulated values. The algorithm was tested using data on changes in the concentration of CO2 in the atmosphere at four stations belonging to different latitudinal zones. The choice of these data is explained by the features that complicate the use of other methods, namely, high interannual variability, high-amplitude seasonal variations, and gaps in the series of observed data. This algorithm made it possible to obtain trend estimates (which are of particular importance for studying the characteristics and searching for the causes of global warming) for any time interval, including those that are not multiples of an integer number of years. The rate of increase in the CO2 content in the atmosphere has also been analyzed. It has been reliably established that in around 2016, the rate of CO2 accumulation in the atmosphere became stabilized and
Earlier, it was shown that conventional algorithms for solving the inverse VES problem cannot achieve the accuracy required for precision monitoring of a geoelectric section, and regularized algorithms were proposed t...
详细信息
Earlier, it was shown that conventional algorithms for solving the inverse VES problem cannot achieve the accuracy required for precision monitoring of a geoelectric section, and regularized algorithms were proposed to improve the accuracy and stability of solving the inverse VES problem. In this paper, we test the resistivity contrast stabilization algorithm on synthetic data. For modeling, a geoelectric section is used, similar to the section of the Garm test site both in the set of layers and their resistivities, and in the characteristics of seasonal variations, as well as noise. It is shown that regularization of the inverse problem greatly reduces errors. The most significant effect is achieved by suppressing the buildup of resistivity. Estimates are obtained for the accuracy in solving the inverse problem, which can be achieved when working with experimental data.
The Rosenbrock function is a ubiquitous benchmark problem in numerical optimization, and variants have been proposed to test the performance of Markov chain Monte Carlo algorithms on distributions with a curved and na...
详细信息
The Rosenbrock function is a ubiquitous benchmark problem in numerical optimization, and variants have been proposed to test the performance of Markov chain Monte Carlo algorithms on distributions with a curved and narrow shape. In this work we discuss the Rosenbrock distribution and the advantages and limitations of its current n-dimensional extensions. We then propose a new extension to arbitrary dimensions called the Hybrid Rosenbrock distribution, which addresses all the limitations that affect the current extensions. The Hybrid Rosenbrock distribution is composed of conditional normal kernels arranged in such a way that preserves the key features of the original Rosenbrock kernel. Moreover, due to its structure, the Hybrid Rosenbrock distribution is analytically tractable, and possesses several desirable properties which make it an excellent test model for computational algorithms. We conclude with numerical experiments that show how commonly used Markov chain Monte Carlo algorithms may fail to explore densities with curved correlation structure, restating the importance of a reliable benchmark problem for this class of densities.
The development of open-source geometric constraint solvers is a pressing research topic, as commercially available solvers may not meet the research requirements. In this paper, we examine the use of numerical method...
详细信息
The development of open-source geometric constraint solvers is a pressing research topic, as commercially available solvers may not meet the research requirements. In this paper, we examine the use of numerical methods in PlaneGCS, an open-source geometric constraint solver within the FreeCAD CAD software. Our study focuses on PlaneGCS's constraint solving algorithms and the three built-in single-subsystem solving methods: BFGS, LM, and Dogleg. Based on our research results, the DFP method was implemented in PlaneGCS and was successfully verified in FreeCAD. To evaluate the performance of the algorithms, we used the solving state of the constraint system as a test criterion, and analysed their solving time, adaptability, and number of iterations. Our results highlight the performance differences between the algorithms and provide empirical guidance for selection of constraint solving algorithms and research based on open-source geometric constraint solvers.
Usually, mutation strategies and the corresponding parameter values play an important role in DE. Because different mutation strategies reveal different characteristic during the course of the evolution, combing diffe...
详细信息
The accurate identification and diagnosis of single-phase line faults in distribution networks based on primary and secondary fusion column switches have long been challenging due to the lack of effective detection an...
详细信息
When demonstrating the effectiveness of a new algorithm, researchers are traditionally encouraged to compare their algorithm's performance against existing algorithms on well-studied benchmark test suites. In the ...
详细信息
When demonstrating the effectiveness of a new algorithm, researchers are traditionally encouraged to compare their algorithm's performance against existing algorithms on well-studied benchmark test suites. In the absence of more nuanced methodologies, algorithm performance is typically summarized on average across the test suite examples. This paper highlights the potential bias of conclusions drawn by analyzing "on average" performance, and the opportunities offered by a recent testing methodology known as instance space analysis. To illustrate, we revisit our 2007 comparative study of algorithms for facial age estimation, and rigorously stress-test to challenge the original conclusions. The case study demonstrates how powerful visualizations offered by instance space analysis enable greater insights into unique strengths and weaknesses, and which algorithm should be used when and why. Inspired by such insights, a new algorithm is proposed, and its unique advantage is demonstrated. The bias often hidden in well-studied datasets, and the ramifications for drawing biased conclusions, are also illustrated in this case study. While focused on facial age estimation, the methodology and lessons learned from the case study are broadly applicable to any study seeking to draw conclusions about algorithm performance based on empirical results.
For about two decades Differential Evolution (DE) algorithms have become one of the most successful optimization meta-heuristics. However, solving single objective real-parameter problem is still a challenging task. I...
详细信息
暂无评论