Multi-Objective Optimization of Large Pipeline Networks Using Genetic Algorithm
Bibliographic record
Abstract
This paper presents application of Genetic Algorithm (GA) methodologies to multi-objective optimization of two complex gas pipeline networks to achieve specific operational objectives. The first network contains 10 compressor stations resulting in 20 decision variables and an optimization space of 6.3 × 1029 cases. The second system contains 25 compressor stations resulting in 54 decision variables and an optimization space of 1.85 × 1078 cases. Compressor stations generally included multiple unit sites, where the compressor characteristics of each unit is taken into account constraining the solution by the surge and stonewall limits, maximum and minimum speeds and maximum power available. A key challenge to the optimization of such large systems is the number of constraints and associated penalty functions, selection of the GA operators such as crossover, mutation, selection criteria and elitism, as well as the population size and number of generations. The paper discusses the approach taken to arrive at optimal values for these parameters for large gas pipeline networks. Examples for two-objective optimizations, referred to as Pareto fronts, include maximum throughput and minimum fuel, as well as, minimum linepack and maximum throughput in typical linepack/throughput/fuel envelopes.
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.001 |
| 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.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".