首页> 外文期刊>Computational Geosciences >Application of a particle swarm optimization algorithm for determining optimum well location and type
【24h】

Application of a particle swarm optimization algorithm for determining optimum well location and type

机译:粒子群算法在确定最佳井位和井型中的应用

获取原文
获取原文并翻译 | 示例
           

摘要

Determining the optimum type and location of new wells is an essential component in the efficient development of oil and gas fields. The optimization problem is, however, demanding due to the potentially high dimension of the search space and the. computational requirements associated with function evaluations, which, in this case, entail full reservoir simulations. In this paper, the particle swarm optimization (PSO) algorithm is applied for the determination of optimal well type and location. The PSO algorithm is a stochastic procedure that uses a population of solutions, called particles, which move in the search space. Particle positions are updated iteratively according to particle fitness (objective function value) and position relative to other particles. The general PSO procedure is first discussed, and then the particular variant implemented for well optimization is described. Four example cases are considered. These involve vertical, deviated, and dual-lateral wells and optimization over single and multiple reservoir realizations. For each case, both the PSO algorithm and the widely used genetic algorithm (GA) are applied to maximize net present value. Multiple runs of both algorithms are performed and the results are averaged in order to achieve meaningful comparisons. It is shown that, on average, PSO outperforms GA in all cases considered, though the relative advantages of PSO vary from casernto case. Taken in total, these findings are very promising and demonstrate the applicability of PSO for this challenging problem.
机译:确定新井的最佳类型和位置是有效开发油气田的重要组成部分。然而,由于搜索空间和搜索空间的潜在高尺寸,最优化问题的要求很高。与功能评估相关的计算要求,在这种情况下,需要进行完整的油藏模拟。本文采用粒子群算法(PSO)确定最优井型和位置。 PSO算法是一种随机过程,它使用在搜索空间中移动的称为粒子的解决方案。根据粒子适应度(目标函数值)和相对于其他粒子的位置来迭代更新粒子位置。首先讨论了一般的PSO程序,然后描述了为优化井而实现的特定变体。考虑了四个示例情况。这些包括垂直井,斜井和双侧井,以及对单井和多井实现的优化。对于每种情况,都应用PSO算法和广泛使用的遗传算法(GA)来最大化净现值。对这两种算法进行多次运行,并对结果取平均值,以实现有意义的比较。结果表明,在所有情况下,PSO的性能均优于GA,尽管PSO的相对优势因案例而异。总而言之,这些发现是非常有希望的,并证明了PSO在这一具有挑战性的问题上的适用性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号