Optimizing the WEEE Recovery Network Associated with Environmental Protection Awareness and Government Subsidy by Nonlinear Mixed Integer Programming
Bibliographic record
Abstract
Recovery of waste electrical and electronic equipment (WEEE) plays an important role in protecting environment and conserving resources. Design of a more efficient WEEE recovery system is an imperative need for the relevant decision-makers, such as alleviation of overcapacity or insufficient recycling in many developing countries. In this paper, we optimize the WEEE recovery network which is associated with recycling prices and government subsidies by a nonlinear mixed integer programming approach. An integrated model is first proposed to formulate a design problem of WEEE recovery network, being involved with collection centers, two types of transfer stations, processing centers, incineration plants, landfill plants, secondhand product markets, and government subsides. The recycling prices and the transported quantities of WEEE (the number of batches) are endogenous variables of the model, being subject to a number of practical constraints. For solving this model, an algorithm is developed based on the branch and bound method. Scenario analysis and numerical experiments indicate that: (1) appropriate capacities of transfer stations can be provided by the proposed model for designing an environmentally and economically efficient WEEE recycling system, especially for alleviating the existing overcapacity or insufficient recycle. (2) An optimal governmental subsidy can be obtained in virtue of the proposed model and algorithm. (3) Diversity of transportation modes and permission of more than one mode in the same delivery route can greatly reduce the cost of recycling WEEE. (4) Preferred awareness of environmental protection can increase the profit and the recycled quantities, as well as reduction of the total recycling cost.
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.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| 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".