Modelling to Generate Alternatives Using Simulation-Driven Optimization: An Application to Waste Management Facility Expansion Planning
Bibliographic record
Abstract
Public sector decision-making typically involves complex problems that are riddled with competing performance objecttives and possess design requirements which are difficult to capture at the time that supporting decision models are constructed. Environmental policy formulation can prove additionally complicated because the various system components often contain considerable stochastic uncertainty and frequently numerous stakeholders exist that hold completely incompatible perspectives. Consequently, there are invariably unmodelled performance design issues, not apparent at the time of the problem formulation, which can greatly impact the acceptability of any proposed solutions. While a mathematically optimal solution might provide the best solution to a modelled problem, normally this will not be the best solution to the underlying real problem. Therefore, in public environmental policy formulation, it is generally preferable to be able to create several quantifiably good alternatives that provide very different approaches and perspectives to the problem. This study shows how a computationally efficient simulation-driven optimization approach that com- bines evolutionary optimization with simulation can be used to generate multiple policy alternatives that satisfy required system criteria and are maximally different in decision space. The efficacy of this modelling-to-generate-alternatives method is specifically demonstrated on a municipal solid waste management facility expansion case.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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.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".