Multi-Objective Optimization of Natural Gas Compression Power Train With Genetic Algorithms
Bibliographic record
Abstract
Multi-objective optimizations were conducted for a compressor station comprising two dissimilar compressor units driven by two dissimilar gas turbines, two coolers of different size, and two parallel pipeline sections to the next station. Genetic Algorithms were used in this optimization along with detailed models of the performance characteristics of gas turbines, compressors, aerial coolers, and downstream pipeline section. Essential in these models is the heat transfer between the gas and soil as it affects the pressure drop along the pipeline, and hence relates back to the coolers and compressor flow/pressure settings. Further investigative techniques were developed to refine the methodology as well as to minimize the downstream gas temperature at the suction of the next station. Current operating conditions at the station were compared to the optimized settings, showing that there is room for improving the efficiency of operation (i.e. lower energy consumption) with minimum effort on the station control strategy. Two threshold throughput conditions were determined in so far as single vs. multi-unit operations due to the dissimilarity in the compressor units and associated gas turbine drivers. The results showed that savings in the energy consumption in the order of 5–6% is achievable with slight adjustment to unit load sharing and coolers by-pass/fan speed selections. It appears that most of the savings (around 70–75%) are derived from optimizing the load sharing between the two parallel compressors, while the balance of the savings is realized from optimizing the aerial coolers settings. In particular, operating the aerial coolers at 50% fan speed (if permitted) could lead to substantial savings in electric energy consumption in some cases.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".