Design of Optimal Operational Parameters for Steam-Alternating-Solvent Processes in Heterogeneous Reservoirs - A Multi-Objective Optimization Approach

2021 ◽  
Author(s):  
Israel Mayo-Molina ◽  
Juliana Y. Leung

Abstract The Steam Alternating Solvent (SAS) process has been proposed and studied in recent years as a new auspicious alternative to the conventional thermal (steam-based) bitumen recovery process. The SAS process incorporates steam and solvent (e.g. propane) cycles injected alternatively using the same configuration as the Steam-Assisted Gravity-Drainage (SAGD) process. The SAS process offers many advantages, including lower capital and operational cost, as well as a reduction in water usage and lower Greenhouse Gas (GHG) Emissions. On the other hand, one of the main challenges of this relatively new process is the influence of uncertain reservoir heterogeneity distribution, such as shale barriers, on production behaviour. Many complex physical mechanisms, including heat transfer, fluid flows, and mass transfer, must be coupled. A proper design and selection of the operational parameters must consider several conflicting objectives. This work aims to develop a hybrid multi-objective optimization (MOO) framework for determining a set of Pareto-optimal SAS operational parameters under a variety of heterogeneity scenarios. First, a 2-D homogeneous reservoir model is constructed based on typical Cold lake reservoir properties in Alberta, Canada. The homogeneous model is used to establish a base scenario. Second, different shale barrier configurations with varying proportions, lengths, and locations are incorporated. Third, a detailed sensitivity analysis is performed to determine the most impactful parameters or decision variables. Based on the results of the sensitivity analysis, several objective functions are formulated (e.g., minimizing energy and solvent usage). Fourth, Response Surface Methodology (RSM) is applied to generate a set of proxy models to approximate the non-linear relationship between the decision variables and the objective functions and to reduce the overall computational time. Finally, three Multi-Objective Evolutionary Algorithms (MOEAs) are applied to search and compare the optimal sets of decision parameters. The study showed that the SAS process is sensitive to the shale barrier distribution, and that impact is strongly dependent on the location and length of a specific shale barrier. When a shale barrier is located near the injector well, pressure and temperature may build up in the near-well area, preventing additional steam and solvent be injected and, consequently, reducing the oil production. Operational constraints, such as bottom-hole pressure, steam trap criterion, and bottom-hole gas rate in the producer, are among various critical decision variables examined in this study. A key conclusion is that the optimal operating strategy should depend on the underlying heterogeneity. Although this notion has been alluded to in other previous steam- or solvent-based studies, this paper is the first to utilize a MOO framework for systematically determining a specific optimal strategy for each heterogeneity scenario. With the advancement of continuous downhole fibre-optic monitoring, the outcomes can potentially be integrated into other real-time reservoir characterization and optimization work-flows.

2019 ◽  
Vol 10 (1) ◽  
pp. 251 ◽  
Author(s):  
Gustavo R. Zavala ◽  
José García-Nieto ◽  
Antonio J. Nebro

The efficient calibration of hydrologic models allows experts to evaluate past events in river basins, as well as to describe new scenarios and predict possible future floodings. A difficulty in this context is the need to adjust a large number of parameters in the model to reduce prediction errors. In this work, we address this issue with two complementary contributions. First, we propose a new lumped rainfall-runoff hydrologic model—called Qom—which is featured by a limited set of continuous decision variables associated with soil moisture and direct runoff. Qom allows to separate and quantify the volume of losses and excesses of the rainwater falling in a hydrographic basin, while a Clark’s model is used to determine output hydrograms. Second, we apply a multi-objective optimization approach to find accurate calibrations of the model in a systematic and automatic way. The idea is to formulate the process as a bi-objective optimization problem where the Nash-Sutcliffe Efficiency coefficient and percent bias have to be minimized, and to combine the results found by a set of metaheuristics used to solve it. For validation purposes, we apply our proposal in six hydrographic scenarios, comprising river basins located in Spain, USA, Brazil and Argentina. The proposed approach is shown to minimize prediction errors of simulated streamflows with regards to those observed in these real-world basins.


Author(s):  
J. Hamel ◽  
M. Li ◽  
S. Azarm

Uncertainty in the input parameters to an engineering system may not only degrade the system’s performance, but may also cause failure or infeasibility. This paper presents a new sensitivity analysis based approach called Design Improvement by Sensitivity Analysis (DISA). DISA analyzes the interval parameter uncertainty of a system and, using multi-objective optimization, determines an optimal combination of design improvements required to enhance performance and ensure feasibility. This is accomplished by providing a designer with options for both uncertainty reduction and, more importantly, slight design adjustments. The approach can provide improvements to a design of interest that will ensure a minimal amount of variation in the objective functions of the system while also ensuring the engineering feasibility of the system. A two stage sequential framework is used in order to effectively employ metamodeling techniques to approximate the analysis function of an engineering system and greatly increase the computational efficiency of the approach. This new approach has been applied to two engineering examples of varying difficulty to demonstrate its applicability and effectiveness.


2017 ◽  
Vol 26 (05) ◽  
pp. 1760016 ◽  
Author(s):  
Shubhashis Kumar Shil ◽  
Samira Sadaoui

This study introduces an advanced Combinatorial Reverse Auction (CRA), multi-units, multiattributes and multi-objective, which is subject to buyer and seller trading constraints. Conflicting objectives may occur since the buyer can maximize some attributes and minimize some others. To address the Winner Determination (WD) problem for this type of CRAs, we propose an optimization approach based on genetic algorithms that we integrate with our variants of diversity and elitism strategies to improve the solution quality. Moreover, by maximizing the buyer’s revenue, our approach is able to return the best solution for our complex WD problem. We conduct a case study as well as simulated testing to illustrate the importance of the diversity and elitism schemes. We also validate the proposed WD method through simulated experiments by generating large instances of our CRA problem. The experimental results demonstrate on one hand the performance of our WD method in terms of several quality measures, like solution quality, run-time complexity and trade-off between convergence and diversity, and on the other hand, it’s significant superiority to well-known heuristic and exact WD techniques that have been implemented for much simpler CRAs.


2015 ◽  
Vol 23 (1) ◽  
pp. 69-100 ◽  
Author(s):  
Handing Wang ◽  
Licheng Jiao ◽  
Ronghua Shang ◽  
Shan He ◽  
Fang Liu

There can be a complicated mapping relation between decision variables and objective functions in multi-objective optimization problems (MOPs). It is uncommon that decision variables influence objective functions equally. Decision variables act differently in different objective functions. Hence, often, the mapping relation is unbalanced, which causes some redundancy during the search in a decision space. In response to this scenario, we propose a novel memetic (multi-objective) optimization strategy based on dimension reduction in decision space (DRMOS). DRMOS firstly analyzes the mapping relation between decision variables and objective functions. Then, it reduces the dimension of the search space by dividing the decision space into several subspaces according to the obtained relation. Finally, it improves the population by the memetic local search strategies in these decision subspaces separately. Further, DRMOS has good portability to other multi-objective evolutionary algorithms (MOEAs); that is, it is easily compatible with existing MOEAs. In order to evaluate its performance, we embed DRMOS in several state of the art MOEAs to facilitate our experiments. The results show that DRMOS has the advantage in terms of convergence speed, diversity maintenance, and portability when solving MOPs with an unbalanced mapping relation between decision variables and objective functions.


2018 ◽  
Vol 140 (4) ◽  
Author(s):  
Xiuying Wang ◽  
Liping Shi ◽  
Wei Huang ◽  
Xiaolei Wang

Spiral groove is one of the most common types of structures on gas mechanical seals. Numerical research demonstrated that the grooves designed for improving gas film lift or film stiffness often lead to the leakage increase. Hence, a multi-objective optimization approach specially for conflicting objectives is utilized to optimize the spiral grooves for a specific sample in this study. First, the objectives and independent variables in multi-objective optimization are determined by single objective analysis. Then, a set of optimal parameters, i.e., Pareto-optimal set, is obtained. Each solution in this set can get the highest dimensionless gas film lift under a specific requirement of the dimensionless leakage rate. Finally, the collinearity diagnostics is performed to evaluate the importance of different independent variables in the optimization.


2013 ◽  
Vol 21 (1) ◽  
pp. 149-177 ◽  
Author(s):  
Vui Ann Shim ◽  
Kay Chen Tan ◽  
Jun Yong Chia ◽  
Abdullah Al Mamun

Many real-world optimization problems are subjected to uncertainties that may be characterized by the presence of noise in the objective functions. The estimation of distribution algorithm (EDA), which models the global distribution of the population for searching tasks, is one of the evolutionary computation techniques that deals with noisy information. This paper studies the potential of EDAs; particularly an EDA based on restricted Boltzmann machines that handles multi-objective optimization problems in a noisy environment. Noise is introduced to the objective functions in the form of a Gaussian distribution. In order to reduce the detrimental effect of noise, a likelihood correction feature is proposed to tune the marginal probability distribution of each decision variable. The EDA is subsequently hybridized with a particle swarm optimization algorithm in a discrete domain to improve its search ability. The effectiveness of the proposed algorithm is examined via eight benchmark instances with different characteristics and shapes of the Pareto optimal front. The scalability, hybridization, and computational time are rigorously studied. Comparative studies show that the proposed approach outperforms other state of the art algorithms.


Author(s):  
Mahmood Mohagheghi ◽  
Jayanta Kapat ◽  
Narasimha Nagaiah

In this paper, two configurations of the S-CO2 Brayton cycles (i.e., the single-recuperated and recompression cycles) are thermodynamically modeled and optimized through a multi-objective approach. Two semi-conflicting objectives, i.e., cycle efficiency (ηc) and cycle specific power (Φsp) are maximized simultaneously to achieve Pareto optimal fronts. The objective of maximum cycle efficiency is to have a smaller and less expensive solar field, and a lower fuel cost in case of a hybrid scheme. On the other hand, the objective of maximum specific power provides a smaller power block, and a lower capital cost associated with recuperators and coolers. The multi-objective optimization is carried out by means of a genetic algorithm which is a robust method for multidimensional, nonlinear system optimization. The optimization process is comprehensive, i.e., all the decision variables including the inlet temperatures and pressures of turbines and compressors, the pinch point temperature differences, and the mass flow fraction of the main compressor are optimized simultaneously. The presented Pareto optimal fronts provide two optimum trade-off curves enabling decision makers to choose their desired compromise between the objectives, and to avoid naive solution points obtained from a single-objective optimization approach. Moreover, the comparison of the Pareto optimal fronts associated with the studied configurations reveals the optimum operational region of the recompression configuration where it presents superior performance over the single-recuperated cycle.


2016 ◽  
Vol 11 (1) ◽  
pp. 47-50 ◽  
Author(s):  
Seyed Reza Nabavi

Abstract Multi-objective optimization is used in many chemical engineering fields that have conflict objective functions. Prevaporation is an effective process for removing trace or minor amount of the component of diluting solutions. This process is used for dehydration of alcohols containing small amounts of water. In this process membrane flux and separation factor have conflict with each other. So a multi-objective optimization approach can be used for optimization of the process. In this paper, in first stage a neural network based model was developed for preparation conditions for polyetherimide membrane in isopropanol prevaporation. Four major variables involved in the membrane preparation procedure, including polymer concentration, additive content, solvent evaporation temperature and time was considered. Membrane flux and separation factor were considered as objective functions. Elitist Non-dominated sorting genetic algorithm with jumping gene and altruistic adaptation (Alt-NSGA-aJG) was applied for simultaneous maximization of flux and separation factor. Pareto optimal solutions for membrane preparation conditions and effect of decision variables (four preparation variables) on Pareto front were investigated.


2019 ◽  
Vol 45 (5) ◽  
pp. 1-15 ◽  
Author(s):  
Alex Lubida ◽  
Mozafar Veysipanah ◽  
Petter Pilesjo ◽  
Ali Mansourian

Land-use planning, which requires finding a balance among different conflicting social, economic and environment factors, is a complex task needed everywhere, including Africa. One example is the city of Zanzibar in Tanzania, which is under special consideration for land-use revision. From one side, the city has high potentials for tourist industry and at the other side there are major challenges with the city structure and poor accessibilities. In order to prepare a proper land-use plan for the city, a variety of influencing conflicting factors needs to be considered and satisfied. This can be regarded as a common problem in many African cities, which are under development. This paper aims to address the problem by proposing and demonstrating the use of Geographical Information System (GIS) and multi-objective optimization for land-use planning, in Zanzibar as a case study. The measures which have been taken by Zanzibar government to address the development challenges through the Zanzibar Strategy for Growth and Reduction of Poverty (ZSGRP) were identified by studying related documents and interviewing experts. Based on these, two objective functions were developed for land-use planning. Optimum base land-use plans were developed and mapped by optimizing the objective functions using the NSGA-II algorithm. The results show that the proposed approach and outputs can considerably facilitate land-use planning in Zanzibar. Similar approaches are highly recommended for other cities in Africa which are under development.


Author(s):  
Amarjeet Prajapati

AbstractOver the past 2 decades, several multi-objective optimizers (MOOs) have been proposed to address the different aspects of multi-objective optimization problems (MOPs). Unfortunately, it has been observed that many of MOOs experiences performance degradation when applied over MOPs having a large number of decision variables and objective functions. Specially, the performance of MOOs rapidly decreases when the number of decision variables and objective functions increases by more than a hundred and three, respectively. To address the challenges caused by such special case of MOPs, some large-scale multi-objective optimization optimizers (L-MuOOs) and large-scale many-objective optimization optimizers (L-MaOOs) have been developed in the literature. Even after vast development in the direction of L-MuOOs and L-MaOOs, the supremacy of these optimizers has not been tested on real-world optimization problems containing a large number of decision variables and objectives such as large-scale many-objective software clustering problems (L-MaSCPs). In this study, the performance of nine L-MuOOs and L-MaOOs (i.e., S3-CMA-ES, LMOSCO, LSMOF, LMEA, IDMOPSO, ADC-MaOO, NSGA-III, H-RVEA, and DREA) is evaluated and compared over five L-MaSCPs in terms of IGD, Hypervolume, and MQ metrics. The experimentation results show that the S3-CMA-ES and LMOSCO perform better compared to the LSMOF, LMEA, IDMOPSO, ADC-MaOO, NSGA-III, H-RVEA, and DREA in most of the cases. The LSMOF, LMEA, IDMOPSO, ADC-MaOO, NSGA-III, and DREA, are the average performer, and H-RVEA is the worst performer.


Sign in / Sign up

Export Citation Format

Share Document