基于惩罚最小生成树的天然气集输管网规划模型
A planning model of natural gas gathering pipeline network based on penalty minimum spanning tree
-
摘要: 针对天然气集输管网的优化问题, 采用K-means聚类算法对天然气田区域内的井口进行分簇, 在Prim算法的基础上提出了惩罚最小生成树算法, 建立了天然气集输管网规划模型, 并给出了天然气管网规划代价函数, 采用迭代逼近的思想, 从全局优化的角度, 对天然气集输管网规划问题进行研究, 借助SPSS与Matlab软件对模型进行了程序实现。结果表明: 利用惩罚最小生成树模型规划的天然气集输管网与传统星枝状结构的天然气管网相比代价更小, 具有一定的可行性与灵活性, 能够为天然气集输系统的工程建设与成本优化提供参考依据。Abstract: To optimize natural gas gathering pipeline networks, the wellheads in the area of a natural gas field were clustered by means of K-means clustering algorithm and the penalty minimum spanning tree algorithm was proposed based on the Prim algorithm. Furthermore, a natural gas pipeline network planning model was established and the cost function of natural gas pipeline network planning was deduced. Then, from the view point of global optimization, the natural gas pipeline network planning was studied according to the concept of iterative approximation. Finally, the program of the model was worked out by virtue of SPSS and Matlab software. It is indicated that compared with the traditional natural gas pipeline network of star-dendritic structure, the natural gas gathering pipeline network planned by the penalty minimum spanning tree model is more feasible and flexible with less cost. It can provide the reference for the engineering construction and cost optimization of natural gas gathering system.