{"id":"https://openalex.org/W2156384963","doi":"https://doi.org/10.1162/evco_a_00126","title":"Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point","display_name":"Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point","publication_year":2014,"publication_date":"2014-03-21","ids":{"openalex":"https://openalex.org/W2156384963","doi":"https://doi.org/10.1162/evco_a_00126","mag":"2156384963","pmid":"https://pubmed.ncbi.nlm.nih.gov/24654679"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00126","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00126","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5077389210","display_name":"Tobias Friedrich","orcid":"https://orcid.org/0000-0003-0076-6308"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Tobias Friedrich","raw_affiliation_strings":["Lehrstuhl Theoretische Informatik I, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Friedrich-Schiller-Universit\u00e4t Jena, Ernst-Abbe-Platz 2, 07743 Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl Theoretische Informatik I, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Friedrich-Schiller-Universit\u00e4t Jena, Ernst-Abbe-Platz 2, 07743 Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Optimisation and Logistics, School of Computer Science, University of Adelaide, Adelaide, SA 5005, Australia"],"affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer Science, University of Adelaide, Adelaide, SA 5005, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019171842","display_name":"Christian Thyssen","orcid":null},"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":"Christian Thyssen","raw_affiliation_strings":["Lehrstuhl 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, 44221 Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl 2, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, 44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019171842","https://openalex.org/A5077389210","https://openalex.org/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I200332995","https://openalex.org/I5681781","https://openalex.org/I76198965"],"apc_list":null,"apc_paid":null,"fwci":2.5766,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90248528,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"1","first_page":"131","last_page":"159"},"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.9980000257492065,"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.996999979019165,"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/multiplicative-function","display_name":"Multiplicative function","score":0.7361265420913696},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.7242526412010193},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7014379501342773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6015716195106506},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5541693568229675},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5250242352485657},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5077577829360962},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4912981390953064},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.43892398476600647},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42417436838150024},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30477994680404663},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08063331246376038},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06601917743682861}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7361265420913696},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.7242526412010193},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7014379501342773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6015716195106506},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5541693568229675},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5250242352485657},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5077577829360962},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4912981390953064},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.43892398476600647},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42417436838150024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30477994680404663},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08063331246376038},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06601917743682861},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003198","descriptor_name":"Computer Simulation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008962","descriptor_name":"Models, Theoretical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D011340","descriptor_name":"Problem Solving","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D011340","descriptor_name":"Problem Solving","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D011340","descriptor_name":"Problem Solving","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true}],"locations_count":3,"locations":[{"id":"doi:10.1162/evco_a_00126","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00126","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:24654679","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/24654679","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/100686","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/100686","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1162/evco_a_00126","raw_type":"Journal article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W42649658","https://openalex.org/W90390084","https://openalex.org/W144691766","https://openalex.org/W1491287429","https://openalex.org/W1525375343","https://openalex.org/W1553373771","https://openalex.org/W1562465485","https://openalex.org/W1564638059","https://openalex.org/W1573534773","https://openalex.org/W1573676079","https://openalex.org/W1588375755","https://openalex.org/W1595498733","https://openalex.org/W1690614984","https://openalex.org/W1846834309","https://openalex.org/W1928381443","https://openalex.org/W1973815989","https://openalex.org/W1976233986","https://openalex.org/W2003356218","https://openalex.org/W2007833876","https://openalex.org/W2029496228","https://openalex.org/W2038420231","https://openalex.org/W2055560312","https://openalex.org/W2059819407","https://openalex.org/W2063375245","https://openalex.org/W2077658674","https://openalex.org/W2090795732","https://openalex.org/W2095792542","https://openalex.org/W2098907614","https://openalex.org/W2100830227","https://openalex.org/W2106334424","https://openalex.org/W2108968575","https://openalex.org/W2148615815","https://openalex.org/W2160088187","https://openalex.org/W2165626989","https://openalex.org/W2490228412","https://openalex.org/W2615258659","https://openalex.org/W3012317737","https://openalex.org/W3122481131","https://openalex.org/W4212997115","https://openalex.org/W4292408320","https://openalex.org/W4292408555","https://openalex.org/W4302557773"],"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/W2022485595"],"abstract_inverted_index":{"Many":[0],"optimization":[1,105],"problems":[2,29],"arising":[3],"in":[4,164],"applications":[5],"have":[6,160],"to":[7,19,40,46,56,73,107,161],"consider":[8,67],"several":[9],"objective":[10,49],"functions":[11],"at":[12],"the":[13,31,42,47,57,75,88,97,108,131,146,149,157,168,171,177,180,184],"same":[14],"time.":[15],"Evolutionary":[16],"algorithms":[17,62,69],"seem":[18],"be":[20,38,162],"a":[21,78,137],"very":[22],"natural":[23],"choice":[24,178],"for":[25,63,77,122],"dealing":[26],"with":[27,44],"multi-objective":[28,64],"as":[30],"population":[32],"of":[33,60,99,110,127,133,139,167,179,187,194],"such":[34],"an":[35,112],"algorithm":[36],"can":[37],"used":[39],"represent":[41],"trade-offs":[43],"respect":[45],"given":[48,79],"functions.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54,102,142,175],"contribute":[55],"theoretical":[58,94],"understanding":[59],"evolutionary":[61],"problems.":[65,129],"We":[66],"indicator-based":[68],"whose":[70],"goal":[71,106,109],"is":[72],"maximize":[74],"hypervolume":[76,147],"problem":[80],"by":[81,197],"distributing":[82],"[Formula:":[83],"see":[84],"text]":[85],"points":[86,159,169],"on":[87,170,183],"Pareto":[89,124,172,192],"front.":[90,173],"To":[91],"gain":[92],"new":[93],"insights":[95],"into":[96],"behavior":[98,186],"hypervolume-based":[100,188],"algorithms,":[101],"compare":[103],"their":[104],"achieving":[111],"optimal":[113],"multiplicative":[114],"approximation":[115,152,185],"ratio.":[116],"Our":[117],"studies":[118],"are":[119],"carried":[120],"out":[121],"different":[123,195],"front":[125],"shapes":[126,196],"bi-objective":[128],"For":[130],"class":[132,138],"linear":[134],"fronts":[135,193],"and":[136,190],"convex":[140],"fronts,":[141],"prove":[143],"that":[144,156],"maximizing":[145],"gives":[148],"best":[150],"possible":[151],"ratio":[153],"when":[154],"assuming":[155],"extreme":[158],"included":[163],"both":[165],"distributions":[166],"Furthermore,":[174],"investigate":[176],"reference":[181],"point":[182],"approaches":[189],"examine":[191],"numerical":[198],"calculations.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-30T08:08:38.191290","created_date":"2025-10-10T00:00:00"}