Performance Assessment of Metaheuristic Algorithms: Firefly, Grey Wolf, and Moth Flame in Coal Pyrolysis Kinetic Parameter Estimation
Bibliographic record
Abstract
This study investigates the effectiveness of the Firefly Optimizer (FFA), Grey Wolf Optimizer (GWO), and Moth Flame Optimizer (MFO) metaheuristic algorithms in estimating the kinetic parameters of a single-step coal pyrolysis model. By examining the effects of the algorithmic configuration, the initial parameter estimates, and the search space size on the efficacy and efficiency of the optimization run, the research seeks to encourage the qualified engineering application of these algorithms in the field of pyrolysis modeling. Four critical analyses were conducted: convergence efficiency, robustness and repeatability, parameter tuning, and performance on noisy data. MFO and GWO had comparable fitness scores of 1.05×10-4 and 1.04×10-4 respectively in the optimisation run analysis, while FireFly Algorithm (FFA) fell behind with a score of 1.09×10-4. Regarding the calculation time, FFA showed better results than other optimizers with an execution time of 113.75 seconds. MFO showed initial promise in convergence analysis with speedy convergence, whereas GWO progressively enhanced its solutions. Additionally, GWO was shown to be the most dependable algorithm with the lowest values for average fitness score and execution time at 1.07×10-4 and 38.86 seconds. The combined values of standard deviation in fitness value and execution time for GWO were 1.07×10-6 and 0.35 indicating its robustness towards initial parameters. Similar to this, investigations on repeatability emphasized the reliability of the GWO method. Further, the parameter tuning assessments supported the balanced performance of GWO, and the studies of noise handling discovered GWO to be the most robust to noisy data. Overall, GWO is recommended as a one-stop average solution for the general engineered application; however, algorithm choice hinges on the specific requirement.
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.004 | 0.008 |
| 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.000 | 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".