A Modified SSLPS Algorithm with Logistic Pseudo-Random Sequence Generator for Improving the Performance of Neka Power Plant
Bibliographic record
Abstract
Metaheuristic techniques have successfully contributed to the development and optimization of large-scale distributed power systems. The archived literature demonstrate that the modification or tuning of the parameters of specific metaheuristics can provide powerful tools suited for optimization of power plants with different types of constraints. In spite of the high potential of metaheuristics in dealing with such systems, most of the conducted researches only address the optimization of the electrical aspects of power systems. In this research, the authors intend to attest the applicability of metaheuristics for optimizing the mechanical aspects of a real-world large-scale power plant, i.e. Neka power plant sited in Mazandaran, Iran. To do so, firstly, based on the laws of thermodynamics and the physics of the problem at hand, the authors implement a mathematical model to calculate the values of exergetic efficiency, energetic efficiency, and total cost of the Neka power plant as three main objective functions. Besides, a memetic supervised neural network and Bahadori's mathematical model are used to calculate the dynamic values of specific heat over the operating procedure of the power plant. At the second stage, a modified version of a recent spotlighted Pareto based multiobjective metaheuristic called synchronous self-learning Pareto strategy (SSLPS) is proposed. The proposed technique is based on embedding logistic chaotic map into the algorithmic architecture of SSLPS. In this context, the resulting optimizer, i.e. chaos-enhanced SSLPS (C-SSLPS), uses the response of time-discrete nonlinear logistic map to update the positions of heuristic agents over the optimization procedure. For the sake of comparison, strength Pareto evolutionary algorithm (SPEA 2), non-dominated sorting genetic algorithm (NSGA-II) and standard SSLPS are taken into account. The results of the numerical study confirm the superiority of the proposed technique as compared to the other rival optimizers. Besides, it is observed that metaheuristics can be successfully used for optimizing the mechanical/energetic parameters of Neka 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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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".