Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Art and Theory of Dynamic Programming
Art and Theory of Dynamic Programming
Nonserial Dynamic Programming
Model relaxations for the fuel cost minimization of steady-state gas pipeline networks
Mathematical and Computer Modelling: An International Journal
Optimization of natural gas pipeline transportation using ant colony optimization
Computers and Operations Research
Minimizing fuel cost in gas transmission networks by dynamic programming and adaptive discretization
Computers and Industrial Engineering
| Hi-index | 0.01 |
In this paper we propose a heuristic solution procedure for fuel cost minimization on gas transmission systems with a cyclic network topology, that is, networks with at least one cycle containing two or more compressor station arcs. Our heuristic solution methodology is based on a two-stage iterative procedure. In a particular iteration, at a first stage, gas flow variables are fixed and optimal pressure variables are found via dynamic programming. At a second stage, pressure variables are fixed and an attempt is made to find a set of flow variables that improve the objective function by exploiting the underlying network structure. Empirical evidence supports the effectiveness of the proposed procedure outperforming the best existing approach to the best of our knowledge.