Optimal Production Planning and Pollution Control in Petroleum Refineries Using Mathematical Programming and Dispersion Models
Bibliographic record
Abstract
Oil refineries, producing a large variety of products, are considered as one of the main sources of air contaminants such as sulfur oxides (SOx), hydrocarbons, nitrogen oxides (NOx), and carbon dioxide (CO2), which are primarily caused by fuel combustion. Gases emanated from the combustion of fuel in an oil refinery need to be reduced, as it poses an environmental hazard. Several strategies can be applied in order to mitigate emissions and meet environmental regulations. This study proposes a mathematical programming model to derive the optimal pollution control strategies for an oil refinery, considering various reduction options for multiple pollutants. The objective of this study is to help decision makers select the most economic pollution control strategy, while satisfying given emission reduction targets. The proposed model is tested on an industrial scale oil refinery sited in North Toronto, Ontario, Canada considering emissions of NOx, SOx, and CO2. In this analysis, the dispersion of these air pollutants is captured using a screening model (SCREEN3) and a non-steady state CALPUFF model based on topographical and meteorological conditions. This way, the impacts of geographic location on the concentration of pollutant emissions were examined in a realistic way. The numerical experiments showed that the optimal production and pollution control plans derived from the proposed optimization model can reduce NOx, SOx, and CO2 emission by up to 60% in exchange of up to 10.7% increase in cost. The results from the dispersion models verified that these optimal production and pollution control plans may achieve a significant reduction in pollutant emission in a large geographic area around the refinery site.
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.001 | 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.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".