• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >A Lagrangean relaxation based procedure for minimizing offshore oil and gas field investment.
【24h】

A Lagrangean relaxation based procedure for minimizing offshore oil and gas field investment.

机译：基于拉格朗日松弛法的程序，可最大程度地减少海上油气田投资。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The main decisions concerning the development of an offshore oil and/or gas field are: (1) how many, what types, and what sizes of production facilities should be used in the development of the field, (2) where should those facilities be located, and (3) how should a given number of wells among several candidate well sites be assigned to the selected facilities. Such a problem is known as the "offshore location-allocation problem" and is formulated here as a pure 0-1 integer programming model in which the objective is to minimize investments for the development of the field. A tree search procedure to find the optimal solution to this problem is developed. The most important elements of this procedure are the methods to find lower and upper bounds, a node simplification procedure, and a two-level branch and bound tree.;A lower bound is found by solving a Lagrangean relaxation of the original problem. The values for the multipliers in this relaxation are found by a dual ascent procedure. This bound is then tightened by adding a Benders inequality generated from model data. An upper bound is generated by constructing a feasible solution to the problem using the solution to the Lagrangean problem. The node simplification procedure is simply a dominance rule for fixing "free" location variables based on a lower bound for the cost savings associated with such decisions. These mechanisms were embedded in a two-level branch and bound tree. In the first level, the search is concentrated on the facility location decisions; whereas, in the second level, the search is conducted on the well assignment decisions.;Ten different examples, all with real data, were used to test the overall methodology. Duality gaps associated with the initial lower bounds and execution times appear to be remarkably small for the size and complexity of the examples. This methodology was compared with a state-of-the-art code specially designed for zero-one integer programming. Computational results indicate that the proposed methodology outperforms the other one, not only in execution time, but also in memory required.
机译：关于海上油气田开发的主要决策是：（1）在油田开发中应使用多少，什么类型，什么规模的生产设施，（2）这些设施应在哪里使用？ （3）如何将几个候选井位中给定数量的井分配给所选设施。这样的问题被称为“离岸位置分配问题”，在这里被表述为一个纯0-1整数规划模型，其目的是最大程度地减少对油田开发的投资。开发了一种树形搜索程序来找到该问题的最佳解决方案。此过程最重要的元素是查找上下限的方法，节点简化过程以及两级分支定界树。;通过解决原始问题的拉格朗日松弛来找到下限。通过双重上升过程找到此松弛过程中乘数的值。然后通过添加从模型数据生成的Benders不等式来加强此界限。通过使用拉格朗日问题的解决方案构造问题的可行解决方案，可以生成一个上限。节点简化过程只是用于基于与此类决策相关的成本节省的下限来固定“自由”位置变量的主导规则。这些机制被嵌入到两级分支和绑定树中。在第一层中，搜索集中在设施位置决策上。在第二级中，搜索是根据油井分配决策进行的。十个不同的实例（都带有真实数据）用于测试总体方法。对于示例的大小和复杂性，与初始下限和执行时间相关的对偶间隙似乎非常小。该方法与专门为零一整数编程设计的最新代码进行了比较。计算结果表明，所提出的方法不仅在执行时间上而且在所需的内存上都优于其他方法。

著录项

  • 作者

    Garcia-Diaz, Juan Carlos.;

  • 作者单位

    Texas A&M University.;

  • 授予单位 Texas A&M University.;
  • 学科 Engineering Industrial.;Operations Research.;Engineering Petroleum.
  • 学位 Ph.D.
  • 年度 1991
  • 页码 172 p.
  • 总页数 172
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号