{"id":"https://openalex.org/W1993533789","doi":"https://doi.org/10.1145/1143997.1144110","title":"An efficient approach to unbounded bi-objective archives -","display_name":"An efficient approach to unbounded bi-objective archives -","publication_year":2006,"publication_date":"2006-07-08","ids":{"openalex":"https://openalex.org/W1993533789","doi":"https://doi.org/10.1145/1143997.1144110","mag":"1993533789"},"language":"en","primary_location":{"id":"doi:10.1145/1143997.1144110","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th 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/A5002806726","display_name":"Adam Berry","orcid":"https://orcid.org/0000-0002-2499-9491"},"institutions":[{"id":"https://openalex.org/I129801699","display_name":"University of Tasmania","ror":"https://ror.org/01nfmeh72","country_code":"AU","type":"education","lineage":["https://openalex.org/I129801699"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Adam Berry","raw_affiliation_strings":["University of Tasmania, Hobart, Tasmania, Australia"],"affiliations":[{"raw_affiliation_string":"University of Tasmania, Hobart, Tasmania, Australia","institution_ids":["https://openalex.org/I129801699"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080095540","display_name":"Peter Vamplew","orcid":"https://orcid.org/0000-0002-8687-4424"},"institutions":[{"id":"https://openalex.org/I149672521","display_name":"Federation University","ror":"https://ror.org/05qbzwv83","country_code":"AU","type":"education","lineage":["https://openalex.org/I149672521"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Peter Vamplew","raw_affiliation_strings":["University of Ballarat, Ballarat, Victoria, Australia","University of Ballarat, Ballarat Victoria, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Ballarat, Ballarat, Victoria, Australia","institution_ids":["https://openalex.org/I149672521"]},{"raw_affiliation_string":"University of Ballarat, Ballarat Victoria, Australia#TAB#","institution_ids":["https://openalex.org/I149672521"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002806726"],"corresponding_institution_ids":["https://openalex.org/I129801699"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.08956195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"619","last_page":"626"},"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.9968000054359436,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6845225095748901},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6012108325958252},{"id":"https://openalex.org/keywords/truncation","display_name":"Truncation (statistics)","score":0.5843346118927002},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49479979276657104},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4711757302284241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2499595284461975},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12275367975234985}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6845225095748901},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6012108325958252},{"id":"https://openalex.org/C106195933","wikidata":"https://www.wikidata.org/wiki/Q7847935","display_name":"Truncation (statistics)","level":2,"score":0.5843346118927002},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49479979276657104},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4711757302284241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2499595284461975},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12275367975234985},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1143997.1144110","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","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":19,"referenced_works":["https://openalex.org/W1585939719","https://openalex.org/W1690614984","https://openalex.org/W1755555095","https://openalex.org/W1972027649","https://openalex.org/W1993530334","https://openalex.org/W2012914379","https://openalex.org/W2021615496","https://openalex.org/W2053900989","https://openalex.org/W2109778277","https://openalex.org/W2116661285","https://openalex.org/W2120621946","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2126997347","https://openalex.org/W2140066605","https://openalex.org/W2167159964","https://openalex.org/W4206237891","https://openalex.org/W4241856473","https://openalex.org/W6637059799"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W1974935850","https://openalex.org/W2074350688","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2042589464"],"abstract_inverted_index":{"Given":[0],"the":[1,12,23,31,50,55,88,96,110,122],"prominence":[2],"of":[3,26,33,52,77,99],"elite":[4,63],"archiving":[5],"in":[6,15,71,87],"contemporary":[7],"multiobjective":[8],"optimisation":[9],"research":[10],"and":[11,35,47,61,81,103,113,140],"limitations":[13],"inherent":[14],"bounded":[16,141],"population":[17],"sizes,":[18],"it":[19,74],"is":[20,59,75,125],"unusual":[21],"that":[22,121],"vast":[24],"majority":[25],"popular":[27],"techniques":[28],"aggressively":[29],"truncate":[30],"capacity":[32],"archives":[34],"are":[36],"based":[37],"upon":[38],"inefficient":[39],"list":[40,142],"representations.":[41],"By":[42],"forming":[43],"better":[44],"data":[45],"structures":[46],"algorithms":[48],"for":[49,57],"storage":[51],"archival":[53],"members,":[54],"need":[56],"truncation":[58],"reduced":[60],"unbounded":[62,139],"sets":[64,102],"become":[65],"viable.":[66],"While":[67],"work":[68],"does":[69],"exist":[70],"this":[72,93],"vein,":[73],"always":[76],"a":[78],"general":[79,129],"nature":[80],"significant":[82],"improvements":[83],"can":[84],"be":[85],"made":[86],"bi-objective":[89,115],"case.":[90],"As":[91],"such,":[92],"paper":[94],"elucidates":[95],"unique":[97],"properties":[98],"two-dimensional":[100],"non-dominated":[101],"capitalises":[104],"on":[105],"these":[106],"notions":[107],"to":[108,127],"develop":[109],"highly":[111],"efficient":[112],"specialised":[114,123],"Mak_Tree":[116],"algorithm.":[117],"Theoretical":[118],"results":[119],"indicate":[120],"approach":[124],"preferable":[126],"pre-existing":[128],"techniques,":[130],"while":[131],"empirical":[132],"analysis":[133],"illustrates":[134],"improved":[135],"performance":[136],"over":[137],"both":[138],"techniques.":[143]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}