Optimization Model for Integrated Municipal Solid Waste System Using Stochastic Chance-Constraint Programming under Uncertainty: A Case Study in Qazvin, Iran
Bibliographic record
Abstract
Municipal solid waste management (MSW) is a factor that affects environmental pollution and the spread of diseases in cities. Therefore, an efficient MSW management system results in reducing the cost of environmental impact by tackling the processes of waste collection, recycling, and disposal. In this study, a biobjective optimization model is developed which aims to minimize the costs of facility location and transportation planning and the emission of environmental pollutants. Furthermore, to consider the uncertain nature of the problem, demand or the volume of the generated waste is considered as a random parameter. As a result, a stochastic mathematical programming model with probable constraints is developed. To solve and validate the model, the ε-constraint approach has been employed. Moreover, for a real-world application of the proposed model, a case study is implemented in Qazvin, Iran. Finally, various problems are solved for different levels of reliability and an efficient MSW system is designed for each of them. Results show that the proposed method was able to achieve Pareto solutions where managers can decide to choose one of them based on their priorities in comparison with the current status. Moreover, results revealed cost and emission would be reduced by increasing confidence level. Finally, a comparison is made between our proposed ε-constraint method and one of the recently used solution approaches.
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.002 | 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".