Minimizing the bullwhip effect in a single product multistage supply chain using genetic algorithm
Bibliographic record
Abstract
Article history: Received March 20, 2014 Received in revised format November 18, 2015 Accepted November 18 2015 Available online November 18 2015 Supply chain management is important for companies and organizations to improve their business and lead competitiveness in the global marketplace. But demand variations in the supply chain are significant problem for most practitioners, planners, demand managers, and operations managers. Demand variations make forecasting and inventory management more difficult and tend to increase inventory levels. The supply chain (SC) profitability can be affected by the cost associated with large inventories, transportation, and production due to the bullwhip effect. Only bullwhip effect can lead to reduce the supply chain profitability in great amount. This paper represents a computational intelligence approach, which addresses the bullwhip effect in multistage supply chain. As a computational intelligence approach, Genetic Algorithm (GA) is employed to reduce the bullwhip effect. Through this approach, optimal order quantity in each stage is to be calculated by considering cost associated with bullwhip effect. Distorted information from one end of a supply chain can lead to tremendous inefficiencies to other end. In this paper it is shown that if each player of the supply chain orders or transfers optimum quantities for the upcoming period then the bullwhip effect can be reduced significantly. Growing Science Ltd. All rights reserved. 6 © 201
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.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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".