{"id":"https://openalex.org/W2579525752","doi":"https://doi.org/10.1162/evco_a_00204","title":"A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting","display_name":"A New Algorithm Using the Non-Dominated Tree to Improve Non-Dominated Sorting","publication_year":2017,"publication_date":"2017-01-19","ids":{"openalex":"https://openalex.org/W2579525752","doi":"https://doi.org/10.1162/evco_a_00204","mag":"2579525752","pmid":"https://pubmed.ncbi.nlm.nih.gov/28103060"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00204","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00204","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/A5022340822","display_name":"Patrik Gustavsson","orcid":"https://orcid.org/0000-0001-8874-0676"},"institutions":[{"id":"https://openalex.org/I205158640","display_name":"University of Sk\u00f6vde","ror":"https://ror.org/051mrsz47","country_code":"SE","type":"education","lineage":["https://openalex.org/I205158640"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Patrik Gustavsson","raw_affiliation_strings":["School of Engineering, University of Sk\u00f6vde, Sk\u00f6vde, 54134, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering, University of Sk\u00f6vde, Sk\u00f6vde, 54134, Sweden","institution_ids":["https://openalex.org/I205158640"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045392792","display_name":"Anna Syberfeldt","orcid":"https://orcid.org/0000-0003-3973-3394"},"institutions":[{"id":"https://openalex.org/I205158640","display_name":"University of Sk\u00f6vde","ror":"https://ror.org/051mrsz47","country_code":"SE","type":"education","lineage":["https://openalex.org/I205158640"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Anna Syberfeldt","raw_affiliation_strings":["School of Engineering, University of Sk\u00f6vde, Sk\u00f6vde, 54134, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering, University of Sk\u00f6vde, Sk\u00f6vde, 54134, Sweden","institution_ids":["https://openalex.org/I205158640"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022340822","https://openalex.org/A5045392792"],"corresponding_institution_ids":["https://openalex.org/I205158640"],"apc_list":null,"apc_paid":null,"fwci":7.6531,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.97778647,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"26","issue":"1","first_page":"89","last_page":"116"},"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.9983000159263611,"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.9983000159263611,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9973000288009644,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9970999956130981,"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/sorting","display_name":"Sorting","score":0.8559339642524719},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.8197057843208313},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.7606202363967896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6536633968353271},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6371650695800781},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5748889446258545},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5173704028129578},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.48959285020828247},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35377588868141174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2706170678138733},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.11129176616668701}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.8559339642524719},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.8197057843208313},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.7606202363967896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6536633968353271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6371650695800781},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5748889446258545},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5173704028129578},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48959285020828247},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35377588868141174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2706170678138733},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.11129176616668701},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","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},{"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}],"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":"D003627","descriptor_name":"Data Interpretation, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003627","descriptor_name":"Data Interpretation, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003627","descriptor_name":"Data Interpretation, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003663","descriptor_name":"Decision Trees","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003663","descriptor_name":"Decision Trees","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D003663","descriptor_name":"Decision Trees","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D005075","descriptor_name":"Biological Evolution","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008954","descriptor_name":"Models, Biological","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008954","descriptor_name":"Models, Biological","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008954","descriptor_name":"Models, Biological","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true}],"locations_count":2,"locations":[{"id":"doi:10.1162/evco_a_00204","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00204","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:28103060","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/28103060","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}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1504943474","https://openalex.org/W1595498733","https://openalex.org/W1670300334","https://openalex.org/W1833634424","https://openalex.org/W1846834309","https://openalex.org/W1905847227","https://openalex.org/W1957430778","https://openalex.org/W1966253115","https://openalex.org/W1972208891","https://openalex.org/W1996641400","https://openalex.org/W2028772559","https://openalex.org/W2116661285","https://openalex.org/W2117852087","https://openalex.org/W2118246375","https://openalex.org/W2126105956","https://openalex.org/W2126997347","https://openalex.org/W2147788835","https://openalex.org/W2150580621","https://openalex.org/W2165558283","https://openalex.org/W2510493362","https://openalex.org/W4213109518"],"related_works":["https://openalex.org/W2362374543","https://openalex.org/W2085265870","https://openalex.org/W2994182992","https://openalex.org/W2053165922","https://openalex.org/W2371194072","https://openalex.org/W2908348257","https://openalex.org/W3033274815","https://openalex.org/W2031959132","https://openalex.org/W2998900262","https://openalex.org/W2972379113"],"abstract_inverted_index":{"Non-dominated":[0,26,58,74,105],"sorting":[1,52],"is":[2,23,71,112,133,158],"a":[3,17,81,97,121,141],"technique":[4],"often":[5],"used":[6],"in":[7,16],"evolutionary":[8],"algorithms":[9,53,150,168],"to":[10,49,67,126,135],"determine":[11],"the":[12,24,33,40,56,72,89,103,116,129,155,163,171],"quality":[13],"of":[14,84,91,115,144,165],"solutions":[15],"population.":[18],"The":[19,44],"most":[20],"common":[21],"algorithm":[22,65,101,118],"Fast":[25],"Sort":[27,59,75,106],"(FNS).":[28],"This":[29,94],"algorithm,":[30],"however,":[31],"has":[32],"drawback":[34,46,70],"that":[35,160],"its":[36],"performance":[37],"deteriorates":[38,87],"when":[39,88],"population":[41,138],"size":[42],"grows.":[43,93],"same":[45],"applies":[47],"also":[48],"other":[50],"non-dominating":[51],"such":[54,169],"as":[55,170],"Efficient":[57,104],"with":[60,107,161],"Binary":[61],"Strategy":[62],"(ENS-BS).":[63],"An":[64],"suggested":[66],"overcome":[68],"this":[69],"Divide-and-Conquer":[73],"(DCNS)":[76],"which":[77],"works":[78],"well":[79],"on":[80],"limited":[82],"number":[83,90,143],"objectives":[85,92,145],"but":[86],"article":[95],"presents":[96],"new,":[98],"more":[99,146],"efficient":[100],"called":[102],"Non-Dominated":[108,123,172],"Tree":[109,124],"(ENS-NDT).":[110],"ENS-NDT":[111,132,162],"an":[113],"extension":[114],"ENS-BS":[117],"and":[119,140],"uses":[120],"novel":[122],"(NDTree)":[125],"speed":[127],"up":[128],"non-dominated":[130,152],"sorting.":[131,153],"able":[134],"handle":[136],"large":[137,142],"sizes":[139],"efficiently":[147],"than":[148],"existing":[149],"for":[151],"In":[154],"article,":[156],"it":[157],"shown":[159],"runtime":[164],"multi-objective":[166],"optimization":[167],"Sorting":[173],"Genetic":[174],"Algorithm":[175],"II":[176],"(NSGA-II)":[177],"can":[178],"be":[179],"substantially":[180],"reduced.":[181]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}