{"id":"https://openalex.org/W2562397702","doi":"https://doi.org/10.1515/jaiscr-2016-0009","title":"Adapting Differential Evolution Algorithms For Continuous Optimization Via Greedy Adjustment Of Control Parameters","display_name":"Adapting Differential Evolution Algorithms For Continuous Optimization Via Greedy Adjustment Of Control Parameters","publication_year":2016,"publication_date":"2016-03-10","ids":{"openalex":"https://openalex.org/W2562397702","doi":"https://doi.org/10.1515/jaiscr-2016-0009","mag":"2562397702"},"language":"en","primary_location":{"id":"doi:10.1515/jaiscr-2016-0009","is_oa":true,"landing_page_url":"https://doi.org/10.1515/jaiscr-2016-0009","pdf_url":"https://sciendo.com/pdf/10.1515/jaiscr-2016-0009","source":{"id":"https://openalex.org/S4210223945","display_name":"Journal of Artificial Intelligence and Soft Computing Research","issn_l":"2083-2567","issn":["2083-2567","2449-6499"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317241","host_organization_name":"Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology","host_organization_lineage":["https://openalex.org/P4310317241"],"host_organization_lineage_names":["Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence and Soft Computing Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://sciendo.com/pdf/10.1515/jaiscr-2016-0009","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019938250","display_name":"Miguel Le\u00f3n","orcid":"https://orcid.org/0000-0002-3425-3837"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Miguel Leon","raw_affiliation_strings":["School of Innovation, Design and Engineering Malardalen University, Vasteras, Sweden"],"affiliations":[{"raw_affiliation_string":"School of Innovation, Design and Engineering Malardalen University, Vasteras, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102290471","display_name":"Ning Xiong","orcid":"https://orcid.org/0000-0001-9857-4317"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ning Xiong","raw_affiliation_strings":["School of Innovation, Design and Engineering Malardalen University, Vasteras, Sweden"],"affiliations":[{"raw_affiliation_string":"School of Innovation, Design and Engineering Malardalen University, Vasteras, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019938250"],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":7.7126,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.97408014,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"6","issue":"2","first_page":"103","last_page":"118"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9987000226974487,"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.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7631262540817261},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.7481462359428406},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.6921703815460205},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.629409670829773},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.5961512327194214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5472280383110046},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5403734445571899},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5104752779006958},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5071039199829102},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5000431537628174},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4540953040122986},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2980141341686249},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.29151397943496704},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29019999504089355}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7631262540817261},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.7481462359428406},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6921703815460205},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.629409670829773},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5961512327194214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5472280383110046},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5403734445571899},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5104752779006958},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5071039199829102},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5000431537628174},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4540953040122986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2980141341686249},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29151397943496704},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29019999504089355},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1515/jaiscr-2016-0009","is_oa":true,"landing_page_url":"https://doi.org/10.1515/jaiscr-2016-0009","pdf_url":"https://sciendo.com/pdf/10.1515/jaiscr-2016-0009","source":{"id":"https://openalex.org/S4210223945","display_name":"Journal of Artificial Intelligence and Soft Computing Research","issn_l":"2083-2567","issn":["2083-2567","2449-6499"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317241","host_organization_name":"Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology","host_organization_lineage":["https://openalex.org/P4310317241"],"host_organization_lineage_names":["Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence and Soft Computing Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1515/jaiscr-2016-0009","is_oa":true,"landing_page_url":"https://doi.org/10.1515/jaiscr-2016-0009","pdf_url":"https://sciendo.com/pdf/10.1515/jaiscr-2016-0009","source":{"id":"https://openalex.org/S4210223945","display_name":"Journal of Artificial Intelligence and Soft Computing Research","issn_l":"2083-2567","issn":["2083-2567","2449-6499"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317241","host_organization_name":"Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology","host_organization_lineage":["https://openalex.org/P4310317241"],"host_organization_lineage_names":["Polish Neural Network Society, the University of Social Sciences in Lodz & Czestochowa University of Technology"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence and Soft Computing Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2562397702.pdf","grobid_xml":"https://content.openalex.org/works/W2562397702.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W226066862","https://openalex.org/W1591761170","https://openalex.org/W1595159159","https://openalex.org/W1976479785","https://openalex.org/W1997600725","https://openalex.org/W2010861271","https://openalex.org/W2018299061","https://openalex.org/W2030018331","https://openalex.org/W2032786550","https://openalex.org/W2043816158","https://openalex.org/W2070505903","https://openalex.org/W2070972695","https://openalex.org/W2111402071","https://openalex.org/W2112036188","https://openalex.org/W2114652055","https://openalex.org/W2129724855","https://openalex.org/W2132181343","https://openalex.org/W2134171600","https://openalex.org/W2144051602","https://openalex.org/W2151554678","https://openalex.org/W2152195021","https://openalex.org/W2155529731","https://openalex.org/W2156194072","https://openalex.org/W2156773695","https://openalex.org/W3015222189","https://openalex.org/W3143957058"],"related_works":["https://openalex.org/W1481410647","https://openalex.org/W4295205538","https://openalex.org/W2277088917","https://openalex.org/W1988293173","https://openalex.org/W3177681191","https://openalex.org/W2076472895","https://openalex.org/W2389275641","https://openalex.org/W1606499289","https://openalex.org/W2895647686","https://openalex.org/W1985939653"],"abstract_inverted_index":{"Abstract":[0],"Differential":[1,163],"evolution":[2],"(DE)":[3],"presents":[4],"a":[5,44,98,104,155,212],"class":[6],"of":[7,25,52,59,100,107,183,201,204],"evolutionary":[8,80],"and":[9,38,90,131],"meta-heuristic":[10],"techniques":[11],"that":[12,186],"have":[13],"been":[14,148,168],"applied":[15],"successfully":[16],"to":[17,65,102,137,154],"solve":[18],"many":[19],"real-world":[20],"problems.":[21],"However,":[22],"the":[23,53,57,78,86,111,118,124,129,132,138,193,197,202,208],"performance":[24],"DE":[26,47,115,157,179],"is":[27,64,121,188],"significantly":[28],"influenced":[29],"by":[30,49],"its":[31,91],"control":[32,54],"parameters":[33,55],"such":[34],"as":[35,160],"scaling":[36],"factor":[37],"crossover":[39],"probability.":[40],"This":[41,142],"paper":[42],"proposes":[43],"new":[45,156],"adaptive":[46],"algorithm":[48,158],"greedy":[50,67,143],"adjustment":[51,145],"during":[56],"running":[58],"DE.":[60],"The":[61,181],"basic":[62,151],"idea":[63],"perform":[66],"search":[68,133],"for":[69],"better":[70],"parameter":[71,88,144],"assignments":[72,93],"in":[73,77,97,110,174,199],"successive":[74],"learning":[75,84,140],"periods":[76],"whole":[79],"process.":[81],"Within":[82],"each":[83],"period,":[85],"current":[87,119],"assignment":[89,120],"neighboring":[92],"are":[94],"tested":[95,169],"(used)":[96],"number":[99],"times":[101],"acquire":[103],"reliable":[105],"assessment":[106],"their":[108],"suitability":[109],"stochastic":[112],"environment":[113],"with":[114,123,176,211],"operations.":[116],"Subsequently":[117],"updated":[122],"best":[125,194],"candidate":[126],"identified":[127],"from":[128],"neighborhood":[130],"then":[134],"moves":[135],"on":[136,170],"next":[139],"period.":[141],"method":[146],"has":[147,167],"incorporated":[149],"into":[150],"DE,":[152],"leading":[153],"termed":[159],"Greedy":[161],"Adaptive":[162],"Evolution":[164],"(GADE).":[165],"GADE":[166,187],"25":[171],"benchmark":[172,209],"functions":[173,210],"comparison":[175],"five":[177],"other":[178],"variants.":[180],"results":[182],"evaluation":[184],"demonstrate":[185],"strongly":[189],"competitive:":[190],"it":[191],"obtained":[192],"rank":[195],"among":[196],"counterparts":[198],"terms":[200],"summation":[203],"relative":[205],"errors":[206],"across":[207],"high":[213],"dimensionality.":[214]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}