{"id":"https://openalex.org/W1994533135","doi":"https://doi.org/10.1145/2001576.2001678","title":"Convergence of hypervolume-based archiving algorithms I","display_name":"Convergence of hypervolume-based archiving algorithms I","publication_year":2011,"publication_date":"2011-07-12","ids":{"openalex":"https://openalex.org/W1994533135","doi":"https://doi.org/10.1145/2001576.2001678","mag":"1994533135"},"language":"en","primary_location":{"id":"doi:10.1145/2001576.2001678","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2001576.2001678","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th annual conference on Genetic and 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/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077389210","display_name":"Tobias Friedrich","orcid":"https://orcid.org/0000-0003-0076-6308"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias Friedrich","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044394587"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":4.3857,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.94272777,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"745","last_page":"752"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9997000098228455,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9990000128746033,"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/convergence","display_name":"Convergence (economics)","score":0.7735226154327393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5810890793800354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5280001163482666},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4144743084907532},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3015309274196625}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7735226154327393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5810890793800354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5280001163482666},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4144743084907532},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3015309274196625},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2001576.2001678","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2001576.2001678","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:edoc.mpg.de:618721","is_oa":false,"landing_page_url":"http://edoc.mpg.de/618721","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Krasnogor, Natalio; Lanzim, Pier Luca: GECCO 2011 : Genetic and Evolutionary Computation Conference, ACM, 745-752 (2011)","raw_type":"Conference-Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W2074371","https://openalex.org/W21003870","https://openalex.org/W166394191","https://openalex.org/W595181173","https://openalex.org/W1491287429","https://openalex.org/W1522860708","https://openalex.org/W1552828154","https://openalex.org/W1564638059","https://openalex.org/W1588375755","https://openalex.org/W1613794742","https://openalex.org/W1980272771","https://openalex.org/W2029496228","https://openalex.org/W2038420231","https://openalex.org/W2059819407","https://openalex.org/W2063375245","https://openalex.org/W2098593811","https://openalex.org/W2106334424","https://openalex.org/W2116938494","https://openalex.org/W2117569255","https://openalex.org/W2133275519","https://openalex.org/W2140671219","https://openalex.org/W2150881546","https://openalex.org/W2154781286","https://openalex.org/W2160088187","https://openalex.org/W2165626989","https://openalex.org/W3122481131"],"related_works":["https://openalex.org/W1506216622","https://openalex.org/W1987033902","https://openalex.org/W2207380610","https://openalex.org/W2298446516","https://openalex.org/W3126152140","https://openalex.org/W1985163180","https://openalex.org/W303980170","https://openalex.org/W2351491280","https://openalex.org/W2386767533","https://openalex.org/W2096243008"],"abstract_inverted_index":{"The":[0],"core":[1],"of":[2,75],"hypervolume-based":[3],"multi-objective":[4],"evolutionary":[5],"algorithms":[6,36,62,98],"is":[7,68],"an":[8,69],"archiving":[9,97],"algorithm":[10,18],"which":[11,37,65,108],"performs":[12],"the":[13,40,46,76,102,110,130],"environmental":[14],"selection.":[15],"A":[16],"(\u03bc+\u03bb)-archiving":[17,35],"defines":[19],"how":[20],"to":[21,45],"choose":[22],"\u03bc":[23,26],"children":[24],"from":[25,42],"parents":[27],"and":[28,50,91,119],"\u03bb":[29,133],"offspring":[30],"together.":[31],"We":[32,88],"study":[33],"theoretically":[34],"never":[38],"decrease":[39],"hypervolume":[41,84,111,126],"one":[43],"generation":[44],"next.":[47],"Zitzler,":[48],"Thiele,":[49],"Bader":[51],"(IEEE":[52],"Trans.":[53],"Evolutionary":[54],"Computation,":[55],"14:58--79,":[56],"2010)":[57],"proved":[58],"that":[59,73,93],"all":[60,96],"(\u03bc+1)-archiving":[61],"are":[63,99,115],"ineffective,":[64],"means":[66],"there":[67],"initial":[70],"population":[71,124],"such":[72],"independent":[74],"used":[77],"reproduction":[78],"rule,":[79],"a":[80,123],"set":[81],"with":[82,125],"maximum":[83],"cannot":[85],"be":[86],"reached.":[87],"extend":[89],"this":[90],"prove":[92],"for":[94,117,132],"\u03bb<\u03bc":[95],"ineffective.":[100],"On":[101],"other":[103],"hand,":[104],"locally":[105],"optimal":[106],"algorithms,":[107],"maximize":[109],"in":[112],"each":[113],"step,":[114],"effective":[116],"\u03bb=\u03bc":[118],"can":[120],"always":[121],"find":[122],"at":[127],"least":[128],"half":[129],"optimum":[131],"<":[134],"\u03bc.":[135]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}