A comprehensive bi-objective optimization model to design circular supply chain networks for sustainable electric vehicle batteries
Bibliographic record
Abstract
As electric vehicles (EVs) continue to advance, there is a growing emphasis on sustainability, particularly in the area of effectively managing the lifecycle of EV batteries. In this study, an efficient and novel optimization model was proposed for designing a circular supply chain network for EV batteries. In doing so, a comprehensive, bi-objective, mixed-integer linear programming model was employed. It is worth noting that the current model outlined in this paper involved both forward and reverse flows, illustrating the process of converting used batteries into their constituent materials or repurposing them for various applications. In line with the circular economy concept, the current model also minimized the total costs and carbon emission to develop an inclusive optimization framework. The LP-metric method was applied to solve the presented bi-objective optimization model. We simulated six problems with different sizes using data and experts' knowledge of a lithium-ion battery manufacturing industry in Canada, and evaluated the performance of the proposed model by simulated data. The results of the sensitivity analysis process of the objective functions coefficients showed that there was a balance between the two objective functions, and the costs should be increased to achieve lower emissions. In addition, the demand sensitivity analysis revealed that the increase in demand directly affects the increase in costs and emissions.
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.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.004 | 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".