Szczegóły publikacji
Opis bibliograficzny
Identification of proton exchange membrane fuel cell parameters using a parameterless swarm intelligent algorithm / Pankaj Sharma, Rohit SALGOTRA, Sarvanakumar Raju, Szymon ŁUKASIK, Amir H. Gandomi // W: Neural Information Processing : 31st International Conference, ICONIP 2024 : Auckland, New Zealand, December 2–6, 2024 : proceedings , Pt. 11 / eds. Mufti Mahmud, [et al.]. — Singapore : Springer Nature Singapore, cop. 2025. — ( Lecture Notes in Computer Science ; ISSN 0302-9743 ; vol. 15296 ). — ISBN: 978-981-96-6605-8; e-ISBN: 978-981-96-6606-5. — S. 116–132. — Bibliogr., Abstr. — Publikacja dostępna online od: 2025-06-24. — R. Salgotra - dod. afiliacja: Data Science Institute, University of Technology Sydney, Australia
Autorzy (5)
- Sharma Pankaj
- AGHSalgotra Rohit
- Raju Saravanakumar
- AGHŁukasik Szymon
- Gandomi Amir H.
Dane bibliometryczne
| ID BaDAP | 160856 |
|---|---|
| Data dodania do BaDAP | 2025-07-03 |
| DOI | 10.1007/978-981-96-6606-5_9 |
| Rok publikacji | 2025 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Wydawca | Springer |
| Konferencja | International Conference on Neural Information Processing 2024 |
| Czasopismo/seria | Lecture Notes in Computer Science |
Abstract
This work proposed a new hybrid parameterless optimization algorithm named the grey cuckoo differential (GCD) algorithm, using the components of the grey wolf optimizer (GWO), cuckoo search (CS), and differential evolution (DE). By integrating the strengths of these three algorithms, the hybrid model aims to obtain a balance between the exploration phase as well as exploitation phase, leading to greater convergence speed and a higher quality of the solution. The performance of GCD has been evaluated using the CEC 2017 and CEC 2019 benchmarks. In addition, three-proton exchange membrane fuel cell (PEMFC) stack parameter extraction experiments were performed to verify the performance and accuracy of the GCD algorithm. The results of the GCD algorithm are compared with the improved artificial humming bird algorithm (IHBO), young double-slit experiment (YDSE), subtraction average-based optimizer (SABO), artificial colony differential evolution optimizer (ABCDE), jDE100 (winner of CEC 2019 competition) and others to demonstrate its effectiveness. The GCD algorithm showed the lowest sum of square error (SSE) based on the comparison result. Finally, the mean absolute error (MAE), mean square error (MSE), root mean squared error (RMSE) and Friedman and Wilcoxon’s statistical tests show the robustness of the GCD algorithm with respect to other competitive algorithms found in the literature.
