The effects of different kinds of returns on an integrated chance-constrained stochastic mobile phone closed-loop supply chain configuration and supplier selection
Bibliographic record
Abstract
One of the important concerns in the world is E-waste. Ending up e-waste in the landfill and inappropriate disposing of it are hazardous to the environment. The goal of this research is to design and optimize a multi-period, multi-product, multi-echelon, and multi-customer Closed-Loop Supply Chain (CLSC) network for a mobile phone network considering different types of product returns. Commercial, end of life, and end-of-use returns are well-known in practice. In this research, a multi-objective mixed-integer linear programming formulation with stochastic demand and return is proposed to maximize the total profit in the mobile phone CLSC network, alongside maximizing the weights of eligible suppliers which are estimated based on a fuzzy method for efficient supplier selection and order allocation. Chance-constraint programming is applied in order to deal with the stochastic demand and return. Moreover, distance method and εε-constraint technique are employed to solve the proposed multi-objective problem. The application of the proposed mathematical model is illustrated in Toronto, Canada using real maps.
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.004 |
| 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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".