{"id":"https://openalex.org/W2105058990","doi":"https://doi.org/10.1109/cec.2011.5949822","title":"On geometrically fast convergence to optimal dominated hypervolume of set-based multiobjective evolutionary algorithms","display_name":"On geometrically fast convergence to optimal dominated hypervolume of set-based multiobjective evolutionary algorithms","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2105058990","doi":"https://doi.org/10.1109/cec.2011.5949822","mag":"2105058990"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2011.5949822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","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/A5062851293","display_name":"G\u00fcnter Rudolph","orcid":"https://orcid.org/0000-0003-4223-5257"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Gunter Rudolph","raw_affiliation_strings":["Department of Computer Science, Technical University Dortmund, Dortmund, Germany","Department of Computer Science, TU Dortmund University, 44221 Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Department of Computer Science, TU Dortmund University, 44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062851293"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":0.3138,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61333946,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1719","last_page":"1723"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9957000017166138,"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.9886000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.756301999092102},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6960503458976746},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6741679906845093},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.619706392288208},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5779064893722534},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5700284242630005},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5306583642959595},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4937520921230316},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.47380298376083374},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4701383709907532},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.45445704460144043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3819599747657776},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3268926739692688},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07123631238937378}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.756301999092102},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6960503458976746},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6741679906845093},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.619706392288208},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5779064893722534},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5700284242630005},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5306583642959595},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4937520921230316},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.47380298376083374},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4701383709907532},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.45445704460144043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3819599747657776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3268926739692688},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07123631238937378},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2011.5949822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","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/W21003870","https://openalex.org/W1507728182","https://openalex.org/W1558919105","https://openalex.org/W1574466722","https://openalex.org/W1993254222","https://openalex.org/W2023782941","https://openalex.org/W2038420231","https://openalex.org/W2066327002","https://openalex.org/W2121811374","https://openalex.org/W2148615815","https://openalex.org/W2160088187","https://openalex.org/W4302557773"],"related_works":["https://openalex.org/W1963790170","https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W2090178682","https://openalex.org/W2586328217","https://openalex.org/W2049264236","https://openalex.org/W4241467429","https://openalex.org/W2001591765","https://openalex.org/W2906115061","https://openalex.org/W2977596624"],"abstract_inverted_index":{"The":[0,18],"Pareto":[1,52],"front":[2,53],"of":[3,15,20,40,50,72],"a":[4,59,80],"multiobjective":[5],"optimization":[6],"problem":[7],"can":[8,23],"be":[9,24],"approximated":[10],"neatly":[11],"by":[12,26,32,78],"some":[13],"versions":[14],"evolutionary":[16,42],"algorithms.":[17],"quality":[19],"the":[21,27,33,38,51,66,70,86],"approximation":[22,49],"measured":[25],"hypervolume":[28,57,89],"that":[29,83],"is":[30,76],"dominated":[31,56,88],"approximation.":[34],"Open":[35],"questions":[36],"concern":[37],"existence":[39,71],"population-based":[41],"algorithms":[43],"whose":[44],"population":[45],"converge":[46],"to":[47,85],"an":[48,74],"with":[54],"maximal":[55,87],"for":[58],"given":[60],"reference":[61],"point":[62],"and,":[63],"if":[64],"applicable,":[65],"convergence":[67],"velocity.":[68],"Here,":[69],"such":[73],"algorithm":[75],"proven":[77],"providing":[79],"concrete":[81],"example":[82],"converges":[84],"geometrically":[90],"fast.":[91]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}