Optimisation of the Single-Vendor Single-Buyer Supply Chain System under Fuzzy Demand Using Optimisation–Simulation Closed Loop Technique
Bibliographic record
Abstract
This research aims to model and optimise the most applicable supply chain system, which is a single-vendor single-buyer system with fuzzy buyer demand. An optimisation model of the supply chain system under consideration is built by formulating the objective function, which is minimising the joint total cost between a buyer and a vendor. The model is developed on the basis of a simulation system, and optimisation is carried out by utilising a Genetic Algorithm that has been embedded in the simulation system. This technique is called optimisation–simulation closed loop. The vendor actual condition, which deals with uncertain demands from the main buyer and other small buyers, is considered. To analyse timely supply chain events, a simulation system is developed. A new optimisation model for the single-vendor single-buyer supply chain system with fuzzy demand is developed on the basis of the simulation system. The use of optimisation–simulation closed loop is also a new finding. In this study, the optimisation model of the supply chain under consideration is developed by taking into account a specific condition in which the vendor receives demands from the main buyer and other small buyers. Naturally, buyer demand is uncertain and has been modelled using a fuzzy set. The use of optimisation–simulation closed loop enables the supply chain to make the optimum decision when at the steady state condition.
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.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".