{"id":"https://openalex.org/W2110041316","doi":"https://doi.org/10.1109/cec.2005.1554892","title":"Improved Differential Evolution Algorithms for Handling Noisy Optimization Problems","display_name":"Improved Differential Evolution Algorithms for Handling Noisy Optimization Problems","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W2110041316","doi":"https://doi.org/10.1109/cec.2005.1554892","mag":"2110041316"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5000078546","display_name":"Swagatam Das","orcid":"https://orcid.org/0000-0001-6843-4508"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Das","raw_affiliation_strings":["Department of Electronics & TeleCommunication Engineering, Jadavpur University, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics & TeleCommunication Engineering, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011939964","display_name":"Amit Konar","orcid":"https://orcid.org/0000-0002-9474-5956"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. Konar","raw_affiliation_strings":["Department of Electronics & TeleCommunication Engineering, Jadavpur University, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics & TeleCommunication Engineering, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041412291","display_name":"Uday K. Chakraborty","orcid":"https://orcid.org/0000-0002-9829-2579"},"institutions":[{"id":"https://openalex.org/I208333798","display_name":"University of Missouri\u2013St. Louis","ror":"https://ror.org/037cnag11","country_code":"US","type":"education","lineage":["https://openalex.org/I208333798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"U.K. Chakraborty","raw_affiliation_strings":["Department of Mathematics & Computer Sciences, University of Missouri, Saint Louis, MO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics & Computer Sciences, University of Missouri, Saint Louis, MO, USA","institution_ids":["https://openalex.org/I208333798"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.9433,"has_fulltext":false,"cited_by_count":83,"citation_normalized_percentile":{"value":0.94555827,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"2","issue":null,"first_page":"1691","last_page":"1698"},"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.9994000196456909,"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.9984999895095825,"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/differential-evolution","display_name":"Differential evolution","score":0.6942812204360962},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6617975831031799},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6285067200660706},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5696148872375488},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5291695594787598},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5154317617416382},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.49150264263153076},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4574647545814514},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.42820072174072266},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.4279767870903015},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41478127241134644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3793483078479767},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2999522089958191}],"concepts":[{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.6942812204360962},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6617975831031799},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6285067200660706},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5696148872375488},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5291695594787598},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5154317617416382},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.49150264263153076},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4574647545814514},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.42820072174072266},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.4279767870903015},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41478127241134644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3793483078479767},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2999522089958191},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2005.1554892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1595159159","https://openalex.org/W1841728366","https://openalex.org/W1939092911","https://openalex.org/W1965612527","https://openalex.org/W1997600725","https://openalex.org/W2011716195","https://openalex.org/W2152195021","https://openalex.org/W2163845190","https://openalex.org/W2171246116","https://openalex.org/W3149025087","https://openalex.org/W4230781079"],"related_works":["https://openalex.org/W2394392475","https://openalex.org/W2069937987","https://openalex.org/W1571424162","https://openalex.org/W2015132550","https://openalex.org/W3168391725","https://openalex.org/W2235797280","https://openalex.org/W2319086340","https://openalex.org/W1966154590","https://openalex.org/W3199390665","https://openalex.org/W1825560194"],"abstract_inverted_index":{"Differential":[0],"evolution":[1],"(DE)":[2],"is":[3,47,73],"a":[4,82,151],"simple":[5],"and":[6,24,33,49,86,123],"efficient":[7],"algorithm":[8],"for":[9],"function":[10,46],"optimization":[11],"over":[12,30],"continuous":[13],"spaces.":[14],"It":[15,139],"has":[16,128,140],"reportedly":[17],"outperformed":[18],"many":[19],"types":[20],"of":[21,39,69,105,111],"evolutionary":[22],"algorithms":[23,58],"other":[25],"search":[26],"heuristics":[27],"when":[28],"tested":[29],"both":[31],"benchmark":[32],"real-world":[34],"problems.":[35],"However,":[36],"the":[37,44,66,78,97,102,112,116,120,124,144,148],"performance":[38,109],"DE":[40,57,118],"deteriorates":[41],"severely":[42],"if":[43],"fitness":[45],"noisy":[48,70],"continuously":[50],"changing.":[51],"In":[52],"this":[53],"paper":[54],"two":[55,90],"improved":[56],"have":[59],"been":[60,129,141],"proposed":[61,114,145],"that":[62,143],"can":[63],"efficiently":[64],"find":[65],"global":[67],"optima":[68],"functions.":[71],"This":[72],"achieved":[74],"firstly":[75],"by":[76,81,88,135],"weighing":[77],"difference":[79],"vector":[80],"random":[83],"scale":[84],"factor":[85],"secondly":[87],"employing":[89],"novel":[91],"selection":[92],"strategies":[93],"as":[94],"opposed":[95],"to":[96],"conventional":[98],"one":[99],"used":[100],"in":[101,150],"original":[103,117],"versions":[104],"DE.":[106],"An":[107],"extensive":[108],"comparison":[110],"newly":[113],"scheme,":[115],"(DE/Rand/1/Exp),":[119],"canonical":[121],"PSO":[122],"standard":[125],"real-coded":[126],"EA":[127],"presented":[130],"using":[131],"well-known":[132],"benchmarks":[133],"corrupted":[134],"zero-mean":[136],"Gaussian":[137],"noise.":[138],"found":[142],"method":[146],"outperforms":[147],"others":[149],"statistically":[152],"significant":[153],"way.":[154]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}