Optimizing Renewable Injection in Integrated Natural Gas Pipeline Networks Using a Multi-Period Programming Approach
Bibliographic record
Abstract
In this paper, we propose an optimization model that considers two pathways for injecting renewable content into natural gas pipeline networks. The pathways include (1) power-to-hydrogen or PtH, where off-peak electricity is converted to hydrogen via electrolysis, and (2) power-to-methane, or PtM, where carbon dioxide from different source locations is converted into renewable methane (also known as synthetic natural gas, SNG). The above pathways result in green hydrogen and methane, which can be injected into an existing natural gas pipeline network. Based on these pathways, a multi-period network optimization model that integrates the design and operation of hydrogen from PtH and renewable methane is proposed. The multi-period model is a mixed-integer non-linear programming (MINLP) model that determines (1) the optimal concentration of hydrogen and carbon dioxide in the natural gas pipelines, (2) the optimal location of PtH and carbon dioxide units, while minimizing the overall system cost. We show, using a case study in Ontario, the optimal network structure for injecting renewable hydrogen and methane within an integrated natural gas network system provides a $12M cost reduction. The optimal concentration of hydrogen ranges from 0.2 vol % to a maximum limit of 15.1 vol % across the network, while reaching a 2.5 vol % at the distribution point. This is well below the maximum limit of 5 vol % specification. Furthermore, the optimizer realized a CO2 concentration ranging from 0.2 vol % to 0.7 vol %. This is well below the target of 1% specified in the model. The study is essential to understanding the practical implication of hydrogen penetration in natural gas systems in terms of constraints on hydrogen concentration and network system costs.
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.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".