{"id":"https://openalex.org/W3126229264","doi":"https://doi.org/10.1109/tevc.2021.3103386","title":"Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization","display_name":"Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization","publication_year":2021,"publication_date":"2021-08-09","ids":{"openalex":"https://openalex.org/W3126229264","doi":"https://doi.org/10.1109/tevc.2021.3103386","mag":"3126229264"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2021.3103386","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2021.3103386","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2102.00941","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Weiyu Chen","orcid":"https://orcid.org/0000-0002-1620-6500"},"institutions":[{"id":"https://openalex.org/I3045169105","display_name":"Southern University of Science and Technology","ror":"https://ror.org/049tv2d57","country_code":"CN","type":"education","lineage":["https://openalex.org/I3045169105"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weiyu Chen","raw_affiliation_strings":["Department of Computer Science and Engineering, Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation, Southern University of Science and Technology, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation, Southern University of Science and Technology, Shenzhen, China","institution_ids":["https://openalex.org/I3045169105"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Hisao Ishibuchi","orcid":"https://orcid.org/0000-0001-9186-6472"},"institutions":[{"id":"https://openalex.org/I3045169105","display_name":"Southern University of Science and Technology","ror":"https://ror.org/049tv2d57","country_code":"CN","type":"education","lineage":["https://openalex.org/I3045169105"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hisao Ishibuchi","raw_affiliation_strings":["Department of Computer Science and Engineering, Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation, Southern University of Science and Technology, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation, Southern University of Science and Technology, Shenzhen, China","institution_ids":["https://openalex.org/I3045169105"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ke Shang","orcid":"https://orcid.org/0000-0003-2363-9504"},"institutions":[{"id":"https://openalex.org/I3045169105","display_name":"Southern University of Science and Technology","ror":"https://ror.org/049tv2d57","country_code":"CN","type":"education","lineage":["https://openalex.org/I3045169105"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ke Shang","raw_affiliation_strings":["Department of Computer Science and Engineering, Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation, Southern University of Science and Technology, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation, Southern University of Science and Technology, Shenzhen, China","institution_ids":["https://openalex.org/I3045169105"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I3045169105"],"apc_list":null,"apc_paid":null,"fwci":3.9377,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.9410741,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"26","issue":"4","first_page":"750","last_page":"764"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.994700014591217,"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":0.994700014591217,"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.0024999999441206455,"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.0006000000284984708,"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/submodular-set-function","display_name":"Submodular set function","score":0.8184999823570251},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.8037999868392944},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.7383000254631042},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.5932999849319458},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.4794999957084656},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.45419999957084656},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.39890000224113464},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3546999990940094}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8184999823570251},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.8037999868392944},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.7383000254631042},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6187999844551086},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5932999849319458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5121999979019165},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.4794999957084656},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.45419999957084656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4097999930381775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4020000100135803},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.39890000224113464},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3546999990940094},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.34200000762939453},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.27309998869895935},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2662999927997589},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tevc.2021.3103386","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2021.3103386","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2102.00941","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2102.00941","pdf_url":"https://arxiv.org/pdf/2102.00941","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2102.00941","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2102.00941","pdf_url":"https://arxiv.org/pdf/2102.00941","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1690822759","display_name":null,"funder_award_id":"62002152","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5859296700","display_name":null,"funder_award_id":"61876075","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W166394191","https://openalex.org/W224959492","https://openalex.org/W934277334","https://openalex.org/W1480517346","https://openalex.org/W1491287429","https://openalex.org/W1543520236","https://openalex.org/W1558919105","https://openalex.org/W1680189815","https://openalex.org/W1846834309","https://openalex.org/W1898824936","https://openalex.org/W1985904652","https://openalex.org/W2000825106","https://openalex.org/W2008049315","https://openalex.org/W2013014665","https://openalex.org/W2022485595","https://openalex.org/W2028781966","https://openalex.org/W2050914643","https://openalex.org/W2056605897","https://openalex.org/W2059819407","https://openalex.org/W2074308169","https://openalex.org/W2085507535","https://openalex.org/W2090797242","https://openalex.org/W2098907614","https://openalex.org/W2104018342","https://openalex.org/W2108968575","https://openalex.org/W2117068724","https://openalex.org/W2117362819","https://openalex.org/W2126105956","https://openalex.org/W2132936405","https://openalex.org/W2141403143","https://openalex.org/W2151953637","https://openalex.org/W2154781286","https://openalex.org/W2343601797","https://openalex.org/W2557744929","https://openalex.org/W2558334374","https://openalex.org/W2559591803","https://openalex.org/W2569283211","https://openalex.org/W2736457838","https://openalex.org/W2753944351","https://openalex.org/W2783781089","https://openalex.org/W2791738125","https://openalex.org/W2803331670","https://openalex.org/W2804195307","https://openalex.org/W2888338796","https://openalex.org/W2901472199","https://openalex.org/W2911842990","https://openalex.org/W2913333339","https://openalex.org/W2918702815","https://openalex.org/W2973142703","https://openalex.org/W3038950283","https://openalex.org/W3046910774","https://openalex.org/W3083209151","https://openalex.org/W3083401455","https://openalex.org/W3112958766","https://openalex.org/W4245314356","https://openalex.org/W4302557773","https://openalex.org/W6687060249"],"related_works":[],"abstract_inverted_index":{"Subset":[0],"selection":[1,26,53,85,164],"plays":[2],"an":[3,16,20,28,139],"important":[4],"role":[5],"in":[6,15,92],"the":[7,40,48,55,71,105,112,123,134,153,160,171],"field":[8],"of":[9,37,50,79,88,90],"evolutionary":[10],"multiobjective":[11],"optimization":[12],"(EMO).":[13],"Especially,":[14],"EMO":[17],"algorithm":[18,143],"with":[19],"unbounded":[21],"external":[22],"archive":[23],"(UEA),":[24],"subset":[25,52,72,84,163],"is":[27,102,109],"essential":[29],"post-processing":[30],"procedure":[31],"to":[32,103,115],"select":[33],"a":[34,76,93],"prespecified":[35],"number":[36,78],"solutions":[38,80,91],"as":[39],"final":[41],"result.":[42],"In":[43],"this":[44],"article,":[45],"we":[46,120,137],"discuss":[47],"efficiency":[49],"greedy":[51,141,162],"for":[54,111,144],"hypervolume,":[56],"inverted":[57],"generational":[58],"distance":[59],"(IGD),":[60],"and":[61,125],"IGD":[62,124],"plus":[63],"(IGD+)":[64],"indicators.":[65,175],"Greedy":[66],"algorithms":[67,155,168],"usually":[68],"efficiently":[69],"handle":[70],"selection.":[73],"However,":[74],"when":[75],"large":[77],"are":[81,128,156],"given":[82],"(e.g.,":[83],"from":[86],"tens":[87],"thousands":[89],"UEA),":[94],"they":[95],"often":[96],"become":[97],"time":[98],"consuming.":[99],"Our":[100],"idea":[101],"use":[104],"submodular":[106,135],"property,":[107,136],"which":[108],"known":[110],"hypervolume":[113],"indicator,":[114],"improve":[116],"their":[117],"efficiency.":[118],"First,":[119],"prove":[121],"that":[122,152],"IGD+":[126],"indicators":[127],"also":[129,169],"submodular.":[130],"Next,":[131],"based":[132],"on":[133,173],"propose":[138],"efficient":[140],"inclusion":[142],"each":[145],"indicator.":[146],"We":[147],"demonstrate":[148],"through":[149],"computational":[150],"experiments":[151],"proposed":[154,167],"much":[157],"faster":[158],"than":[159],"standard":[161],"algorithms.":[165],"The":[166],"help":[170],"research":[172],"performance":[174]},"counts_by_year":[{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2021-02-15T00:00:00"}