{"id":"https://openalex.org/W2021418037","doi":"https://doi.org/10.1109/tcyb.2013.2247594","title":"Corner Sort for Pareto-Based Many-Objective Optimization","display_name":"Corner Sort for Pareto-Based Many-Objective Optimization","publication_year":2013,"publication_date":"2013-05-07","ids":{"openalex":"https://openalex.org/W2021418037","doi":"https://doi.org/10.1109/tcyb.2013.2247594","mag":"2021418037","pmid":"https://pubmed.ncbi.nlm.nih.gov/23757536"},"language":"en","primary_location":{"id":"doi:10.1109/tcyb.2013.2247594","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2013.2247594","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"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 Cybernetics","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/A5091324372","display_name":"Handing Wang","orcid":"https://orcid.org/0000-0002-4805-3780"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Handing Wang","raw_affiliation_strings":["Xidian University, Xi'an, China","Xidian University, Xi\u2019an, China#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xidian University, Xi'an, China","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"Xidian University, Xi\u2019an, China#TAB#","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["University of Birmingham, Birmingham, U.K","University of Birmingham Birmingham/UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham, Birmingham, U.K","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"University of Birmingham Birmingham/UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":10.3248,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.98640366,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"44","issue":"1","first_page":"92","last_page":"102"},"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.9998999834060669,"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.9998999834060669,"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9933000206947327,"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/sort","display_name":"sort","score":0.9213612079620361},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.8425874710083008},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6997092962265015},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6963577270507812},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6794013977050781},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6655449271202087},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5110917687416077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4850310683250427},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.46469753980636597},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4576003849506378},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4422638416290283},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43084877729415894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32280445098876953},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.042989522218704224}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.9213612079620361},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.8425874710083008},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6997092962265015},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6963577270507812},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6794013977050781},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6655449271202087},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5110917687416077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4850310683250427},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.46469753980636597},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4576003849506378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4422638416290283},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43084877729415894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32280445098876953},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.042989522218704224},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1109/tcyb.2013.2247594","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcyb.2013.2247594","pdf_url":null,"source":{"id":"https://openalex.org/S4210191041","display_name":"IEEE Transactions on Cybernetics","issn_l":"2168-2267","issn":["2168-2267","2168-2275"],"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 Cybernetics","raw_type":"journal-article"},{"id":"pmid:23757536","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/23757536","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":"IEEE transactions on cybernetics","raw_type":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.301.3153","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.3153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~xin/papers/CornerSortR2_3.pdf","raw_type":"text"},{"id":"pmh:oai:alma.44SUR_INST:11139359370002346","is_oa":false,"landing_page_url":"https://openresearch.surrey.ac.uk/esploro/outputs/journalArticle/Corner-sort-for-pareto-based-many-objective-optimization/99513945502346","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"Open Research (University of Surrey)","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:epubs.surrey.ac.uk:839968","is_oa":false,"landing_page_url":"http://epubs.surrey.ac.uk/839968/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400680","display_name":"Surrey Research Insight Open Access (The University of Surrey)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28290843","host_organization_name":"University of Surrey","host_organization_lineage":["https://openalex.org/I28290843"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/1e9cad00-937c-433c-bed9-1adf52a0bda4","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/1e9cad00-937c-433c-bed9-1adf52a0bda4","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wang, H & Yao, X 2014, 'Corner Sort for Pareto-Based Many-Objective Optimization', IEEE Transactions on Cybernetics, vol. 44, no. 1, pp. 92-102. https://doi.org/10.1109/TCYB.2013.2247594","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/1e9cad00-937c-433c-bed9-1adf52a0bda4","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/corner-sort-for-paretobased-manyobjective-optimization(1e9cad00-937c-433c-bed9-1adf52a0bda4).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wang , H & Yao , X 2014 , ' Corner Sort for Pareto-Based Many-Objective Optimization ' , IEEE Transactions on Cybernetics , vol. 44 , no. 1 , pp. 92-102 . https://doi.org/10.1109/TCYB.2013.2247594","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2577795444","display_name":"\u91cf\u5b50\u514d\u75ab\u591a\u76ee\u6807\u4f18\u5316\u6a21\u578b\u4e0e\u7b97\u6cd5\u7814\u7a76","funder_award_id":"61001202","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5113799172","display_name":null,"funder_award_id":"20100203120008","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8346632801","display_name":null,"funder_award_id":"247619","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"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":38,"referenced_works":["https://openalex.org/W150900122","https://openalex.org/W1480428252","https://openalex.org/W1519778441","https://openalex.org/W1540838335","https://openalex.org/W1574672657","https://openalex.org/W1585939719","https://openalex.org/W1588375755","https://openalex.org/W1605170913","https://openalex.org/W1607221389","https://openalex.org/W1612556207","https://openalex.org/W1823686600","https://openalex.org/W1846834309","https://openalex.org/W1869403964","https://openalex.org/W1905847227","https://openalex.org/W1957430778","https://openalex.org/W1976578972","https://openalex.org/W1976743943","https://openalex.org/W2009957599","https://openalex.org/W2021776358","https://openalex.org/W2025525377","https://openalex.org/W2042011228","https://openalex.org/W2101668304","https://openalex.org/W2106334424","https://openalex.org/W2116661285","https://openalex.org/W2123808725","https://openalex.org/W2126105956","https://openalex.org/W2126273906","https://openalex.org/W2142331156","https://openalex.org/W2154693991","https://openalex.org/W2158320871","https://openalex.org/W2162974421","https://openalex.org/W2166898117","https://openalex.org/W2261054240","https://openalex.org/W6628770400","https://openalex.org/W6635097213","https://openalex.org/W6636658889","https://openalex.org/W6656537966","https://openalex.org/W6675971974"],"related_works":["https://openalex.org/W2908348257","https://openalex.org/W2994182992","https://openalex.org/W2350549588","https://openalex.org/W4281648223","https://openalex.org/W2362374543","https://openalex.org/W3206496585","https://openalex.org/W2085265870","https://openalex.org/W2187267622","https://openalex.org/W2351942115","https://openalex.org/W2922989628"],"abstract_inverted_index":{"Nondominated":[0],"sorting":[1,34],"plays":[2],"an":[3],"important":[4],"role":[5],"in":[6,32,48,94],"Pareto-based":[7],"multiobjective":[8,18],"evolutionary":[9],"algorithms":[10],"(MOEAs).":[11],"When":[12],"faced":[13],"with":[14,22,109,148],"many-objective":[15,183],"optimization":[16,19,184],"problems":[17,20],"(MOPs)":[21],"more":[23],"than":[24,191],"three":[25,114],"objectives,":[26],"the":[27,66,72,77,86,123,135,142,145,152,155,158,165],"number":[28],"of":[29,40,116,120],"comparisons":[30,93,190],"needed":[31],"nondominated":[33,63,73,87,105],"becomes":[35],"very":[36],"large.":[37],"In":[38,97],"view":[39],"this,":[41],"a":[42,55,62],"new":[43],"corner":[44,67,95,111,177],"sort":[45,52,112,178,187],"is":[46],"proposed":[47],"this":[49],"paper.":[50],"Corner":[51,186],"first":[53],"adopts":[54],"fast":[56],"and":[57,69,122],"simple":[58],"method":[59],"to":[60,75,82,99,171],"obtain":[61],"solution":[64,74,118,124,139,146,159],"from":[65,127,162],"solutions,":[68],"then":[70],"uses":[71,188],"ignore":[76],"solutions":[78,88],"dominated":[79],"by":[80],"it":[81],"save":[83],"comparisons.":[84],"Obtaining":[85],"requires":[89],"much":[90],"fewer":[91,189],"objective":[92],"sort.":[96],"order":[98],"evaluate":[100],"its":[101],"performance,":[102],"several":[103],"state-of-the-art":[104],"sorts":[106,169],"are":[107],"compared":[108],"our":[110],"on":[113,129,137,144,157,182],"kinds":[115],"artificial":[117,138],"sets":[119,125,140,147,160],"MOPs":[121],"generated":[126,161],"MOEAs":[128,163],"benchmark":[130],"problems.":[131,185],"On":[132,151],"one":[133],"hand,":[134,154],"experiments":[136,156],"show":[141,164,175],"performance":[143],"different":[149,168],"distributions.":[150],"other":[153],"influence":[166],"that":[167,176],"bring":[170],"MOEAs.":[172],"The":[173],"results":[174],"performs":[179],"well,":[180],"especially":[181],"others.":[192]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":22},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}
