管道(软件)
计算机科学
解算器
树状网络
数学优化
管道运输
树(集合论)
整数规划
明星(博弈论)
网络拓扑
领域(数学)
网络模型
油田
拓扑(电路)
石油工程
算法
数学
工程类
数据挖掘
时间复杂性
机械工程
计算机网络
数学分析
纯数学
程序设计语言
组合数学
作者
Jun Zhou,Daixin Zhang,Liuling Zhou,Guangchuan Liang,Xuan Zhou,Zelong Li
摘要
Oil&gas gathering pipeline network structure is a significant part of oil&gas field construction, and the rational construction of pipeline network is directly related to the efficiency and benefits of oil&gas field production. Therefore, optimizing the gathering and transportation system of oil and gas fields is the key to reducing development costs. The star-tree type pipe network is widely used in the gathering and transportation system. In order to optimize the star-tree pipe networks (STPNs) that has restrictions on the processing capacity and gathering radius of the station as a whole, this paper establishes four models of pipe network layout with specific constraints. They are Mixed-Integer Linear Programming Models with a large number of discrete variables. We take two virtual fields as examples, use CPLEX solver to solve the above four models as a whole, to obtain the optimal scheme, and also figure out the investment of the pipeline network. We further optimize the hierarchical optimization of the pipeline network with special constraints, then compare and analyze results obtained by the overall optimization. Finally, models are applied to an actual oil field and an actual gas field as examples to optimize the layout, which verifies the validity and feasibility of the models.
科研通智能强力驱动
Strongly Powered by AbleSci AI