p.250
p.254
p.263
p.267
p.271
p.277
p.281
p.286
p.290
Optimal Scheduling of Compressors Considering Linepack Storage in a Pipeline Network
Abstract:
This paper presents an algorithm using dynamic programming to solve the problem of opitimal scheduling of compressors considering the linepack storage in a pipeline network. Both centrifugal and piston compressors are modelled for power calculation. For a forecast profile of gas loads, a multi-stage problem is formed by discretizing the storage capacity of linepack and tank along the timeline, and then is solved by a dynamic programming to obtain optimal day-ahead schedules for each compressor. While creating the multi-stage data, constraints on compressors, stations (sources), and pipeline network are utilized to exclude infeasible paths, avoiding dimension disaster and ensuring the feasibility of the paths from the point of view of state transition. Case studies have been done on both simple and complex systems, and the results indicate the practicability of the proposed algorithm.
Info:
Periodical:
Pages:
271-276
Citation:
Online since:
July 2013
Authors:
Keywords:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: