A new model for logistics and transportation of fashion goods in the presence of stochastic market demands considering restricted retailers capacity
Bibliographic record
Abstract
In today’s world, using fashion goods is a vital of human. In this research, we focused on developing a scheduling method for distributing and selling fashion goods in a multi-market/multi-retailer supply chain while the product demands in markets are stochastic. For this purpose, a new multi-objective mathematical programming model is developed where maximizing the profit of selling fashion goods and minimizing delivering time and customer’s dissatisfaction are considered as objective functions. In continue due to the complexity of the problem, a number of metaheuristics are compared and a hybrid of Non-dominated Sorting Genetic Algorithm II (NSGAII) and simulated annealing is selected for solving the case studies. Then, in order to find the best values for input parameters of the algorithm, a Taguchi method is applied. In continue, a number of case studies are selected from literature review and solved by the algorithm. The outcomes are analyzed and it is found that using multi-objective models can find more realistic solutions. Then, the model is applied for a case study with real data from industry and outcomes showed that the proposed algorithm can be successfully applied in practice.
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.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.004 | 0.001 |
| Research integrity | 0.004 | 0.002 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
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".