Updating exclusive hypervolume contributions cheaply

Updating exclusive hypervolume contributions cheaply

Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The basic requirement is to choose a subset of a front such that the hypervolume of that subset is maximised. We describe a techni...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bradstreet, L., Barone, L., While, L.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Australia
Computer science
Costs
Evolutionary computation
Pareto optimization
Runtime
Software engineering
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 544
container_issue
container_start_page 538
container_title
container_volume
creator Bradstreet, L.
Barone, L.
While, L.
description Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The basic requirement is to choose a subset of a front such that the hypervolume of that subset is maximised. We describe a technique that improves the performance of hypervolume contribution based front selection schemes. This technique improves performance by allowing the update of hypervolume contributions after the addition or removal of a point, where these contributions would previously require full recalculation. Empirical evidence shows that this technique reduces runtime by up 72-99% when compared to the cost of full contribution recalculation on DTLZ and random fronts.
doi_str_mv 10.1109/CEC.2009.4982992
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4982992</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4982992</ieee_id><sourcerecordid>4982992</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a072e3306ecbc1546b7a6a35fe510b3da4b61db73681498524cc839c1b04e0b23</originalsourceid><addsrcrecordid>eNpFkEtLw0AURsdHwba6F9zkD6TeO4_M3KWE-oCCGwvuysz01o6kaUjSYv-9AQuuvsWBA-cT4h5hhgj0WM7LmQSgmSYnieSFmKCWWksyZC7FGEljDiCLq3_g7PUAwFFurfscickgcATOKroRk677BkBtkMZCL5u171P9lfFPrA5dOnK2PTXcHvfVYcdZ3Nd9m8KhT_u6y-KWfVOdbsVo46uO7847Fcvn-Uf5mi_eX97Kp0We0Jo-92AlKwUFxxDR6CJYX3hlNmwQglp7HQpcB6sKh0OckTpGpyhiAM0QpJqKhz9vYuZV06adb0-r8w_qF1FiSzQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Updating exclusive hypervolume contributions cheaply</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bradstreet, L. ; Barone, L. ; While, L.</creator><creatorcontrib>Bradstreet, L. ; Barone, L. ; While, L.</creatorcontrib><description>Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The basic requirement is to choose a subset of a front such that the hypervolume of that subset is maximised. We describe a technique that improves the performance of hypervolume contribution based front selection schemes. This technique improves performance by allowing the update of hypervolume contributions after the addition or removal of a point, where these contributions would previously require full recalculation. Empirical evidence shows that this technique reduces runtime by up 72-99% when compared to the cost of full contribution recalculation on DTLZ and random fronts.</description><identifier>ISSN: 1089-778X</identifier><identifier>ISBN: 1424429587</identifier><identifier>ISBN: 9781424429585</identifier><identifier>EISSN: 1941-0026</identifier><identifier>EISBN: 1424429595</identifier><identifier>EISBN: 9781424429592</identifier><identifier>DOI: 10.1109/CEC.2009.4982992</identifier><identifier>LCCN: 2008908739</identifier><language>eng</language><publisher>IEEE</publisher><subject>Australia ; Computer science ; Costs ; Evolutionary computation ; Pareto optimization ; Runtime ; Software engineering</subject><ispartof>2009 IEEE Congress on Evolutionary Computation, 2009, p.538-544</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4982992$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,796,2056,27924,54757,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4982992$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bradstreet, L.</creatorcontrib><creatorcontrib>Barone, L.</creatorcontrib><creatorcontrib>While, L.</creatorcontrib><title>Updating exclusive hypervolume contributions cheaply</title><title>2009 IEEE Congress on Evolutionary Computation</title><addtitle>CEC</addtitle><description>Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The basic requirement is to choose a subset of a front such that the hypervolume of that subset is maximised. We describe a technique that improves the performance of hypervolume contribution based front selection schemes. This technique improves performance by allowing the update of hypervolume contributions after the addition or removal of a point, where these contributions would previously require full recalculation. Empirical evidence shows that this technique reduces runtime by up 72-99% when compared to the cost of full contribution recalculation on DTLZ and random fronts.</description><subject>Australia</subject><subject>Computer science</subject><subject>Costs</subject><subject>Evolutionary computation</subject><subject>Pareto optimization</subject><subject>Runtime</subject><subject>Software engineering</subject><issn>1089-778X</issn><issn>1941-0026</issn><isbn>1424429587</isbn><isbn>9781424429585</isbn><isbn>1424429595</isbn><isbn>9781424429592</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkEtLw0AURsdHwba6F9zkD6TeO4_M3KWE-oCCGwvuysz01o6kaUjSYv-9AQuuvsWBA-cT4h5hhgj0WM7LmQSgmSYnieSFmKCWWksyZC7FGEljDiCLq3_g7PUAwFFurfscickgcATOKroRk677BkBtkMZCL5u171P9lfFPrA5dOnK2PTXcHvfVYcdZ3Nd9m8KhT_u6y-KWfVOdbsVo46uO7847Fcvn-Uf5mi_eX97Kp0We0Jo-92AlKwUFxxDR6CJYX3hlNmwQglp7HQpcB6sKh0OckTpGpyhiAM0QpJqKhz9vYuZV06adb0-r8w_qF1FiSzQ</recordid><startdate>200905</startdate><enddate>200905</enddate><creator>Bradstreet, L.</creator><creator>Barone, L.</creator><creator>While, L.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200905</creationdate><title>Updating exclusive hypervolume contributions cheaply</title><author>Bradstreet, L. ; Barone, L. ; While, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a072e3306ecbc1546b7a6a35fe510b3da4b61db73681498524cc839c1b04e0b23</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Australia</topic><topic>Computer science</topic><topic>Costs</topic><topic>Evolutionary computation</topic><topic>Pareto optimization</topic><topic>Runtime</topic><topic>Software engineering</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bradstreet, L.</creatorcontrib><creatorcontrib>Barone, L.</creatorcontrib><creatorcontrib>While, L.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bradstreet, L.</au><au>Barone, L.</au><au>While, L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Updating exclusive hypervolume contributions cheaply</atitle><btitle>2009 IEEE Congress on Evolutionary Computation</btitle><stitle>CEC</stitle><date>2009-05</date><risdate>2009</risdate><spage>538</spage><epage>544</epage><pages>538-544</pages><issn>1089-778X</issn><eissn>1941-0026</eissn><isbn>1424429587</isbn><isbn>9781424429585</isbn><eisbn>1424429595</eisbn><eisbn>9781424429592</eisbn><abstract>Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The basic requirement is to choose a subset of a front such that the hypervolume of that subset is maximised. We describe a technique that improves the performance of hypervolume contribution based front selection schemes. This technique improves performance by allowing the update of hypervolume contributions after the addition or removal of a point, where these contributions would previously require full recalculation. Empirical evidence shows that this technique reduces runtime by up 72-99% when compared to the cost of full contribution recalculation on DTLZ and random fronts.</abstract><pub>IEEE</pub><doi>10.1109/CEC.2009.4982992</doi><tpages>7</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1089-778X
ispartof 2009 IEEE Congress on Evolutionary Computation, 2009, p.538-544
issn 1089-778X
1941-0026
language eng
recordid cdi_ieee_primary_4982992
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Australia
Computer science
Costs
Evolutionary computation
Pareto optimization
Runtime
Software engineering
title Updating exclusive hypervolume contributions cheaply
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T17%3A19%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Updating%20exclusive%20hypervolume%20contributions%20cheaply&rft.btitle=2009%20IEEE%20Congress%20on%20Evolutionary%20Computation&rft.au=Bradstreet,%20L.&rft.date=2009-05&rft.spage=538&rft.epage=544&rft.pages=538-544&rft.issn=1089-778X&rft.eissn=1941-0026&rft.isbn=1424429587&rft.isbn_list=9781424429585&rft_id=info:doi/10.1109/CEC.2009.4982992&rft_dat=%3Cieee_6IE%3E4982992%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424429595&rft.eisbn_list=9781424429592&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4982992&rfr_iscdi=true