Deriving to an Optimum Policy for Designing the Operating Parameters of Mahshahr Gas Turbine Power Plant Using a Self Learning Pareto Strategy
Bibliographic record
Abstract
In the last decades, analyzing and optimizing the power plants based on thermodynamic laws and intelligent control techniques absorb an incremental interest of researchers. This is because deriving the efficient operating parameters for designing and optimizing the performance of power plants will lead to an acceptable investment and avoiding from discarding the energy. However, there are a few areas of application of mathematical optimization method. Optimizing the governing equations and designing parameters of power plants simultaneously leads to a multi-objective problem in industry. Some of these objectives are nonlinear, non-convex and multi-modal with different type of real life engineering constraints. In this paper a new method called Synchronous Parallel Shuffling Self Organized Pareto Strategy Algorithm (SPSSOPSA) is presented which synthesized evolutionary computing, swarm intelligence techniques and Time Adaptive Self Organizing Map(TASOM) simultaneously incorporating with a data shuffling behavior. Thereafter it will be applied to verifying the optimum decision making for parameter designing of Mahshahr power plant that produced about 117MW electricity, sited in Iran, as a multi-objective and multi-modal problem. The results show the deep relation of the unit cost on the change of the operating parameters. Key words : Economic optimizing; Exergetic optimizing; Work output maximization; Evolutionary algorithm; Self organized map; Power plant
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.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 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".