Optimal Design of Star-Tree Oil-Gas Pipeline Network in Discrete Space
Publication: Journal of Pipeline Systems Engineering and Practice
Volume 9, Issue 1
Abstract
Construction of oil-and-gas pipeline networks is an important topic in the field of oil and gas development. The rationality and economy of pipeline-network construction are becoming increasingly important. Generally, the investment required for constructing pipeline networks is more than 30% of the total investment required for the development of an oil-gas field. Therefore, based on the characteristics of pipeline networks, the design of oil-gas pipeline networks needs to be optimized to reduce the investment. In this study, considering the discrete characteristic of facility location in the pipeline network, a comprehensive and optimal mathematical model of the star-tree oil-gas pipeline network was established considering various constraints. From the standpoint of characteristics of the complex model comprising numerous discrete variables, a hierarchical-optimization strategy was presented to decompose the optimization problem into four subproblems. An optimization program was compiled. Furthermore, the developed optimization program was applied to a case study to demonstrate the optimization process of the subproblem well clustering. Finally, the optimization program helped in optimizing the pipeline-network layout of a practical project under the known or unknown station location conditions. The manual and optimal designs were compared. Consequently, the optimization model presented in this paper was proven to be an effective method to solve the optimization problem for the star-tree oil-gas pipeline network in a discrete space.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
The authors would like to express sincere acknowledgements to the National Natural Science Foundation of China (51704253) and the Young Scholars Development Fund of SWPU (201599010096) for the financial support in this project.
References
Alp, O., Erkut, E., and Drezner, Z. (2003). “An efficient genetic algorithm for the p-median Problem.” Ann. Oper. Res., 122(1–4), 21–42.
Beltran, C., Tadonki, C., and Vial, J. P. (2006). “Solving the p-median problem with a semi-Lagrangian relaxation.” Comput. Optim. Appl., 35(2), 239–260.
Bhaskaran, S., and Salzborn, F. J. (1979). “Optimal diameter assignment for gas pipeline networks.” Aus. Math. Soc. J., 21(2), 129–144.
Ceselli, A., and Righini, G. (2005). “A branch-and-price algorithm for the capacitated p-median problem.” Networks, 45(3), 125–142.
Correa, E. S., Steiner, M. T., Freitas, A. A., and Carnieri, C. (2001). “A genetic algorithm for the p-median problem.” Proc., 3rd Genetic and Evolutionary Computation Conf., Association for Computing Machinery, San Francisco.
Daskin, M. S. (1995). Network and discrete location: Models, algorithms, and applications, Wiley, New York.
Daskin, M. S., and Dean, L. K. (2005). “Location of health care facilities.” Operations research and health care: A handbook of methods and applications, Springer, Berlin, 43–76.
Dijkstra, E. W. (1959). “A note on two problems in connexion with graphs.” Numer. Math., 1(1), 269–271.
Floyd, R. W. (1962). “Algorithm 97: Shortest path.” Commun. ACM, 5(6), 345.
Han, J. Z., and Wang, Y. C. (1999). “The optimization design of the gathering network.” J. Southwest Pet. Univ. Sci. Technol. Ed., 21(3), 52–55 (in Chinese).
Hribar, M., and Daskin, M. S. (1997). “A dynamic programming heuristic for the p-median problem.” Eur. J. Oper. Res., 101(3), 499–508.
Leng, J. C., Liu, Y., and Zhao, H. J. (2001). “The topology optimization design of the oil and gas pipeline networks basing on the neural networks.” Petrol. Plann. Des., 12(6), 7–9 (in Chinese).
Li, B., et al. (2008). “Well division method basing on the particle swarm optimization.” Oil Gas Field Surf. Eng., 27(2), 36–37 (in Chinese).
Liu, Y., et al. (2003). “The topology optimization design of the oil and gas pipeline networks basing on the hybrid genetic algorithm.” Oil Gas Storage Transp., 22(6), 33–36 (in Chinese).
Liu, Y., and Cheng, G. D. (1989). “The topology optimization design of the N levels star network.” J. Dalian Univ. Technol., 29(2), 131–137 (in Chinese).
Liu, Y., and Guan, X. J. (1993). “The design optimization of the oil and gas gathering system.” Acta. Petrol. Sin., 14(3), 110–117 (in Chinese).
Merino, E. D., Pérez, J. M., and Aragonés, J. J. (2003). “Neural network algorithms for the p-median problem.” Proc., 11th European Symp. on Artificial Neural Networks, IEEE, New York, 385–392.
Michael, G. R., and David, S. J. (1979). Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Co., San Francisco.
Moreno-Perez, J. A., Roda Garcia, J. L., and Moreno-Vega, J. M. (1994). “Parallel genetic algorithm for the discrete p-median problem.” Stud. Locational Anal., 7, 131–141.
Murray, A. T., and Church, R. L. (1996). “Applying simulated annealing to location-planning models.” J. Heuristics, 2(1), 31–53.
Pan, H. L., and Yang, H. Y. (2002). “Gas gathering and transportation pipeline system optimization design.” Oil Gas Storage Transp., 21(4), 14–18 (in Chinese).
Resende, M. G. C., and Werneck, R. F. (2004). “A hybrid heuristic for the p-median problem.” J. Heuristics, 10(1), 59–88.
Rolland, E., Schilling, D. A., and Current, J. R. (1997). “An efficient tabu search procedure for the p-median problem.” Eur. J. Oper. Res., 96(2), 329–342.
Rosing, K. E., Revelle, C. S., and Schilling, D. A. (1999). “A gamma heuristic for the p-median problem.” Eur. J. Oper. Res., 117(3), 522–532.
Senne, E. L. F., Lorena, L. A. N., and Pereira, M. A. (2005). “A branch-and-price approach to p-median location problems.” Comput. Oper. Res., 32(6), 1655–1664.
Sun, X. X., et al. (2002). “Optimization study on oil-gas gathering and transporting system layout.” Oil Gas Storage Transp., 21(4), 28–30 (in Chinese).
Tansel, B. C., Francis, R. L., and Lowe, T. J. (1983). “Location on networks: A survey. I: The p-center and p-median problems.” Manage. Sci., 29(4), 482–497.
Wei, L. X., and Liu, Y. (2006). “The topological disorder optimization design of the oil and gas gathering system.” Oil J., 27(6), 120–124 (in Chinese).
Wu, H. L., et al. (2007). “Well pipeline networks group division basing on the genetic algorithms.” Pipeline Tech. Equip., 11(6), 1–2 (in Chinese).
Xu, G. D., and Liang, Z. (2004). “The layout optimization of the gas gathering pipeline network.” Petrol. Plann. Des., 15(6), 18–21 (in Chinese).
Yang, J. J., et al. (2008). “The topology optimization design of the stellate oil gathering pipeline network basing on the hybrid genetic algorithm.” J. Southwest Pet. Univ. Sci. Technol. Ed., 30(4), 166–169 (in Chinese).
Zhen, B. J., Liang, Z., and Deng, X. (2005). “The well division’s new approach of the natural gas gathering pipeline network.” Pipeline Tech. Equip., 6(3), 7–8 (in Chinese).
Zhou, J., et al. (2015). “Optimization of coal bed methane gathering system in China.” Adv. Mech. Eng., 6(2), 147381.
Information & Authors
Information
Published In
Journal of Pipeline Systems Engineering and Practice
Volume 9 • Issue 1 • February 2018
Copyright
©2017 American Society of Civil Engineers.
History
Received: Oct 28, 2016
Accepted: Jul 13, 2017
Published online: Nov 29, 2017
Published in print: Feb 1, 2018
Discussion open until: Apr 29, 2018
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.