Optimal Scheduling of Compressors Considering Linepack Storage in a Pipeline Network
This paper presents an algorithm using dynamic programming to solve the problem of opitimai 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.
Linepack Gas compressor Optimal scheduling Dynamic programming
Gongtao WANG Chen ZHENG Abed Halimah
OSI Automation Software Systems(Beijing)Co.,Ltd.No.2 East 3rd Ring Road,Beijing,China 100027
国际会议
武汉
英文
271-276
2013-06-15（万方平台首次上网日期，不代表论文的发表时间）