Binary well placement optimization using a decomposition-based multi-objective evolutionary algorithm with diversity preservation
Resumo
In binary multi-objective well placement optimization, multiple conflicting objective functions must be optimized simultaneously in reservoir simulation models containing discrete decision variables. Although multi-objective algorithms have been developed or adapted to tackle this scenario, such as the derivative-free evolutionary algorithms, these methods are known to generate a high number of duplicated strategies in discrete problems. Duplicated strategies negatively impact the optimization process since they: (i) degrade the efficiency of recombination operators in evolutionary algorithms; (ii) slow the convergence speed as they require more iterations to find a well-distributed set of strategies; and (iii) perform unnecessary re-evaluations of previously seen strategies through reservoir simulation. To perform multi-objective well placement optimization while avoiding duplicated strategies, this paper investigates the application of a newly proposed algorithm named MOEA/D-NFTS, with a modified diversity preservation mechanism that incorporates prior knowledge of the problem, on a multi-objective well placement optimization problem. The proposed methodology is evaluated on the UNISIM-II-D benchmark case, a synthetic carbonate black-oil simulation model in a well placement optimization problem using a binary strategy representation, indicating the presence or absence of a given candidate well position in the final strategy. The objective functions are the maximization of the Net Present Value, the maximization of the Cumulative Oil Production, and the minimization of Cumulative Water Production. The modified MOEA/D-NFTS performance is compared with a baseline algorithm without diversity preservation, and the evidence shows that the MOEA/D-NFTS produces statistically significant superior results, and is suitable for binary multi-objective well placement optimization.