Designing a multi-objective mathematical model of a perishable supply chain (PSC) in a state of uncertainty
Bibliographic record
Abstract
Purpose The pharmaceutical industry is one of the most essential areas of health in any country. It is defined as a system of processes, operations and organizations involved in discovering, developing and producing drugs. The supply chain in the pharmaceutical field is one of the most important strategic issues in the pharmaceutical and health-care industries. The purpose of this study is to reduce the total cost of the supply chain network and reduce the amount of distribution scheduling. Design/methodology/approach In this study, the authors designed a drug supply chain network with uncertainty-related corruption. The optimal number and location of potential facilities, the optimal allocation of flow between facilities, the optimal routing of vehicles and the optimal amount of inventory in production and distribution center warehouses were determined to achieve these two objective functions. Findings In evaluating the small sample size problem, it was found that the comprehensive benchmarking method was more efficient than the other methods in obtaining the mean index of the first objective function. The utility function method has also proved its efficiency in obtaining the mean of the second objective function indices, the spacing index and the computational time. Because of the inefficiency of GAMS software in resolving size issues, the modified NSGA II and MOPSO algorithms with modified priority-based encryption have been used. First, using the Taguchi method, the initial parameters of the metaheuristic algorithms are adjusted, and then, 15 sample problems are designed in larger sizes. To avoid generating random data, five problems were equally designed, and the averages of objective functions and metrics of met heuristic algorithms (number of efficient solutions, maximum expansion index, spacing index and computational time) were analyzed as the basis of evaluation and comparison. Therefore, using all the indicators and results of the NSGA II algorithm is recommended. Originality/value In this research, a biobjective modeling approach is proposed to minimize the total costs of the supply chain network (construction costs, storage costs and product transportation costs between centers) and advertising costs and to minimize distribution and transportation scheduling across each level of the supply chain network.
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.003 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.003 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 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".