Optimization of Investments in Natural Gas Distribution Networks

This paper presents an optimization model and solution procedure for planning investments in gas distribution networks for residential customers. The situation can be considered a capital budgeting problem under uncertainty. There is uncertainty about whether a potential customer will convert to gas service if a distribution main is built, the revenue generated if the household does convert, and the cost of constructing the main. A fixed annual budget is allocated to a set of discrete, competing projects over time. The allocation is done by maximizing the expected net present value (NPV) given the decision-maker's risk preferences. The probability distribution of the NPV for each competing project is created from two statistical models. A binary probit model is used to estimate the probability of conversion for a potential customer. A random effects regression model is used to estimate the revenue generated should a particular potential customer switch to gas. A rollout value greedy heuristic was devised to solve the resulting optimization formulation. Two case studies based on data from a large gas company illustrate the analysis.

[1]  Witold Pedrycz,et al.  Neural network based decision model, used for design of rural natural gas systems , 1992, [1992 Proceedings] IEEE International Conference on Fuzzy Systems.

[2]  John M. Mulvey,et al.  A New Scenario Decomposition Method for Large-Scale Stochastic Optimization , 1995, Oper. Res..

[3]  Scott A. Malcolm,et al.  Robust Optimization for Power Systems Capacity Expansion under Uncertainty , 1994 .

[4]  J. Mulvey,et al.  Making a case for robust optimization models , 1997 .

[5]  Luís Ferreira,et al.  Planning large-scale distribution networks for robust expansion under deregulation , 2000, 2000 Power Engineering Society Summer Meeting (Cat. No.00CH37134).

[6]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[7]  Dean A. Jones,et al.  Robust optimization for fleet planning under uncertainty , 2003 .

[8]  E. Thanassoulis.  SELECTING A SUITABLE SOLUTION METHOD FOR A MULTI OBJECTIVE PROGRAMMING CAPITAL BUDGETING PROBLEM , 1985 .

[9]  John N. Tsitsiklis,et al.  Rollout Algorithms for Combinatorial Optimization , 1997, J. Heuristics.

[10]  Dimitri P. Bertsekas,et al.  Rollout Algorithms for Stochastic Scheduling Problems , 1999, J. Heuristics.

[11]  Patrick D. Surry,et al.  A Multi-objective Approach to Constrained Optimisation of Gas Supply Networks: the COMOGA Method , 1995, Evolutionary Computing, AISB Workshop.

[12]  Nicos Christofides,et al.  Capital Budgeting Under Uncertainty - An Integrated Approach Using Contingent Claims Analysis and Integer Programming , 2001, Oper. Res..

[13]  M. Laguna,et al.  Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty , 1998 .

[14]  B. Rustem,et al.  Robust capacity planning under uncertainty , 1991 .

[15]  J. Eliot B. Moss,et al.  Scheduling Straight-Line Code Using Reinforcement Learning and Rollouts , 1998, NIPS.

[16]  Sherwood C. Frey,et al.  Equivalent Mathematical Programming Models of Pure Capital Rationing , 1978 .

[17]  Rachel A. Davidson,et al.  Computing Distance to the Nearest Utility: As the Crow Flies vs. As the Gas Flows , 2003 .

[18]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[19]  Gerald Tesauro,et al.  On-line Policy Improvement using Monte-Carlo Search , 1996, NIPS.

[20]  Nicola Secomandi,et al.  A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands , 2001, Oper. Res..

[21]  Ioana Popescu,et al.  Revenue Management in a Dynamic Network Environment , 2003, Transp. Sci..

[22]  Ji Soo Kim,et al.  Equivalent mathematical programming models of the capital budgeting problem , 1991 .

[23]  Jong-Bae Park,et al.  An improved genetic algorithm for generation expansion planning , 2000 .