A data-driven method for pipeline scheduling optimization

2019 ◽  
Vol 144 ◽  
pp. 79-94 ◽  
Author(s):  
Qi Liao ◽  
Haoran Zhang ◽  
Tianqi Xia ◽  
Quanjun Chen ◽  
Zhengbing Li ◽  
...  
IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 49990-50002 ◽  
Author(s):  
Qian Tao ◽  
Chunqin Gu ◽  
Zhenyu Wang ◽  
Joseph Rocchio ◽  
Weiwen Hu ◽  
...  

Author(s):  
Qi Liao ◽  
Bohong Wang ◽  
Zhengbing Li ◽  
Haoran Zhang ◽  
Yongtu Liang ◽  
...  

Considering market’s diversified demand and transport economy, large volumes of various refined products commonly move down the pipeline in batches, which are pumped at pump stations and delivered to respective delivery stations. The integrate detailed scheduling optimization is a sophisticated problem due to the characteristics of multi-product pipelines, such as market-oriented, fluctuated demand, various processing technique and complicated hydraulic calculation during batch migration. The integrate detailed scheduling optimization has been widely studied during the last decade, however, most of them studied pipeline scheduling and pump scheduling separately. Besides, the proposed methods are mathematical models, whose computational efficiency greatly decreases in large-scale pipeline scheduling, let alone in the problems coupling with pump scheduling. Aiming at this problem, this paper presents a novel depth-first searching approach based on flowrate ratio to deal with the detailed scheduling of operations in a multi-product pipeline with multiple pump stations. As for each single time interval, the proposed method decides an ideal flowrate ratio according to current status, then solves out the optimal flowrate that mostly conforms to the ideal ratio and satisfies all operational constraints, and finally updates information for next time interval. However, during the computational procedure, backtracking method would be adopted to modify the previous flowrate ratios and recalculate new flowrate when the actual delivered products are insufficient. Finally, a case tested on a Chinese real-world pipeline with 6 delivery stations is given to demonstrate the veracity and practicability of the proposed method. From the results, computing time of the case is within 1 minute, and the solved detailed scheduling plans can fulfill demand with stable pump operations. Besides, the proposed approach is scarcely influenced by the scale of pipeline structure and time horizon, so it is also applicable to the long-term scheduling of a pipeline with many delivery stations.


2021 ◽  
Vol 3 (1) ◽  
pp. 40-56
Author(s):  
Defan Feng ◽  
Yu Mo ◽  
Zhiyao Tang ◽  
Quanjun Chen ◽  
Haoran Zhang ◽  
...  

2013 ◽  
Vol 411-414 ◽  
pp. 2746-2751
Author(s):  
Ming Li

The logistics pipeline scheduling problem of oil refining process was researched in this paper. The problem has been received significant attentions in actual production process. A MILP scheduling optimization model was built by formulating the complex logistics pipeline network of oil refining process. Compared to other researches, the presented model in this paper has fewer variables and more concise constrains which can be solved more efficiently. The formulation approach also provides a basis for the further research on energy network optimization. Finally, the presented model was used to address the scheduling of a refinery. Case study shows that the obtained optimal schedule satisfies real requirements, which illustrates the models efficiency.


2020 ◽  
Vol 59 (17) ◽  
pp. 8281-8294
Author(s):  
Hossein Mostafaei ◽  
Teemu Ikonen ◽  
Jason Kramb ◽  
Tewodros Deneke ◽  
Keijo Heljanko ◽  
...  

2021 ◽  
pp. 116971
Author(s):  
Xin Dai ◽  
Liang Zhao ◽  
Zhi Li ◽  
Wenli Du ◽  
Weimin Zhong ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document