Performance analysis and optimization for CSDGB filling system of a beverage plant using particle swarm optimization
Bibliographic record
Abstract
The paper deals with the performance analysis and optimization for Carbonated Soft Drink Glass Bottle (CSDGB) filling system of a beverage plant using Particle Swarm Optimization (PSO) approach.The CSDGB system consists of seven main subsystems arranged in series namely Uncaser, Bottle Washer, Electronic Inspection Station, Filling Machine, Crowner, Coding Machine and Case Packer.Considering exponential distribution for probable failures and repairs, mathematical modeling is performed using Markov Approach (MA).The differential equations have been derived on the basis of probabilistic approach using transition diagram.These equations are solved using normalizing condition and recursive method to drive out the steady state availability expression of the system i.e. system's performance criterion.The performance optimization of system has been carried out by varying the number of particles and number of generations.It has been observed that the maximum availability of 90.27% is achieved at flock size of 55 and 90.84% at 300 th generation.Thus, findings of the paper will be useful to the plant management for execution of proper maintenance decisions.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".