{"id":"https://openalex.org/W2059397811","doi":"https://doi.org/10.1109/cec.2013.6557782","title":"A comparative study of dynamic resampling strategies for guided Evolutionary Multi-objective Optimization","display_name":"A comparative study of dynamic resampling strategies for guided Evolutionary Multi-objective Optimization","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2059397811","doi":"https://doi.org/10.1109/cec.2013.6557782","mag":"2059397811"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2013.6557782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-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/A5035225173","display_name":"Florian Siegmund","orcid":"https://orcid.org/0000-0003-3432-5068"},"institutions":[{"id":"https://openalex.org/I205158640","display_name":"University of Sk\u00f6vde","ror":"https://ror.org/051mrsz47","country_code":"SE","type":"education","lineage":["https://openalex.org/I205158640"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Florian Siegmund","raw_affiliation_strings":["Virtual Systems Research Center, University of Sk\u00f6vde, Skovde, Sweden","[Virtual Systems Research Center, University of Sk\u00f6vde, Skovde, Sweden]"],"affiliations":[{"raw_affiliation_string":"Virtual Systems Research Center, University of Sk\u00f6vde, Skovde, Sweden","institution_ids":["https://openalex.org/I205158640"]},{"raw_affiliation_string":"[Virtual Systems Research Center, University of Sk\u00f6vde, Skovde, Sweden]","institution_ids":["https://openalex.org/I205158640"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067664620","display_name":"Amos H.C. Ng","orcid":"https://orcid.org/0000-0003-0111-1776"},"institutions":[{"id":"https://openalex.org/I205158640","display_name":"University of Sk\u00f6vde","ror":"https://ror.org/051mrsz47","country_code":"SE","type":"education","lineage":["https://openalex.org/I205158640"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Amos H.C. Ng","raw_affiliation_strings":["Virtual Systems Research Center, University of Sk\u00f6vde, Skovde, Sweden","[Virtual Systems Research Center, University of Sk\u00f6vde, Skovde, Sweden]"],"affiliations":[{"raw_affiliation_string":"Virtual Systems Research Center, University of Sk\u00f6vde, Skovde, Sweden","institution_ids":["https://openalex.org/I205158640"]},{"raw_affiliation_string":"[Virtual Systems Research Center, University of Sk\u00f6vde, Skovde, Sweden]","institution_ids":["https://openalex.org/I205158640"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088394271","display_name":"Kalyanmoy Deb","orcid":"https://orcid.org/0000-0001-7402-9939"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kalyanmoy Deb","raw_affiliation_strings":["Department of Mechanical Engineering, Indian Institute of Technology, Kanpur, India","Dept. of Mech. Eng., Indian Inst. of Technol., Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Indian Institute of Technology, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]},{"raw_affiliation_string":"Dept. of Mech. Eng., Indian Inst. of Technol., Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035225173"],"corresponding_institution_ids":["https://openalex.org/I205158640"],"apc_list":null,"apc_paid":null,"fwci":3.2629,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.92063702,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1826","last_page":"1835"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9916999936103821,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/resampling","display_name":"Resampling","score":0.843769907951355},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6965675950050354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6938146352767944},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6798461675643921},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5878934264183044},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5217089056968689},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4975328743457794},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4811359941959381},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43716752529144287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28367307782173157},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.22257190942764282},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1887691617012024}],"concepts":[{"id":"https://openalex.org/C150921843","wikidata":"https://www.wikidata.org/wiki/Q1170431","display_name":"Resampling","level":2,"score":0.843769907951355},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6965675950050354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6938146352767944},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6798461675643921},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5878934264183044},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5217089056968689},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4975328743457794},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4811359941959381},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43716752529144287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28367307782173157},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.22257190942764282},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1887691617012024},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2013.6557782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2013.6557782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W111409845","https://openalex.org/W1510354679","https://openalex.org/W1536615069","https://openalex.org/W1698608285","https://openalex.org/W1977764678","https://openalex.org/W2003683863","https://openalex.org/W2071231831","https://openalex.org/W2091055889","https://openalex.org/W2102365077","https://openalex.org/W2106334424","https://openalex.org/W2116683880","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2140481308","https://openalex.org/W2144304907","https://openalex.org/W2147525584","https://openalex.org/W2163783967","https://openalex.org/W2170241649","https://openalex.org/W4233711612","https://openalex.org/W4237029372","https://openalex.org/W6630519998","https://openalex.org/W6684126959"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2073147994","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W2384474142","https://openalex.org/W3083133203"],"abstract_inverted_index":{"In":[0,30,43,135],"Evolutionary":[1],"Multi-objective":[2],"Optimization":[3,32],"many":[4,61],"solutions":[5,20,112],"have":[6],"to":[7,10],"be":[8,83,114],"evaluated":[9,46],"provide":[11],"the":[12,22,33,45,68,80,89,96,109,132,146],"decision":[13],"maker":[14],"with":[15,152],"a":[16,65],"diverse":[17],"choice":[18],"of":[19,55,72,88,105,111],"along":[21],"Pareto-front,":[23,90],"in":[24,128],"particular":[25],"for":[26,67,108],"high-dimensional":[27],"optimization":[28,78,81,133,150],"problems.":[29],"Simulation-based":[31],"modeled":[34],"systems":[35,47],"are":[36,48],"complex":[37],"and":[38,51,140],"require":[39],"long":[40],"simulation":[41,62,73],"times.":[42],"addition":[44],"often":[49],"stochastic":[50,153],"reliable":[52],"quality":[53],"assessment":[54],"system":[56],"configurations":[57],"by":[58,76,95,116],"resampling":[59,110,118,142],"requires":[60],"runs.":[63],"As":[64],"countermeasure":[66],"required":[69],"high":[70],"number":[71,104],"runs":[74],"caused":[75],"multiple":[77],"objectives":[79],"can":[82,113],"focused":[84],"on":[85,149],"interesting":[86],"parts":[87],"as":[91,123],"it":[92],"is":[93],"done":[94],"Reference":[97],"point-guided":[98],"NSGA-II":[99],"algorithm":[100,148],"(R-NSGA-II)":[101],"[9].":[102],"The":[103],"evaluations":[106],"needed":[107,127],"reduced":[115],"intelligent":[117],"algorithms":[119,143],"that":[120,144],"allocate":[121],"just":[122],"much":[124],"sampling":[125],"budget":[126],"different":[129],"situations":[130],"during":[131],"run.":[134],"this":[136],"paper":[137],"we":[138],"propose":[139],"compare":[141],"support":[145],"R-NSGA-II":[147],"problems":[151],"evaluation":[154],"functions.":[155]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}