Layout optimization of tree-tree gas pipeline network

被引:44
作者
Zhou, Jun [1 ]
Peng, Jinghong [1 ]
Liang, Guangchuan [1 ]
Deng, Tao [2 ]
机构
[1] Southwest Petr Univ, Coll Petr Engn, Chengdu, Sichuan, Peoples R China
[2] China Natl Petr Corp, Guangzhou Petr Training Ctr, Guangzhou, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Layout design; Two-level tree-tree pipeline network; Hierarchical optimization strategy; Delaunay triangulation; Discrete optimization; MODEL; ALGORITHM;
D O I
10.1016/j.petrol.2018.10.067
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
With the development of petroleum industry and the exploitation of unconventional gas reservoir, the topological form of surface pipeline network is changing gradually and a tree-tree structure is put forward in gas field. Therefore, optimization of the tree-tree pipeline network becomes urgent and indispensable. In this paper, a comprehensive optimization objective function and constraints is established to allow layout design. In view of the characteristics of the model comprising numerous discrete variables (e.g. location, number, allocation relationship, connection decision variable etc), a hierarchical optimization strategy is proposed to decompose it into three sub-problems. On the basis of the proposed model, an optimization program based on Delaunay triangulation has been presented to solve the non-linear constrained optimization problem which contains connection decision variable between wells in clusters on the constraint condition of path length restriction. Further, the reason of using Delaunay triangulation is analyzed and the optimization process of the essential sub-problem has been illustrated. Moreover, the developed program has been applied to a practical coalbed methane field project. The model and method in this paper is shown to be feasible and effective to solve layout optimization on two-level tree-tree pipeline network.
引用
收藏
页码:666 / 680
页数:15
相关论文
共 35 条
[1]  
[Anonymous], THESIS
[2]   Solving the p-median problem with a semi-Lagrangian relaxation [J].
Beltran, C. ;
Tadonki, C. ;
Vial, J. -Ph. .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2006, 35 (02) :239-260
[3]   Trained artificial neural network for glaucoma diagnosis using visual field data - A comparison with conventional algorithms [J].
Bizios, Dimitrios ;
Heijl, Anders ;
Bengtsson, Boel .
JOURNAL OF GLAUCOMA, 2007, 16 (01) :20-28
[4]   Solving the p-median bilevel problem with order through a hybrid heuristic [J].
Casas-Ramirez, Martha-Selene ;
Camacho-Vallejo, Jose-Fernando .
APPLIED SOFT COMPUTING, 2017, 60 :73-86
[5]   A branch-and-price algorithm for the capacitated p-median problem [J].
Ceselli, A ;
Righini, G .
NETWORKS, 2005, 45 (03) :125-142
[6]  
Daskin MS., 1995, NETWORK DISCRETE LOC
[7]  
Dijkstra E. W., 1959, Numer. Math, V1, P269, DOI [DOI 10.1007/BF01386390, 10.1007/BF01386390]
[8]   Reconsidering environmental diversity (ED) as a biodiversity surrogacy strategy [J].
Engelbrecht, Ian ;
Robertson, Mark ;
Stoltz, Marnus ;
Joubert, Johan W. .
BIOLOGICAL CONSERVATION, 2016, 197 :171-179
[9]   ALGORITHM-97 - SHORTEST PATH [J].
FLOYD, RW .
COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345
[10]   COMPUTING DIRICHLET TESSELLATIONS IN PLANE [J].
GREEN, PJ ;
SIBSON, R .
COMPUTER JOURNAL, 1978, 21 (02) :168-173