Simulation optimization of an inventory control model for a reverse logistics system
Bibliographic record
Abstract
Nowadays, companies are recognizing their primordial roles and responsibilities towards the protection of the environment and save the natural resources. They are focusing on some contemporary activities such as Reverse Logistics which is economically and environmentally viable. However, the integration of such an initiative needs flows restructuring and supply chain management in order to increase sustainability and maximize profits. Under this background, this paper addresses an inventory control model for a reverse logistics system that deals with two separated types of demand, for new products and remanufactured products, with different selling prices. The model consists of a single shared machine between production and remanufacturing operations, while the machine is subject to random failures and repairs. Three stock points respectively for returns, new products and remanufactured products are investigated. Meanwhile, in this paper, a modeling of the problem with Discrete-Event simulation using Arena® was conducted. Regarding the purpose of finding, a near-optimal inventory control policy that minimizes the total cost, an optimization of the model based on Tabu Search and Genetic Algorithms was established. Computational examples and sensitivity analysis were performed in order to compare the results and the robustness of each proposed algorithm. Then the results of the two methods were compared with those of OptQuest® optimization tool.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".