Modeling and MPC-based Method for Planning Transportation of Multiple Oil Products in Pipeline Network

被引:0
|
作者
Ghenaati, Seyyed Hossein [1 ]
Aghaei, Shahram [1 ]
机构
[1] Yazd Univ, Elect Engn Dept, Yazd, Iran
来源
2019 27TH IRANIAN CONFERENCE ON ELECTRICAL ENGINEERING (ICEE 2019) | 2019年
关键词
constrained optimization; receding horizon control; model predictive control; planning; PETROLEUM-PRODUCTS;
D O I
10.1109/iraniancee.2019.8786581
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multiple pipeline networks are planned and under construction for long-distance transportation of some petroleum derivatives through a system of pipes typically towards the market areas for consumption. The main purpose of this paper in the form of planning problem consists of demand regulation and efficiency improvement based on optimization factors such as descend total transportation losses and increase response time to satisfy demands regarding plant specification and systematic constraints. The planning process as a scheme that defines how to transport petroleum products and batch sequences injected consecutively through pipeline polyducts with no separating device is one of the most prominent challenges facing industrial engineering. In this paper, the yearly demands are split into monthly problems so that considering two-month prediction horizons, model predictive control strategy is applied to optimize sequences which are regulating demands in the corresponding time steps to the last day of every month. The hierarchical offline reoptimization for the small-sized problem at the beginning of every month, instead of optimizing annual planning as a high dimensional and constrained problem can lead to overcoming computational complexity that is a remarkable challenge in the planning.
引用
收藏
页码:1145 / 1150
页数:6
相关论文
共 50 条
  • [11] Effect of Planning Period on MPC-based Navigation for a Biped Robot in a Crowd
    Ciocca, Matteo
    Wieber, Pierre-Brice
    Fraichard, Thierry
    2019 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2019, : 491 - 496
  • [12] CIAO*: MPC-based Safe Motion Planning in Predictable Dynamic Environments
    Schoels, Tobias
    Rutquist, Per
    Palmieri, Luigi
    Zanelli, Andrea
    Arras, Kai O.
    Diehl, Moritz
    IFAC PAPERSONLINE, 2020, 53 (02): : 6555 - 6562
  • [13] MPC-based Motion Planning for Autonomous Truck-Trailer Maneuvering
    Bos, Mathias
    Vandewal, Bastiaan
    Decre, Wilm
    Swevers, Jan
    IFAC PAPERSONLINE, 2023, 56 (02): : 4877 - 4882
  • [14] MPC-Based Motion Planning and Tracking Control for Autonomous Underwater Vehicles
    Huang, Zhihao
    Sun, Bing
    Zhang, Wei
    2023 35TH CHINESE CONTROL AND DECISION CONFERENCE, CCDC, 2023, : 2077 - 2082
  • [15] Hierarchical MPC-based Motion Planning for Automated Vehicles in Parallel Autonomy
    Cheng, Zijun
    Zeng, Xianlin
    Fang, Hao
    Wang, Gang
    Dou, Lihua
    UNMANNED SYSTEMS, 2024, 12 (05) : 927 - 938
  • [16] Global Search Metaheuristics for planning transportation of multiple petroleum products in a multi-pipeline system
    Herran, A.
    de la Cruz, J. M.
    de Andres, B.
    COMPUTERS & CHEMICAL ENGINEERING, 2012, 37 : 248 - 261
  • [17] Network-based optimization modeling of manhole setting for pipeline transportation
    Chen, Jingxu
    Wang, Shuaian
    Liu, Zhiyuan
    Guo, Yanyong
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2018, 113 : 38 - 55
  • [18] Planning the transportation of multiple commodities in bidirectional pipeline networks
    Pessoa, AA
    ALGORITHMS AND COMPUTATION, 2004, 3341 : 766 - 777
  • [19] Decentralized MPC-Based Trajectory Generation for Multiple Quadrotors in Cluttered Environments
    Xinyi Wang
    Lele Xi
    Yizhou Chen
    Shupeng Lai
    Feng Lin
    Ben MChen
    Guidance,Navigation and Control, 2021, (02) : 44 - 63
  • [20] Secure MPC-Based Path Following for UAS in Adverse Network Environment
    Feng, Zhaowen
    Cao, Guoyan
    Grigoriadis, Karolos M.
    Pan, Quan
    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2023, 19 (11) : 11091 - 11101