{"id":"https://openalex.org/W4414053056","doi":"https://doi.org/10.1007/s00521-025-11584-w","title":"A novel metaheuristic algorithm inspired by tree pruning for solving benchmark optimization and engineering design problems","display_name":"A novel metaheuristic algorithm inspired by tree pruning for solving benchmark optimization and engineering design problems","publication_year":2025,"publication_date":"2025-09-08","ids":{"openalex":"https://openalex.org/W4414053056","doi":"https://doi.org/10.1007/s00521-025-11584-w"},"language":"en","primary_location":{"id":"doi:10.1007/s00521-025-11584-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00521-025-11584-w","pdf_url":null,"source":{"id":"https://openalex.org/S147897268","display_name":"Neural Computing and Applications","issn_l":"0941-0643","issn":["0941-0643","1433-3058"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computing and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074855845","display_name":"Hardi M. Mohammed","orcid":"https://orcid.org/0000-0002-9766-9100"},"institutions":[{"id":"https://openalex.org/I2802007472","display_name":"Kurdistan Regional Government","ror":"https://ror.org/05g801a49","country_code":"IQ","type":"government","lineage":["https://openalex.org/I2802007472"]},{"id":"https://openalex.org/I64952554","display_name":"University of Sulaimani","ror":"https://ror.org/00saanr69","country_code":"IQ","type":"education","lineage":["https://openalex.org/I64952554"]}],"countries":["IQ"],"is_corresponding":true,"raw_author_name":"Hardi M. Mohammed","raw_affiliation_strings":["Computer Science Department, College of Science, Charmo University, 46023, Chamchamal/Sulaimani, Kurdistan Region, Iraq"],"raw_orcid":"https://orcid.org/0000-0002-9766-9100","affiliations":[{"raw_affiliation_string":"Computer Science Department, College of Science, Charmo University, 46023, Chamchamal/Sulaimani, Kurdistan Region, Iraq","institution_ids":["https://openalex.org/I64952554","https://openalex.org/I2802007472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074855845"],"corresponding_institution_ids":["https://openalex.org/I2802007472","https://openalex.org/I64952554"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11868872,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"30","first_page":"25415","last_page":"25443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7214999794960022},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7031000256538391},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5253999829292297},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.5200999975204468},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4812999963760376},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4117000102996826},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.3926999866962433},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.3903000056743622},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.3659000098705292}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7214999794960022},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7031000256538391},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6327000260353088},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5421000123023987},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5284000039100647},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5253999829292297},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.5200999975204468},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4117000102996826},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.3903000056743622},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.3659000098705292},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C110850998","wikidata":"https://www.wikidata.org/wiki/Q5377895","display_name":"Engineering optimization","level":3,"score":0.31279999017715454},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2770000100135803},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2700999975204468},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.2669999897480011},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.2615000009536743}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00521-025-11584-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00521-025-11584-w","pdf_url":null,"source":{"id":"https://openalex.org/S147897268","display_name":"Neural Computing and Applications","issn_l":"0941-0643","issn":["0941-0643","1433-3058"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computing and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W2125313209","https://openalex.org/W2894116595","https://openalex.org/W2923345427","https://openalex.org/W2964611903","https://openalex.org/W2985845430","https://openalex.org/W3000981632","https://openalex.org/W3007040893","https://openalex.org/W3008162770","https://openalex.org/W3011104345","https://openalex.org/W3012071895","https://openalex.org/W3012988996","https://openalex.org/W3018510315","https://openalex.org/W3029517552","https://openalex.org/W3035795080","https://openalex.org/W3039208239","https://openalex.org/W3044553173","https://openalex.org/W3083066276","https://openalex.org/W3090157909","https://openalex.org/W3094704314","https://openalex.org/W3096671774","https://openalex.org/W3106913724","https://openalex.org/W3135659360","https://openalex.org/W3135748221","https://openalex.org/W3139484821","https://openalex.org/W3199288670","https://openalex.org/W3203480234","https://openalex.org/W3211940632","https://openalex.org/W4206918024","https://openalex.org/W4223539584","https://openalex.org/W4224300633","https://openalex.org/W4224314705","https://openalex.org/W4249545506","https://openalex.org/W4290697790","https://openalex.org/W4290714434","https://openalex.org/W4296990533","https://openalex.org/W4304187656","https://openalex.org/W4307722364","https://openalex.org/W4321248138","https://openalex.org/W4323361905","https://openalex.org/W4377009985","https://openalex.org/W4382137125","https://openalex.org/W4385820046","https://openalex.org/W4386391043","https://openalex.org/W4388001357","https://openalex.org/W4388895673","https://openalex.org/W4389265515","https://openalex.org/W4389954369","https://openalex.org/W4390770591","https://openalex.org/W4391014866","https://openalex.org/W4391253626","https://openalex.org/W4398787479","https://openalex.org/W4398787527","https://openalex.org/W4399246920","https://openalex.org/W4400125497","https://openalex.org/W4403527546"],"related_works":["https://openalex.org/W2378211422","https://openalex.org/W4321353415","https://openalex.org/W2745001401","https://openalex.org/W2130974462","https://openalex.org/W2789681586","https://openalex.org/W2794361564","https://openalex.org/W2028665553","https://openalex.org/W2086519370","https://openalex.org/W4285312748","https://openalex.org/W3203767529"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}