Designing profitable and responsive supply chains under uncertainty
Bibliographic record
Abstract
In this paper, we develop a multi-objective two-stage stochastic programming model, which takes into account the selection of warehouse and retailer sites and the decision about production levels, inventory levels, and shipping quantities among the entities of the supply chain network. The first objective function is to maximise the chain’s total profit over multiple periods, and the second objective function is to minimise the total travel times for unsatisfied customers, whose demands must be met by retailers which have been established in other markets, to maximise the chain’s responsiveness. Demands, selling prices and productions times at manufacturing sites are all considered as uncertain parameters. The two objective functions are in conflict with each other, and we use ϵ-constraint method to generate a set of Pareto optimal solutions for the proposed multi-objective problem. We then generalise the case and assume the uncertain parameters are continuously distributed random variables and use a simulation approach called sample average approximation (SAA) scheme to compute near optimal solutions to the stochastic model with potentially infinite number of scenarios. A computational study involving hypothetical networks of different sizes and a real supply chain network are presented to highlight the efficiency of the proposed solution methodology.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".