Jian Wang

Bio: Jian Wang is an academic researcher from China University of Petroleum. The author has contributed to research in topics: Diagenesis & Carbonate. The author has an hindex of 10, co-authored 45 publications receiving 422 citations.

Affine Transformation-Enhanced Multifactorial Optimization for Heterogeneous Problems

Abstract: Evolutionary multitasking (EMT) is a newly emerging research topic in the community of evolutionary computation, which aims to improve the convergence characteristic across multiple distinct optimization tasks simultaneously by triggering knowledge transfer among them. Unfortunately, most of the existing EMT algorithms are only capable of boosting the optimization performance for homogeneous problems which explicitly share the same (or similar) fitness landscapes. Seldom efforts have been devoted to generalize the EMT for solving heterogeneous problems. A few preliminary studies employ domain adaptation techniques to enhance the transferability between two distinct tasks. However, almost all of these methods encounter a severe issue which is the so-called degradation of intertask mapping. Keeping this in mind, a novel rank loss function for acquiring a superior intertask mapping is proposed in this article. In particular, with an evolutionary-path-based representation model for optimization instance, an analytical solution of affine transformation for bridging the gap between two distinct problems is mathematically derived from the proposed rank loss function. It is worth mentioning that the proposed mapping-based transferability enhancement technique can be seamlessly embedded into an EMT paradigm. Finally, the efficacy of our proposed method against several state-of-the-art EMTs is verified experimentally on a number of synthetic multitasking and many-tasking benchmark problems, as well as a practical case study.

History Matching of Naturally Fractured Reservoirs Using a Deep Sparse Autoencoder

Abstract: Although researchers have applied many methods to history matching, such as Monte Carlo methods, ensemble-based methods, and optimization algorithms, history matching fractured reservoirs is still challenging. The key challenges are effectively representing the fracture network and coping with large amounts of reservoir-model parameters. With increasing numbers of fractures, the dimension becomes larger, resulting in heavy computational work in the inversion of fractures. This paper proposes a new characterization method for the multiscale fracture network, and a powerful dimensionality-reduction method by means of an autoencoder for model parameters. The characterization method of the fracture network is dependent on the length, orientation, and position of fractures, including large-scale and small-scale fractures. To significantly reduce the dimension of parameters, the deep sparse autoencoder (DSAE) transforms the input to the low-dimensional latent variables through encoding and decoding. Integrated with the greedy layer-wise algorithm, we set up a DSAE and then take the latent variables as optimization variables. The performance of the DSAE with fewer activating nodes is excellent because it reduces the redundant information of the input and avoids overfitting. Then, we adopt the ensemble smoother (ES) with multiple data assimilation (ES-MDA) to solve this minimization problem. We test our proposed method in three synthetic reservoir history-matching problems, compared with the no-dimensionality-reduction method and the principal-component analysis (PCA). The numerical results show that the characterization method integrated with the DSAE could simplify the fracture network, preserve the distribution of fractures during the update, and improve the quality of history matching naturally fractured reservoirs.

Multifidelity Genetic Transfer: An Efficient Framework for Production Optimization

Abstract: Production optimization led by computing intelligence can greatly improve oilfield economic effectiveness. However, it is confronted with huge computational challenge because of the expensive black-box objective function and the high-dimensional design variables. Many low-fidelity methods based on simplified physical models or data-driven models have been proposed to reduce evaluation costs. These methods can approximate the global fitness landscape to a certain extent, but it is difficult to ensure accuracy and correlation in local areas. Multifidelity methods have been proposed to balance the advantages of the two, but most of the current methods rely on complex computational models. Through a simple but efficient shortcut, our work aims to establish a novel production-optimization framework using genetic transfer learning to accelerate convergence and improve the quality of optimal solution using results from different fidelities. Net present value (NPV) is a widely used standard to comprehensively evaluate the economic value of a strategy in production optimization. On the basis of NPV, we first established a multifidelity optimization model that can synthesize the reference information from high-fidelity tasks and the approximate results from low-fidelity tasks. Then, we introduce the concept of relative fidelity as an indicator for quantifying the dynamic reliability of low-fidelity methods, and further propose a two-mode multifidelity genetic transfer learning framework that balances computing resources for tasks with different fidelity levels. The multitasking mode takes the elite solution as the transfer medium and forms a closed-loop feedback system through the information exchange between low- and high-fidelity tasks in parallel. Sequential transfer mode, a one-way algorithm, transfers the elite solutions archived in the previous mode as the population to high-fidelity domain for further optimization. This framework is suitable for population-based optimization algorithms with variable search direction and step size. The core work of this paper is to realize the framework by means of differential evolution (DE), for which we propose the multifidelity transfer differential evolution (MTDE). Corresponding to multitasking and sequential transfer in the framework, MTDE includes two modes, transfer based on base vector (b-transfer) and transfer based on population (p-transfer). The b-transfer mode incorporates the unique advantages of DE into fidelity switching, whereas the p-transfer mode adaptively conducts population for further high-fidelity local search. Finally, the production-optimization performance of MTDE is validated with the egg model and two real field cases, in which the black-oil and streamline models are used to obtain high- and low-fidelity results, respectively. We also compared the convergence curves and optimization results with the single-fidelity method and the greedy multifidelity method. The results show that the proposed algorithm has a faster convergence rate and a higher-quality well-control strategy. The adaptive capacity of p-transfer is also demonstrated in three distinct cases. At the end of the paper, we discuss the generalization potential of the proposed framework.

Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts

Abstract: A recent set of overused population-based methods have been published in recent years. Despite their popularity, most of them have uncertain, immature performance, partially done verifications, similar overused metaphors, similar immature exploration and exploitation components and operations, and an insecure tradeoff between exploration and exploitation trends in most of the new real-world cases. Therefore, all users need to extensively modify and adjust their operations based on main evolutionary methods to reach faster convergence, more stable balance, and high-quality results. To move the optimization community one step ahead toward more focus on performance rather than change of metaphor, a general-purpose population-based optimization technique called Hunger Games Search (HGS) is proposed in this research with a simple structure, special stability features and very competitive performance to realize the solutions of both constrained and unconstrained problems more effectively. The proposed HGS is designed according to the hunger-driven activities and behavioural choice of animals. This dynamic, fitness-wise search method follows a simple concept of “Hunger” as the most crucial homeostatic motivation and reason for behaviours, decisions, and actions in the life of all animals to make the process of optimization more understandable and consistent for new users and decision-makers. The Hunger Games Search incorporates the concept of hunger into the feature process; in other words, an adaptive weight based on the concept of hunger is designed and employed to simulate the effect of hunger on each search step. It follows the computationally logical rules (games) utilized by almost all animals and these rival activities and games are often adaptive evolutionary by securing higher chances of survival and food acquisition. This method's main feature is its dynamic nature, simple structure, and high performance in terms of convergence and acceptable quality of solutions, proving to be more efficient than the current optimization methods. The effectiveness of HGS was verified by comparing HGS with a comprehensive set of popular and advanced algorithms on 23 well-known optimization functions and the IEEE CEC 2014 benchmark test suite. Also, the HGS was applied to several engineering problems to demonstrate its applicability. The results validate the effectiveness of the proposed optimizer compared to popular essential optimizers, several advanced variants of the existing methods, and several CEC winners and powerful differential evolution (DE)-based methods abbreviated as LSHADE, SPS_L_SHADE_EIG, LSHADE_cnEpSi, SHADE, SADE, MPEDE, and JDE methods in handling many single-objective problems. We designed this open-source population-based method to be a standard tool for optimization in different areas of artificial intelligence and machine learning with several new exploratory and exploitative features, high performance, and high optimization capacity. The method is very flexible and scalable to be extended to fit more form of optimization cases in both structural aspects and application sides. This paper's source codes, supplementary files, Latex and office source files, sources of plots, a brief version and pseudocode, and an open-source software toolkit for solving optimization problems with Hunger Games Search and online web service for any question, feedback, suggestion, and idea on HGS algorithm will be available to the public at https://aliasgharheidari.com/HGS.html .

Classification of offshore mass movements

Abstract: More than 100 offshore mass-movement deposits have been studied in Holocene and Pleistocene sediments. The processes can be divided into three main types: slides/slumps, plastic flows, and turbidity currents, of which 13 main varieties have been recognized. The three types are differentiated mainly by motion, architecture, and shape of failure surface. For slides, the morphology of deposits can usually be linked to a process, but for plastic flows and turbidity currents, information about the motion is mainly provided by the sedimentary record. A static classification based on these features is given, and is related to a dynamic classification system to try to underline the morphological transformation of an offshore event from initiation to deposition.

RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method

Abstract: The optimization field suffers from the metaphor-based “pseudo-novel” or “fancy” optimizers. Most of these cliche methods mimic animals' searching trends and possess a small contribution to the optimization process itself. Most of these cliche methods suffer from the locally efficient performance, biased verification methods on easy problems, and high similarity between their components' interactions. This study attempts to go beyond the traps of metaphors and introduce a novel metaphor-free population-based optimization method based on the mathematical foundations and ideas of the Runge Kutta (RK) method widely well-known in mathematics. The proposed RUNge Kutta optimizer (RUN) was developed to deal with various types of optimization problems in the future. The RUN utilizes the logic of slope variations computed by the RK method as a promising and logical searching mechanism for global optimization. This search mechanism benefits from two active exploration and exploitation phases for exploring the promising regions in the feature space and constructive movement toward the global best solution. Furthermore, an enhanced solution quality (ESQ) mechanism is employed to avoid the local optimal solutions and increase convergence speed. The RUN algorithm's efficiency was evaluated by comparing with other metaheuristic algorithms in 50 mathematical test functions and four real-world engineering problems. The RUN provided very promising and competitive results, showing superior exploration and exploitation tendencies, fast convergence rate, and local optima avoidance. In optimizing the constrained engineering problems, the metaphor-free RUN demonstrated its suitable performance as well. The authors invite the community for extensive evaluations of this deep-rooted optimizer as a promising tool for real-world optimization. The source codes, supplementary materials, and guidance for the developed method will be publicly available at different hubs at http://imanahmadianfar.com and http://aliasgharheidari.com/RUN.html .