A novel branch and bound algorithm for optimal development of gas fields under uncertainty in reserves

被引:56
|
作者
Goel, Vikas
Grossmann, Ignacio E.
El-Bakry, Amr S.
Mulkay, Eric L.
机构
[1] Carnegie Mellon Univ, Dept Chem Engn, Pittsburgh, PA 15213 USA
[2] ExxonMobil Upstream Res Co, Houston, TX USA
关键词
gas fields; long-term planning; stochastic programming; Lagrangean branch and bound;
D O I
10.1016/j.compchemeng.2006.02.006
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider the problem of optimal investment and operational planning for development of gas fields under uncertainty in gas reserves. Assuming uncertainties in the size and initial deliverabilities of the gas fields, the problem has been formulated as a multistage stochastic program by Goel and Grossmann (2004). In this paper, we present a set of theoretical properties satisfied by any feasible solution of this model. We also present a Lagrangean duality based branch and bound algorithm that is guaranteed to give the optimal solution of this model. It is shown that the properties presented here achieve significant reduction in the size of the model. In addition, the proposed algorithm generates significantly superior solutions than the deterministic approach and the heuristic proposed by Goel and Grossmann (2004). The optimality gaps are also much tighter. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1076 / 1092
页数:17
相关论文
共 50 条
  • [1] Optimal development planning of gas reserves
    Boucher, J
    Smeers, Y
    [J]. ENERGY ECONOMICS, 1996, 18 (1-2) : 25 - 47
  • [2] Adaptive branch and bound algorithm for selecting optimal features
    Nakariyakul, Songyot
    Casasent, David P.
    [J]. PATTERN RECOGNITION LETTERS, 2007, 28 (12) : 1415 - 1427
  • [3] OPTIMAL NETWORK PROBLEM - BRANCH-AND-BOUND ALGORITHM
    BOYCE, DE
    FARHI, A
    WEISCHEDEL, R
    [J]. ENVIRONMENT AND PLANNING A, 1973, 5 (04) : 519 - 533
  • [4] A branch and bound algorithm for optimal television commercial scheduling
    Lu-Wen Liao
    [J]. MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2022, 19 (05) : 4933 - 4945
  • [5] A branch and bound algorithm for robust binary optimization with budget uncertainty
    Buesing, Christina
    Gersing, Timo
    Koster, Arie M. C. A.
    [J]. MATHEMATICAL PROGRAMMING COMPUTATION, 2023, 15 (02) : 269 - 326
  • [6] A branch and bound algorithm for robust binary optimization with budget uncertainty
    Christina Büsing
    Timo Gersing
    Arie M. C. A. Koster
    [J]. Mathematical Programming Computation, 2023, 15 : 269 - 326
  • [7] Optimal Coalition Structure Generation Algorithm with Branch and Bound Technique
    Li, Jinglei
    Zhang, Zhenrong
    Zhang, Wei
    [J]. PROCEEDINGS OF THE 2009 CHINESE CONFERENCE ON PATTERN RECOGNITION AND THE FIRST CJK JOINT WORKSHOP ON PATTERN RECOGNITION, VOLS 1 AND 2, 2009, : 974 - 978
  • [8] ALGORITHM FOR OPTIMAL REACTOR SHUTDOWN PROBLEM BY BRANCH AND BOUND METHOD
    MIYAKOSHI, A
    OOUCHI, A
    KAJI, I
    [J]. JOURNAL OF THE ATOMIC ENERGY SOCIETY OF JAPAN, 1978, 20 (10): : 726 - 733
  • [9] An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow
    Liu, Pengxiang
    Wu, Zhi
    Gu, Wei
    Lu, Yuping
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2022, 37 (02) : 1326 - 1339
  • [10] Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
    Carbonneau, Real A.
    Caporossi, Gilles
    Hansen, Pierre
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2748 - 2762