Feasibility Study of Decentralized Lubrication System Design Through Branch and Bound and Genetic Algorithm for Turbomachinery Trains
Bibliographic record
Abstract
Abstract The lubrication system functions are crucial in a mechanical system, where friction needs to be controlled and managed. These functions include preventing excessive wear and tear, minimizing heat generation, and prolonging the machinery components’ lifespan. Improper lubrication can incur substantial costs in repairing damaged or replacing worn-out parts and unscheduled downtime. Although turbomachinery trains centralized circulating lubrication systems developed over half a century ago are reliable, they now require an updated design philosophy. These systems are challenged by issues such as low efficiency, complex piping networks, additional footprint space, and high costs. To address these issues, this study explores improvement methods employed in similar centralized industrial systems, like those in the energy and wastewater sectors. A common design trait of these systems is decentralization, transforming a large-scale centralized infrastructure into decentralized, smaller, localized units. These units can leverage local resources and distribute them according to specific requirements. Decentralization has demonstrated improvements in resilience, reliability, efficiency, cost-effectiveness, and environmental impact. Given the comparable challenges faced by centralized circulating lubrication systems, the feasibility of applying decentralization to lubrication systems was investigated. This paper introduces the concept of the decentralized lubrication system comprising multiple compact lubrication units that collectively satisfy the turbomachinery train lubrication demand. To identify the optimal decentralized combination of lubrication units, two optimization models using Branch-and-Bound and Genetic Algorithm techniques were developed. The objective of these models was to minimize three key parameters, namely footprint space, tank volume, and investment cost, while adequately meeting the overall lubrication demand (in terms of flow rate). The comparison between the optimized decentralized lubrication system and the existing centralized lubrication system revealed that the former offers significant improvements in the three key parameters. Furthermore, these optimization models demonstrated their adaptability by effectively identifying the optimal combinations of lubrication units for various lubrication demands.
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.000 |
| 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".