Minimization of energy use in pipeline operations-an application to natural gas transmission system
Bibliographic record
Abstract
We aim to determine the pipeline operation configurations requiring the minimum amount of energy (e.g. fuel, power) needed to operate the equipment at compressor stations for given transportation requirements. Considering the problem as a search for the optimal operation conditions, speedup of the process can be achieved by careful formulation of the search model and integration of knowledge about the application into the search control. Knowledge incorporation will not only be used to reduce the solution space and guide the search process but also to create heuristics that characterize a proper initial state for every search. Due to the complexity of the fuel cost function (non-convex, non-smooth) selection and proper design of the search paradigm to solve the optimization problem is crucial. Genetic algorithms have been chosen as initial optimization technique to address the optimization problem. Each candidate solution generated by the search algorithm will be evaluated by a hydraulic model that simulates the steady state gas flow in the pipeline network to obtain the reaction of the system at specific control nodes and determine the feasibility of the given solution and perhaps evaluate if it is near-to-optimal. The new method will assist in the optimization of pipeline operations by providing a portfolio of feasible near-to-optimum solutions to decision makers in a timely manner. This set of solutions will represent the network operation conditions that decrease energy consumption. Reduction of energy use will not only have a tremendous economical impact but, nevertheless an environmental one: the more efficient the use of compressors stations is the less greenhouse emissions are dissipated.
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.000 | 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".