An integrated reliable four-level supply chain with multi-stage products under shortage and stochastic constraints
Bibliographic record
Abstract
In this paper, we design and optimise an integrated four-level Supply Chain (SC), which contains a supplier, a producer, a wholesaler and multiple retailers. The levels cooperate to make an Integrated SC (ISC) so that the inventory cost is minimised and the reliability is maximised, simultaneously. The model is constrained by real stochastic constraints on total space, number of orders, procurement cost, shortage cost, setup cost and production capacity. An Lp-Metric function converts the reliability function and cost function into a single-objective function to optimise the number of stockpiles and period lengths. The designed ISC is a large-scale Nonlinear Programming (NLP) and hard to solve by generic methods. Accordingly, two algorithms, entitled ‘Sequential Quadratic Programming (SQP)’ and ‘Interior Point (IP)’ with super-linear convergence rates are applied for finding the optimum solution. The performance of proposed algorithms is compared based on optimality criteria. Findings showed that the obtained solutions by SQP algorithm have better performance than IP algorithm in terms of optimality error and solution quality. However, the number of taken iterations by IP is less than SQP algorithm. Finally, the result of sensitivity analyses confirmed the excellent performance of the presented methods for solving the large-scale NLP models.
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.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.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 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".