Mojtaba Ghasemi, Nima Khodadadi, Pavel Trojovský, Li Li, Zulkefli Mansor, Laith Abualigah, Amal H. Alharbi, El-Sayed M. El-Kenawy
{"title":"基尔霍夫定律算法(KLA):一种新的物理启发的非参数元启发式优化算法","authors":"Mojtaba Ghasemi, Nima Khodadadi, Pavel Trojovský, Li Li, Zulkefli Mansor, Laith Abualigah, Amal H. Alharbi, El-Sayed M. El-Kenawy","doi":"10.1007/s10462-025-11289-5","DOIUrl":null,"url":null,"abstract":"<div><p>This research introduces Kirchhoff’s Law Algorithm (KLA), a novel optimization method inspired by electrical circuit laws, particularly Kirchhoff’s Current Law (KCL). The KLA is evaluated using real-parameter test functions including CEC-2005, 2014, and 2017, comparing its performance with several established algorithms. Results from real-parameter and constrained benchmark functions affirm KLA’s accuracy and convergence rate superiority compared to other algorithms. Notably, when applied to the CEC-2005 benchmarks with dimensions ranging from 30 to 100, KLA demonstrates a remarkable ability to maintain population diversity throughout the search process within a feasible search space. Based on the average rank criteria, KLA consistently outperforms other algorithms despite its simplicity and lack of control parameters (aside from population size). This inherent simplicity makes KLA easy to use as-is, adaptable, and compatible with other optimization techniques. The source codes of the KLA algorithm are publicly available at https://nimakhodadadi.com/algorithms-%2B-codes.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 10","pages":""},"PeriodicalIF":13.9000,"publicationDate":"2025-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-025-11289-5.pdf","citationCount":"0","resultStr":"{\"title\":\"Kirchhoff’s law algorithm (KLA): a novel physics-inspired non-parametric metaheuristic algorithm for optimization problems\",\"authors\":\"Mojtaba Ghasemi, Nima Khodadadi, Pavel Trojovský, Li Li, Zulkefli Mansor, Laith Abualigah, Amal H. Alharbi, El-Sayed M. El-Kenawy\",\"doi\":\"10.1007/s10462-025-11289-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This research introduces Kirchhoff’s Law Algorithm (KLA), a novel optimization method inspired by electrical circuit laws, particularly Kirchhoff’s Current Law (KCL). The KLA is evaluated using real-parameter test functions including CEC-2005, 2014, and 2017, comparing its performance with several established algorithms. Results from real-parameter and constrained benchmark functions affirm KLA’s accuracy and convergence rate superiority compared to other algorithms. Notably, when applied to the CEC-2005 benchmarks with dimensions ranging from 30 to 100, KLA demonstrates a remarkable ability to maintain population diversity throughout the search process within a feasible search space. Based on the average rank criteria, KLA consistently outperforms other algorithms despite its simplicity and lack of control parameters (aside from population size). This inherent simplicity makes KLA easy to use as-is, adaptable, and compatible with other optimization techniques. The source codes of the KLA algorithm are publicly available at https://nimakhodadadi.com/algorithms-%2B-codes.</p></div>\",\"PeriodicalId\":8449,\"journal\":{\"name\":\"Artificial Intelligence Review\",\"volume\":\"58 10\",\"pages\":\"\"},\"PeriodicalIF\":13.9000,\"publicationDate\":\"2025-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s10462-025-11289-5.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Artificial Intelligence Review\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10462-025-11289-5\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-025-11289-5","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Kirchhoff’s law algorithm (KLA): a novel physics-inspired non-parametric metaheuristic algorithm for optimization problems
This research introduces Kirchhoff’s Law Algorithm (KLA), a novel optimization method inspired by electrical circuit laws, particularly Kirchhoff’s Current Law (KCL). The KLA is evaluated using real-parameter test functions including CEC-2005, 2014, and 2017, comparing its performance with several established algorithms. Results from real-parameter and constrained benchmark functions affirm KLA’s accuracy and convergence rate superiority compared to other algorithms. Notably, when applied to the CEC-2005 benchmarks with dimensions ranging from 30 to 100, KLA demonstrates a remarkable ability to maintain population diversity throughout the search process within a feasible search space. Based on the average rank criteria, KLA consistently outperforms other algorithms despite its simplicity and lack of control parameters (aside from population size). This inherent simplicity makes KLA easy to use as-is, adaptable, and compatible with other optimization techniques. The source codes of the KLA algorithm are publicly available at https://nimakhodadadi.com/algorithms-%2B-codes.
期刊介绍:
Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.