Applications of inexact programming methods to waste management under uncertainty: current status and future directions
Bibliographic record
Abstract
Waste management problems are subject to uncertainties presented as intervals, random variables and/or fuzzy sets. During the past 20 years, inexact programming methods have been developed and applied increasingly to waste management problems under uncertainty. To obtain a snapshot of these studies, this paper gives a review on recent developments, applications, challenges, and barriers associated with inexact programming techniques in supporting waste management. The results indicate that the majority of inexact programming methods can be categorized as two-stage stochastic programming, chance-constrained programming, fuzzy flexible programming, fuzzy robust programming, interval-parameter programming, mixed-integer programming, multiple-objective programming, and nonlinear programming. The demanding areas for future research efforts would include: expansion of conventional concepts to quantify uncertainties, integration of single inexact programming method with other programming methods to deal with multiple uncertainties and even complexities (e.g. nonlinearities and interactions), integration of inexact programming with other modeling techniques (e.g. life cycle assessment, multiple-criteria decision analyses, and waste flow simulation) to support sustainable waste management, development of more efficient algorithms to solve the proposed methods, linkage of waste management with its environmental impacts (e.g. air pollutants and GHG emissions as well as leachate pollution) within an inexact optimization framework, and applications of the developed methods to novel (e.g. specific types of wastes) or real-world waste management cases in different countries.
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.004 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".