The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Layout optimization of large-scale oil–gas gathering system based on combined optimization strategy
Abstract
Abstract Layout optimization of large-scale oil–gas gathering system is a kind of NP-hard problem in the field of system optimization. It involves a large number of network nodes, coupled optimization variables, complex network structures and hydraulic constraints, which cause the great difficulty in constructing optimization models and solution methods. In this paper, a high-dimensional mixed integer nonlinear layout optimization mathematical model involving the pipeline network structure parameters and pipeline design parameters is established, which can be applied to large-scale oil gathering system and gas gathering system universally. A modified particle swarm optimization (MPSO) algorithm with global search ability is proposed. The convergence theorem of the stochastic optimization algorithm is established based on the Poincare cycle theory. Global convergence of MPSO algorithm is proved, and the performance of MPSO algorithm is analyzed by numerical experiments. Based on dimension reduction planning and modularization thought, the grid dissection set partition method is proposed, and the theoretical foundation and complexity of the grid dissection method are discussed. In order to reduce the dimension of the layout optimization problem, the concept of the fuzzy set of adjacent position, and a novel approach for the well-station connection mode optimization are put forward. Based on the MPSO algorithm, grid dissection set partition method and solution method by fuzzy set of adjacent position, a combined optimization strategy for layout optimization model is proposed. The reliability and practicality of the proposed layout optimization model and combined optimization strategy are verified by the successful application of a real-world large-scale oil field with 661 wells.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
Friedman, M. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731944 · Cited by 2,785
A review of recent advances in global optimization
Floudas, C. A., & Gounaris, C. E. (2009) · Journal of Global Optimization · doi:10.1007/s10898-008-9332-8 · Cited by 455
Cited by
Dung beetle optimizer: a new meta-heuristic algorithm for global optimization
Xue, J., & Shen, B. (2023) · The Journal of Supercomputing · doi:10.1007/s11227-022-04959-6 · Cited by 1,686
Song, B., Wang, Z., & Zou, L. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106960 · Cited by 441
A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm
Zeng, N., Wang, Z., Liu, W., Zhang, H., Hone, K., & Liu, X. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3029748 · Cited by 269
Metadata
- Authors
- Liu, Y., Chen, S., Guan, B., & Xu, P.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2019-03
- Volume
- 332
- Pages
- 159-183
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W2907039237
- Cited by
- 188
- References
- 2
- FWCI
- 17.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Layout optimization of large-scale oil–gas gathering system based on combined optimization strategy. https://app.cochat.ai/papers/10.1016/j.neucom.2018.12.021
- The paper
- Liu, Y., Chen, S., Guan, B., & Xu, P. (2019). Layout optimization of large-scale oil–gas gathering system based on combined optimization strategy. Neurocomputing. https://doi.org/10.1016/j.neucom.2018.12.021
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.