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 e...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	The Artificial intelligence review Ročník 58; číslo 10; s. 325
Hlavní autoři:	Ghasemi, Mojtaba, Khodadadi, Nima, Trojovský, Pavel, Li, Li, Mansor, Zulkefli, Abualigah, Laith, Alharbi, Amal H., El-Kenawy, El-Sayed M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Dordrecht Springer Netherlands 26.07.2025 Springer Nature B.V
Témata:	Algorithms Artificial Intelligence Behavior Benchmarks Chemical reactions Circuits Computer engineering Computer Science Convergence Genetic algorithms Heuristic methods Law Methodological problems Multiculturalism & pluralism Novels Optimization Optimization algorithms Parameters Physics Power supply Search process Simplicity Kirchhoff’s Law Algorithm (KLA) Engineering problems Optimization Optimal engineering design
ISSN:	1573-7462, 0269-2821, 1573-7462
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	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 .
AbstractList	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. 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 .
ArticleNumber	325
Author	Mansor, Zulkefli Trojovský, Pavel Alharbi, Amal H. Li, Li Ghasemi, Mojtaba Abualigah, Laith Khodadadi, Nima El-Kenawy, El-Sayed M.
Author_xml	– sequence: 1 givenname: Mojtaba surname: Ghasemi fullname: Ghasemi, Mojtaba organization: Department of Electronics and Electrical Engineering, Shiraz University of Technology – sequence: 2 givenname: Nima surname: Khodadadi fullname: Khodadadi, Nima email: Nima.khodadadi@miami.edu organization: Department of Civil and Architectural Engineering, University of Miami – sequence: 3 givenname: Pavel surname: Trojovský fullname: Trojovský, Pavel organization: Department of Mathematics, Faculty of Science, University of Hradec Králové – sequence: 4 givenname: Li surname: Li fullname: Li, Li organization: Faculty of Engineering and Information Technology, University of Technology – sequence: 5 givenname: Zulkefli surname: Mansor fullname: Mansor, Zulkefli organization: Centre for Software Technology and Management, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia – sequence: 6 givenname: Laith surname: Abualigah fullname: Abualigah, Laith organization: Computer Science Department, Al Al-Bayt University – sequence: 7 givenname: Amal H. surname: Alharbi fullname: Alharbi, Amal H. organization: Department of Computer Sciences, College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University – sequence: 8 givenname: El-Sayed M. surname: El-Kenawy fullname: El-Kenawy, El-Sayed M. organization: School of ICT, Faculty of Engineering, Design and Information & Communications Technology (EDICT), Applied Science Research Center, Applied Science Private University
BookMark	eNp9ULtOwzAUtVCRaAs_wGSJBQaDH3HcsFUVL7USC8yWk9qNqyQOdgoqYuA3-D2-BEOQysR07j06D-mMwKBxjQbgmOBzgrG4CAQnKUWYckQInWSI74Eh4YIhEfnBn_sAjEJYY4w5TdgQvM2tL8rSGfP5_hFgpV6gqlbO266s4el8MT27hAo27llXsC23wRYB2Sa01utlpBvUKq9q3XlbwAiq1BtvQxe_XYxxHrq2s7V9VZ11DWy9yytdh0Owb1QV9NEvjsHj9dXD7BYt7m_uZtMFKhhJO7RMjMj1ROdLTokmaS74RBmuWEYSlhktuKKYc5FGWUZoXmQqcizLRcENx4aNwUmfG4ufNjp0cu02vomVklHGOGeJSKOK9qrCuxC8NrL1tlZ-KwmW3yvLfmUZV5Y_K0seTaw3hShuVtrvov9xfQG2gITV
Cites_doi	10.1109/TEVC.2009.2033580 10.1016/j.jestch.2025.102053 10.1016/j.eswa.2018.10.050 10.1016/j.eswa.2021.115292 10.1016/j.knosys.2019.105190 10.1007/s00521-022-07405-z 10.1109/ICNN.1995.488968 10.1109/CEC48606.2020.9185577 10.1007/s10586-023-04221-5 10.1016/j.compstruc.2012.07.010 10.1007/s00500-023-08202-z 10.1016/j.knosys.2015.07.006 10.1109/TEVC.2008.919004 10.1007/s10462-016-9486-6 10.1038/s41598-022-14338-z 10.1016/j.cma.2022.114616 10.1016/j.swevo.2020.100693 10.1007/s10489-020-01898-8 10.1109/ACCESS.2022.3212081 10.1155/2018/1806947 10.1016/j.asoc.2012.11.026 10.1016/j.advengsoft.2018.04.007 10.1007/s42235-023-00386-2 10.1016/j.asoc.2020.106392 10.1016/j.engappai.2019.103294 10.1016/j.advengsoft.2017.01.004 10.1109/ACCESS.2020.2973197 10.1016/B978-0-32-395365-8.00031-2 10.1016/j.future.2019.07.015 10.1109/CEC48606.2020.9185583 10.1016/j.advengsoft.2013.12.007 10.1016/j.engappai.2019.01.001 10.1109/ICRERA52334.2021.9598773 10.32604/cmc.2021.013836 10.32604/cmc.2022.023030 10.1093/comjnl/bxy133 10.1016/j.knosys.2022.110248 10.1016/j.advengsoft.2022.103282 10.1007/s11831-023-10060-9 10.1016/j.eswa.2022.119015 10.1016/j.cma.2023.116446 10.1016/j.asoc.2019.03.012 10.1016/j.apm.2015.10.040 10.1016/j.apm.2019.10.026 10.1080/03052150410001647966 10.1016/j.knosys.2020.106619 10.1002/wics.70028 10.1016/j.eswa.2009.06.044 10.3390/math10193466 10.1016/j.engappai.2022.105075 10.1016/j.ijepes.2012.06.013 10.5120/ijca2016909119 10.1016/j.eswa.2021.114864 10.1016/j.apm.2018.06.036 10.1016/j.advengsoft.2017.07.002 10.1016/j.knosys.2022.110146 10.3390/app8030329 10.1016/j.eswa.2023.120069 10.1016/j.disopt.2016.01.005 10.1016/j.ins.2009.03.004 10.1016/j.engappai.2022.105622 10.1016/j.eswa.2020.113902 10.1016/j.aej.2023.07.066 10.1007/s00521-023-08229-1 10.1016/j.cma.2012.12.009 10.3390/biomimetics8030321 10.1016/j.asoc.2020.106761 10.1007/s00366-020-01179-5 10.1016/j.advengsoft.2017.03.014 10.1007/s12652-021-03391-7 10.1016/j.jestch.2023.101551 10.1016/j.asoc.2015.06.056 10.1016/j.asoc.2010.04.024 10.1016/j.eswa.2023.122070 10.1016/j.cma.2021.114194 10.1016/j.eswa.2023.122147 10.1016/j.knosys.2022.110032 10.1109/CEC48606.2020.9185632 10.1007/s10845-010-0393-4 10.1007/s10586-024-04602-4 10.1016/j.eswa.2023.122200 10.1016/j.eswa.2020.113917 10.1109/ACCESS.2019.2918753 10.1016/j.future.2020.03.055 10.1016/j.ecoinf.2006.07.003 10.1109/ACCESS.2022.3146374 10.1109/CEC48606.2020.9185743 10.1023/A:1008202821328 10.1109/CEC48606.2020.9185566 10.1016/j.knosys.2023.111081 10.1155/2020/1450985 10.1016/j.knosys.2018.06.001 10.1016/j.engappai.2020.103718 10.1016/j.engappai.2013.02.002
ContentType	Journal Article
Copyright	The Author(s) 2025 The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: The Author(s) 2025 – notice: The Author(s) 2025. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	C6C AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABUWG AFKRA ALSLI ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU CNYFK DWQXO E3H F2A FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L7M L~C L~D M0C M0N M1O P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PRQQA PSYQQ Q9U
DOI	10.1007/s10462-025-11289-5
DatabaseName	Springer Nature OA Free Journals CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Central (Alumni) ProQuest Central UK/Ireland Social Science Premium Collection Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection Technology collection ProQuest One Library & Information Science Collection ProQuest Central Library & Information Sciences Abstracts (LISA) Library & Information Science Abstracts (LISA) Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Library Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Proquest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business (UW System Shared) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest One Social Sciences ProQuest One Psychology ProQuest Central Basic
DatabaseTitle	CrossRef ProQuest Business Collection (Alumni Edition) ProQuest One Psychology Computer Science Database ProQuest Central Student Library and Information Science Abstracts (LISA) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences Library & Information Science Collection ProQuest Central (New) Advanced Technologies & Aerospace Collection Business Premium Collection Social Science Premium Collection ABI/INFORM Global ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Library Science ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ProQuest One Social Sciences ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ProQuest Business Collection (Alumni Edition)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Physics Law
EISSN	1573-7462
ExternalDocumentID	10_1007_s10462_025_11289_5
GroupedDBID	.4S .86 .DC .VR 06D 0R~ 0VY 1N0 203 23N 2J2 2JY 2KG 2LR 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6J9 6NX 77I 77K 7WY 8FL 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AAFWJ AAHNG AAIAL AAJKR AAJSJ AAKKN AANZL AARTL AASML AATVU AAUYE AAWCG AAYIU AAYQN AAYZH ABBBX ABBXA ABDBE ABDZT ABECU ABEEZ ABFSG ABFTD ABFTV ABHLI ABHQN ABIVO ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABWNU ABXPI ACACY ACGFS ACHSB ACHXU ACIHN ACKNC ACMDZ ACMLO ACOKC ACOMO ACREN ACSNA ACSTC ACULB ADHHG ADHIR ADIMF ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEAQA AEFQL AEGAL AEGNC AEJHL AEJRE AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFGXO AFHIU AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIIXL AILAN AITGF AIXLP AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALSLI ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BENPR BGNMA C24 C6C CS3 CSCUP DDRTE DL5 DNIVK DPUIP EBLON EBS EDO EIOEI ESBYG FEDTE FERAY FFXSO FNLPD FRRFC FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS HCIFZ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IAO IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6~ KDC KOV LLZTM M1O M4Y MA- MK~ N9A NB0 NPVJJ NQJWS NU0 O93 O9G O9I O9J OAM P19 P9O PF0 PT5 QOK QOS R89 R9I RHV RNS RPX RSV S16 S1Z S27 S3B SAP SCO SDH SDM SHX SISQX SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX VC2 W23 W48 WH7 WK8 YLTOR Z45 ZMTXR ~A9 ~EX 8AO AAYXX ABUWG AFFHD AFKRA AZQEC BEZIV BGLVJ CCPQU CITATION CNYFK DWQXO FRNLG GNUQQ K7- M0C PHGZM PHGZT PQBIZ PQBZA PQGLB PRQQA PSYQQ 3V. 7SC 7XB 8AL 8FD 8FE 8FG 8FK E3H F2A JQ2 L.- L7M L~C L~D M0N P62 PKEHL PQEST PQQKQ PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c316t-d4f7be8ebd521e16b758af5a391439fe75a205576f7b912bc9ae7539b7c5f50f3
IEDL.DBID	C24
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001536633800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1573-7462 0269-2821
IngestDate	Thu Nov 13 23:21:10 EST 2025 Sat Nov 29 07:29:41 EST 2025 Sat Sep 13 01:10:24 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	10
Keywords	Kirchhoff’s Law Algorithm (KLA) Engineering problems Optimization Optimal engineering design
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c316t-d4f7be8ebd521e16b758af5a391439fe75a205576f7b912bc9ae7539b7c5f50f3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
OpenAccessLink	https://link.springer.com/10.1007/s10462-025-11289-5
PQID	3233553476
PQPubID	36790
ParticipantIDs	proquest_journals_3233553476 crossref_primary_10_1007_s10462_025_11289_5 springer_journals_10_1007_s10462_025_11289_5
PublicationCentury	2000
PublicationDate	2025-07-26
PublicationDateYYYYMMDD	2025-07-26
PublicationDate_xml	– month: 07 year: 2025 text: 2025-07-26 day: 26
PublicationDecade	2020
PublicationPlace	Dordrecht
PublicationPlace_xml	– name: Dordrecht
PublicationSubtitle	An International Science and Engineering Journal
PublicationTitle	The Artificial intelligence review
PublicationTitleAbbrev	Artif Intell Rev
PublicationYear	2025
Publisher	Springer Netherlands Springer Nature B.V
Publisher_xml	– name: Springer Netherlands – name: Springer Nature B.V
References	M Drigo (11289_CR37) 1996; 26 H Yapici (11289_CR110) 2019; 78 A Mahdavi-Meymand (11289_CR77) 2022; 258 PN Suganthan (11289_CR104) 2005; 2005005 J Hu (11289_CR58) 2022; 237 V Garg (11289_CR41) 2023; 124 MA Akbari (11289_CR11) 2022; 12 W Zhao (11289_CR117) 2022; 388 S Zhao (11289_CR119) 2024; 238 11289_CR18 11289_CR122 11289_CR19 AR Mehrabian (11289_CR80) 2006; 1 J-S Chou (11289_CR30) 2023; 155 MH Nadimi-Shahraki (11289_CR90) 2021; 166 DR Morrison (11289_CR88) 2016; 19 11289_CR31 M Abdel-Basset (11289_CR7) 2022; 10 S Zhao (11289_CR116) 2022; 114 FK Karim (11289_CR62) 2023; 8 L Deng (11289_CR35) 2023; 225 K Golalipour (11289_CR46) 2023; 78 Z Hu (11289_CR56) 2020; 79 S Mirjalili (11289_CR82) 2015; 89 NA Kallioras (11289_CR61) 2018; 121 11289_CR28 N Khodadadi (11289_CR66) 2022; 10 FA Hashim (11289_CR51) 2019; 101 11289_CR45 M Montemurro (11289_CR87) 2013; 256 R Rao (11289_CR94) 2016; 7 11289_CR44 A Kaveh (11289_CR64) 2022; 38 C Coello (11289_CR32) 2004; 36 S Akyol (11289_CR12) 2017; 47 B Akay (11289_CR10) 2012; 23 S Li (11289_CR74) 2020; 111 11289_CR38 P Savsani (11289_CR121) 2016; 40 E Çelik (11289_CR21) 2020; 87 A Baykasoğlu (11289_CR17) 2015; 36 11289_CR54 G Dhiman (11289_CR36) 2018; 159 M Ghasemi (11289_CR43) 2017; 1 11289_CR50 E Rashedi (11289_CR95) 2009; 179 S Saremi (11289_CR99) 2017; 105 A Kaveh (11289_CR63) 2017; 110 B Abdollahzadeh (11289_CR9) 2022; 174 Y Yang (11289_CR109) 2021; 177 H Eskandar (11289_CR39) 2012; 110–111 11289_CR49 AYS Lam (11289_CR71) 2009; 14 11289_CR69 B Alsalibi (11289_CR14) 2021; 51 11289_CR68 11289_CR65 R Storn (11289_CR103) 1997; 11 M Abdel-Basset (11289_CR6) 2021; 212 EH Houssein (11289_CR55) 2023; 213 11289_CR60 H Zamani (11289_CR111) 2022; 392 A Sadollah (11289_CR97) 2013; 13 11289_CR76 W Li (11289_CR73) 2023; 14 W Zhao (11289_CR118) 2023; 417 M Abdel-Basset (11289_CR8) 2023; 262 D Simon (11289_CR102) 2008; 12 K Mohammadi (11289_CR85) 2023; 35 I Mazhoud (11289_CR79) 2013; 26 S Gupta (11289_CR48) 2020; 93 Z Lei (11289_CR72) 2020; 152 JJ Liang (11289_CR75) 2013; 635 S Gupta (11289_CR47) 2019; 119 G Hu (11289_CR59) 2023; 58 A Kumar (11289_CR70) 2020; 56 E Mezura-Montes (11289_CR81) 2008 S Shadravan (11289_CR100) 2019; 80 M Shahrouzi (11289_CR101) 2022; 57 11289_CR86 MH Nadimi-Shahraki (11289_CR89) 2020; 97 FA Hashim (11289_CR52) 2023; 260 C Dai (11289_CR33) 2020; 8 11289_CR105 N Khodadadi (11289_CR67) 2022 J Zhang (11289_CR112) 2018; 63 11289_CR106 11289_CR107 Z-S Wu (11289_CR108) 2015; 2015 HN Ghafil (11289_CR42) 2020; 93 W Zhao (11289_CR115) 2019; 7 S Mirjalili (11289_CR83) 2014; 69 11289_CR15 E Çelik (11289_CR26) 2021; 182 F Rezaei (11289_CR96) 2023; 27 11289_CR98 S Mirjalili (11289_CR84) 2017; 114 11289_CR92 A Alorf (11289_CR13) 2023; 117 11289_CR93 E Çelik (11289_CR27) 2025; 65 R Mallipeddi (11289_CR78) 2011; 11 11289_CR4 11289_CR3 L Cheng (11289_CR29) 2018; 8 11289_CR5 E Heidary (11289_CR53) 2021; 67 A Faramarzi (11289_CR40) 2020; 191 11289_CR2 11289_CR1
References_xml	– volume: 1 start-page: 61 issue: 2 year: 2017 ident: 11289_CR43 publication-title: Amer J Electr Comput Eng – volume: 14 start-page: 381 issue: 3 year: 2009 ident: 11289_CR71 publication-title: IEEE Trans Evol Comput doi: 10.1109/TEVC.2009.2033580 – volume: 65 year: 2025 ident: 11289_CR27 publication-title: Eng Sci Tech, An Int J doi: 10.1016/j.jestch.2025.102053 – volume: 119 start-page: 210 year: 2019 ident: 11289_CR47 publication-title: Exp Syst Appl doi: 10.1016/j.eswa.2018.10.050 – volume: 182 year: 2021 ident: 11289_CR26 publication-title: Exp Syst Appl doi: 10.1016/j.eswa.2021.115292 – volume: 191 year: 2020 ident: 11289_CR40 publication-title: Knowl-Based Syst doi: 10.1016/j.knosys.2019.105190 – year: 2022 ident: 11289_CR67 publication-title: Neural Comput Appl doi: 10.1007/s00521-022-07405-z – ident: 11289_CR65 doi: 10.1109/ICNN.1995.488968 – ident: 11289_CR98 doi: 10.1109/CEC48606.2020.9185577 – volume: 152 year: 2020 ident: 11289_CR72 publication-title: Exp Syst Appl – volume: 2005005 start-page: 2005 issue: 2005 year: 2005 ident: 11289_CR104 publication-title: KanGAL Rep – ident: 11289_CR4 doi: 10.1007/s10586-023-04221-5 – volume: 110–111 start-page: 151 year: 2012 ident: 11289_CR39 publication-title: Comput Struct doi: 10.1016/j.compstruc.2012.07.010 – volume: 27 start-page: 10571 issue: 15 year: 2023 ident: 11289_CR96 publication-title: Soft Comput doi: 10.1007/s00500-023-08202-z – ident: 11289_CR50 – volume: 89 start-page: 228 year: 2015 ident: 11289_CR82 publication-title: Knowl-Based Syst doi: 10.1016/j.knosys.2015.07.006 – volume: 12 start-page: 702 issue: 6 year: 2008 ident: 11289_CR102 publication-title: IEEE Trans Evol Comput doi: 10.1109/TEVC.2008.919004 – volume: 47 start-page: 417 issue: 4 year: 2017 ident: 11289_CR12 publication-title: Artif Intell Rev doi: 10.1007/s10462-016-9486-6 – volume: 12 start-page: 10953 issue: 1 year: 2022 ident: 11289_CR11 publication-title: Sci Rep doi: 10.1038/s41598-022-14338-z – volume: 392 year: 2022 ident: 11289_CR111 publication-title: Comput Methods Appl Mech Eng doi: 10.1016/j.cma.2022.114616 – volume: 56 year: 2020 ident: 11289_CR70 publication-title: Swarm Evol Comput doi: 10.1016/j.swevo.2020.100693 – volume: 51 start-page: 1992 year: 2021 ident: 11289_CR14 publication-title: Appl Intell doi: 10.1007/s10489-020-01898-8 – ident: 11289_CR68 doi: 10.1109/ACCESS.2022.3212081 – ident: 11289_CR28 doi: 10.1155/2018/1806947 – volume: 13 start-page: 2592 issue: 5 year: 2013 ident: 11289_CR97 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2012.11.026 – volume: 155 year: 2023 ident: 11289_CR30 publication-title: Autom Constr – volume: 121 start-page: 147 year: 2018 ident: 11289_CR61 publication-title: Adv Eng Softw doi: 10.1016/j.advengsoft.2018.04.007 – ident: 11289_CR1 doi: 10.1007/s42235-023-00386-2 – volume: 93 year: 2020 ident: 11289_CR42 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2020.106392 – volume: 87 year: 2020 ident: 11289_CR21 publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2019.103294 – volume: 105 start-page: 30 year: 2017 ident: 11289_CR99 publication-title: Adv Eng Softw doi: 10.1016/j.advengsoft.2017.01.004 – volume: 8 start-page: 30745 year: 2020 ident: 11289_CR33 publication-title: IEEE Access doi: 10.1109/ACCESS.2020.2973197 – ident: 11289_CR45 doi: 10.1016/B978-0-32-395365-8.00031-2 – volume: 101 start-page: 646 year: 2019 ident: 11289_CR51 publication-title: Futur Gener Comput Syst doi: 10.1016/j.future.2019.07.015 – ident: 11289_CR49 doi: 10.1109/CEC48606.2020.9185583 – volume: 69 start-page: 46 year: 2014 ident: 11289_CR83 publication-title: Adv Eng Softw doi: 10.1016/j.advengsoft.2013.12.007 – volume: 80 start-page: 20 year: 2019 ident: 11289_CR100 publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2019.01.001 – ident: 11289_CR18 doi: 10.1109/ICRERA52334.2021.9598773 – volume: 67 start-page: 1085 issue: 1 year: 2021 ident: 11289_CR53 publication-title: Comput Mater Continua doi: 10.32604/cmc.2021.013836 – ident: 11289_CR15 doi: 10.32604/cmc.2022.023030 – ident: 11289_CR19 doi: 10.1093/comjnl/bxy133 – volume: 262 year: 2023 ident: 11289_CR8 publication-title: Knowl-Based Syst doi: 10.1016/j.knosys.2022.110248 – volume: 174 year: 2022 ident: 11289_CR9 publication-title: Adv Eng Softw doi: 10.1016/j.advengsoft.2022.103282 – ident: 11289_CR86 doi: 10.1007/s11831-023-10060-9 – volume: 238 year: 2024 ident: 11289_CR119 publication-title: Exp Syst Appl – volume: 213 year: 2023 ident: 11289_CR55 publication-title: Exp Syst Appl doi: 10.1016/j.eswa.2022.119015 – volume: 417 year: 2023 ident: 11289_CR118 publication-title: Comput Methods Appl Mech Eng doi: 10.1016/j.cma.2023.116446 – volume: 78 start-page: 545 year: 2019 ident: 11289_CR110 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2019.03.012 – volume: 40 start-page: 3951 issue: 5–6 year: 2016 ident: 11289_CR121 publication-title: Appl Mathemat Model doi: 10.1016/j.apm.2015.10.040 – volume: 79 start-page: 145 year: 2020 ident: 11289_CR56 publication-title: Appl Math Model doi: 10.1016/j.apm.2019.10.026 – volume: 57 year: 2022 ident: 11289_CR101 publication-title: J Compt Sci – volume-title: Bacterial Foraging for Engineering Design Problems: Preliminary Results year: 2008 ident: 11289_CR81 – volume: 36 start-page: 219 issue: 2 year: 2004 ident: 11289_CR32 publication-title: Eng Optim doi: 10.1080/03052150410001647966 – volume: 212 year: 2021 ident: 11289_CR6 publication-title: Knowl-Based Syst doi: 10.1016/j.knosys.2020.106619 – ident: 11289_CR122 doi: 10.1002/wics.70028 – ident: 11289_CR31 doi: 10.1016/j.eswa.2009.06.044 – volume: 10 start-page: 3466 issue: 19 year: 2022 ident: 11289_CR7 publication-title: Mathematics doi: 10.3390/math10193466 – volume: 114 year: 2022 ident: 11289_CR116 publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2022.105075 – ident: 11289_CR93 doi: 10.1016/j.ijepes.2012.06.013 – ident: 11289_CR5 doi: 10.5120/ijca2016909119 – volume: 177 year: 2021 ident: 11289_CR109 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2021.114864 – volume: 63 start-page: 464 year: 2018 ident: 11289_CR112 publication-title: Appl Math Model doi: 10.1016/j.apm.2018.06.036 – volume: 114 start-page: 163 year: 2017 ident: 11289_CR84 publication-title: Adv Eng Softw doi: 10.1016/j.advengsoft.2017.07.002 – volume: 260 year: 2023 ident: 11289_CR52 publication-title: Knowl-Based Syst doi: 10.1016/j.knosys.2022.110146 – volume: 2015 start-page: 87 year: 2015 ident: 11289_CR108 publication-title: Comput Intell Neurosci – volume: 8 start-page: 329 issue: 3 year: 2018 ident: 11289_CR29 publication-title: Appl Sci doi: 10.3390/app8030329 – volume: 225 year: 2023 ident: 11289_CR35 publication-title: Exp Syst Appl doi: 10.1016/j.eswa.2023.120069 – volume: 19 start-page: 79 year: 2016 ident: 11289_CR88 publication-title: Discret Optim doi: 10.1016/j.disopt.2016.01.005 – volume: 179 start-page: 2232 issue: 13 year: 2009 ident: 11289_CR95 publication-title: Inf Sci doi: 10.1016/j.ins.2009.03.004 – volume: 117 year: 2023 ident: 11289_CR13 publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2022.105622 – ident: 11289_CR60 doi: 10.1016/j.eswa.2020.113902 – volume: 78 start-page: 614 year: 2023 ident: 11289_CR46 publication-title: Alex Eng J doi: 10.1016/j.aej.2023.07.066 – volume: 35 start-page: 10147 issue: 14 year: 2023 ident: 11289_CR85 publication-title: Neural Comput Appl doi: 10.1007/s00521-023-08229-1 – volume: 256 start-page: 70 year: 2013 ident: 11289_CR87 publication-title: Comput Methods Appl Mech Eng doi: 10.1016/j.cma.2012.12.009 – volume: 237 year: 2022 ident: 11289_CR58 publication-title: Knowl-Based Syst – volume: 8 start-page: 321 issue: 3 year: 2023 ident: 11289_CR62 publication-title: Biomimetics doi: 10.3390/biomimetics8030321 – volume: 97 year: 2020 ident: 11289_CR89 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2020.106761 – volume: 38 start-page: 1921 issue: 3 year: 2022 ident: 11289_CR64 publication-title: Eng Comp doi: 10.1007/s00366-020-01179-5 – volume: 110 start-page: 69 year: 2017 ident: 11289_CR63 publication-title: Adv Eng Softw doi: 10.1016/j.advengsoft.2017.03.014 – ident: 11289_CR105 – volume: 14 start-page: 1753 issue: 3 year: 2023 ident: 11289_CR73 publication-title: J Ambient Intell Humaniz Comput doi: 10.1007/s12652-021-03391-7 – ident: 11289_CR44 doi: 10.1016/j.jestch.2023.101551 – volume: 36 start-page: 152 year: 2015 ident: 11289_CR17 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2015.06.056 – volume: 124 year: 2023 ident: 11289_CR41 publication-title: Eng Appl Artif Intell – volume: 11 start-page: 1679 issue: 2 year: 2011 ident: 11289_CR78 publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2010.04.024 – ident: 11289_CR106 doi: 10.1016/j.eswa.2023.122070 – volume: 388 year: 2022 ident: 11289_CR117 publication-title: Comput Methods Appl Mech Eng doi: 10.1016/j.cma.2021.114194 – volume: 7 start-page: 19 issue: 1 year: 2016 ident: 11289_CR94 publication-title: Int J Ind Eng Comput – ident: 11289_CR38 doi: 10.1016/j.eswa.2023.122147 – volume: 258 year: 2022 ident: 11289_CR77 publication-title: Knowl-Based Syst doi: 10.1016/j.knosys.2022.110032 – ident: 11289_CR107 doi: 10.1109/CEC48606.2020.9185632 – volume: 23 start-page: 1001 issue: 4 year: 2012 ident: 11289_CR10 publication-title: J Intell Manuf doi: 10.1007/s10845-010-0393-4 – ident: 11289_CR92 doi: 10.1007/s10586-024-04602-4 – ident: 11289_CR3 doi: 10.1016/j.eswa.2023.122200 – volume: 635 start-page: 490 year: 2013 ident: 11289_CR75 publication-title: Comput Intell Lab, Zhengzhou Unive, Zhengzhou China and Tech Rep, Nanyang Tech Univ, Singapore – volume: 166 year: 2021 ident: 11289_CR90 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2020.113917 – volume: 7 start-page: 73182 year: 2019 ident: 11289_CR115 publication-title: IEEE Access doi: 10.1109/ACCESS.2019.2918753 – volume: 111 start-page: 300 year: 2020 ident: 11289_CR74 publication-title: Futur Gener Comput Syst doi: 10.1016/j.future.2020.03.055 – volume: 1 start-page: 355 issue: 4 year: 2006 ident: 11289_CR80 publication-title: Eco Inform doi: 10.1016/j.ecoinf.2006.07.003 – volume: 58 year: 2023 ident: 11289_CR59 publication-title: Adv Eng Inform – volume: 10 start-page: 16188 year: 2022 ident: 11289_CR66 publication-title: IEEE Access doi: 10.1109/ACCESS.2022.3146374 – ident: 11289_CR69 doi: 10.1109/CEC48606.2020.9185743 – volume: 11 start-page: 341 issue: 4 year: 1997 ident: 11289_CR103 publication-title: J Global Optim doi: 10.1023/A:1008202821328 – volume: 26 start-page: 1 issue: 1 year: 1996 ident: 11289_CR37 publication-title: IEEE Trans Syst, Man, and Cybernetics-Part B – ident: 11289_CR54 doi: 10.1109/CEC48606.2020.9185566 – ident: 11289_CR2 doi: 10.1016/j.knosys.2023.111081 – ident: 11289_CR76 doi: 10.1155/2020/1450985 – volume: 159 start-page: 20 year: 2018 ident: 11289_CR36 publication-title: Knowl-Based Syst doi: 10.1016/j.knosys.2018.06.001 – volume: 93 year: 2020 ident: 11289_CR48 publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2020.103718 – volume: 26 start-page: 1263 issue: 4 year: 2013 ident: 11289_CR79 publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2013.02.002
SSID	ssj0005243
Score	2.4043903
Snippet	This research introduces Kirchhoff’s Law Algorithm (KLA), a novel optimization method inspired by electrical circuit laws, particularly Kirchhoff’s Current Law...
SourceID	proquest crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	325
SubjectTerms	Algorithms Artificial Intelligence Behavior Benchmarks Chemical reactions Circuits Computer engineering Computer Science Convergence Genetic algorithms Heuristic methods Law Methodological problems Multiculturalism & pluralism Novels Optimization Optimization algorithms Parameters Physics Power supply Search process Simplicity
SummonAdditionalLinks	– databaseName: ABI/INFORM Global dbid: M0C link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PT9swFH6CAtIulBUQZQz5sAMIrDV248S7TKgamtQOcdgQt8hxbFqpv9a0cOHAv8G_x1-y58RRAYldOEVyIsfSZ7_32X7vfQBf0ohnLqGRhsIw2g5sgHYwNTRC-mzQJYa8yPC-6kUXF_H1tbz0B265D6usbGJhqLOJdmfkXznj6Bp5OxLfp3-pU41yt6teQmMV1hyzcSF9v1qdZyEeZdQcE5Li1iLwSTM-da4tGHVirsg4YknDl45pyTZfXZAWfue8_t4Rb8GmZ5zkrJwiH2HFjBtQr9QciF_cDVjtqbsGbBQhoTrfhvvuANdAf2Lt08NjTobqjqjhDf5g3h-Ro27v7PgbUWQ8uTVDUp6P5HQwdhf3JsPmMXVVxUdOsEsTfKi-WZRVoZ91g4yZTNBojXw2KPH6NvkO_Dn_8bvzk3qtBqp5IOY0a9soNbFJM-QDJhAp7kOUDRWXSMikNVGomCv3JfAzGbBUS4VtXKaRDm3YsnwXajg0swdEmlTF3DJrNe7-YuSAljEbcC2Q-jBhm3BSAZVMy5IcybL4soM1QViTAtYkbMJBhU7il2eeLKFpwmmF7_L1273t_7-3T_CBuSnViigTB1CbzxbmM6zr2_kgnx0Wk_Mfs-Dq7w priority: 102 providerName: ProQuest
Title	Kirchhoff’s law algorithm (KLA): a novel physics-inspired non-parametric metaheuristic algorithm for optimization problems
URI	https://link.springer.com/article/10.1007/s10462-025-11289-5 https://www.proquest.com/docview/3233553476
Volume	58
WOSCitedRecordID	wos001536633800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1573-7462 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005243 issn: 1573-7462 databaseCode: 7WY dateStart: 20240101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1573-7462 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005243 issn: 1573-7462 databaseCode: M0C dateStart: 20240101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1573-7462 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005243 issn: 1573-7462 databaseCode: P5Z dateStart: 20240101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1573-7462 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005243 issn: 1573-7462 databaseCode: K7- dateStart: 20240101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Library Science Database customDbUrl: eissn: 1573-7462 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005243 issn: 1573-7462 databaseCode: M1O dateStart: 20240101 isFulltext: true titleUrlDefault: https://search.proquest.com/libraryscience providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1573-7462 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005243 issn: 1573-7462 databaseCode: BENPR dateStart: 20240101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: Springer Nature - Connect here FIRST to enable access customDbUrl: eissn: 1573-7462 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005243 issn: 1573-7462 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature – providerCode: PRVAVX databaseName: Springer Nature OA Free Journals customDbUrl: eissn: 1573-7462 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005243 issn: 1573-7462 databaseCode: C24 dateStart: 20240101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTxsxEB7xOnDh2Yq0EPnQAxVYytpre90bRCCk0DSivNrLyruxSaQ8qmyACwf-Bn-PX8J4s0sAtYdymZW8Xsvy2J7P6_lmAL4kirc9oZEKaRkNAxfgPphYqhA-WzSJgucM7_Nj1WxGl5e6VZDCstLbvbySzHfqF2S3UDLq068iRog0FbMwL4JIe0e-uuc4PDt2hLygx_z9u9cmaIor31yF5hbmcPl9fVuBpQJRkr3JFFiFGTtYg-UyWwMpFu863DW6OKc7Q-ce7x8y0jO3xPSuhqPuuNMn243jva_fiCGD4Y3tkcn_jox2B_4i3raxeEB9lPC-T8CVEnyYjr2eRHl-0QwiYDLETahfsDtJka8m-wBnhwen9SNa5F6gKQ_kmLZDpxIb2aSN9t0GMsFzhXHCcI0ASzurhGE-fJfEajpgSaoNlnGdqFQ4UXP8I8xh1-wGEG0TE3HHnEvxNBchpnOMuYCnEqEMk64CO6U64j-TEBvxNJiyH9gYBzbOBzYWFdgsNRYXyy2LOeOIm3ioZAV2Sw1NX_-7tU__V_0zLDKv5JqiTG7C3Hh0bbdgIb0Zd7NRFWbVxa8qzO8fNFsn1XxSomwoivJ7re5l8ANlS_xGefLz_AkJf-HI
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NbtQwEB61BVQutF2KWCjUhyKBqEVjJ3ZcCaEKqFolrDgU1FvqOHZ3pf0pzbYrJA68Bi_Rh-JJGOdHW5Dg1gOnSE40SpzPM9_Y8wOwlUte-IRGGgnLaBi4APVgbqlE-mzRJEa8yvD-nMpeLz4-Vh8X4KrNhfFhla1OrBR1MTF-j_wVZxxNIw-leHP2hfquUf50tW2hUcMisV9n6LKVrw_f4f99xtj--6O3B7TpKkAND8SUFqGTuY1tXqDlsoHIkTFrF2mukDooZ2WkmS9MJfAxFbDcKI1jXOXSRC7acRzlLsKtkMfSr6tE0mshJXWUHhOKoisTNEk6TapeKBj1zWOR4cSKRr8bwjm7_eNAtrJz-yv_2wytwr2GUZO9egmswYIdd2Cl7VZBGuXVgcVUzzpwpwp5NeV9-JYM8FX7E-d-fv9RkqGeET08xQ-a9kfkeZLuvdglmownl3ZI6v2fkg7GPjDBFjg8pr5q-sg3JDMEL7pvL-qq19fEoEdAJqiUR022K2n695Tr8OlG5uQBLOGr2YdAlM11zB1zzqB3GyPHdYy5gBuB1I4J14WXLTCys7rkSDYvLu1hlCGMsgpGWdSFjRYNWaN-ymwOhS5st3ia3_67tEf_lrYJywdHH9IsPewlj-Eu83DekZSJDVianl_YJ3DbXE4H5fnTamEQOLlpnP0Cbw1IVA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NbtQwEB615Ue9UFhAXSjgA0ggsNrYaztGQqiirKh2tdoDoIpLcBybXWl_SrPtCokDr8Gr8Dg8CePE0RYkuPXAKZITjRLn88w39vwAPMwVL0JCIxXSMdpJfIJ6MHdUIX12aBIFrzK83_fVYJAeHenhGvxocmFCWGWjEytFXcxt2CPf5YyjaeQdJXd9DIsYHnRfHn-moYNUOGlt2mnUEOm5L0t038oXhwf4rx8x1n399tUbGjsMUMsTuaBFx6vcpS4v0Iq5RObIno0XhmukEdo7JQwLRaokPqYTllttcIzrXFnhxZ7nKHcdLin0MUM44VB8OBdeUkfsMakpujVJTNiJaXsdyWhoJItsJ9VU_G4UV0z3j8PZyuZ1t_7n2boO1yLTJvv10rgBa27Wgq2miwWJSq0F632zbMGVKhTWljfha2-Mrzqae__z2_eSTMySmMkn_KDFaEoe9_r7T54TQ2bzMzch9b5QScezELDgChye0VBNfRoalVmCFzNyp3U17HNi0FMgc1TW05gFS2Jfn_IWvLuQObkNG_hqbhuIdrlJuWfeW_R6U-S-njGfcCuR8jHp2_C0AUl2XJciyVZFpwOkMoRUVkEqE23YaZCRRbVUZitYtOFZg63V7b9Lu_NvaQ_gKsIr6x8OendhkwVk7ynK5A5sLE5O3T24bM8W4_LkfrVGCHy8aJj9Aj2pUXg
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Kirchhoff%E2%80%99s+law+algorithm+%28KLA%29%3A+a+novel+physics-inspired+non-parametric+metaheuristic+algorithm+for+optimization+problems&rft.jtitle=The+Artificial+intelligence+review&rft.au=Ghasemi%2C+Mojtaba&rft.au=Khodadadi%2C+Nima&rft.au=Trojovsk%C3%BD%2C+Pavel&rft.au=Li%2C+Li&rft.date=2025-07-26&rft.pub=Springer+Netherlands&rft.eissn=1573-7462&rft.volume=58&rft.issue=10&rft_id=info:doi/10.1007%2Fs10462-025-11289-5&rft.externalDocID=10_1007_s10462_025_11289_5
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1573-7462&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1573-7462&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1573-7462&client=summon