Artificial Neural Networks as Metamodels for the Multiobjective Optimization of Biobutanol Production
Bibliographic record
Abstract
Process optimization using a physical process or its comprehensive model often requires a significant amount of time. To remedy this problem, metamodels, or surrogate models, can be used. In this investigation, a methodology for optimizing the biobutanol production process via the integrated acetone–butanol–ethanol (ABE) fermentation–membrane pervaporation process is proposed. In this investigation, artificial neural networks (ANNs) were used as metamodels in an attempt to reduce the time needed to circumscribe the Pareto domain and identify the best optimal operating conditions. Two different metamodels were derived from a small set of operating conditions obtained from a uniform experimental design. The first series of metamodels were derived to entirely replace the phenomenological model of the butanol fermentation process by representing the relationship that exists between five operating conditions and four performance criteria. The second series of metamodels were derived to estimate the initial concentrations under steady-state conditions for the eight chemical species within the fermenter in order to expedite convergence of the process simulator. The first series of metamodels led to an accurate Pareto domain and reduced the computation time to circumscribe the Pareto domain by a factor of 2500. The second series of metamodels led to only a small reduction of computation time (a factor of approximately 2) because of the inherently slow convergence of the overall fermentation process.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| 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".