Article ID: | iaor20083178 |
Country: | Netherlands |
Volume: | 8 |
Issue: | 3 |
Start Page Number: | 259 |
End Page Number: | 275 |
Publication Date: | Sep 2007 |
Journal: | Optimization and Engineering |
Authors: | Wu Yue, Lai Kin Keung, Liu Yongjin |
Keywords: | distribution, networks: flow, programming: network |
Natural gas is normally transported through a vast network of pipelines. A pipeline network is generally established either to transmit gas at high pressure from coastal supplies to regional demand points (transmission network) or to distribute gas to consumers at low pressure from the regional demand points (distribution network). In this study, the distribution network is considered. The distribution network differs from the transmission one in a number of ways. Pipes involved in a distribution network are often much smaller and the network is simpler, having no valves, compressors or nozzles. In this paper, we propose the problem of minimizing the cost of pipelines incurred by driving the gas in a distribute non-linear network under steady-state assumptions. In particular, the decision variables include the length of the pipes' diameter, pressure drops at each node of the network, and mass flow rate at each pipeline leg. We establish a mathematical optimization model of this problem, and then present a global approach, which is based on the GOP primal–relaxed dual decomposition method presented by Visweswaran and Floudas, to the optimization model. Finally, results from application of the approach to data from gas company are presented.