Large Pipeline Network Optimization: Summary and Conclusions of TransCanada Research Effort
Bibliographic record
Abstract
Operation of large gas pipeline networks calls for fulfilling variation in contractual volume obligations, and maintaining a certain range of linepack with minimum fuel consumptions to drive compressor units. This is often achieved with either operational experience or by utilization of optimization tools, which results in reduced hydraulic analysis time as well as improved pipeline operation as a whole. The main objective is to accurately identify the optimum set points for all compressor stations, control and block valves in the network, subject to several system and operational constraints. This implies multi-objective optimization of a highly constrained network with a large number of decision variables. Over the past three years, TransCanada has devoted a research effort in developing/integrating an optimization tool based on stochastic methods. It was found that it offers greater stability and is more suited for multi-objective optimizations of large networks with inherently large number of decision variables, than any gradient-based method. This paper describes the nature of the pipeline system under optimization, and discusses the basis for a Genetic-Algorithm-based tool employed. It summarizes the results of the past three years of research efforts outlining the selection criteria for the optimization parameters, integration with a robust steady-state thermal hydraulic simulator of the pipeline network and the notion that dynamic penalty parameters can affect convergence. The methodology is applied to a large gas pipeline network containing 22 compressor stations resulting in 54 decision variables and an optimization space of 1.85×1078 cases. Comparison of genetic algorithm optimization with traditional and manual optimization is demonstrated. Extensive effort has been devoted to reduce the computation time, which includes techniques to utilize various hybrid surrogate methods such as Kriging, Neural Networks, Response Surface, as well as exploitation of parallel processing.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".